Projection method for solving systems of linear inequalities

DOI10.1007/BF00969860MaRDI QIDQ1116653zbMATH OpenOpenAlexFDO

Authors L. M. Brehgman

Publication date 1988

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00969860

zbMATH Keywords

algorithmlinear programmingnonzero nonnegative vectorprojection methodsystems of linear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Review text

See the review in Zbl 0655.65081.

Cites work

• A new polynomial-time algorithm for linear programming
• An asymptotic estimate of the average number of steps of the parametric simplex method
• scientific article; zbMATH DE number 3672004 (Why is no real title available?)
• scientific article; zbMATH DE number 3088637 (Why is no real title available?)
• Intelligent gradient search in linear programming

Cited in

(4)

• Projection methods for systems of equations
• Projection with a minimal system of inequalities
• A general projection algorithm for solving systems of linear equations
• A projection method for least-squares solutions to overdetermined systems of linear inequalities

This page was built for publication: Projection method for solving systems of linear inequalities

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