A projective algorithm for linear programming with no regularity condition
暂无分享,去创建一个
The combined phase I-phase II projective algorithm of de Ghellinck and Vial solves any linear programming problem in its primal-dual formulation, without assuming any regularity condition. The method does not require artificial variables and/or constraints. It consists simply in minimizing the sum of all primal and dual variables. The present note is an alternative to a recent proposal of Anstreicher.
[1] Jean-Philippe Vial. A unified approach to projective algorithms for linear programming , 1988 .
[2] Jean-Philippe Vial,et al. An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex , 1987, Math. Program..
[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[4] Kurt M. Anstreicher,et al. On interior algorithms for linear programming with no regularity assumptions , 1992, Oper. Res. Lett..