This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CO 355 Mathematical Optimization (Fall 2010) Assignment 5 Due: Thursday, Dec 2nd. Policy. No collaboration is allowed. You may use the course notes / textbook, lecture slides, and any solutions to previous assignments but please be very specific when using citing results found there. (Don’t just say “from some claim in class we know....”.) Every other resource that you might stumble upon must be properly referenced. You are welcome to seek help from the current instructor and TAs for CO 355. Question 1: Prove that if the matrix A is totally unimodular, then so are the following matrices. (a): A T (b): ( A I ) (c): any matrix obtained by multiplying a row or column of A by 1 (d): ( A A ) (e): A A I I Question 2: Let M be a matrix of size m × n such that, in every row i , the first r i entries are 1 and the remainder are 0. In other words, there exist integers r 1 ,...,r m such that M i,j = { 1 (if j ≤ r i ) (otherwise) ....
View
Full Document
 Winter '10
 Harvey
 Optimization, vertex cover

Click to edit the document details