Feasibility issues in a primal-dual interior-point method for linear programming (Q803044)
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: Feasibility issues in a primal-dual interior-point method for linear programming |
scientific article; zbMATH DE number 4199958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feasibility issues in a primal-dual interior-point method for linear programming |
scientific article; zbMATH DE number 4199958 |
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
0 references
0 references
0.94622123
0 references
0.93718284
0 references
0.93528664
0 references
0.9275627
0 references
0.92381614
0 references
0.92381597
0 references
0.9201908
0 references
