A fast simplex algorithm for linear programming
From MaRDI portal
Recommendations
Cited in
(18)- Adjacent vertex simplex algorithms: More experimental results on random problems
- The simplex algorithm with a new primal and dual pivot rule
- A general pricing scheme for the simplex method
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models
- Book review of: P.-Q. Pan, Linear programming computation
- Steepest-edge simplex algorithms for linear programming
- A timing model for the revised simplex method
- A simple direct cosine simplex algorithm
- A largest-distance pivot rule for the simplex algorithm
- A randomized polynomial-time simplex algorithm for linear programming
- scientific article; zbMATH DE number 3919643 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- Fresh views on some recent developments in the simplex algorithm
- scientific article; zbMATH DE number 966292 (Why is no real title available?)
- A simple polynomial-time rescaling algorithm for solving linear programs
- Efficient nested pricing in the simplex algorithm
This page was built for publication: A fast simplex algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110369)