id: 03934764
dt: j
an: 03934764
au: Terlaky, Tamás
ti: A finite "criss-cross method" for solving linear programming problems.
so: Alkalmazott Mat. Lapok 10, 289-296 (1984).
py: 1984
pu: Akademiei Kiado, Budapest
la: HU
cc: 
ut: criss-cross method
ci: 
li: 
ab: Our paper treats 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 a finite number of steps if it exists. If
    there is no optimal solution, then we show that there is no 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 that we have
    constructed a quite new procedure for solving linear programming
    problems.
rv: