Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Worst-Case Step in Karmarkar's Algorithm / 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: On the improvement per iteration in Karmarkar's algorithm for linear programming / rank | |||
Normal rank | |||
Revision as of 13:50, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program |
scientific article |
Statements
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (English)
0 references
27 June 1992
0 references
The convergence behavior of Karmarkar's projective algorithm for linear programming problems is described. The authors show that the algorithm requires at least \(n-1\) iterations to reach the optimal solution.
0 references
convergence behavior
0 references
Karmarkar's projective algorithm
0 references
