Elements of a theory in non-convex programming

The question of necessary and sufficient optimality conditions for non-convex programs is analyzed in the general context of subadditivity. Several types of convex set extensions are investigated to generate valid inequalities from the corresponding gauge functions.