An experimental investigation of a primal–dual exterior point simplexalgorithm

DOI10.1080/02331934.2013.765422zbMath1311.90006OpenAlexW2061133142MaRDI QIDQ2868925

Nikolaos Samaras, Themistoklis Glavelis

Publication date: 19 December 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.765422

zbMATH Keywords

linear programmingexterior point algorithmsimplex algorithmcomputational results

Mathematics Subject Classification ID

Linear programming (90C05) Inventory, storage, reservoirs (90B05) Extreme-point and pivoting methods (90C49)

Related Items (1)

Improving a primal–dual simplex-type algorithm using interior point methods

Cites Work

• A new polynomial-time algorithm for linear programming
• An infeasible (exterior point) simplex algorithm for assignment problems
• Pivot rules for linear programming: A survey on recent theoretical developments
• An efficient simplex type algorithm for sparse and dense linear programs.
• Multiple centrality corrections in a primal-dual method for linear programming
• A new efficient primal dual simplex algorithm
• A primal-dual exterior point algorithm for linear programming problems
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Combining Interior-Point and Pivoting Algorithms for Linear Programming

This page was built for publication: An experimental investigation of a primal–dual exterior point simplexalgorithm