Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:35, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs |
scientific article |
Statements
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (English)
0 references
6 November 1996
0 references
primal-dual infeasible-interior-point algorithm
0 references
polynomial-time computational complexity
0 references
initial points
0 references
step lengths
0 references
nonlinear monotone complementarity
0 references
