Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Q587154 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Vl. D. Mazurov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(91)90040-v / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075608398 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:01, 30 July 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
