|
|
|
Discussion of simplex method with respect to convergence, degeneracy of pivots, pivot rules, and optimality. Improvement of theorems in previous lectures so now we can guarantee that the simplex…
|
|
Simplex method computations with a discussion of dictionaries and corresponding solutions.
|
|
|
|
|
|
Modeling logical AND using 4 no-good inequalities from the truth table; or using 3 facet-defining inequalities. Mixed 0/1 modeling: Extended formulations of models with fixed charge costs or…
|
|
Dual (complementary) basis; dual dictionary, negative transpose property of the dictionary pair; complementarity of primal and basic dual solutions; dual simplex method; complementary slackness…
|
|
Pivot rules. Unboundedness. The simplex method with lexicographic perturbation and a deterministic pivot rule as an algorithm. Fundamental theorem of linear optimization. Preview of LP development…
|