Assigned:
Friday, October 19, 2001
Due:
Thursday, October 25, 2001
General Instructions
- 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.
- Please do not express an algorithm using only pseudocode.
Additional explanation is required!
- Numbered problems are all from the textbook Network Flows .
Problems
- Problem 9.2. Vehicle fleet planning.
- Problem 9.16. Flow optimality.
- Problem 9.30. More flow optimality.
- Derive the complimentary slackness conditions for min-cost flow
presented in class (or the version in the textbook) by applying the
complimentary slackness theorem to an LP formulation of min-cost flow.
Switch to:
cliff@ieor.columbia.edu