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 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. (For publication in [Management Science]; presented at Mathematical Programming Society Conference, August 1973.) 23 pp. Bibliog.
This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.