The Fenchel-Lagrange Dual of Generalized Convex Optimization Problem
Yiran He · Journal of Sichuan Normal University · 2008
R.I.Bot and G.Wanka studied two kinds of dualproblem in finite dimensional space,namely,an extended Fenchel type and Fenchel-Lagrange dual based on the conjugate theorem in convex optimization problem.The latter is a combination of the classical Fenchel dual and Lagrange dual,which are based on perturbation theory.Then they introduced a constraint qualification whose fulfillment is sufficient in order to guarantee strong duality.Inspired and motivated by research works above,we presents another constraint qualification to guarantee strong duality for generalized convex optimization problem.