A steepest feasible direction extension of the simplex method

DOI10.1007/978-3-030-48439-2_14MaRDI QIDQ2050249zbMATH OpenOpenAlexFDO

Authors Biressaw C. Wolde, Torbjörn Larsson

Publication date 30 August 2021

Full work available at URL https://doi.org/10.1007/978-3-030-48439-2_14

zbMATH Keywords

external pivotingfeasible directionlinear programsteepest-edge

Mathematics Subject Classification ID

Linear programming (90C05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• A feasible direction method for linear programming
• Steepest-edge simplex algorithms for linear programming
• An interior feasible direction method with constraint projections for linear programming
• A new steepest edge approximation for the simplex method for linear programming
• On gradient simplex methods for linear programs

Cited in

(5)

• A new steepest edge approximation for the simplex method for linear programming
• Global pricing and feasible directions in linear programming
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
• A global pricing extension of the simplex method
• A feasible direction method for linear programming

This page was built for publication: A steepest feasible direction extension of the simplex method

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