Steepest Ascent for Large Scale Linear Programs
暂无分享,去创建一个
[1] H. M. Wagner. The dual simplex algorithm for bounded variables , 1958 .
[2] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[3] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[4] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.
[5] J. B. Rosen. Primal partition programming for block diagonal matrices , 1964 .
[6] A. Heesterman,et al. Special Simplex Algorithm for Linked Problems , 1965 .
[7] J. Kornai,et al. Two-Level Planning , 1965 .
[8] Egon Balas,et al. An Infeasibility-Pricing Decomposition Method for Linear Programs , 1966, Oper. Res..
[9] Leon S. Lasdon,et al. Duality and Decomposition in Mathematical Programming , 1968, IEEE Trans. Syst. Sci. Cybern..
[10] Arthur M. Geoffrion,et al. Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems , 1970, Oper. Res..
[11] C. Roger Glassey,et al. Dynamic Linear Programs for Production Scheduling , 1971, Oper. Res..