A duality theorem for non-linear programming
Open Access
- 1 January 1961
- journal article
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 19 (3), 239-244
- https://doi.org/10.1090/qam/135625
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Nonlinear ProgrammingPublished by Springer Nature ,2013
- Mathematical Programming and Electrical Networks. By J. B. Dennis. Pp. 186. 36s. 1959. (Chapman and Hall, London)The Mathematical Gazette, 1961
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- A Duality Theorem for Convex ProgramsIBM Journal of Research and Development, 1960
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960
- The Simplex Method for Quadratic ProgrammingEconometrica, 1959