A Homework Exercise — The “Big-M” Problem
作者： R. W. H. Sargent
DOI: 10.1007/978-94-009-0369-2_16
关键词:
摘要:
springer.com
sci-hub.st 参考文章(9)
Renato Duarte Carneiro Monteiro, Ilan Adler, Interior path following primal-dual algorithms University of California, Berkeley. ,(1988)
Progress in Mathematical Programming Springer New York. ,(1989) , 10.1007/978-1-4613-9617-8
Nimrod Megiddo, Pathways to the Optimal Set in Linear Programming Progress in Mathematical Programming. pp. 131- 158 ,(1989) , 10.1007/978-1-4613-9617-8_8
Irvin J. Lustig, Roy E. Marsten, David F. Shanno, Computational experience with a primal-dual interior point method for linear programming Linear Algebra and its Applications. ,vol. 152, pp. 191- 222 ,(1991) , 10.1016/0024-3795(91)90275-2
Masakazu Kojima, Shinji Mizuno, Akiko Yoshise, A polynomial-time algorithm for a class of linear complementary problems Mathematical Programming. ,vol. 44, pp. 1- 26 ,(1989) , 10.1007/BF01587074
Renato D. C. Monteiro, Ilan Adler, Interior path following primal-dual algorithms. Part I: Linear programming Mathematical Programming. ,vol. 44, pp. 27- 41 ,(1989) , 10.1007/BF01587075
Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming Mathematical Programming. ,vol. 61, pp. 263- 280 ,(1993) , 10.1007/BF01582151
Irvin J. Lustig, Feasibility issues in a primal-dual interior-point method for linear programming Mathematical Programming. ,vol. 49, pp. 145- 162 ,(1990) , 10.1007/BF01588785
Renato D. C. Monteiro, Ilan Adler, Interior path following primal-dual algorithms. Part II: Convex quadratic programming Mathematical Programming. ,vol. 44, pp. 43- 66 ,(1989) , 10.1007/BF01587076