A projective algorithm for linear programming with no regularity condition (Q1200753): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On interior algorithms for linear programming with no regularity assumptions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial Newton method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4733659 / rank | |||
Normal rank | |||
Latest revision as of 12:04, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A projective algorithm for linear programming with no regularity condition |
scientific article |
Statements
A projective algorithm for linear programming with no regularity condition (English)
0 references
16 January 1993
0 references
interior point algorithm
0 references
phase I-phase II projective algorithm
0 references
0 references
