A contribution to mathematical programming theory, describing a solution procedure for a class of nonconvex programs defined by constraints and objectives having convexity which is the reverse of that required for a convex problem. Theorems are pres...