A computational procedure for finding the minimum of a quadratic function of variables subject to linear inequality constraints. The procedure is analogous to the simplex method for linear programming, being based on the Barankin-Dorfman procedure for this problem. A usable computational procedure for quadratic programming can be applied to the solution of elaborate nonlinear programming problems that economic models often present and to such problems as regression, efficient production, the "portfolio"problem, and convex programming
This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
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.