IEOR 3608, Fall 2002: Homework 5

Assigned: Wednesady, October 16, 2002
Due: Wednesday, October 23, 2002, in class

General Instructions

  1. Please review the course information.
  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. 212, Problem A5. (Solve this any way you like)
  2. p. 223, Problem A4.
  3. p. 258, Problem A2.
  4. p. 272, Problem A7. Use the linear algebraic methods from this section to solve this problem.
  5. p. 272, Problem B8. Use the linear algebraic methods from this section to solve this problem.
  6. Extra Credit Suppose that you are given a linear program
    maximize cx
    s.t.
    Ax = b
    x >= 0
    Let xBV be one set of basic variables, and let xNBV, cBV, cNBV, N and B be defined as in class. Let x'BV be another set of basic variables, and let x'NBV, c'BV, c'NBV, N' and B' be defined relative to x'BV. Given the dictionary corresponding to xBV, explain how to compute the dictionary corresponding to x'BV.

    Switch to:

    cliff@ieor.columbia.edu