For LP:
Please check the reading list. Ensure that you know sensitivity
analysis, duality, and both the revised and dual simplex method.
For Networks:
Please check the reading list. In addition, see the notes on WWW
that we have been going over in class. These notes include: min
distance; minimum spanning tree; max flow; transportation problem;
and transshipment problem.
For Integer Programming:
Please check the problems we have covered in class, e.g. knapsack
problem, set covering (crew scheduling) problem.