On Sensitivity Analysis in Convex Quadratic Programming Problems

J. C. G. Boot
Additional contact information
J. C. G. Boot: Econometric Institute, Rotterdam, Holland

Operations Research, 1963, vol. 11, issue 5, 771-786

Abstract: The present paper consists of three clearly distinct sections. In the first section we discuss the problem of how the solution vector of a quadratic programming problem changes in case of infinitesimal changes in the data of the problem. In the second section we apply these results to a numerical example that arose in a practical application of programming. In the third section we ask for the changes in the solution vector when some parameter (s) of the problem change (s) persistently rather than infinitesimally. This leads to a class of algorithms to solve quadratic programming problems of which the Houthakker capacity method and the Markowitz portfolio procedure are members.

Date: 1963
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.11.5.771 (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:oropre:v:11:y:1963:i:5:p:771-786

Access Statistics for this article

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