Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Crossref DOI link: https://doi.org/10.1007/s11075-018-0469-3
Published Online: 2018-01-13
Published Print: 2018-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yang, Y. http://orcid.org/0000-0002-2943-9389
Text and Data Mining valid from 2018-01-13
Article History
Received: 10 November 2017
Accepted: 2 January 2018
First Online: 13 January 2018