Ordinary convex programs without a duality gap

DOI10.1007/BF00932472zbMath0198.24604OpenAlexW2151395035MaRDI QIDQ2539955

R. Tyrrell Rockafellar

Publication date: 1971

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00932472

zbMATH Keywords

operations research

Related Items

Stable parametric programming^*, Primal and dual optimality criteria in convex programming, Set intersection theorems and existence of optimal solutions, Arbitrage, equilibrium, and gains from trade: A counterexample, Penalty function methods and a duality gap for invex optimization problems, Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization, Some convex programs without a duality gap, On A characterization of optimality in convex programming, Efficiency in multiple objective optimization problems, Existence theorems for general control problems of Bolza and Lagrange, Stochastic convex programming: Kuhn-Tucker conditions, On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization, Risk-aversely efficient random variables: Characterization and an application to growth under uncertainty, A dual approach to solving nonlinear programming problems by unconstrained optimization, On efficient sets in vector maximum problems - A brief survey

Cites Work

• Helly's theorem and minima of convex functions
• Convex Analysis
• Unnamed Item