Assigned:
Thursday, October 28, 2004
Due:
Wednesday, November 10, 2004, at the beginning of 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 problemnnns are all from the textbook Introduction to
Mathematical Programming, 4th Edition.
Problems
- Section 7.1, p. 371, A3. Formulate as a transportation problem.
Do not solve.
- Section 7.1, p. 372, A10. Formulate and solve using transportation
simplex. Show your work.
- Section 7.6, p. 403, A5. Formulate and solve using LINGO. Show your work, and the LINGO input and output.
- Section 7.5, p. 399, A6. For part a, formulate and solve using the Hungarian algorithm. Then answer part b.
- p. 411, Problem B27. Solve anyway you like. Show your work.
- Extra Credit p. 411, Problem B29.
Switch to:
cliff@ieor.columbia.edu