A Decomposition Method for Structured Linear and Nonlinear Programs
暂无分享,去创建一个
[1] Kanti Swarup,et al. A Duality Theorem for Non-Linear Programming , 1965 .
[2] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[3] K. Ritter,et al. A DECOMPOSITION METHOD FOR LARGE STRUCTURED NONLINEAR PROGRAMS. , 1967 .
[4] K. Ritter. A DECOMPOSITION METHOD FOR LINEAR PROGRAMMING PROBLEMS WITH COUPLING CONSTRAINTS AND VARIABLES. , 1967 .
[5] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .
[6] Arthur M. Geoffrion. RELAXATION AND THE DUAL METHOD IN MATHEMATICAL PROGRAMMING , 1968 .
[7] M. D. Grigoriadis,et al. AN ALGORITHM FOR POST-OPTIMALITY ANALYSIS OF STRUCTURED LINEAR PROGRAMS. , 1967 .
[8] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[9] E. Beale,et al. The Simplex Method Using Pseudo-Basic Variables for Structured Linear Programming Problems , 1961 .
[10] J. L. Sanders. A Nonlinear Decomposition Principle , 1965 .
[11] P. Wolfe. A duality theorem for non-linear programming , 1961 .
[12] S. Vajda. Recent Advances in Mathematical Programming , 1964 .
[13] Olvi L. Mangasarian,et al. Minmax and duality in nonlinear programming , 1965 .
[14] Klaus Ritter,et al. A Decomposition Method for Structured Quadratic Programming Problems , 1967, J. Comput. Syst. Sci..
[15] J. B. Rosen. Primal partition programming for block diagonal matrices , 1964 .