IEOR 3608, Fall 2006: Homework 7

Assigned: Tuesday, October 31, 2006
Due: Tuesday, November 14, 2006, 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 problems are all from the textbook Introduction to Mathematical Programming, 4th Edition.

p. 372, A6. Formulate and solve using transportation simplex. Show your work. (You can check your answer against your LINDO solution from last week.)
p. 372, A10. Formulate and solve using transportation simplex. Show your work. (You can check your answer against your LINDO solution from last week.)
p.398, A2. Formulate and solve using the Hungarian Algorithm.
p. 399, A6. You can solve however you like, but be sure to explain your answers.
p. 403, Problem A5. Formulate and solve however you like. Show your work, or computer input/output.
Write LINGO code to formulate and solve a transshipment problem. Your code should work for 3 supply points, 3 demand points and 2 transshipment points. You can assume that the data section will look as follows:

DEMAND = (3 entries);
SUPPLY = (3 entries);
SDCOST = (9 entries);
D STCOST = (6 entries);
TDCOST = (6 entries);
TTCOST = (4 entries);

where DEMAND and SUPPLY are the demand and supply vectors, and SDCOST, STCOST, TDCOST and TTCOST are the costs from supply nodes to demand nodes, from supply nodes to transshipment nodes, from transshipment nodes to demand nodes, and from transhipment nodes to transshipment nodes respectively.
Run your code on the following data:

DEMAND = 100 100 100;
SUPPLY = 150 50 100;
SDCOST = 25 40 10 30 15 20 20 20 20;
STCOST = 10 5 10 5 5 5;
TDCOST = 15 10 25 30 20 10;
TTCOST = 5 15 10 10;