Skip to main content
SpringerLink
Log in

Computation of efficient compromise arcs in Convex Quadratic Multicriteria Optimization

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract.

Given a Convex Quadratic Multicriteria Optimization Problem, we show the stability of the Domination Problem. By modifying Benson’s single parametric method, which is based on the Domination Problem, we are able to show the existence of an efficient compromise arc connecting any two efficient points. Moreover, we deduce an algorithm which realizes the modification in polynomial time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arrow K.J., Barankin E.W., Blackwell D. (1953). Admissible Points of Convex Sets. In: Contributions to the Theory of Games. Princeton University Press, Princeton, New Jersey, pp. 87–91.

  2. B. Bank J. Guddat D. Klatte B. Kummer K. Tammer (1983) Nonlinear Parametric Optimization Birkhäuser Basel

    Google Scholar 

  3. H.P. Benson (1978) ArticleTitleExistence of Efficient Solutions for Vector Maximization Problems Journal of Optimization Theory and Applications 26 569–580 Occurrence Handle10.1007/BF00933152

    Article  Google Scholar 

  4. R. Caballero E. Cerdá M.M. Munõz L. Rey I.M. Stancu-Minasian (2001) ArticleTitleEfficient solution concepts and their relations in stochastic multiobjective programming Journal of Optimization Theory and Applications 110 53–74 Occurrence Handle10.1023/A:1017591412366

    Article  Google Scholar 

  5. Chankong V., Haimes Y.Y. (1983). Multiobjective Decision Making: Theory and Methodology. North Holland Series in Science and Engineering 8.

  6. F. Cole J.G. Ecker W. Gochet (1982) ArticleTitleA reduced gradient method for quadratic programs with quadratic constraints and l p -constrained l p -approximation problems European Journal of Operational Research 9 194–203 Occurrence Handle10.1016/0377-2217(82)90073-X

    Article  Google Scholar 

  7. Dantzig G.B. (1951), Maximization of a Linear Function of Variables subject to Linear Constraints. Activity Analysis.

  8. M. Ehrgott (2000) Multicriteria Optimization Springer Berlin, Heidelberg, New York

    Google Scholar 

  9. A.M. Geoffrion (1968) ArticleTitleProper Efficiency, the Theory of Vector Maximization Journal of Mathematical Analysis and Applications 22 618–630 Occurrence Handle10.1016/0022-247X(68)90201-1

    Article  Google Scholar 

  10. J. Guddat F.G. Vasquez (1987) ArticleTitleMultiobjective Optimization using pivoting and continuation methods Archiwum Automatyki i Telemechaniki 4 301–318

    Google Scholar 

  11. S.-P. Han (1986) ArticleTitleA Successive Projection Method Mathematical Programming 40 1–14 Occurrence Handle10.1007/BF01580719

    Article  Google Scholar 

  12. S. Helbig (1990) ArticleTitleAn Algorithm for Quadratic Vector Optimization Zeitschrift für Angewandte Mathematik und Mechanik 70 T751–T753

    Google Scholar 

  13. M.I. Henig (1986) ArticleTitleThe domination property in multicriteria optimization Journal of Mathematical Analysis and Applications 114 7–16 Occurrence Handle10.1016/0022-247X(86)90061-2

    Article  Google Scholar 

  14. M. Hirschberger (2003) Structure of the Efficient Set in Convex Quadratic Multicriteria Optimization. Working Paper University of Eichstätt-Ingolstadt Eichstätt

    Google Scholar 

  15. S. Karlin (1959) Mathematical Methods in Games, Programming and Economics I. Addison-Wesley Reading, Massachusetts

    Google Scholar 

  16. M.K. Kozlov S.P. Tarasov L.G. Khachiyan (1979) ArticleTitlePolynomial Solvability of Convex Quadratic Programming Soviet Mathematics—Doklady 20 1108–1111

    Google Scholar 

  17. D.T. Luc (1989) Theory of Vector Optimization Springer Berlin, Heidelberg, New York

    Google Scholar 

  18. Markowitz H. (1952), Portfolio Selection. Journal of Finance ■ 77–91.

  19. R.T. Rockafellar (1970) Convex Analysis Princeton University Press Princeton, New Jersey

    Google Scholar 

  20. M. Zeleny (1973) Compromise Programming Multiple Criteria Decision Making South Cardina

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Eichstätt-Ingolstadt, Tegernbacherstr. 38, 85276, Pfaffenhofen, Germany

    M. Hirschberger

Authors
  1. M. Hirschberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Hirschberger.

Additional information

Part of the article is taken from the author’s doctoral dissertation at the University of Eichstätt-Ingolstadt

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hirschberger, M. Computation of efficient compromise arcs in Convex Quadratic Multicriteria Optimization. J Glob Optim 31, 535–546 (2005). https://doi.org/10.1007/s10898-004-0573-x

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-004-0573-x

Keywords

Search

Navigation