IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v84y2022i1d10.1007_s10898-022-01132-4.html
   My bibliography  Save this article

Finding non dominated points for multiobjective integer convex programs with linear constraints

Author

Listed:
  • Lamia Zerfa

    (University Alger 1
    RECITS Laboratory)

  • Mohamed El-Amine Chergui

    (RECITS Laboratory)

Abstract

In this paper, we present a branch-and-bound based algorithm to generate all non dominated points for a multiobjective integer programming problem with convex objective functions and linear constraints (MOICP). The principle is to solve a single objective program (P) defined from the original MOICP program with relaxed integrality constraints. Whenever an integer solution is found through the branching process, a node is created in the search tree for each criterion. That is, by adding a cutting plane that locally approximates the criterion, as to exclude a subset of dominated points. The nodes are traversed according to the depth-first strategy and the same process is repeated for the obtained programs as (P). Finally, as to illustrate the efficiency of the suggested algorithm, we present an experimental study, where we assess its efficiency using randomly generated quadratic multiobjective integer problems with linear constraints.

Suggested Citation

  • Lamia Zerfa & Mohamed El-Amine Chergui, 2022. "Finding non dominated points for multiobjective integer convex programs with linear constraints," Journal of Global Optimization, Springer, vol. 84(1), pages 95-117, September.
    • Handle: RePEc:spr:jglopt:v:84:y:2022:i:1:d:10.1007_s10898-022-01132-4
    DOI: 10.1007/s10898-022-01132-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01132-4
    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-022-01132-4?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. Fatma Zohra Ouaïl & Mohamed El-Amine Chergui, 2018. "A branch-and-cut technique to solve multiobjective integer quadratic programming problems," Annals of Operations Research, Springer, vol. 267(1), pages 431-446, August.
    2. Ida, Masaaki, 2005. "Efficient solution generation for multiple objective linear programming based on extreme ray generation method," European Journal of Operational Research, Elsevier, vol. 160(1), pages 242-251, January.
    3. 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.
    4. Hela Masri & Saoussen Krichen & Adel Guitouni, 2012. "Generating efficient faces for multiobjective linear programming problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 15(1), pages 1-15.
    5. Matthias Ehrgott & Lizhen Shao & Anita Schöbel, 2011. "An approximation algorithm for convex multi-objective programming problems," Journal of Global Optimization, Springer, vol. 50(3), pages 397-416, July.
    6. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    7. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
    8. Matthias Ehrgott, 2005. "Multicriteria Optimization," Springer Books, Springer, edition 0, number 978-3-540-27659-3, March.
    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. Thai Doan Chuong, 2022. "Second-order cone programming relaxations for a class of multiobjective convex polynomial problems," Annals of Operations Research, Springer, vol. 311(2), pages 1017-1033, April.
    2. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    3. Stephan Helfrich & Tyler Perini & Pascal Halffmann & Natashia Boland & Stefan Ruzika, 2023. "Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 86(2), pages 417-440, June.
    4. Stephan Helfrich & Kathrin Prinz & Stefan Ruzika, 2024. "The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1187-1216, September.
    5. Kerstin Dächert & Tino Fleuren & Kathrin Klamroth, 2024. "A simple, efficient and versatile objective space algorithm for multiobjective integer programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 351-384, August.
    6. T. D. Chuong & V. H. Mak-Hau & J. Yearwood & R. Dazeley & M.-T. Nguyen & T. Cao, 2022. "Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty," Annals of Operations Research, Springer, vol. 319(2), pages 1533-1564, December.
    7. Stephan Helfrich & Arne Herzel & Stefan Ruzika & Clemens Thielen, 2024. "Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 27-63, August.
    8. Ç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.
    9. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
    10. Wu, Weitiao & Lin, Yue & Liu, Ronghui & Jin, Wenzhou, 2022. "The multi-depot electric vehicle scheduling problem with power grid characteristics," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 322-347.
    11. Podinovski, Vladislav V., 2013. "Non-dominance and potential optimality for partial preference relations," European Journal of Operational Research, Elsevier, vol. 229(2), pages 482-486.
    12. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    13. Bogdana Stanojević & Milan Stanojević & Sorin Nădăban, 2021. "Reinstatement of the Extension Principle in Approaching Mathematical Programming with Fuzzy Numbers," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    14. Stelios Rozakis & Athanasios Kampas, 2022. "An interactive multi-criteria approach to admit new members in international environmental agreements," Operational Research, Springer, vol. 22(4), pages 3461-3487, September.
    15. Chambers, Robert G., 2024. "Numeraire choice, shadow profit, and inefficiency measurement," European Journal of Operational Research, Elsevier, vol. 319(2), pages 658-668.
    16. Argyris, Nikolaos & Karsu, Özlem & Yavuz, Mirel, 2022. "Fair resource allocation: Using welfare-based dominance constraints," European Journal of Operational Research, Elsevier, vol. 297(2), pages 560-578.
    17. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
    18. Petr Iakovlevitch Ekel & Matheus Pereira Libório & Laura Cozzi Ribeiro & Mateus Alberto Dorna de Oliveira Ferreira & Joel Gomes Pereira Junior, 2024. "Multi-Criteria Decision under Uncertainty as Applied to Resource Allocation and Its Computing Implementation," Mathematics, MDPI, vol. 12(6), pages 1-20, March.
    19. Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
    20. Yeudiel Lara Moreno & Carlos Ignacio Hernández Castellanos, 2024. "A Hierarchical Approach to a Tri-Objective Portfolio Optimization Problem Considering an ESG Index," Mathematics, MDPI, vol. 12(19), pages 1-16, 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:jglopt:v:84:y:2022:i:1:d:10.1007_s10898-022-01132-4. 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.