**Assigned:**
Thursday, March 24, 2011

**Due:**
Thursday, March 31, 2011

## 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
* Network Flows *.

## Problems

- Problem 9.8. Formulation of minimum-cost flow problems.
- Problem 9.14. Formulation of minimum-cost flow problems.
- Problem 9.30. Transforming a minimum-cost flow problem.
- Problem 9.36. Transformation of minimum-cost flow networks.
- Problem 9.44. Convexity of minimum cost flow solutions.

### Switch to:

cliff@ieor.columbia.edu