IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v79y2021i2d10.1007_s10898-021-00991-7.html
   My bibliography  Save this article

Nonlinear biobjective optimization: improving the upper envelope using feasible line segments

Author

Listed:
  • Ignacio Araya

    (Pontificia Universidad Católica de Valparaíso)

  • Damir Aliquintui

    (Pontificia Universidad Católica de Valparaíso)

  • Franco Ardiles

    (Pontificia Universidad Católica de Valparaíso)

  • Braulio Lobo

    (Pontificia Universidad Católica de Valparaíso)

Abstract

In this work, we propose a segment-based representation for the upper bound of the non-dominated set in interval branch & bound solvers for biobjective non linear optimization. We ensure that every point over the upper line segments is dominated by at least one point in the feasible objective region. Segments are generated by linear envelopes of the image of feasible line segments. Finally, we show that the segment-based representation together with methods for generating upper line segments allows us to converge more quickly to the desired precision of the whole strategy. The code of our solver can be found in our git repository ( https://github.com/INFPUCV/ibex-lib/tree/master/plugins/optim-mop ).

Suggested Citation

  • Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo, 2021. "Nonlinear biobjective optimization: improving the upper envelope using feasible line segments," Journal of Global Optimization, Springer, vol. 79(2), pages 503-520, February.
    • Handle: RePEc:spr:jglopt:v:79:y:2021:i:2:d:10.1007_s10898-021-00991-7
    DOI: 10.1007/s10898-021-00991-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-00991-7
    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-021-00991-7?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. 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.
    2. Alexandre Goldsztejn & Ferenc Domes & Brice Chevalier, 2014. "First order rejection tests for multiple-objective optimization," Journal of Global Optimization, Springer, vol. 58(4), pages 653-672, April.
    3. Ignacio Araya & Jose Campusano & Damir Aliquintui, 2019. "Nonlinear biobjective optimization: improvements to interval branch & bound algorithms," Journal of Global Optimization, Springer, vol. 75(1), pages 91-110, September.
    4. Ignacio Araya & Bertrand Neveu, 2018. "lsmear: a variable selection strategy for interval branch and bound solvers," Journal of Global Optimization, Springer, vol. 71(3), pages 483-500, July.
    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. Ignacio Araya & Gilles Trombettoni & Bertrand Neveu & Gilles Chabert, 2014. "Upper bounding in inner regions for global optimization under inequality constraints," Journal of Global Optimization, Springer, vol. 60(2), pages 145-164, October.
    7. Martin, Benjamin & Goldsztejn, Alexandre & Granvilliers, Laurent & Jermann, Christophe, 2017. "Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 934-948.
    8. Panos M. Pardalos & Antanas Žilinskas & Julius Žilinskas, 2017. "Non-Convex Multi-Objective Optimization," Springer Optimization and Its Applications, Springer, number 978-3-319-61007-8, September.
    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. Ignacio Araya & Jose Campusano & Damir Aliquintui, 2019. "Nonlinear biobjective optimization: improvements to interval branch & bound algorithms," Journal of Global Optimization, Springer, vol. 75(1), pages 91-110, September.
    2. Charles Audet & Frédéric Messine & Jordan Ninin, 2022. "Numerical certification of Pareto optimality for biobjective nonlinear problems," Journal of Global Optimization, Springer, vol. 83(4), pages 891-908, August.
    3. Marendet, Antoine & Goldsztejn, Alexandre & Chabert, Gilles & Jermann, Christophe, 2020. "A standard branch-and-bound approach for nonlinear semi-infinite problems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 438-452.
    4. Martin, Benjamin & Goldsztejn, Alexandre & Granvilliers, Laurent & Jermann, Christophe, 2017. "Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 934-948.
    5. Alberto Lovison & Kaisa Miettinen, 2021. "On the Extension of the DIRECT Algorithm to Multiple Objectives," Journal of Global Optimization, Springer, vol. 79(2), pages 387-412, February.
    6. 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).
    7. 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.
    8. 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.
    9. Oliver Stein & Maximilian Volk, 2023. "Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1156-1190, September.
    10. Alberto Pajares & Xavier Blasco & Juan Manuel Herrero & Miguel A. Martínez, 2021. "A Comparison of Archiving Strategies for Characterization of Nearly Optimal Solutions under Multi-Objective Optimization," Mathematics, MDPI, vol. 9(9), pages 1-28, April.
    11. Gabriele Eichfelder & Corinna Krüger & Anita Schöbel, 2017. "Decision uncertainty in multiobjective optimization," Journal of Global Optimization, Springer, vol. 69(2), pages 485-510, October.
    12. Morovati, Vahid & Pourkarimi, Latif, 2019. "Extension of Zoutendijk method for solving constrained multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 44-57.
    13. Francisco Salas-Molina & Juan A. Rodriguez-Aguilar & Pablo Díaz-García, 2018. "Selecting cash management models from a multiobjective perspective," Annals of Operations Research, Springer, vol. 261(1), pages 275-288, February.
    14. Cui, Yunfei & Geng, Zhiqiang & Zhu, Qunxiong & Han, Yongming, 2017. "Review: Multi-objective optimization methods and application in energy saving," Energy, Elsevier, vol. 125(C), pages 681-704.
    15. Mitrović, Sandra & Baesens, Bart & Lemahieu, Wilfried & De Weerdt, Jochen, 2018. "On the operational efficiency of different feature types for telco Churn prediction," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1141-1155.
    16. 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.
    17. Lourdes Uribe & Johan M Bogoya & Andrés Vargas & Adriana Lara & Günter Rudolph & Oliver Schütze, 2020. "A Set Based Newton Method for the Averaged Hausdorff Distance for Multi-Objective Reference Set Problems," Mathematics, MDPI, vol. 8(10), pages 1-29, October.
    18. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    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. Rebeca Ramirez Acosta & Chathura Wanigasekara & Emilie Frost & Tobias Brandt & Sebastian Lehnhoff & Christof Büskens, 2023. "Integration of Intelligent Neighbourhood Grids to the German Distribution Grid: A Perspective," Energies, MDPI, vol. 16(11), pages 1-16, May.

    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:79:y:2021:i:2:d:10.1007_s10898-021-00991-7. 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.