Assigned:
Friday, September 28, 2001
Due:
Friday, October 5, 2001, 1PM, in boxes outside IEOR department office
General Instructions
- This homework covers material from lectures on 9/26 and 10/1
- For each problem where you have to solve using the simplex method,
you should show your work. In particular, you should show the results
of each iteration, either as a tableau, or as a set of equations. You
can follow the details either of the method used in class, or the one
used in the textbook.
- 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.
Problems
- p. 144, Problem A1. For this problem please give 3 optimal
solutions (They do not all need to be basic solutions.)
- p. 145, Problem A6. Do not try to list all the optimal
solutions. Instead, describe the set of optimal solutions.
- p. 148, Problem A4.
- p. 200, Problem B17.
- Extra Credit: p. 140, problem B5. Please explain your answer carefully.
Switch to:
cliff@ieor.columbia.edu