This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: IEE 598  8 (III.1) Integral Polyhedra Muhong Zhang DEPARTMENT OF INDUSTRIAL ENGINEERING Feb. 24, 2011 Integral Polyhedron Definition: A nonempty polyhedron P is said to be integral if each of its nonempty faces contains an integral point. Proposition: A nonempty polyhedron P = { x R n : Ax b } with rank ( A ) = n is integral if and only if all of its extreme points are integral. Consider the optimization problem z * = max { cx : x P } , given a polyhedron P . Proposition: The following statements are equivalent: 1 P is integral; 2 There is an integral optimal solution for all c R n for which an optimal solution exists; 3 There is an integral optimal solution for all c Z n for which an optimal solution exists; 4 z * is integral for all c Z n for which an optimal solution exists. Zhang IEE 598 OPT II 2 / 12 Totally Unimodularity Definition: An m n matrix A is totally unimodular (TU) if the determinant of every square submatrix is 0, 1, or 1. Proposition: If A is a totally unimodular matrix and b Z m , then P = { x R n : Ax b } is an integral polyhedron. Proposition: The following statements are equivalent: 1 A is TU; 2 The transpose of A is TU; 3 ( A , I ) is TU; 4 A matrix obtained by deleting a unit row/column from A is TU; 5 A matrix obtained by multiplying a row/column of A by 1 is TU; 6 A matrix obtained by interchanging two rows/columns of...
View
Full
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.
 Spring '10
 Hillary

Click to edit the document details