On the finite convergence of interior-point algorithms for linear programming (Q687096)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 429128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the finite convergence of interior-point algorithms for linear programming |
scientific article; zbMATH DE number 429128 |
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
0 references
0 references
0 references
0.8560840487480164
0 references
0.847866415977478
0 references
0.846051037311554
0 references
0.8412577509880066
0 references
0.8391476273536682
0 references
