A new revised simplex method for degenerate linear programs
From MaRDI portal
Publication:4901344
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 1383435 (Why is no real title available?)
- An improved primal simplex algorithm for degenerate linear programs
- Parametric linear programming and anti-cycling pivoting rules
- Making progress during a stall in the simplex algorithm
- A new steepest edge approximation for the simplex method for linear programming
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A new version of the improved primal simplex for degenerate linear programs
- scientific article; zbMATH DE number 847181 (Why is no real title available?)
- The positive edge pricing rule for the dual simplex
- Removing degeneracy in LP-type problems revisited
- A revised simplex method of solving degenerate fuzzy number linear programming problems
- Alternative approach to revised simplex method
- On the solution of highly degenerate linear programmes
- A new pivoting rule for solving various degeneracy problems
- On the solution of degenerate problems of linear programming
- scientific article; zbMATH DE number 3852781 (Why is no real title available?)
This page was built for publication: A new revised simplex method for degenerate linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901344)
