IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v147y2006i1p343-36010.1007-s10479-006-0074-z.html
   My bibliography  Save this article

A discussion of scalarization techniques for multiple objective integer programming

Author

Listed:
  • Matthias Ehrgott

Abstract

In this paper we consider solution methods for multiobjective integer programming (MOIP) problems based on scalarization. We define the MOIP, discuss some common scalarizations, and provide a general formulation that encompasses most scalarizations that have been applied in the MOIP context as special cases. We show that these methods suffer some drawbacks by either only being able to find supported efficient solutions or introducing constraints that can make the computational effort to solve the scalarization prohibitive. We show that Lagrangian duality applied to the general scalarization does not remedy the situation. We also introduce a new scalarization technique, the method of elastic constraints, which is shown to be able to find all efficient solutions and overcome the computational burden of the scalarizations that use constraints on objective values. Finally, we present some results from an application in airline crew scheduling as evidence. Copyright Springer Science + Business Media, LLC 2006

Suggested Citation

  • Matthias Ehrgott, 2006. "A discussion of scalarization techniques for multiple objective integer programming," Annals of Operations Research, Springer, vol. 147(1), pages 343-360, October.
    • Handle: RePEc:spr:annopr:v:147:y:2006:i:1:p:343-360:10.1007/s10479-006-0074-z
    DOI: 10.1007/s10479-006-0074-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0074-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0074-z?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. Gardiner, Lorraine R. & Steuer, Ralph E., 1994. "Unified interactive multiple objective programming," European Journal of Operational Research, Elsevier, vol. 74(3), pages 391-406, May.
    2. Mavrotas, G. & Diakoulaki, D., 1998. "A branch and bound algorithm for mixed zero-one multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 530-541, June.
    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. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    2. J. Granat & M. Makowski, 1998. "ISAAP - Interactive Specification and Analysis of Aspiration-Based Preferences," Working Papers ir98052, International Institute for Applied Systems Analysis.
    3. P Vasant & R Nagarajan & S Yaacob, 2005. "Fuzzy linear programming with vague objective coefficients in an uncertain environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 597-603, May.
    4. Ellen De Schepper & Steven Van Passel & Sebastien Lizin & Thomas Vincent & Benjamin Martin & Xavier Gandibleux, 2016. "Economic and environmental multi-objective optimisation to evaluate the impact of Belgian policy on solar power and electric vehicles," Journal of Environmental Economics and Policy, Taylor & Francis Journals, vol. 5(1), pages 1-27, March.
    5. Jamain, Florian, 2014. "Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14002 edited by Bazgan, Cristina.
    6. Mariano Luque & Rafael Caballero & Julian Molina & Francisco Ruiz, 2007. "Equivalent Information for Multiobjective Interactive Procedures," Management Science, INFORMS, vol. 53(1), pages 125-134, January.
    7. Steuer, Ralph E. & Utz, Sebastian, 2023. "Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing," European Journal of Operational Research, Elsevier, vol. 306(2), pages 742-753.
    8. J. Granat & M. Makowski, 1995. "SAP- Modular Tool for Specification and Analysis of User Preferences in Multiple-Criteria Model Analysis," Working Papers wp95073, International Institute for Applied Systems Analysis.
    9. Sun, Minghe, 2002. "A multiple objective programming approach for determining faculty salary equity adjustments," European Journal of Operational Research, Elsevier, vol. 138(2), pages 302-319, April.
    10. Atashpaz Gargari, Masoud & Sahraeian, Rashed, 2023. "An exact criterion space search method for a bi-objective nursing home location and allocation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 166-180.
    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. 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.
    13. Juan Villegas & Fernando Palacios & Andrés Medaglia, 2006. "Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example," Annals of Operations Research, Springer, vol. 147(1), pages 109-141, October.
    14. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    15. Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
    16. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    17. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
    18. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    19. Asim Roy & Patrick Mackin & Jyrki Wallenius & James Corner & Mark Keith & Gregory Schymik & Hina Arora, 2008. "An Interactive Search Method Based on User Preferences," Decision Analysis, INFORMS, vol. 5(4), pages 203-229, December.
    20. Hongming Li & Xintao Li, 2022. "A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy," Mathematics, MDPI, vol. 10(24), pages 1-20, December.

    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:annopr:v:147:y:2006:i:1:p:343-360:10.1007/s10479-006-0074-z. 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.