We consider the NLP optimization problem
??
and discuss the duality gap between P and
??
The convex problem D is in fact the dual of a ``relaxed'' version of P via ``randomization'' which permits to give a simple interpretation for the presence or absence of a duality gap in the general case. Several particular cases are also discussed and the case of homogeneous functions is given special attention.
