LPAKO: A Simplex-based Linear Programming Program
From MaRDI portal
Publication:4709753
DOI10.1080/1055678021000049381zbMath1027.90058OpenAlexW1969374862MaRDI QIDQ4709753
Publication date: 14 January 2004
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000049381
Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Extreme-point and pivoting methods (90C49) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A two-phase support method for solving linear programs: numerical experiments, A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING, LPAKO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- A fast LU update for linear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Recovering an optimal LP basis from an interior point solution
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- Steepest-edge simplex algorithms for linear programming
- Nonadjacent extreme point methods for solving linear programs
- On Finding Primal- and Dual-Optimal Bases
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- The Composite Simplex Algorithm
- The simplex method of linear programming using LU decomposition
- Pivot selection methods of the Devex LP code
