LPAKO: A Simplex-based Linear Programming Program
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A fast LU update for linear programming
- A new polynomial-time algorithm for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- Nonadjacent extreme point methods for solving linear programs
- On Finding Primal- and Dual-Optimal Bases
- Pivot rules for linear programming: A survey on recent theoretical developments
- Pivot selection methods of the Devex LP code
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Recovering an optimal LP basis from an interior point solution
- Steepest-edge simplex algorithms for linear programming
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
- The Composite Simplex Algorithm
- The simplex method of linear programming using LU decomposition
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(6)- Numerical aspects in developing LP softwares, LPAKO and LPABO
- A two-phase support method for solving linear programs: numerical experiments
- ALPO: Another Linear Program Optimizer
- LPAKO
- scientific article; zbMATH DE number 1783867 (Why is no real title available?)
- A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
This page was built for publication: LPAKO: A Simplex-based Linear Programming Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709753)