On the finite convergence of interior-point algorithms for linear programming (Q687096): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the finite convergence of interior-point algorithms for linear programming |
scientific article |
Statements
On the finite convergence of interior-point algorithms for linear programming (English)
0 references
20 December 1993
0 references
For a linear program a polynomial-time interior point algorithm is suggested, which generates an exact optimal solution on the optimal face in combination with a test projection procedure. Computational results are also reported. The concept of projecting an interior point into the optimal face is vital and very useful also for other algorithms.
0 references
polynomial-time interior point algorithm
0 references
test projection procedure
0 references
