Questions from Kupferschmid, Chapters 5 and 6 (available on LMS):

• 5.5.48(d) (lecture 13. You should only need 2 iterations.)
• 6.6.28 (lectures 15 and 16)
• 6.6.31 (lectures 15 and 16)
• 6.6.50 (lecture 17): use the network simplex method from class. For an initial BFS, take the optimal solution given on page 216, modified so that x₁₅ is nonbasic at its upper bound, and x₄₅ is basic. Note that just one edge has a capacity constraint, so this is the only variable that can be nonbasic at its upper bound. Note also that rhs values give net demand in the bookt while the notes use net supply.
• 6.6.54 (lectures 16 and 17): Assume all edge lengths are positive. Hint: one approach is to map each node in the shortest path problem to one source node and one destination node in the transportation problem. You then have to choose the edge lengths so that the solution to the assignment problem gives an optimal solution to the shortest path problem.

In addition, read Sections 5.3 and 5.4, and Chapter 6 from the text.

Solving the homework problems (and other problems from the text) will improve your understanding of the material.

Working out the problems yourself will greatly improve your understanding of the material and help you on the exams.

You can ask questions on piazza, in addition to using office hours or email.

Exam 2 will be on November 7, in class. It will cover the material in Lectures 11–19. You can bring one sheet of handwritten notes, no larger than 8.5” × 11”. Old exams are available on LMS.