The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP (Q3842984): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
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: Sufficient matrices and the linear complementarity problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4226179 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite crisscross method for oriented matroids / rank | |||
Normal rank | |||
Latest revision as of 15:55, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP |
scientific article |
Statements
The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP (English)
0 references
20 August 1998
0 references
existence of a short sequence
0 references
simplex methods
0 references
admissible pivot
0 references
