IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v178y2018i2d10.1007_s10957-018-1289-2.html
   My bibliography  Save this article

A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems

Author

Listed:
  • Fereshteh Akbari

    (Amirkabir University of Technology)

  • Mehrdad Ghaznavi

    (Shahrood University of Technology)

  • Esmaile Khorram

    (Amirkabir University of Technology)

Abstract

The presented study deals with the scalarization techniques for solving multiobjective optimization problems. The Pascoletti–Serafini scalarization technique is considered, and it is attempted to sidestep two weaknesses of this method, namely the inflexibility of the constraints and the difficulties of checking proper efficiency. To this end, two modifications for the Pascoletti–Serafini scalarization technique are proposed. First, by including surplus variables in the constraints and penalizing the violations in the objective function, the inflexibility of the constraints is resolved. Moreover, by including slack variables in the constraints, easy-to-check statements on proper efficiency are obtained. Thereafter, the two proposed modifications are combined to obtain the revised Pascoletti–Serafini scalarization method. Theorems are provided on the relation of (weakly, properly) efficient solutions of the multiobjective optimization problem and optimal solutions of the proposed scalarized problems. All the provided results are established with no convexity assumption. Moreover, the capability of the proposed approaches is demonstrated through numerical examples.

Suggested Citation

  • Fereshteh Akbari & Mehrdad Ghaznavi & Esmaile Khorram, 2018. "A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 560-590, August.
  • Handle: RePEc:spr:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1289-2
    DOI: 10.1007/s10957-018-1289-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1289-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-018-1289-2?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. Lizhen Shao & Matthias Ehrgott, 2008. "Approximating the nondominated set of an MOLP by approximately solving its dual problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 469-492, December.
    2. Ehrgott, Matthias & Klamroth, Kathrin & Schwehm, Christian, 2004. "An MCDM approach to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 155(3), pages 752-770, June.
    3. Masoud Zarepisheh & Panos M. Pardalos, 2017. "An equivalent transformation of multi-objective optimization problems," Annals of Operations Research, Springer, vol. 249(1), pages 5-15, February.
    4. R. S. Burachik & C. Y. Kaya & M. M. Rizvi, 2014. "A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible Sets," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 428-446, August.
    5. Gabriele Eichfelder, 2009. "Scalarizations for adaptively solving multi-objective optimization problems," Computational Optimization and Applications, Springer, vol. 44(2), pages 249-273, November.
    6. Khorram, E. & Zarepisheh, M. & Ghaznavi-ghosoni, B.A., 2010. "Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1162-1168, December.
    7. Engau, Alexander & Wiecek, Margaret M., 2007. "Generating [epsilon]-efficient solutions in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1566-1579, March.
    8. Rastegar, Narges & Khorram, Esmaile, 2014. "A combined scalarizing method for multiobjective programming problems," European Journal of Operational Research, Elsevier, vol. 236(1), pages 229-237.
    9. Johannes Jahn & Andreas Kirsch & Carmen Wagner, 2004. "Optimization of rod antennas of mobile phones," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(1), pages 37-51, February.
    10. S. Schäffler & R. Schultz & K. Weinzierl, 2002. "Stochastic Method for the Solution of Unconstrained Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 114(1), pages 209-222, July.
    11. Lizhen Shao & Matthias Ehrgott, 2008. "Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 257-276, October.
    12. Kazhal Khaledian & Esmaile Khorram & Majid Soleimani-damaneh, 2016. "Strongly Proper Efficient Solutions: Efficient Solutions with Bounded Trade-Offs," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 864-883, March.
    13. Alexander Engau, 2015. "Definition and Characterization of Geoffrion Proper Efficiency for Real Vector Optimization with Infinitely Many Criteria," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 439-457, May.
    14. I. Kaliszewski & W. Michalowski, 1997. "Efficient Solutions and Bounds on Tradeoffs," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 381-394, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhao, Ruijia & Song, Yunting & Wang, Haoze & Xie, Xinlian, 2022. "Bi-objective optimisation model and its exact solution method of profit and market share of novel repair-and-support ships based on game theory," Omega, Elsevier, vol. 113(C).

    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. Rastegar, Narges & Khorram, Esmaile, 2014. "A combined scalarizing method for multiobjective programming problems," European Journal of Operational Research, Elsevier, vol. 236(1), pages 229-237.
    2. O. Schütze & C. Hernández & E-G. Talbi & J. Q. Sun & Y. Naranjani & F.-R. Xiong, 2019. "Archivers for the representation of the set of approximate solutions for MOPs," Journal of Heuristics, Springer, vol. 25(1), pages 71-105, February.
    3. Engau, Alexander, 2009. "Tradeoff-based decomposition and decision-making in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 199(3), pages 883-891, December.
    4. Andreas Löhne & Birgit Rudloff & Firdevs Ulus, 2014. "Primal and dual approximation algorithms for convex vector optimization problems," Journal of Global Optimization, Springer, vol. 60(4), pages 713-736, December.
    5. Raimundo, Marcos M. & Ferreira, Paulo A.V. & Von Zuben, Fernando J., 2020. "An extension of the non-inferior set estimation algorithm for many objectives," European Journal of Operational Research, Elsevier, vol. 284(1), pages 53-66.
    6. Matthias Ehrgott & Andreas Löhne & Lizhen Shao, 2012. "A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming," Journal of Global Optimization, Springer, vol. 52(4), pages 757-778, April.
    7. Kazhal Khaledian & Esmaile Khorram & Majid Soleimani-damaneh, 2016. "Strongly Proper Efficient Solutions: Efficient Solutions with Bounded Trade-Offs," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 864-883, March.
    8. Matthias Ehrgott & Çiğdem Güler & Horst Hamacher & Lizhen Shao, 2010. "Mathematical optimization in intensity modulated radiation therapy," Annals of Operations Research, Springer, vol. 175(1), pages 309-365, March.
    9. Brian Dandurand & Margaret M. Wiecek, 2016. "Quadratic scalarization for decomposed multiobjective optimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1071-1096, October.
    10. Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
    11. Gupta, Pankaj & Mittal, Garima & Mehlawat, Mukesh Kumar, 2013. "Expected value multiobjective portfolio rebalancing model with fuzzy parameters," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 190-203.
    12. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    13. Florian Methling & Rüdiger Nitzsch, 2019. "Thematic portfolio optimization: challenging the core satellite approach," Financial Markets and Portfolio Management, Springer;Swiss Society for Financial Market Research, vol. 33(2), pages 133-154, June.
    14. Mahdi Massahi & Masoud Mahootchi & Alireza Arshadi Khamseh, 2020. "Development of an efficient cluster-based portfolio optimization model under realistic market conditions," Empirical Economics, Springer, vol. 59(5), pages 2423-2442, November.
    15. Tong Shu & Xiaoqin Gao & Shou Chen & Shouyang Wang & Kin Keung Lai & Lu Gan, 2016. "Weighing Efficiency-Robustness in Supply Chain Disruption by Multi-Objective Firefly Algorithm," Sustainability, MDPI, vol. 8(3), pages 1-27, March.
    16. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    17. Emmanuel Jurczenko & Bertrand Maillet & Paul Merlin, 2008. "Efficient Frontier for Robust Higher-order Moment Portfolio Selection," Post-Print halshs-00336475, HAL.
    18. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    19. A. Garcia-Bernabeu & J. V. Salcedo & A. Hilario & D. Pla-Santamaria & Juan M. Herrero, 2019. "Computing the Mean-Variance-Sustainability Nondominated Surface by ev-MOGA," Complexity, Hindawi, vol. 2019, pages 1-12, December.
    20. Alexander Nikiporenko, 2023. "Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation," Papers 2307.04045, arXiv.org.

    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:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1289-2. 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.