A version of the simplex method for solving linear systems of inequalities and linear programming problems

arXiv2305.03730MaRDI QIDQ6435539FDOQ6435539

Publication date: 24 April 2023

Abstract: In order to nd a non-negative solution to a system of inequalities, the corresponding dual problem is composed, which has a suitable unity basic matrix. In such a formulation, the objective function is replaced by set of constraints based on that function. Additional constraints can be used for accelerating calculations in the rst phase of the simplex method. As an example the solution of the Klee-Minty hypercube problem is described in detail.

This page was built for publication: A version of the simplex method for solving linear systems of inequalities and linear programming problems

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