Abstract

In this paper, zero duality gap conditions in nonconvex optimization are investigated. It is considered that dual problems can be constructed with respect to the weak conjugate functions, and/or directly by using an augmented Lagrangian formulation. Both of these approaches and the related strong duality theorems are studied and compared in this paper. By using the weak conjugate functions approach, special cases related to the optimization problems with equality and inequality constraints are studied and the zero duality gap conditions in terms of objective and constraint functions, are established. Illustrative examples are provided.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call