Programming with a Quadratic Constraint

C. van de Panne
Additional contact information
C. van de Panne: University of Birmingham and State University of Groningen

Management Science, 1966, vol. 12, issue 11, 798-815

Abstract: A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general convex programming methods by terminating in a finite number of iterations and is actually an application of the Simplex and dual methods for quadratic programming to parametric quadratic programming problems. The method is shown to be useful for the solution of some chance-constrained programming problems. Detailed rules and a simple example of an application are given.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.11.798 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:12:y:1966:i:11:p:798-815

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().