A Characterization of Local Solutions Useful for Solving Reverse Convex Problems.
Expert InsightsPublished 1973
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.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1973
- Pages: 23
- Document Number: P-5066
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND paper series. The paper series was a product of RAND 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.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND 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.