IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v195y2009i1p98-103.html
   My bibliography  Save this article

An algorithm for optimizing a linear function over an integer efficient set

Author

Listed:
  • Jorge, Jesús M.

Abstract

Optimizing a linear function over the efficient set of a multiobjective integer linear programming (MOILP) problem is a topic of unquestionable practical as well as mathematical interest within the field of multiple criteria decision making. As known, those problems are particularly difficult to deal with due to the discrete nature of the efficient set, which is not explicitly known, nor a suitable implicit description is available. In this work an exact algorithm is presented to optimize a linear function over the efficient set of a MOILP. The approach here proposed defines a sequence of progressively more constrained single-objective integer problems that successively eliminates undesirable points from further consideration. The algorithm has been coded in C Sharp, using CPLEX solver, and computational experiments have been undertaken in order to analyze performance properties of the algorithm over different problem instances randomly generated.

Suggested Citation

  • Jorge, Jesús M., 2009. "An algorithm for optimizing a linear function over an integer efficient set," European Journal of Operational Research, Elsevier, vol. 195(1), pages 98-103, May.
    • Handle: RePEc:eee:ejores:v:195:y:2009:i:1:p:98-103
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00179-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Abbas, Moncef & Chaabane, Djamal, 2006. "Optimizing a linear function over an integer efficient set," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1140-1161, October.
    2. Odile Marcotte & Richard M. Soland, 1986. "An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization," Management Science, INFORMS, vol. 32(1), pages 61-75, January.
    3. Jesús Jorge, 2005. "A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem," Journal of Global Optimization, Springer, vol. 31(1), pages 1-16, January.
    4. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    5. Alves, Maria Joao & Climaco, Joao, 2007. "A review of interactive methods for multiobjective integer and mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 99-115, July.
    6. 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.
    7. Sylva, John & Crema, Alejandro, 2004. "A method for finding the set of non-dominated vectors for multiple objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 158(1), pages 46-55, October.
    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. Zerdani, Ouiza & Moulai, Mustapha, 2011. "Optimization over an integer efficient set of a Multiple Objective Linear Fractional Problem," MPRA Paper 35579, University Library of Munich, Germany.
    2. Melih Ozlen & Benjamin A. Burton & Cameron A. G. MacRae, 2014. "Multi-Objective Integer Programming: An Improved Recursive Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 470-482, February.
    3. Sierra-Altamiranda, Alvaro & Charkhgard, Hadi & Eaton, Mitchell & Martin, Julien & Yurek, Simeon & Udell, Bradley J., 2020. "Spatial conservation planning under uncertainty using modern portfolio theory and Nash bargaining solution," Ecological Modelling, Elsevier, vol. 423(C).
    4. Murat Köksalan & Banu Lokman, 2015. "Finding nadir points in multi-objective integer programs," Journal of Global Optimization, Springer, vol. 62(1), pages 55-77, May.
    5. Alvaro Sierra Altamiranda & Hadi Charkhgard, 2019. "A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 823-840, October.
    6. Hadjer Belkhiri & Mohamed El-Amine Chergui & Fatma Zohra Ouaïl, 2022. "Optimizing a linear function over an efficient set," Operational Research, Springer, vol. 22(4), pages 3183-3201, September.
    7. 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.
    8. Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
    9. 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.
    10. Jornada, Daniel & Leon, V. Jorge, 2016. "Biobjective robust optimization over the efficient set for Pareto set reduction," European Journal of Operational Research, Elsevier, vol. 252(2), pages 573-586.
    11. Blanco, Víctor, 2011. "A mathematical programming approach to the computation of the omega invariant of a numerical semigroup," European Journal of Operational Research, Elsevier, vol. 215(3), pages 539-550, December.
    12. Melih Ozlen & Meral Azizoğlu & Benjamin Burton, 2013. "Optimising a nonlinear utility function in multi-objective integer programming," Journal of Global Optimization, Springer, vol. 56(1), pages 93-102, May.
    13. Vahid Mahmoodian & Iman Dayarian & Payman Ghasemi Saghand & Yu Zhang & Hadi Charkhgard, 2022. "A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1453-1470, May.
    14. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "A new method for optimizing a linear function over the efficient set of a multiobjective integer program," European Journal of Operational Research, Elsevier, vol. 260(3), pages 904-919.
    15. Gokhan Kirlik & Serpil Sayın, 2015. "Computing the nadir point for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 62(1), pages 79-99, May.
    16. Esmaeili, Somayeh & Bashiri, Mahdi & Amiri, Amirhossein, 2023. "An exact criterion space search algorithm for a bi-objective blood collection problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 210-232.
    17. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.

    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. S. Razavyan, 2016. "A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-23, August.
    2. Zhang, Weihua & Reimann, Marc, 2014. "A simple augmented ∊-constraint method for multi-objective mathematical integer programming problems," European Journal of Operational Research, Elsevier, vol. 234(1), pages 15-24.
    3. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    4. 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.
    5. Dinçer Konur & Hadi Farhangi & Cihan H. Dagli, 2016. "A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 967-1006, October.
    6. Weihua Zhang & Marc Reimann, 2014. "Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 591-622, December.
    7. Alves, Maria Joao & Climaco, Joao, 2007. "A review of interactive methods for multiobjective integer and mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 99-115, July.
    8. Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, November.
    9. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    10. Lacour, Renaud, 2014. "Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14806 edited by Vanderpooten, Daniel.
    11. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    12. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "A new method for optimizing a linear function over the efficient set of a multiobjective integer program," European Journal of Operational Research, Elsevier, vol. 260(3), pages 904-919.
    13. 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.
    14. Rong, Aiying & Figueira, José Rui, 2013. "A reduction dynamic programming algorithm for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 299-313.
    15. Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
    16. Banu Lokman & Murat Köksalan, 2013. "Finding all nondominated points of multi-objective integer programs," Journal of Global Optimization, Springer, vol. 57(2), pages 347-365, October.
    17. Tolga Bektaş, 2018. "Disjunctive Programming for Multiobjective Discrete Optimisation," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 625-633, November.
    18. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    19. Rong, Aiying & Figueira, José Rui, 2014. "Dynamic programming algorithms for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 236(1), pages 85-99.
    20. Nikolaos Argyris & José Figueira & Alec Morton, 2011. "Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem," Journal of Global Optimization, Springer, vol. 49(2), pages 213-235, February.

    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:eee:ejores:v:195:y:2009:i:1:p:98-103. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.