IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v154y2007i1p29-5010.1007-s10479-007-0186-0.html
   My bibliography  Save this article

A survey of recent developments in multiobjective optimization

Author

Listed:
  • Altannar Chinchuluun
  • Panos Pardalos

Abstract

Multiobjective Optimization (MO) has many applications in such fields as the Internet, finance, biomedicine, management science, game theory and engineering. However, solving MO problems is not an easy task. Searching for all Pareto optimal solutions is expensive and a time consuming process because there are usually exponentially large (or infinite) Pareto optimal solutions. Even for simple problems determining whether a point belongs to the Pareto set is $\mathcal{NP}$ -hard. In this paper, we discuss recent developments in MO. These include optimality conditions, applications, global optimization techniques, the new concept of epsilon Pareto optimal solution, and heuristics. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    • Handle: RePEc:spr:annopr:v:154:y:2007:i:1:p:29-50:10.1007/s10479-007-0186-0
    DOI: 10.1007/s10479-007-0186-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0186-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0186-0?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.

    References listed on IDEAS

    as
    1. Jean-Philippe Vial, 1983. "Strong and Weak Convexity of Sets and Functions," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 231-259, May.
    2. VIAL, Jean-Philippe, 1983. "Strong and weak convexity of sets and functions," LIDAM Reprints CORE 529, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Klein, Dieter & Hannan, Edward, 1982. "An algorithm for the multiple objective integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 9(4), pages 378-385, April.
    4. Moshe Eben-Chaime, 1996. "Parametric Solution for Linear Bicriteria Knapsack Models," Management Science, INFORMS, vol. 42(11), pages 1565-1575, November.
    5. Z. A. Liang & H. X. Huang & P. M. Pardalos, 2001. "Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 611-619, September.
    6. C. Singh & M.A. Hanson, 1991. "Multiobjective fractional programming duality theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 925-933, December.
    7. Chalmet, L. G. & Lemonidis, L. & Elzinga, D. J., 1986. "An algorithm for the bi-criterion integer programming problem," European Journal of Operational Research, Elsevier, vol. 25(2), pages 292-300, May.
    8. Meir J. Rosenblatt & Zilla Sinuany-Stern, 1989. "Generating the Discrete Efficient Frontier to the Capital Budgeting Problem," Operations Research, INFORMS, vol. 37(3), pages 384-394, June.
    9. Ramos, R. M. & Alonso, S. & Sicilia, J. & Gonzalez, C., 1998. "The problem of the optimal biobjective spanning tree," European Journal of Operational Research, Elsevier, vol. 111(3), pages 617-628, December.
    10. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    11. Khoury, Nabil & Martel, Jean-Marc & Veilleux, Marc, 1993. "Méthode multicritère de sélection de portefeuilles indiciels internationaux," L'Actualité Economique, Société Canadienne de Science Economique, vol. 69(1), pages 171-190, mars.
    12. Steuer, Ralph E. & Na, Paul, 2003. "Multiple criteria decision making combined with finance: A categorized bibliographic study," European Journal of Operational Research, Elsevier, vol. 150(3), pages 496-515, November.
    13. Zopounidis, C., 1999. "Multicriteria decision aid in financial management," European Journal of Operational Research, Elsevier, vol. 119(2), pages 404-415, December.
    14. Kathrin Klamroth & Margaret M. Wiecek, 2000. "Dynamic programming approaches to the multiple criteria knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 57-76, February.
    15. Brumbaugh-Smith, J. & Shier, D., 1989. "An empirical investigation of some bicriterion shortest path algorithms," European Journal of Operational Research, Elsevier, vol. 43(2), pages 216-224, November.
    16. J-F. Cloquette & Marcel Gérard & Moncef Hadhri, 1995. "An empirical analysis of Belgian daily returns using GARCH models," Brussels Economic Review, ULB -- Universite Libre de Bruxelles, vol. 148, pages 513-534.
    17. Spronk, Jaap & Hallerbach, Winfried, 1997. "Financial modelling: Where to go? With an illustration for portfolio management," European Journal of Operational Research, Elsevier, vol. 99(1), pages 113-125, May.
    18. Das, L. N. & Nanda, S., 1997. "Symmetric dual multiobjective programming," European Journal of Operational Research, Elsevier, vol. 97(1), pages 167-171, February.
    19. D. T. Luc & S. Schaible, 1997. "Efficiency and Generalized Concavity," Journal of Optimization Theory and Applications, Springer, vol. 94(1), pages 147-153, July.
    20. Zhou, Gengui & Gen, Mitsuo, 1999. "Genetic algorithm approach on multi-criteria minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 114(1), pages 141-152, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Panagiotis Xidonas & George Mavrotas & John Psarras, 2010. "Equity portfolio construction and selection using multiobjective mathematical programming," Journal of Global Optimization, Springer, vol. 47(2), pages 185-209, June.
    2. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    3. Marchioni, Andrea & Magni, Carlo Alberto, 2018. "Investment decisions and sensitivity analysis: NPV-consistency of rates of return," European Journal of Operational Research, Elsevier, vol. 268(1), pages 361-372.
    4. Xidonas, Panagiotis & Mavrotas, George & Zopounidis, Constantin & Psarras, John, 2011. "IPSSIS: An integrated multicriteria decision support system for equity portfolio construction and selection," European Journal of Operational Research, Elsevier, vol. 210(2), pages 398-409, April.
    5. Anurag Jayswal & Vivek Singh & Krishna Kummari, 2017. "Duality for nondifferentiable minimax fractional programming problem involving higher order $$(\varvec{C},\varvec{\alpha}, \varvec{\rho}, \varvec{d})$$ ( C , α , ρ , d ) -convexity," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 598-617, September.
    6. P Xidonas & G Mavrotas & J Psarras, 2010. "A multiple criteria decision-making approach for the selection of stocks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(8), pages 1273-1287, August.
    7. Nagurney, Anna & Ke, Ke, 2006. "Financial networks with intermediation: Risk management with variable weights," European Journal of Operational Research, Elsevier, vol. 172(1), pages 40-63, July.
    8. Marasovic, Branka & Babic, Zoran, 2011. "Two-step multi-criteria model for selecting optimal portfolio," International Journal of Production Economics, Elsevier, vol. 134(1), pages 58-66, November.
    9. Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    10. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    11. Panos Xidonas & Ilias Lekkos & Charis Giannakidis & Christos Staikouras, 2023. "Multicriteria security evaluation: does it cost to be traditional?," Annals of Operations Research, Springer, vol. 323(1), pages 301-330, April.
    12. Altannar Chinchuluun & Dehui Yuan & Panos Pardalos, 2007. "Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity," Annals of Operations Research, Springer, vol. 154(1), pages 133-147, October.
    13. Sune Lauth Gadegaard & Lars Relund Nielsen & Matthias Ehrgott, 2019. "Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 790-804, October.
    14. Sorger, Gerhard, 2004. "Consistent planning under quasi-geometric discounting," Journal of Economic Theory, Elsevier, vol. 118(1), pages 118-129, September.
    15. Huynh Ngai & Nguyen Huu Tron & Nguyen Vu & Michel Théra, 2022. "Variational Analysis of Paraconvex Multifunctions," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 180-218, June.
    16. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    17. T. R. Gulati & I. Ahmad & D. Agarwal, 2007. "Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 411-427, December.
    18. S. Nobakhtian, 2006. "Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (Fρ)-convexity," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 361-367, August.
    19. Huck, Nicolas, 2009. "Pairs selection and outranking: An application to the S&P 100 index," European Journal of Operational Research, Elsevier, vol. 196(2), pages 819-825, July.
    20. Serpil Say{i}n & Panos Kouvelis, 2005. "The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm," Management Science, INFORMS, vol. 51(10), pages 1572-1581, October.

    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:annopr:v:154:y:2007:i:1:p:29-50:10.1007/s10479-007-0186-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.