scientific article; zbMATH DE number 4045475

MaRDI QIDQ3783068zbMATH OpenFDO

Authors Tamás Terlaky, Emil Klafszky

Publication date 1987

zbMATH Keywords

finite termination proofprimal and dual simplex method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Practical finite pivoting rules for the simplex method
• scientific article; zbMATH DE number 179276
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• The simplex algorithm with a new primal and dual pivot rule

Cited in

(4)

• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• Finiteness of the quadratic simplex method with the application of index selection rules
• scientific article; zbMATH DE number 179276 (Why is no real title available?)
• Practical finite pivoting rules for the simplex method

This page was built for publication:

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