General convex objective forms.
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback19 pages | $15.00 | $12.00 20% Web Discount |
A study concerned with the minimization of a general convex objective form subject to linear inequality restrictions. An alternative procedure is developed that has points in common with those given in P-1544 on the decomposition principle for linear programs. The general convex objective form, however, leads to an infinite algorithm and requires a special proof of convergence. The special devices used in the proof can also be applied to show convergence of the simplex algorithm for infinite programs.
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.
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.
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.