A duality theorem for non-linear programming
Quarterly of Applied MathematicsPublished 1 October 1961Open access
Philip Wolfe
Citations585
SJR quartileQ2
SJR score0.64
SNIP0.75
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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
Social SciencesMathematicsEngineering
IBM Journal of Research and DevelopmentA Duality Theorem for Convex Programs
60 Citations1960William S. Dorn
A proof is given for a duality theorem for a class of convex programs, i.e., constrained minimization of conveX functions, which is based on the inequality of the following type: For α ≥ 1, β ≥ 1 using LaSalle's inequality.