A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:30, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' |
scientific article |
Statements
A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (English)
0 references
27 June 1992
0 references
This paper develops an algorithm for solving a standard-form linear program directly from an infeasible ``warm start''. The algorithm is a potential function reduction algorithm. The paper is partially motivated by the following phenomenon related to the simplex methods: The optimal basis of one version of the model usually serves as an excellent starting basis for the next version of the model, whether or not the basis is even feasible for the next version of the model.
0 references
interior-point methods
0 references
potential function reduction algorithm
0 references
