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;
transshipment problem, etc...
For Integer Programming:
Please check the reading list and the notes on WWW. These notes
include several techniques on modelling problems with integer variables
(e.g. logical constraints).
In addition, you need to be able to solve a simple problem using
branch-bound and/or Gomory cutting planes.
For Dynamic Programming:
Please check the reading list. You should review the assignment and
the problems done in class. This includes the two types of networks
(serial and acyclic); as well as the basic dynamic formulation using a
recursion function.