Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949)
From MaRDI portal
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
0 references
0 references
0 references
0 references
0 references
0 references
