A convergent criss-cross method
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 16 (5) , 683-690
- https://doi.org/10.1080/02331938508843067
Abstract
Our paper presents a new Criss-Cross method for solving linear programming problems. Starting from a neither primal nor dual feasible solution, we reach an optimal solution in finite number of steps if it exists. If there is no optimal solution, then we show that there is not primal feasible or dual feasible solution, We prove the finiteness of this procedure. Our procedure is not the same as the primal or dual simplex method if we have a primal or dual feasible solution, so we have constructed a quite new procedure for solving linear programming problems.Keywords
This publication has 4 references indexed in Scilit:
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- Some Empirical Tests of the Criss-Cross MethodManagement Science, 1972
- Duality Theory of Linear Programs: A Constructive Approach with ApplicationsSIAM Review, 1969
- The Criss-Cross Method for Solving Linear Programming ProblemsManagement Science, 1969