On the finiteness of the criss-cross method (Q1176822)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the finiteness of the criss-cross method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the finiteness of the criss-cross method |
scientific article |
Statements
On the finiteness of the criss-cross method (English)
0 references
25 June 1992
0 references
The criss-cross method is a finite procedure to decide if an LP problem has an optimal solution or not. A new proof of the finiteness of this known method is given. With this proof, a relaxation of the pivoting selection is allowed, without losing the finiteness of the algorithm.
0 references
simplex method
0 references
criss-cross method
0 references
finiteness
0 references
