3 IP and LP

3 IP and LP - IEE 598 - 3. (I.1, II.4.2) IP and LP Muhong...

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

View Full Document Right Arrow Icon
IEE 598 - 3. (I.1, II.4.2) IP and LP Muhong Zhang DEPARTMENT OF INDUSTRIAL ENGINEERING Feb. 02, 2010
Background image of page 1

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

View Full DocumentRight Arrow Icon
Relaxation Definition: ( R ) : z * R = max { c ( x ) : x T } is called a relaxation of ( P ) : z * P = max { f ( x ) : x S } if 1 S T , 2 c ( x ) f ( x ) , x S . Proposition: z * P z * R . Proof. Proposition: Let x * R be an optimal solution for ( R ) . If x * R S and f ( x * R ) = c ( x * R ) then x * R is optimal for ( P ) . Proof. Zhang IEE 376 Introduction to OR 2 / 9
Background image of page 2
LP Relaxation and IP Proposition: (i) If an LP relaxation is infeasible, the original problem IP is infeasible. (ii) Let x * LP be an optimal solution of the LP relaxation. If x * LP is feasible for IP, then x * LP is an optimal solution of IP. Proof. Q: If LP relaxation is unbounded, what can you say for the IP? Zhang IEE 376 Introduction to OR 3 / 9
Background image of page 3

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

View Full DocumentRight Arrow Icon
Branch and bound algorithm is the most commonly-used algorithm for solving MIPs. Divide and conquer approach.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/01/2011 for the course IEE 598 taught by Professor Hillary during the Spring '10 term at USC.

Page1 / 9

3 IP and LP - IEE 598 - 3. (I.1, II.4.2) IP and LP Muhong...

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

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