The Criss-Cross Method for Solving Linear Programming Problems
This paper describes the Criss-Cross Method of solving linear programming problems. The method, a primal-dual scheme, normally begins with a problem solution that is neither primal nor dual feasible, and generates an optimal feasible solution in a finite number of iterations. Convergence of the method is proved and flow charts of the method are presented. The method has been programmed in FORTRAN and has been run on a number of computers including the IBM 1620, the IBM 7044, the CDC G-20, and the CDC 6400. A number of problems have been solved using the Criss-Cross method, and some comparisons between the Criss-Cross method and the Simplex method have been made. The results, though scanty, are favorable for the Criss-Cross method. A means of using the product form of the inverse with the Criss-Cross method is also discussed.
Year of publication: |
1969
|
---|---|
Authors: | Zionts, Stanley |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 15.1969, 7, p. 426-445
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Saved in favorites
Similar items by person
-
Multiple Criteria Decision Making : From Early History to the 21st Century
Wallenius, Jyrki, (2011)
-
Decision making : some experiences, myths and observations
Zionts, Stanley, (1997)
-
Bringing MCDM to the forefront of management practice
Zionts, Stanley, (1998)
- More ...