Conditions for zero duality gap in convex programming
نویسندگان
چکیده
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of our result and special cases as applications. We pay special attention to the polyhedral and sublinear cases, and their implications in convex optimization. 2010 Mathematics Subject Classification: Primary 49J52, 48N15; Secondary 90C25, 90C30, 90C46
منابع مشابه
Stable Zero Duality Gaps in Convex Programming: Complete Dual Characterisations with Applications to Semidefinite Programs∗
The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملSome Robust Convex Programs without a Duality Gap∗
In this paper, we examine the duality gap between the robust counterpart of a primal uncertain convex optimization problem and the optimistic counterpart of its uncertain Lagrangian dual and identify the classes of uncertain problems which do not have a duality gap. The absence of a duality gap (or equivalently zero duality gap) means that the primal worst value equals the dual best value. We f...
متن کاملProjection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. Weextend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programswith finitely many variables and infinitely many constraints. Applying projection leads to newcharacterizations of important properties for primal-dual pairs of semi-infinite programs suchas zero ...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کامل