An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming |
scientific article |
Statements
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (English)
0 references
3 August 2018
0 references
polynomial algorithm
0 references
infeasible-interior-point method
0 references
linear programming
0 references
