The generalized simplex method

DOI10.1016/0167-6377(92)90094-JzbMATH Open0770.90038OpenAlexW2094703996MaRDI QIDQ1195877FDOQ1195877

Authors: Joao Carlos Namorado Climaco, D. M. 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

Recommendations

• scientific article; zbMATH DE number 3898608
• Publication:4502371
• A method of solving the general problem of linear programming
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
• scientific article; zbMATH DE number 966292

zbMATH Keywords

polytopelarge scale systemssimplex algorithmoptimal face

Mathematics Subject Classification ID

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

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming

Cited In (13)

• An efficient simplex type algorithm for sparse and dense linear programs.
• A regularized simplex method
• The sagitta method for solving linear programs
• A simplex-like method with bisection for linear programming¹
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
• Exterior point simplex-type algorithms for linear and network optimization problems
• Title not available (Why is that?)
• A phase-1 approach for the generalized simplex algorithm
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
• Simplex method and groups generated by reflections
• Title not available (Why is that?)
• Pivoting in an outcome polyhedron
• Title not available (Why is that?)

This page was built for publication: The generalized simplex method

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