07 - Industrial Engineering 634 Integer Programming Fall...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Industrial Engineering 634 Fall 2011 Integer Programming Lecturer: Nelson Uhan Scribe: Jikai Zou September 7, 2011 Lecture 7. Guidelines for Strong Formulations With linear programming, a “good” formulation is typically one that has a small number of variables and constraints. In addition, given the availability of several efficient algorithms for linear optimization, the choice of formulation is important, but not critical. However, the situation in in- teger programming is quite different. The choice of formulation critically affects whether a problem can be solved efficiently or not. Then, what makes a good integer programming formulation? Definition Given a mixed integer program [MIP] min cx + dy s.t. Ax + By = d, x,y 0 , x Z n , the linear relaxation ( sometimes called LP relaxation ) of [MIP] is defined as min cx + dy s.t. Ax + By = d, x,y 0 . Note that the binary variable constraint y ∈ { 0 , 1 } is equivalent to 0 y 1 ,y Z n . In
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2012 for the course IE 530 taught by Professor Ravindran during the Spring '97 term at Purdue University-West Lafayette.

Page1 / 2

07 - Industrial Engineering 634 Integer Programming Fall...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online