IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v245y2016i1d10.1007_s10479-014-1545-2.html
   My bibliography  Save this article

An interactive algorithm to find the most preferred solution of multi-objective integer programs

Author

Listed:
  • Banu Lokman

    (TED University)

  • Murat Köksalan

    (Middle East Technical University)

  • Pekka J. Korhonen

    (Aalto University)

  • Jyrki Wallenius

    (Aalto University)

Abstract

In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM’s preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the most preferred solution for integer programs. We test the performance of the algorithm on multi-objective assignment, knapsack, and shortest path problems and show that it works well.

Suggested Citation

  • Banu Lokman & Murat Köksalan & Pekka J. Korhonen & Jyrki Wallenius, 2016. "An interactive algorithm to find the most preferred solution of multi-objective integer programs," Annals of Operations Research, Springer, vol. 245(1), pages 67-95, October.
    • Handle: RePEc:spr:annopr:v:245:y:2016:i:1:d:10.1007_s10479-014-1545-2
    DOI: 10.1007/s10479-014-1545-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1545-2
    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/s10479-014-1545-2?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. R. Ramesh & Mark H. Karwan & Stanley Zionts, 1989. "Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming," Management Science, INFORMS, vol. 35(9), pages 1092-1105, September.
    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. Karaivanova, Jasmina & Korhonen, Pekka & Narula, Subhash & Wallenius, Jyrki & Vassilev, Vassil, 1995. "A reference direction approach to multiple objective integer linear programming," European Journal of Operational Research, Elsevier, vol. 81(1), pages 176-187, February.
    4. Murat Koksalan, M. & Taner, Orhan V., 1992. "An approach for finding the most preferred alternative in the presence of multiple criteria," European Journal of Operational Research, Elsevier, vol. 60(1), pages 52-60, July.
    5. Srinivas Y. Prasad & Mark H. Karwan & Stanley Zionts, 1997. "Use of Convex Cones in Interactive Multiple Objective Decision Making," Management Science, INFORMS, vol. 43(5), pages 723-734, May.
    6. Alves, Maria Joao & Climaco, Joao, 2000. "An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound," European Journal of Operational Research, Elsevier, vol. 124(3), pages 478-494, August.
    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. Ramesh, R. & Zionts, Stanley & Karwan, Mark H., 1986. "A class of practical interactive branch and bound algorithms for multicriteria integer programming," European Journal of Operational Research, Elsevier, vol. 26(1), pages 161-172, July.
    9. Ralph E. Steuer & Joe Silverman & Alan W. Whisman, 1993. "A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure," Management Science, INFORMS, vol. 39(10), pages 1255-1260, October.
    10. Pekka Korhonen & Jyrki Wallenius & Stanley Zionts, 1984. "Solving the Discrete Multiple Criteria Problem using Convex Cones," Management Science, INFORMS, vol. 30(11), pages 1336-1345, November.
    11. Stanley Zionts & Jyrki Wallenius, 1983. "An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions," Management Science, INFORMS, vol. 29(5), pages 519-529, May.
    12. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    13. Stanley Zionts & Jyrki Wallenius, 1976. "An Interactive Programming Method for Solving the Multiple Criteria Problem," Management Science, INFORMS, vol. 22(6), pages 652-663, February.
    14. 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.
    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. Anderson Kenji Hirose & Cassius Tadeu Scarpin & José Eduardo Pécora Junior, 2020. "Goal programming approach for political districting in Santa Catarina State: Brazil," Annals of Operations Research, Springer, vol. 287(1), pages 209-232, April.
    2. Bashir Bashir & Özlem Karsu, 2022. "Solution approaches for equitable multiobjective integer programming problems," Annals of Operations Research, Springer, vol. 311(2), pages 967-995, April.
    3. Selin Özpeynirci & Özgür Özpeynirci & Vincent Mousseau, 2021. "An interactive algorithm for resource allocation with balance concerns," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 983-1005, December.
    4. 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.
    5. Karakaya, G. & Köksalan, M. & Ahipaşaoğlu, S.D., 2018. "Interactive algorithms for a broad underlying family of preference functions," European Journal of Operational Research, Elsevier, vol. 265(1), pages 248-262.
    6. Özlem Karsu & Hale Erkan, 2020. "Balance in resource allocation problems: a changing reference approach," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 297-326, March.
    7. Karakaya, G. & Köksalan, M., 2023. "Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 308(1), pages 215-228.
    8. Karakaya, G. & Köksalan, M., 2021. "Evaluating solutions and solution sets under multiple objectives," European Journal of Operational Research, Elsevier, vol. 294(1), pages 16-28.
    9. Nasim Nasrabadi & Akram Dehnokhalaji & Pekka Korhonen & Jyrki Wallenius, 2019. "Using convex preference cones in multiple criteria decision making and related fields," Journal of Business Economics, Springer, vol. 89(6), pages 699-717, August.

    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. 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.
    2. Nasim Nasrabadi & Akram Dehnokhalaji & Pekka Korhonen & Jyrki Wallenius, 2019. "Using convex preference cones in multiple criteria decision making and related fields," Journal of Business Economics, Springer, vol. 89(6), pages 699-717, August.
    3. R. Ramesh & Mark H. Karwan & Stanley Zionts, 1989. "Interactive multicriteria linear programming: An extension of the method of Zionts and Wallenius," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(3), pages 321-335, June.
    4. Nikolaos Argyris & Alec Morton & José Rui Figueira, 2014. "CUT: A Multicriteria Approach for Concavifiable Preferences," Operations Research, INFORMS, vol. 62(3), pages 633-642, June.
    5. M Köksalan & E Karasakal, 2006. "An interactive approach for multiobjective decision making," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 532-540, May.
    6. Engau, Alexander, 2009. "Tradeoff-based decomposition and decision-making in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 199(3), pages 883-891, December.
    7. Pekka Korhonen & Majid Soleimani-damaneh & Jyrki Wallenius, 2017. "The use of quasi-concave value functions in MCDM: some theoretical results," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 367-375, October.
    8. Demirtas, Ezgi Aktar & Üstün, Özden, 2008. "An integrated multiobjective decision making process for supplier selection and order allocation," Omega, Elsevier, vol. 36(1), pages 76-90, February.
    9. P. Korhonen & J. Karaivanova, 1998. "An Algorithm for Projecting a Reference Direction onto the Nondominated Set of Given Points," Working Papers ir98011, International Institute for Applied Systems Analysis.
    10. Alves, Maria Joao & Climaco, Joao, 2000. "An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound," European Journal of Operational Research, Elsevier, vol. 124(3), pages 478-494, August.
    11. Ted Ralphs & Matthew Saltzman & Margaret Wiecek, 2006. "An improved algorithm for solving biobjective integer programs," Annals of Operations Research, Springer, vol. 147(1), pages 43-70, October.
    12. Bashir Bashir & Özlem Karsu, 2022. "Solution approaches for equitable multiobjective integer programming problems," Annals of Operations Research, Springer, vol. 311(2), pages 967-995, April.
    13. Soleimani-damaneh, Majid & Pourkarimi, Latif & Korhonen, Pekka J. & Wallenius, Jyrki, 2021. "An operational test for the existence of a consistent increasing quasi-concave value function," European Journal of Operational Research, Elsevier, vol. 289(1), pages 232-239.
    14. Sun, Minghe, 2005. "Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures," European Journal of Operational Research, Elsevier, vol. 162(2), pages 468-483, April.
    15. Sun, Minghe & Steuer, Ralph E., 1996. "InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 462-472, March.
    16. Kallio, Markku & Halme, Merja, 2013. "Cone contraction and reference point methods for multi-criteria mixed integer optimization," European Journal of Operational Research, Elsevier, vol. 229(3), pages 645-653.
    17. Zhang, Cai Wen & Ong, Hoon Liong, 2004. "Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic," European Journal of Operational Research, Elsevier, vol. 159(3), pages 545-557, December.
    18. 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.
    19. Thomas L. Saaty, 2013. "The Modern Science of Multicriteria Decision Making and Its Practical Applications: The AHP/ANP Approach," Operations Research, INFORMS, vol. 61(5), pages 1101-1118, October.
    20. Nowak, Maciej, 2007. "Aspiration level approach in stochastic MCDM problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1626-1640, March.

    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:245:y:2016:i:1:d:10.1007_s10479-014-1545-2. 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.