A Short Course in Linear Programming
Here are more terms for you to add to what you studied with the
mid-course list
.
Alternative systems
Anticycling rule
Backward substitution
Backward transformation
Backward triangularization
Big-M method
Bland's rule
Blending problem
Central path
Chemical equilibrium problem
Column generation
Compatibility theory
Crash
Dantzig-Wolfe decomposition
Decomposition principle
Decoupling principle
Density
Duality gap
Elastic program
Elementary matrix
Ellipsoid method
Equilibrium basis
Factored form of basis
Forced equality
Forcing substructure
Forward substitution
Forward transformation
Forward triangularization
Generalized upper bound
Hirsch conjecture
Inventory control problem
Involutionary property
Irreducible inconsistent subsystem
Irredundant
Karmarkar's algorithm
Kernel of a basis
Linearity interval
Logical variable
Max Flow - Min Cut theorem
100% Rule
Optimal partition
Pivot selection
Preconditioning
Predictor-corrector algorithm
Presolve
Product form of basis
Sensitivity analysis
Sequential Linear Programming
Shadow price
Sparsity
Support set
Tolerance approach
Transposition theorem
Last updated: October 23, 1997