Affordable Access

The Criss-Cross Method for Solving Linear Programming Problems

Authors
Disciplines
  • Computer Science

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

New variants of the criss-cross method for linearl...

on European Journal of Operationa... Jan 01, 2004

A relaxation method for solving problems of non-li...

on USSR Computational Mathematics... Jan 01, 1977

Numerical methods for solving problems of non-line...

on USSR Computational Mathematics... Jan 01, 1976

A note on “A new method for solving fully fuzzy li...

on Applied Mathematical Modelling Aug 01, 2013
More articles like this..