All homework assignments are due in class.

• Homework 1 , due Feb. 22 in class.

• Homework 2 , due March 28, before exam.

• Homework 3 , due April 14, in class.

• Homework 4 (PDF file), due April 28, in class.

  If you cannot figure out how to model undirected (bi-directional) edges with the imposed total capacity constraint, please refer to the following hint .

  Use the following input format for the airline-scheduling problem.
  Your program should prompt you for the user data:
  ( starting_airport, terminal_airport, starting_time).
  Alternatively, you can just provide a short file with: starting_airport, terminal_airport, time .

  A full explanation of the format is given in this Air-schedule-format document prepared by the TA.

• Homework 5 (PDF file), due May 13.

  In this assignment you will use an LP solver LINGO, available on sisko.ecs.umass.edu, to model network flow problems as linear programs.
  The following document shows how to use LINGO. Follow the format of the Longest Path example discussed in class: Primal LP and Dual LP.
  Make sure to clearly identify the solutions, ketch the graphs, do not just turn in pages of printouts.

Final Exam is scheduled for Tuesday, May 17, 2005, at 10:30 am, MRST 132.
The exam will be comprehensive, with emphasis on the material covered after midterm 1, in particular Graphs, Flow Networks and mathematical programming (LP and ILP).