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

DOI10.1007/BF02023111MaRDI QIDQ1312781zbMATH OpenOpenAlexFDO

Authors 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

cycling-free pivoting rulesdegeneracyexterior point simplex type algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 710572
• An exterior point polynomial-time algorithm for convex quadratic programming
• Exterior point simplex-type algorithms for linear and network optimization problems
• An exterior-point method for linear programming problems
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming

Cites work

• A convergent criss-cross method
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• An infeasible (exterior point) simplex algorithm for assignment problems
• Computational complexity of parametric linear programming
• scientific article; zbMATH DE number 3115468 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• scientific article; zbMATH DE number 3209723 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3341891 (Why is no real title available?)
• New Finite Pivoting Rules for the Simplex Method
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• On anti-cycling pivoting rules for the simplex method
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
• The simplex algorithm with the pivot rule of maximizing criterion improvement

Cited in

(19)

• An external reconstruction approach (ERA) to linear programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• An exterior point method for the convex programming problem
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• An efficient simplex type algorithm for sparse and dense linear programs.
• A new efficient primal dual simplex algorithm
• Systematic construction of examples for cycling in the simplex method
• An exterior-point method for linear programming problems
• A note on probability assignments in estimating the time to solve linear programs
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• scientific article; zbMATH DE number 3939126 (Why is no real title available?)
• scientific article; zbMATH DE number 3961338 (Why is no real title available?)
• scientific article; zbMATH DE number 1203366 (Why is no real title available?)
• scientific article; zbMATH DE number 710572 (Why is no real title available?)
• Improving a primal–dual simplex-type algorithm using interior point methods
• Exterior point simplex-type algorithms for linear and network optimization problems
• On using exterior penalty approaches for solving linear programming problems
• An exterior point linear programming method based on inclusive normal cones
• Computational experience with exterior point algorithms for the transportation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312781)