Cover: A Cutting Plane Algorithm for Problems Containing Convex and Reverse Convex Constraints.

A Cutting Plane Algorithm for Problems Containing Convex and Reverse Convex Constraints.

Published 1973

by Richard Hillestad

Purchase Print Copy

 Format Price
Add to Cart Paperback15 pages $20.00

"Convexity" or "Tui" cuts are combined with the support cuts of Kelley's cutting plane algorithm to solve a large class of nonconvex programming problems. This class is defined by problems with some constraints of the "reverse convex" variety, that is, constraints which have convexity the opposite of that required for a convex problem. An example and a discussion of convergence are presented. 15 pp. Bibliog.

This report is part of the RAND paper series. The paper 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.