A general phase-I method in linear programming
From MaRDI portal
(Redirected from Publication:1069441)
Recommendations
- An improved general Phase-I method in linear programming
- A strictly improving linear programming Phase I algorithm
- An artificial-free simplex-type algorithm for general LP models
- A piecewise linear dual phase-1 algorithm for the simplex method
- A phase-1 approach for the generalized simplex algorithm
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3744918 (Why is no real title available?)
- scientific article; zbMATH DE number 3616184 (Why is no real title available?)
- Pivot selection methods of the Devex LP code
- The Composite Simplex Algorithm
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
Cited in
(13)- A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
- A piecewise linear dual phase-1 algorithm for the simplex method
- A strictly improving linear programming Phase I algorithm
- An improved general Phase-I method in linear programming
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A phase-1 approach for the generalized simplex algorithm
- Advances in design and implementation of optimization software
- On a dual method for a specially structured linear programming problem with application to stochastic programming
- MOPS -- Mathematical optimization system
- A new pivoting rule for solving various degeneracy problems
- Direct phasing by binary integer programming
- A generalized dual phase-2 simplex algorithm.
- A Variant of the Dual Pivoting Rule in Linear Programming
This page was built for publication: A general phase-I method in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069441)
