Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| 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 | |||
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
