IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v72y2018i3d10.1007_s10898-018-0642-1.html
   My bibliography  Save this article

On upper approximations of Pareto fronts

Author

Listed:
  • I. Kaliszewski

    (Polish Academy of Sciences
    Warsaw School of Information Technology)

  • J. Miroforidis

    (Polish Academy of Sciences)

Abstract

In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside of the feasible objective set, called, respectively, lower shell and upper shell. We worked there under the assumption that for a given problem an upper shell exists. As it is not always the case, in this paper we give some sufficient conditions for the existence of upper shells. We also investigate how to constructively search infeasible sets to derive upper shells. We approach this issue by means of problem relaxations. We formally show that under certain conditions some subsets of lower shells to relaxed multiobjective optimization problems are upper shells in the respective unrelaxed problems. Results are illustrated by a numerical example representing a small but real mechanical problem. Practical implications of the results are discussed.

Suggested Citation

  • I. Kaliszewski & J. Miroforidis, 2018. "On upper approximations of Pareto fronts," Journal of Global Optimization, Springer, vol. 72(3), pages 475-490, November.
    • Handle: RePEc:spr:jglopt:v:72:y:2018:i:3:d:10.1007_s10898-018-0642-1
    DOI: 10.1007/s10898-018-0642-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0642-1
    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/s10898-018-0642-1?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. Ignacy Kaliszewski, 2006. "Soft Computing For Complex Multiple Criteria Decision Making," International Series in Operations Research and Management Science, Springer, number 978-0-387-30177-8, September.
    2. Kathrin Klamroth & Jørgen Tind & Margaret M. Wiecek, 2003. "Unbiased approximation in multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(3), pages 413-437, January.
    3. Markus Hartikainen & Kaisa Miettinen & Margaret M. Wiecek, 2011. "Decision Making on Pareto Front Approximations with Inherent Nondominance," Lecture Notes in Economics and Mathematical Systems, in: Yong Shi & Shouyang Wang & Gang Kou & Jyrki Wallenius (ed.), New State of MCDM in the 21st Century, chapter 0, pages 35-45, Springer.
    4. Kaliszewski, Ignacy & Miroforidis, Janusz & Podkopaev, Dmitry, 2012. "Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy," European Journal of Operational Research, Elsevier, vol. 216(1), pages 188-199.
    5. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2012. "PAINT: Pareto front interpolation for nonlinear multiobjective optimization," Computational Optimization and Applications, Springer, vol. 52(3), pages 845-867, July.
    6. I. Kaliszewski & J. Miroforidis, 2014. "Two-Sided Pareto Front Approximations," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 845-855, September.
    7. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    8. S. Ruzika & M. M. Wiecek, 2005. "Approximation Methods in Multiobjective Programming," Journal of Optimization Theory and Applications, Springer, vol. 126(3), pages 473-501, September.
    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. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    2. I. Kaliszewski & J. Miroforidis, 2021. "Cooperative multiobjective optimization with bounds on objective functions," Journal of Global Optimization, Springer, vol. 79(2), pages 369-385, February.
    3. Lakmali Weerasena, 2022. "Advancing local search approximations for multiobjective combinatorial optimization problems," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 589-612, April.
    4. I. Kaliszewski & J. Miroforidis, 2022. "Probing the Pareto front of a large-scale multiobjective problem with a MIP solver," Operational Research, Springer, vol. 22(5), pages 5617-5673, November.

    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. I. Kaliszewski & J. Miroforidis, 2021. "Cooperative multiobjective optimization with bounds on objective functions," Journal of Global Optimization, Springer, vol. 79(2), pages 369-385, February.
    2. I. Kaliszewski & J. Miroforidis, 2022. "Probing the Pareto front of a large-scale multiobjective problem with a MIP solver," Operational Research, Springer, vol. 22(5), pages 5617-5673, November.
    3. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    4. Markus Hartikainen & Alberto Lovison, 2015. "PAINT–SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization," Journal of Global Optimization, Springer, vol. 62(2), pages 243-261, June.
    5. Hartikainen, Markus & Miettinen, Kaisa & Klamroth, Kathrin, 2019. "Interactive Nonconvex Pareto Navigator for multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 275(1), pages 238-251.
    6. Kalyan Shankar Bhattacharjee & Hemant Kumar Singh & Tapabrata Ray, 2017. "An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making," Journal of Global Optimization, Springer, vol. 68(1), pages 71-93, May.
    7. Gabriele Eichfelder & Leo Warnow, 2022. "An approximation algorithm for multi-objective optimization problems using a box-coverage," Journal of Global Optimization, Springer, vol. 83(2), pages 329-357, June.
    8. Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann, 2016. "On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach," Journal of Global Optimization, Springer, vol. 64(1), pages 3-16, January.
    9. Nguyen, Trung H. & Granger, Julien & Pandya, Deval & Paustian, Keith, 2019. "High-resolution multi-objective optimization of feedstock landscape design for hybrid first and second generation biorefineries," Applied Energy, Elsevier, vol. 238(C), pages 1484-1496.
    10. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2011. "Constructing a Pareto front approximation for decision making," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 209-234, April.
    11. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    12. Yadav, Deepanshu & Nagar, Deepak & Ramu, Palaniappan & Deb, Kalyanmoy, 2023. "Visualization-aided multi-criteria decision-making using interpretable self-organizing maps," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1183-1200.
    13. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2012. "PAINT: Pareto front interpolation for nonlinear multiobjective optimization," Computational Optimization and Applications, Springer, vol. 52(3), pages 845-867, July.
    14. Eichfelder, Gabriele & Warnow, Leo, 2023. "Advancements in the computation of enclosures for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 310(1), pages 315-327.
    15. Rasmus Bokrantz & Anders Forsgren, 2013. "An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 377-393, May.
    16. Çağın Ararat & Firdevs Ulus & Muhammad Umer, 2022. "A Norm Minimization-Based Convex Vector Optimization Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 681-712, August.
    17. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    18. Saeed Vasebi & Yeganeh M. Hayeri, 2021. "Collective Driving to Mitigate Climate Change: Collective-Adaptive Cruise Control," Sustainability, MDPI, vol. 13(16), pages 1-30, August.
    19. Malavasi, Matteo & Ortobelli Lozza, Sergio & Trück, Stefan, 2021. "Second order of stochastic dominance efficiency vs mean variance efficiency," European Journal of Operational Research, Elsevier, vol. 290(3), pages 1192-1206.
    20. 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.

    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:jglopt:v:72:y:2018:i:3:d:10.1007_s10898-018-0642-1. 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.