The iterative step in the linear programming algorithm of N. Karmarkar (Q1089252): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: A different convergence proof of the projective method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4221106 / rank | |||
Normal rank | |||
Latest revision as of 19:53, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The iterative step in the linear programming algorithm of N. Karmarkar |
scientific article |
Statements
The iterative step in the linear programming algorithm of N. Karmarkar (English)
0 references
1986
0 references
We simplify and strengthen the analysis of the improvement obtained in one step of Karmarkar's algorithm [see \textit{N. Karmarkar}, Combinatorica 4, 373-395 (1984; Zbl 0557.90065)].
0 references
improvement
0 references
Karmarkar's algorithm
0 references
