Unformatted text preview:  dual simplex algorithm use in sensitivity analysis adding/deleting rows/columns in basic LP model with solution recovery via primal and dual algorithms transportation problem graph interpretation (spanning trees) of basic solutions specialized algorithms for this model basis unimodularity and integrality of solutions sensitivity analysis and graphical interpretation geometry of LP and related topics convexity, polyhedra, polytopes, extreme points, edges, rays correspondence: extreme points <> basic feasible solutions geometric significance of the simplex algorithm degeneracy, cycling, proof of finite convergence using leastindex rule for cycle avoidance computational complexity KleeMinty examples of exponential worstcase behavior of simplex alg. discussion of polynomialtime algs. for combinatorial problems *************************************************...
View
Full
Document
This note was uploaded on 06/29/2011 for the course ORIE 3300 at Cornell.
 '08
 TODD

Click to edit the document details