A Characterization of Local Solutions Useful for Solving Reverse Convex Programs,
RAND CORP SANTA MONICA CALIF
Pagination or Media Count:
This paper describes 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 presented to show that only a finite number of local solutions must be considered in searching for the global minimum. It is also shown that a global solution can be obtained by solving a finite number of convex subproblems under certain broad conditions.
- Operations Research