Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.

Slides:



Advertisements
Similar presentations
Thursday, April 11 Some more applications of integer
Advertisements

IEOR 4004 Final Review part II.
Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Branch-and-Bound Technique for Solving Integer Programs
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a mn *X n  b m X 1, X n  0 Standard form.
Solving LP Models Improving Search Special Form of Improving Search
Branch and Bound See Beale paper. Example: Maximize z=x1+x2 x2 x1.
MATHEMATICS 3 Operational Analysis Štefan Berežný Applied informatics Košice
Gomory’s cutting plane algorithm for integer programming Prepared by Shin-ichi Tanigawa.
Trees and BFSs Page 1 The Network Simplex Method Spanning Trees and Basic Feasible Solutions.
Integer Programming 3 Brief Review of Branch and Bound
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding ILPs with Branch & Bound ILP References: ‘Integer Programming’
Chapter 5 Linear Inequalities and Linear Programming Section R Review.
Systems of Equations and Inequalities
Decision Procedures An Algorithmic Point of View
1 Decision Procedures for Linear Arithmetic Presented By Omer Katz 01/04/14 Based on slides by Ofer Strichman.
Chapter 9 Integer Programming
Simplex Algorithm.Big M Method
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Copyright © 2009 Pearson Education, Inc. CHAPTER 9: Systems of Equations and Matrices 9.1 Systems of Equations in Two Variables 9.2 Systems of Equations.
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
MILP algorithms: branch-and-bound and branch-and-cut
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
WOOD 492 MODELLING FOR DECISION SUPPORT
Integer programming, MA Operational Research1 Integer Programming Operational Research -Level 4 Prepared by T.M.J.A.Cooray Department of Mathematics.
Notes on Linear Programming Uwe A. Schneider. Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a.
1 Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference:
Chap 10. Integer Prog. Formulations
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
Branch-and-Cut Valid inequality: an inequality satisfied by all feasible solutions Cut: a valid inequality that is not part of the current formulation.
Sandia is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear.
Integer Programming (정수계획법)
Integer LP In-class Prob
D Nagesh Kumar, IIScOptimization Methods: M7L2 1 Integer Programming Mixed Integer Linear Programming.
1 Section 5.3 Linear Systems of Equations. 2 THREE EQUATIONS WITH THREE VARIABLES Consider the linear system of three equations below with three unknowns.
Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.
Linear functions form the basis of linear inequalities. A linear inequality in two variables relates two variables using an inequality symbol, such as.
Algebra 2 9/22/14 Bellwork:. 2.8 – Graph Linear Inequalities in Two Variables A linear inequality in two variables can be written in one of these forms:
Integer Programming, Branch & Bound Method
1 7.5 Solving Radical Equations. 2 What is a radical equation? A radical equation is an equation that has a variable under a radical or that has a variable.
Notes Over 1.6 Solving an Inequality with a Variable on One Side Solve the inequality. Then graph your solution. l l l
Discrete Optimization MA2827 Fondements de l’optimisation discrète Material from P. Van Hentenryck’s course.
Chapter 8 Quadratic Functions.
Algebra 1 Section 6.5 Graph linear inequalities in two variables.
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
Module 1 Review ( ) Rewrite the following equations in slope-intercept form (solve for y), then graph on the coordinate plane.
MILP algorithms: branch-and-bound and branch-and-cut
Gomory Cuts Updated 25 March 2009.
Solve a system of linear equation in two variables
Chapter 6. Large Scale Optimization
Integer Programming (정수계획법)
Chapter 5 Linear Inequalities and Linear Programming
Chapter 6. Large Scale Optimization
2. Generating All Valid Inequalities
Multivariable LINEAR systems
Integer Programming (정수계획법)
Cynthia Phillips (Sandia National Laboratories)
Branch-and-Bound Algorithm for Integer Program
Integer LP: Algorithms
Chapter 6. Large Scale Optimization
Solving Linear Systems of Equations - Inverse Matrix
Discrete Optimization
Presentation transcript:

Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract DE-AC04-94AL Reconnect ‘04 A Couple of General Classes of Cutting Planes Cynthia Phillips Sandia National Laboratories

Slide 2 Knapsack Cover (KC) Inequalities A C

Slide 3 Moving Away from Graphs The cuts apply to more general For this discussion, assume Let I be a set of variable indices such that

Slide 4 Cover Cuts We can remove the assumption that Consider a general inequality Set Apply a regular cover cut to and substitute

Slide 5 Review: Linear Programming Basis What does a corner look like algebraically? Ax=b Partition A matrix into three parts where B is nonsingular (invertible, square). Reorder x: (x B, x L, x U ) We have Bx B + Lx L + Ux U = b BLU xBxB xLxL xUxU

Slide 6 A Basic Solution We have Bx B + Lx L + Ux U = b Set all members of x L to their lower bound. Set all members of x U to their upper bound. Let (this is a constant because bounds and u are) Thus we have Set So we can express each basic variable in the current optimal LP solution x* as a function of the nonbasic variables.

Slide 7 Gomory Cuts Assume we have a pure integer program (not necessarily binary) Express each basic variable in the current optimal LP solution x* as a function of the nonbasic variables (tableau): fr(g j ) is the fractional part of g j Split g j into integral and fractional pieces:

Slide 8 Gomory Cuts

Slide 9 Gomory Cuts In a feasible solution x i is integral (pure integer program), so the whole left side is integral. Thus the right side must be as well: This is (one type of) Gomory Cut.

Slide 10 Global Validity Cuts like the TSP subtour elimination cuts are globally valid (apply to all subproblems). Can be shared Recall the key step for Gomory cuts:

Slide 11 Global Validity We require for the and u j in effect at the subproblem where the Gomory cut was generated. Gomory cuts are globally valid for binary variables –Need fixed at 1 to be fixed at upper and fixed at 0 to be at lower Gomory cuts are not generally valid for general integer variables