A duality theorem for non-linear programming
Philip Wolfe · Quarterly of Applied Mathematics · 1961
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.
Cited by 591 works. doi:10.1090/qam/135625 Open-access PDF
Authors
References
- Nonlinear Programming
- The Simplex Method for Quadratic Programming
- The Cutting-Plane Method for Solving Convex Programs
- The Simplex Method for Quadratic Programming
- Duality in quadratic programming
- Mathematical Programming and Electrical Networks
- A Duality Theorem for Convex Programs
- Mathematical Programming and Electrical Networks
- 4. Theory of Linear Programming