On interior algorithms for linear programming with no regularity assumptions.
Kurt M. AnstreicherPublished in: Oper. Res. Lett. (1992)
Keyphrases
- linear programming
- computational cost
- theoretical analysis
- orders of magnitude
- objective function
- search algorithm
- recently developed
- linear program
- computationally efficient
- benchmark datasets
- restrictive assumptions
- real time
- graph theory
- computationally expensive
- machine learning algorithms
- dynamic programming
- significant improvement
- data structure
- genetic algorithm