Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:03, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining phase I and phase II in a potential reduction algorithm for linear programming |
scientific article |
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
