Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q124828843, #quickstatements; #temporary_batch_1710970253704 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q124828843 / rank | |||
Normal rank | |||
Revision as of 22:36, 20 March 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
