Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:58, 29 January 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
