An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1506.06365 / rank | |||
Normal rank | |||
Revision as of 20:25, 18 April 2024
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
