Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combining phase I and phase II in a potential reduction algorithm for linear programming |
scientific article; zbMATH DE number 279314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining phase I and phase II in a potential reduction algorithm for linear programming |
scientific article; zbMATH DE number 279314 |
Statements
Combining phase I and phase II in a potential reduction algorithm for linear programming (English)
0 references
22 August 1993
0 references
Most interior-point algorithms for linear programming assume that an initial interior point is known. This paper introduces an algorithm for attaining feasibility and optimality together. Convergence is proved, and the complexity is such that roughly \(O(n)\) iterations are required for each additional bit of precision.
0 references
combined phase I-phase II method
0 references
convergence
0 references
interior-point algorithms
0 references
complexity
0 references
0 references
0 references
0.8444278240203857
0 references
0.8404232859611511
0 references
0.8366448879241943
0 references
0.8331018090248108
0 references
0.8330409526824951
0 references
