IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v53y2001i2p233-245.html
   My bibliography  Save this article

On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization

Author

Listed:
  • Kaisa Miettinen
  • Marko M. Mäkelä

Abstract

Efficient, weakly and properly Pareto optimal solutions of multiobjective optimization problems can be characterized with the help of different cones. Here, contingent, tangent and normal cones as well as cones of feasible directions are used in the characterizations. The results are first presented in convex cases and then generalized to nonconvex cases by employing local concepts. Copyright Springer-Verlag Berlin Heidelberg 2001

Suggested Citation

  • Kaisa Miettinen & Marko M. Mäkelä, 2001. "On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(2), pages 233-245, June.
    • Handle: RePEc:spr:mathme:v:53:y:2001:i:2:p:233-245
    DOI: 10.1007/s001860000109
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000109
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000109?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. M. Mäkelä & Y. Nikulin, 2009. "On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 519-538, December.
    2. M. Zarepisheh & E. Khorram, 2011. "On the transformation of lexicographic nonlinear multiobjective programs to single objective programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 217-231, October.
    3. Augustine Esogbue & Qiang Song & Donovan Young, 2006. "Non-Euler–Lagrangian Pareto-optimality Conditions for Dynamic Multiple Criterion Decision Problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 525-542, July.
    4. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:53:y:2001:i:2:p:233-245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.