On the finite convergence of interior-point algorithms for linear programming (Q687096): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/mp/Ye92a, #quickstatements; #temporary_batch_1731468600454 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01581087 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063176644 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mp/Ye92a / rank | |||
Normal rank | |||
Latest revision as of 04:34, 13 November 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
0 references
0 references
0 references
