Feasibility issues in a primal-dual interior-point method for linear programming (Q803044): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINOS / rank | |||
Normal rank | |||
Revision as of 22:09, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feasibility issues in a primal-dual interior-point method for linear programming |
scientific article |
Statements
Feasibility issues in a primal-dual interior-point method for linear programming (English)
0 references
1990
0 references
The author proposes a new method (based on the generic primal-dual algorithm) for obtaining an initial feasible interior-point solution to a linear program which avoids the use of a ``big-\({\mathcal M}''\).
0 references
primal-dual algorithm
0 references
initial feasible interior-point solution
0 references
