Strong duality for generalized convex optimization problems (Q948630)

Strong duality for nearly-convex optimization problems is established. Three kinds of conjugate dual problems are associated to the primal optimization problem: the Langrange dual, Fenchel dual, and Fenchel-Lagrange dual problems. The main result shows that, under suitable conditions (constraint qualifications), the optimal objective values of these four problems coincide.