Please see the winter/96 midterm - available from the course home page.
This (winter/97) midterm will have 4 questions as well.
There will be
   2 on LP
   1 on NLP
   1 on Networks

The emphasis will be on sensitivity analysis and modelling (rather than
on algorithms).

For LP:  
    Please check the reading list. In addition, go over the min-max
approach for deriving the duals of LPs. This (implicitly) includes the
optimality conditions:
   dual feasibility
   primal feasibility
   complementary slackness

For NLP:
    Please check the reading list. In particular: min-max approach to
duality;  gradient; Hessian; convexity; quadratic functions and
ellipsoids; unconstrained optimality conditions; local vs global optimality.
Also, you should know what a semidefinite program is.


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.