论文信息 - A duality theorem for non-linear programming

A duality theorem for non-linear programming

A dual problem is formulated for the mathematical programming problem of minimizing a convex function under convex constraints which reduces to the classical dual problem in the case of linear programming problems. Duality theorems are proved regarding the relationship between the problem and its dual.

P. Wolfe

[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] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .

[4] William S. Dorn. A Duality Theorem for Convex Programs , 1960, IBM J. Res. Dev..