This paper studies necessary and sufficinet conditions and provides a duality theory for a wide class of problems arising in nonconvex optimization, such as minimizing a difference of two convex functions subject to a convex vector constraint taking values in an ordered topological vector space. These results are then used to study a problem of nondifferentiable optimization.