The generalized simplex method

DOI10.1016/0167-6377(92)90094-JzbMath0770.90038OpenAlexW2094703996MaRDI QIDQ1195877

Joao Carlos Namorado Climaco, Domingos Moreira Cardoso

Publication date: 4 January 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90094-j

zbMATH Keywords

simplex algorithmlarge scale systemspolytopeoptimal face

Mathematics Subject Classification ID

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

Related Items (4)

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ An efficient simplex type algorithm for sparse and dense linear programs.

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

This page was built for publication: The generalized simplex method