Assigned:
Friday, November 9, 2001
Due:
Friday, November 16, 2001, 1PM, in boxes inside IEOR department office
General Instructions
- This homework covers material from lectures on 10/29 and 11/7.
- You must write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
- Numbered problems are all from the textbook Introduction to
Mathematical Programming.
Problems
- p. 390. Problem A3. Solve part c using the Hungarian
algorithm. Show your work. Cultural note: Tony Geary
and Genie Francis were famous around 1980 as Luke and Laura on the TV
Soap Opera General Hospital.
- p. 390. Problem A4. You can solve this one any way you wish,
but show your work.
- p. 395. Problem A5. Your must formulate and solve this
problem. You should solve it using the transportation simplex method.
- p. 403. Problem B27. You should solve this using the Hungarian
algorithm.
- Extra credit: p. 403. Problem B29.
Switch to:
cliff@ieor.columbia.edu