We characterize a class of optimization problems having convex objective function and nonconvex feasible region with the property that all local minima are global.