Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02206809 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053624310 / rank | |||
Normal rank | |||
Latest revision as of 09:01, 30 July 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
