Simplex algorithms for linear programming

MaRDI QIDQ3081837zbMATH OpenFDO

Authors Andrea Grosso, F. Della Croce

Publication date 9 March 2011

zbMATH Keywords

dual simplex algorithmprimal simplex algorithmprimal-dual simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• Linear programming. Foundations and extensions
• scientific article; zbMATH DE number 194981
• Linear programming computation
• Classical simplex methods for linear programming and their developments
• scientific article; zbMATH DE number 50649

Cited in

(10)

• An overview on the simplex algorithm
• An exact approach for the 0-1 knapsack problem with setups
• A new exact approach for the 0-1 collapsing knapsack problem
• Computational techniques of the simplex method
• Numerical report of basic line algorithm for linear programming
• scientific article; zbMATH DE number 3889289 (Why is no real title available?)
• Simplexwise Linear Untangling
• scientific article; zbMATH DE number 5018767 (Why is no real title available?)
• A practical guide to the dual theorem
• Simple LPO constraint solving methods

This page was built for publication: Simplex algorithms for linear programming

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