THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING

reportActive / Technical Report | Accession Number: AD0606274 | Open PDF

Abstract:

A computational procedure is given 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.

Author(s):
Wolfe, Philip
Author Organization(s):
RAND CORP SANTA MONICA CA
Supplementary Note:
Legibility of this document is in part unsatisfactory. Reproduction has been made from best available copy.
Pagination:
0038

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release, Document Partially Illegible
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited. Document Partially Illegible.

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
RAND-P-1205
Monitor Series:
XD
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*LINEAR PROGRAMMING, *NUMERICAL METHODS AND PROCEDURES, *QUADRATIC PROGRAMMING, OPERATIONS RESEARCH
Field(s)/Group(s):
Operations Research
Report Date:
1959 Apr 01