Cite
HARVARD Citation
Engau, A. et al. (2017). Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities. Optimization. pp. 2063-2086. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Engau, A. et al. (2017). Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities. Optimization. pp. 2063-2086. [Online].