IEOR264 - HW #4 - Due: 04/14/08

1) Do exercises 1, 3, and 10 in Section 9 of Chapter II.1
   and exercise 9 in Section 6 of Chapter II.2.

2) Implement a branch-and-cut algorithm based on 0-1 knapsack cover 
   inequalities to solve 0-1 programming problems (Modify the Concert 
   code for the branch-and-cut algorithm for the lot-sizing problem). 
   Use randomly generated problem instances max {cx: Ax <= b, x binary}
   and treat each row as a knapsack set. Compare using a greedy rounding 
   heuristic and a dynamic programming algorithm to solve the separation
   problems. A numerical example is given on pages 459-461 of the textbook.