An exterior point simplex algorithm for (general) linear programming problems

DOI10.1007/BF02023111zbMath0786.90043OpenAlexW2057085806MaRDI QIDQ1312781

Konstantinos Paparrizos

Publication date: 7 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023111

zbMATH Keywords

degeneracycycling-free pivoting rulesexterior point simplex type algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Resolution of the problem of degeneracy in a primal and dual simplex algorithm ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Computational experience with exterior point algorithms for the transportation problem ⋮ Systematic construction of examples for cycling in the simplex method ⋮ On using exterior penalty approaches for solving linear programming problems ⋮ An efficient simplex type algorithm for sparse and dense linear programs. ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ A new efficient primal dual simplex algorithm

Cites Work

• An infeasible (exterior point) simplex algorithm for assignment problems
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
• On anti-cycling pivoting rules for the simplex method
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• A convergent criss-cross method
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Computational complexity of parametric linear programming
• New Finite Pivoting Rules for the Simplex Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An exterior point simplex algorithm for (general) linear programming problems