Journal of Optimization Theory and Applications

, Volume 72, Issue 2, pp 213–224 | Cite as

AnO(n2) active set method for solving a certain parametric quadratic program

  • M. J. Best
  • N. Chakravarti
Contributed Papers


This paper presents anO(n2) method for solving the parametric quadratic program
$$\min (1/2)x'Dx - a'x + (\lambda /2)\left( {\sum\limits_{j = 1}^n {\gamma _j x_j } - c} \right)^2 ,$$
having lower and upper bounds on the variables, for all nonnegative values of the parameter λ. Here,D is a positive diagonal matrix,a an arbitraryn-vecotr, each γ j ,j=1, ...,n, andc are arbitrary scalars. An application to economics is also presented.

Key Words

Strong polynomiality active set methods tax programming models 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Helgason, R., Kennington, J., andLall, H.,A Polynomially Bounded Algorithm for Singly Constrained Quadratic Programs, Mathematical Programming, Vol. 18, pp. 338–343, 1980.Google Scholar
  2. 2.
    Brucker, P.,An O(n) Algorithm for Quadratic Knapsack Problems, Operations Research Letters, Vol. 3, pp. 163–166, 1984.Google Scholar
  3. 3.
    Murty, K. G.,Linear Programming, John Wiley and Sons, New York, New York, 1983.Google Scholar
  4. 4.
    Balinski, M. L.,A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, Vol. 34, pp. 125–141, 1986.Google Scholar
  5. 5.
    Hung, M. S.,A Polynomial Simplex Method for the Assignment Problem, Operations Research, Vol. 31, pp. 595–600, 1983.Google Scholar
  6. 6.
    Orlin, J. B.,Genuinely Polynomial Simplex and Non-simplex Methods for the Minimum Cost Flow Problem, Working Paper No. 1615-84, Sloan, 1984.Google Scholar
  7. 7.
    Best, M. J., andChakravarti, N.,Active Set Algorithms for Isotonic Regression; a Unifying Framework, Mathematical Programming, Vol. 47, pp. 425–439, 1990.Google Scholar
  8. 8.
    Best, M. J., andCharkravarti, N.,Active Set Algorithms for Isotonic Regression when the Underlying Graph is an Arborescence, Report CORR 88-18, University of Waterloo, Waterloo, Ontario, Canada, 1988.Google Scholar
  9. 9.
    Best, M. J.,Equivalence of Some Quadratic Programming Algorithms, Mathematical Programming, Vol. 30, pp. 71–87, 1984.Google Scholar
  10. 10.
    Best, M. J.,An Algorithm for the Solution of the Parametric Quadratic Programming Problem, Report CORR 82-24, University of Waterloo, Waterloo, Ontario, Canada, 1982.Google Scholar
  11. 11.
    Best, M. J., andCaron, R.,A Parametrized Hessian Quadratic Programming Algorithm, Annals of Operations Research, Vol. 5, pp. 373–394, 1985/6.Google Scholar
  12. 12.
    Fletcher, R.,Practical Methods for Optimization, Vol. 2, John Wiley and Sons, New York, New York, 1980.Google Scholar
  13. 13.
    Gill, P. E., Murray, W., andWright, M. H.,Practical Optimization, Academic Press, New York, New York, 1981.Google Scholar
  14. 14.
    Yitzakhi, S.,A Tax Programming Model, Journal of Public Economics, Vol. 19, pp. 107–120, 1982.Google Scholar
  15. 15.
    Best, M. J., andTan, R. Y.,On O(n 2 logn)Strong Polynomial Algorithm for Quadratic Program with Two Equations and Lower and Upper Bounds, Report CORR 90-04, University of Waterloo, Waterloo, Ontario, Canada, 1990.Google Scholar

Copyright information

© Plenum Publishing Corporation 1992

Authors and Affiliations

  • M. J. Best
    • 1
  • N. Chakravarti
    • 2
  1. 1.Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada
  2. 2.Department of Mathematical SciencesNorthern Illinois UniversityDeKalb

Personalised recommendations