IOE 510 Finals

Below is a list of topics pertinent to the Final Exam.

Strong vs. Weak Constraint Formulation o Show that the formulations are equivalent o Compare their strength by finding a numerical example Using a constraint of the strong formulation as the objective function and maximizing over the set of weak constraints to show that the weak constraints do not imply the strong constraint. Showing that one formulation is at least as strong as another by showing that every inequality of one can be derived as a weighted combination of inequalities of the other Integer Solutions For Free o Consecutive 1s matricies, Assignment Problems, Network Problems o Recognizing and understanding Total Unimodularity Forming the Dual of an LP o Standard form and general form o Weak Duality, Strong Duality, Complementary Slackness Theorems of the Alternative and Farkas' Lemma Understanding the mechanics of the Simplex Method and why it works o Knowing which variable should enter / leave the basis o Unboundedness via basic feasible rays o Phase 1 for feasibility Sensitivity Analysis o How do we determine the bounds b or c for which the current basis remains optimal? o Understanding global behavior: piecewise linear convex and concave function Understanding the mechanics of the decomposition and cutting stock algorithms and why they work o What exactly is happening when we perform decomposition? Branch & Bound o How the algorithm generally works o Comparing upper/lower bounds of branches and knowing when to eliminate a particular branch Gomory cuts o No Gomory to Gomory-Chvatal comparison on the exam o Know how the take a combination of inequalities and round them (e.g. to cut off a given fractional solution) No MIP or MIR Subgradient Optimization o Should know how to apply the subgradient method o No proof of convergence No epsilon-vector material, such as o Anti-cycling o Phase 1 (you should know about Phase 1 feasibility, but do not worry about dealing with anti-cycling in Phase 1) General o All definitions o All short proofs o All theorems we mentioned more than once o No recreation of lengthy proofs