论文信息 - Maximizing a Function in a Convex Region - 字舞流文

Maximizing a Function in a Convex Region

G. Zoutendijk | G. Zoutendijk

[1] P. Wolfe. THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .

[2] Jack B. Dennis,et al. Mathematical Programming and Electrical Networks , 1959, The Mathematical Gazette.

[3] A. Charnes,et al. Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming , 1957 .

[4] George B. Dantzig,et al. 7* A Primal-Dual Algorithm for Linear Programs , 1957 .

[5] Abraham Charnes,et al. Minimization of non-linear separable convex functionals† , 1954 .

[6] G. Dantzig. UPPER BOUNDS, SECONDARY CONSTRAINTS, AND BLOCK TRIANGULARITY IN LINEAR PROGRAMMING , 1955 .

[7] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .

[8] C. E. Lemke,et al. Computational Theory of Linear Programming. 1. The Bounded Variables Problem , 1954 .

[9] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[10] H. Markowitz. The optimization of a quadratic function subject to linear constraints , 1956 .

[11] C. E. Lemke,et al. The dual method of solving the linear programming problem , 1954 .

[12] G. Dantzig,et al. Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[13] Clifford Hildreth,et al. A quadratic programming procedure , 1957 .

[14] H. M. Wagner. The dual simplex algorithm for bounded variables , 1958 .