scientific article; zbMATH DE number 59349

MaRDI QIDQ4007501zbMATH OpenFDO

Authors

Publication date 27 September 1992

zbMATH Keywords

Karmarkar's methodlinear programmingpolynomial-time simplex type methodsimplex methodsystems of linear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)

Recommendations

• A locally polynomial method for solving a system of linear inequalities
• Locally polynomial method for solving systems of linear inequalities
• Solving Inequalities and Proving Farkas's Lemma Made Easy
• A strongly polynomial algorithm for a new class of linear inequalities¹
• A primal-dual projection method for solving systems of linear inequalities

Cited in

(4)

• Locally polynomial method for solving systems of linear inequalities
• Trapezoid method for solving systems of linear inequalities and its implementation in insertion modeling
• A strongly polynomial algorithm for a new class of linear inequalities¹
• A locally polynomial method for solving a system of linear inequalities

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 Q4007501)