An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904): 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 05:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
scientific article |
Statements
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (English)
0 references
24 October 1996
0 references
interior-point
0 references
barrier function
0 references
Newton method
0 references
measures of infeasibility
0 references
nonoptimality
0 references
