Cone-cutting: a variant representation of pivot in simplex

DOI10.1142/S0219622011004221MaRDI QIDQ2994775zbMATH OpenFDO

Authors Pei-Zhuang Wang

Publication date 29 April 2011

Published in International Journal of Information Technology & Decision Making (Search for Journal in Brave)

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

zbMATH Keywords

cone-cuttinglinear programmingsimplex

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The double pivot simplex method
• A Note on the Simplex Method for 2-Dimensional Second-Order Cone Programming
• A Variant of the Dual Pivoting Rule in Linear Programming
• Practical finite pivoting rules for the simplex method
• Cone-LP's and semidefinite programs: geometry and a simplex-type method

Cites work

• Linear Programming

Cited in

(1)

• Collapsing and lifting for the cut cone

This page was built for publication: Cone-cutting: a variant representation of pivot in simplex

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