On the finiteness of the criss-cross method (Q1176822): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A combinatorial abstraction of linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A convergent criss-cross method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite crisscross method for oriented matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite conformal-elimination free algorithm over oriented matroid programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank | |||
Normal rank | |||
Latest revision as of 11:01, 15 May 2024
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
