Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities (Q4598852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6819368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities |
scientific article; zbMATH DE number 6819368 |
Statements
Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities (English)
0 references
15 December 2017
0 references
linear programming
0 references
interior-point algorithms
0 references
selective addition of inequalities
0 references
0.7718626260757446
0 references
0.7694739103317261
0 references
0.7578476071357727
0 references
0.7517334222793579
0 references
