An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:22, 1 February 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