Resolution of the problem of degeneracy in a primal and dual simplex algorithm

DOI10.1016/S0167-6377(96)00008-9zbMath0899.90127OpenAlexW2084312527WikidataQ127124385 ScholiaQ127124385MaRDI QIDQ1374385

Konstantinos Dosios, Konstantinos Paparrizos

Publication date: 17 November 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00008-9

zbMATH Keywords

degeneracypivoting rulesexterior point simplex algorithmprimal-dual simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Systematic construction of examples for cycling in the simplex method ⋮ An efficient simplex type algorithm for sparse and dense linear programs. ⋮ A new efficient primal dual simplex algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infeasible (exterior point) simplex algorithm for assignment problems
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
• On anti-cycling pivoting rules for the simplex method
• A practical anti-cycling procedure for linearly constrained optimization
• An exterior point simplex algorithm for (general) linear programming problems
• The simplex algorithm with a new primal and dual pivot rule
• A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
• New Finite Pivoting Rules for the Simplex Method
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: Resolution of the problem of degeneracy in a primal and dual simplex algorithm