IEOR 3608, Fall 2001: Homework 09

Assigned: Wednesday, November 30, 2001
Due: Friday, December 7, 2001, 1PM, in boxes inside IEOR department office

General Instructions

  1. This homework covers material from lectures on 11/21, 11/26 and 11/28.
  2. 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.
  3. Numbered problems are all from the textbook Introduction to Mathematical Programming.

Problems

  1. p. 773 Problem A2. To receive credit you must solve this problem via dynamic programming and show your work.
  2. p. 791. Problem A4. To receive credit you must solve this problem via dynamic programming and show your work.
  3. p. 816. Problem A5. This is an easy problem to solve in your head. To receive credit you must solve this problem via dynamic programming and show your work.
  4. For the network in Figure 4 on p. 411, consider the following multicommodity flow problem. We have three commodities, each specified by the triple (source,destination,demand): (1,5,6) (2,4,5) (1,4,1) Write down the linear program for this multicommodity flow problem and solve it using LINDO.

    Switch to:

    cliff@ieor.columbia.edu