Efficiency of the dual simplex method for solving systems of linear inequalities

DOI10.1007/BF01070120MaRDI QIDQ4005338zbMATH OpenOpenAlexFDO

Authors É. I. Nenakhov, M. E. Primak

Publication date 26 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

dual simplex methodlinear inequalitieslinear programmingmethod of simplex Chebyshev centersnumber of iterations

Mathematics Subject Classification ID

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

Recommendations

• The dual simplex method, techniques for a fast and stable implementation
• scientific article; zbMATH DE number 232263
• scientific article; zbMATH DE number 2092205
• A variant of the dual simplex method for a linear semidefinite programming problem
• A dual projective simplex method for linear programming
• Finding all solutions of systems of nonlinear equations using the dual simplex method
• Duality for inexact linear programming problems^∗
• A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
• A primal-dual projection method for solving systems of linear inequalities
• A Dual Simplex Algorithm for Piecewise-Linear Programming

Cited in

(3)

• scientific article; zbMATH DE number 3854364 (Why is no real title available?)
• scientific article; zbMATH DE number 3970553 (Why is no real title available?)
• Convergence of the method of Chebyshev centers and some applications

This page was built for publication: Efficiency of the dual simplex 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 Q4005338)