论文信息 - On Solving the Linear Programming Problem Approximately - 字舞流文

On Solving the Linear Programming Problem Approximately

This paper studies the complexity of some approximate solutions of linear programming problems with real coefficients.

Nimrod Megiddo | N. Megiddo

[1] David M. Gay. A variant of Karmarkar's linear programming algorithm for problems in standard form , 1988, Math. Program..

[2] Masakazu Kojima,et al. Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming , 1987, Math. Program..

[3] David M. Gay,et al. A variant of Karmarkar's linear programming algorithm for problems in standard form , 1987, Math. Program..

[4] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .

[5] László Lovász,et al. Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[6] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[7] Clóvis C. Gonzaga,et al. Polynomial affine algorithms for linear programming , 1990, Math. Program..

[8] Nimrod Megiddo,et al. Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[9] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .