An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
暂无分享,去创建一个
[1] Michael J. Todd,et al. On Anstreicher's combined phase I—phase II projective algorithm for linear programming , 1992, Math. Program..
[2] A. Charnes,et al. Management Models and Industrial Applications of Linear Programming , 1961 .
[3] Clyde L. Monma,et al. An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[5] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..
[6] Yinyu Ye. Comparative analysis of affine scaling algorithms based on simplifying assumptions , 1991, Math. Program..
[7] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[8] Nimrod Megiddo,et al. Homotopy Continuation Methods for Nonlinear Complementarity Problems , 1991, Math. Oper. Res..
[9] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[10] Kurt M. Anstreicher,et al. A combined phase I-phase II projective algorithm for linear programming , 1989, Math. Program..
[11] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[12] Nimrod Megiddo,et al. An interior point potential reduction algorithm for the linear complementarity problem , 1992, Math. Program..