Abstract
A method is proposed for finding local minima to the parametric general quadratic programming problem where all the coefficients are linear or polynomial functions of a scalar parameter. The local minimum vector and the local minimum value are determined explicitly as rational functions of the parameter. A numerical example is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Benveniste, “One way to solve the parametric quadratic programming problem”,Mathematical Programming 21 (1981) 224–228.
G. Debreu, “Definite and semidefinite quadratic forms”,Econometrica 20 (1952) 295–300.
W. Dinkelbach,Sensitivitätsanalysen und parametrische Programmierung (Springer-Verlag, Berlin, Heidelberg, New York, 1969).
F.R. Gantmacher,The theory of matrices, Vol. 1 (Chelsea Publishing Company, New York, 1959).
R.L. Graves, “A principal pivoting simplex algorithm for linear and quadratic programming”,Operations Research 15 (1967) 482–494.
J. Guddat, “Behandlung parametrischer quadratischer Optimierungsprobleme mit der Methode von Beale”,Mathematische Operationsforschung und Statistik 1 (1970) 81–86.
J. Guddat und K. Tammer, “Eine Modification der Methode von Theil und van de Panne zur Lösung einparametrischer quadratischer Optimierungsprobleme”,Mathematische Operationsforschung und Statistik 3 (1970) 199–206.
E.L. Keller, “The general quadratic optimization problem”,Mathematical Programming 5 (1973) 311–337.
H.B. Mann, “Quadratic forms with linear constraints”,American Mathematical Monthly 50 (1943) 430–433.
C. van de Panne, “Local optima of quadratic programming problems by means of the simplex method for quadratic programming”, Discussion Paper No. 7335, Center for Operations Research and Econometrics, Heverlee, Belgium (1973).
C. van de Panne,Methods for linear and quadratic programming (North-Holland, Amsterdam and Oxford, 1975).
C. van de Panne and A. Whinston, “The symmetric formulation of the simplex method for quadratic programming”,Econometrica 37 (1969) 507–527.
T.D. Parsons, “A combinatorial approach to convex quadratic programming”, Doctoral Dissertation, Princeton University, Princeton, N.J. (1966).
K. Ritter, “Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme”,Unternehmensforschung 6 (1962) 149–166. English translation:Naval Research Logistics Quarterly 14 (1967) 147–162.
K. Tammer, “Die Abhängigkeit eines quadratischen Optimierungs Problems von einem Parameter in der Zielfunktion”,Mathematische Operationsforschung und Statistik 5 (1974) 573–590.
H. Väliaho, “A procedure for one-parametric linear programming”,BIT 19 (1979) 256–269.
H. Väliaho, “On the definity of quadratic forms subject to linear constraints”,Journal of Optimization Theory and Applications 38 (1982) 143–145.
K. Wendler,Hauptaustauschschritte (Principal pivoting) (Springer-Verlag, Berlin, Heidelberg, New York, 1971).
I. Zsigmond, “Parameterization of all the coefficients of a linear programming problem”, Computing Center for Universities, Department of Operations Research, ESzK 4, Budapest (1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Väliaho, H. A unified approach to one-parametric general quadratic programming. Mathematical Programming 33, 318–338 (1985). https://doi.org/10.1007/BF01584380
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584380