论文信息 - A projective method for linear programming with box-type constraints - 字舞流文

A projective method for linear programming with box-type constraints

A specialization of the projective method for linear programming to problems with lower and upper bounds on the variables is proposed.

Giovanni Rinaldi | G. Rinaldi

[1] G. Kalchenko,et al. SOLUTION OF A NONLINEAR PROGRAMMING PROBLEM , 1968 .

[2] M. Padberg. A different convergence proof of the projective method for linear programming , 1986 .

[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[4] J. Tomlin. An experimental approach to karmarkar’s projective method for linear programming , 1987 .

[5] Michael J. Todd,et al. An extension of Karmarkar's algorithm for linear programming using dual variables , 1986, Algorithmica.