A Short Course in Linear Programming
Lesson 7. Computer science of LP
Use the
Mathematical Programming Glossary
to look up terms you do not understand.
First, look up the following terms from my glossary (some you have already seen).
Backward substitution
,
Backward transformation
,
Backward triangularization
Complexity
Cycling
Dantzig-Wolfe decomposition
Density
Dual method
Elementary matrix
Factored form of basis
Forward substitution
,
Forward transformation
,
Forward triangularization
Generalized upper bound
Hirsch conjecture
Interior (point) method
Kernel of a basis
Klee-Minty polytope
Labeling algorithm
LU decomposition
NP-complete
,
NP-hard
Parametric programming
Phase I
Pivot
,
Pivot selection
Preconditioning
Predictor-corrector algorithm
Presolve
Pricing
Primal method
Product form of basis
Reduce
Restricted basis entry rule
Sequential Linear Programming
Sherman-Morrison formula
Simplex method
Sparsity
Variable upper bound
Last updated: July 12, 1997