Assigned:
Wednesady, November 6, 2002
Due:
Wednesday, November 13, 2002, in class
General Instructions
- Please review the
course information.
- 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. 361, Problem A8. Formulate the problem and solve using the
transportation simplex method. Show all your work.
- p. 361, Problem A10. Formulate the problem and solve using the
transportation simplex method. Show all your work.
- p. 395, Problem A1. Solve any way you like. Show appropriate work.
- p. 396, Problem B6. Formulate, but do not solve.
- p. 390, Problem A4. Formulate, and solve using the Hungarian
algorithm.
- Extra Credit p. 403, Problem B29.
Switch to:
cliff@ieor.columbia.edu