This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Industrial Engineering Fall Integer Programming Homework Last updated: October , Due: Friday October , in class Note: only a proper subset of these problems will be graded. Prob em . (Bertsimas and Weismantel, Exercise . ) Prove that a matrix of zeroone elements, in which each column has consecutive ones, is totally unimodular. Prob em . (Bertsimas and Weismantel, Exercise . ) Let b Z m . Show that { x R n Ax b , x } is integral if and only if {( x , s ) R n + m Ax + s = b , x , s , } is integral. Prob em . (Bertsimas and Weismantel, Exercise . ) a. Show that an incidence matrix of a general undirected graph is not totally unimodular. b. Show that an incidence matrix of an undirected graph is totally unimodular if and only if the graph is bipartite. (See Chapter of Korte and Vygen for a formal de nition of the incidence matrix of an undirected graph.) Prob em . (Bertsimas and Weismantel, Exercise . ) a. Recall the integer programming formulation of the minimum cut problem on an undirected graph we discussed in Lecture . Show how to modify this formulation to nd the minimumdiscussed in Lecture ....
View
Full
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 UniversityWest Lafayette.
 Spring '97
 RAVINDRAN
 Industrial Engineering

Click to edit the document details