This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ORIE 3310/5310 Optimization II Summer 2009 Homework # 3 Due: Monday, July 20, by 2:30p.m., in the OR3310 homework drop box. Print your name clearly on the first page of your homework. 1. Problem #6, BHM Chapter 8. (catering model) 2. Problem #16, BHM Chapter 8. (transportation model) 3. Problem #21, BHM Chapter 8. (transshipment model) 4. Given below is the utility data for a 5 × 5 assignment model ( max total utility). 4 8 6 3 3 2 2 3 1 4 2 4 2 1 4 3 3 2 1 3 6 2 4 2 (a) What is the size of a basis for this problem? How many degenerate variables must each basic solution have? Answer the previous two questions for a general n × n assignment model. (b) How do you expect the considerations of part (a) to affect the algorithms discussed in recitation for the transportation model, when applied to assignment problems? (c) For this model, starting with a basis determined by the greedy procedure, perform three full iterations (i.e., proceed through three additional bases, stopping if you demonstrate optimality) of the primaldual transportation algorithm studied in recitation....
View
Full Document
 Spring '08
 TODD
 Operations Research, Bipartite graph, BHM Chapter, integervalued optimal solution

Click to edit the document details