On the Duality Gap in Nonconvex Optimization

Given a nonconvex constrained minimization problem, we introduce the dual problem by means of the ordinary Lagrangean function. The aim of the paper is to give, by means of the “image problem,” an estimate of the duality gap using the definition of lack of convexity of a function.