The Simplex Method for Quadratic Programming

Notes on Linear Programming and Extensions-Part 51

Philip S. Wolfe

ResearchPublished 1959

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

Topics

Document Details

Citation

Chicago Manual of Style

Wolfe, Philip S., The Simplex Method for Quadratic Programming: Notes on Linear Programming and Extensions-Part 51. Santa Monica, CA: RAND Corporation, 1959. https://www.rand.org/pubs/research_memoranda/RM2388.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

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.