Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3102461863 / rank | |||
Normal rank | |||
Revision as of 02:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming |
scientific article |
Statements
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (English)
0 references
29 October 2018
0 references
polynomial algorithm
0 references
arc-search
0 references
infeasible interior-point method
0 references
linear programming
0 references
