Treffer: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Title:
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Authors:
Source:
Numerical Algorithms. :1-36
Database:
Springer Nature Journals