A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING

DOI10.1142/S0217595904000394MaRDI QIDQ4654999zbMATH OpenFDO

Authors Sungmook Lim, Soondal Park

Publication date 10 March 2005

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595904000394

zbMATH Keywords

admissible pivot methodcriss-cross methodlinear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
• New variants of finite criss-cross pivot algorithms for linear programming
• scientific article; zbMATH DE number 4027164
• The simplex algorithm with a new primal and dual pivot rule
• scientific article; zbMATH DE number 5011461

Cites work

• LPAKO: A Simplex-based Linear Programming Program
• On the finiteness of the criss-cross method
• The Criss-Cross Method for Solving Linear Programming Problems

Cited in

(3)

• On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
• Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

This page was built for publication: A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING

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