A version of the simplex method for solving linear systems of inequalities and linear programming problems
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.