IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v54y2008i7p1350-1363.html
   My bibliography  Save this article

Interactive Coordination of Objective Decompositions in Multiobjective Programming

Author

Listed:
  • Alexander Engau

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Margaret M. Wiecek

    (Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634)

Abstract

To remedy challenges resulting from a high number of objectives in multiobjective programming and multicriteria decision making, this paper chooses to decompose the vector objective function and characterizes the relationships between solutions for the original problem and the collection of decomposed subproblems. In particular, it is shown how solutions that are found using this decomposition approach relate to solutions found by traditional scalarization techniques. For the selection of a final solution, two interactive coordination methods are proposed that allow to find any solution for the original problem by merely solving the smaller-sized subproblems, while integrating both preferences of the decision maker and trade-off information obtained from a sensitivity analysis. A theoretical foundation for the procedures is established, and their application is illustrated for portfolio optimization and a design selection problem.

Suggested Citation

  • Alexander Engau & Margaret M. Wiecek, 2008. "Interactive Coordination of Objective Decompositions in Multiobjective Programming," Management Science, INFORMS, vol. 54(7), pages 1350-1363, July.
    • Handle: RePEc:inm:ormnsc:v:54:y:2008:i:7:p:1350-1363
    DOI: 10.1287/mnsc.1070.0848
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1070.0848
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1070.0848?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
    ---><---

    References listed on IDEAS

    as
    1. Ehrgott, Matthias & Klamroth, Kathrin & Schwehm, Christian, 2004. "An MCDM approach to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 155(3), pages 752-770, June.
    2. Gal, Tomas & Hanne, Thomas, 2006. "Nonessential objectives within network approaches for MCDM," European Journal of Operational Research, Elsevier, vol. 168(2), pages 584-592, January.
    3. JosÉ Figueira & Salvatore Greco & Matthias Ehrogott, 2005. "Multiple Criteria Decision Analysis: State of the Art Surveys," International Series in Operations Research and Management Science, Springer, number 978-0-387-23081-8, December.
    4. S. Ruzika & M. M. Wiecek, 2005. "Approximation Methods in Multiobjective Programming," Journal of Optimization Theory and Applications, Springer, vol. 126(3), pages 473-501, September.
    5. Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, March.
    6. H. P. Benson & E. Sun, 2000. "Outcome Space Partition of the Weight Set in Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 17-36, April.
    7. T. J. Lowe & J.-F. Thisse & J. E. Ward & R. E. Wendell, 1984. "On Efficient Solutions to Multiple Objective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1346-1349, November.
    8. Gal, Tomas & Leberling, Heiner, 1977. "Redundant objective functions in linear vector maximum problems and their determination," European Journal of Operational Research, Elsevier, vol. 1(3), pages 176-184, May.
    9. Gal, Tomas & Hanne, Thomas, 1999. "Consequences of dropping nonessential objectives for the application of MCDM methods," European Journal of Operational Research, Elsevier, vol. 119(2), pages 373-378, December.
    10. James Ward, 1989. "Structure of Efficient Sets for Convex Objectives," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 249-257, May.
    11. Matthias Ehrgott & Stefan Nickel, 2002. "On the number of criteria needed to decide Pareto optimality," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 55(3), pages 329-345, June.
    12. Matthias Ehrgott & Stefan Nickel, 2002. "On the number of criteria needed to decide Pareto optimality," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(3), pages 329-345, June.
    13. Gomez, T. & Gonzalez, M. & Luque, M. & Miguel, F. & Ruiz, F., 2001. "Multiple objectives decomposition-coordination methods for hierarchical organizations," European Journal of Operational Research, Elsevier, vol. 133(2), pages 323-341, January.
    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. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    2. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    3. Sauli Ruuska & Kaisa Miettinen & Margaret M. Wiecek, 2012. "Connections Between Single-Level and Bilevel Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 60-74, April.
    4. 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.
    5. Melissa Gardenghi & Trinidad Gómez & Francisca Miguel & Margaret M. Wiecek, 2011. "Algebra of Efficient Sets for Multiobjective Complex Systems," Journal of Optimization Theory and Applications, Springer, vol. 149(2), pages 385-410, 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. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2019. "Preprocessing and cut generation techniques for multi-objective binary programming," European Journal of Operational Research, Elsevier, vol. 274(3), pages 858-875.

    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. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    2. 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.
    3. Lindroth, Peter & Patriksson, Michael & Strömberg, Ann-Brith, 2010. "Approximating the Pareto optimal set using a reduced set of objective functions," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1519-1534, December.
    4. Melissa Gardenghi & Trinidad Gómez & Francisca Miguel & Margaret M. Wiecek, 2011. "Algebra of Efficient Sets for Multiobjective Complex Systems," Journal of Optimization Theory and Applications, Springer, vol. 149(2), pages 385-410, May.
    5. Naoki Hamada & Shunsuke Ichiki, 2022. "Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 248-270, January.
    6. A. B. Malinowska & D. F. M. Torres, 2008. "Computational Approach to Essential and Nonessential Objective Functions in Linear Multicriteria Optimization," Journal of Optimization Theory and Applications, Springer, vol. 139(3), pages 577-590, December.
    7. Frank Plastria, 2020. "On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 547-564, February.
    8. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    9. Stephan Dempe & Gabriele Eichfelder & Jörg Fliege, 2015. "On the effects of combining objectives in multi-objective optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 1-18, August.
    10. Gupta, Pankaj & Mittal, Garima & Mehlawat, Mukesh Kumar, 2013. "Expected value multiobjective portfolio rebalancing model with fuzzy parameters," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 190-203.
    11. Gal, Tomas & Hanne, Thomas, 2006. "Nonessential objectives within network approaches for MCDM," European Journal of Operational Research, Elsevier, vol. 168(2), pages 584-592, January.
    12. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    13. Emmanuel Jurczenko & Bertrand Maillet & Paul Merlin, 2008. "Efficient Frontier for Robust Higher-order Moment Portfolio Selection," Post-Print halshs-00336475, HAL.
    14. Greco, Salvatore & Ishizaka, Alessio & Tasiou, Menelaos & Torrisi, Gianpiero, 2019. "Sigma-Mu efficiency analysis: A methodology for evaluating units through composite indicators," European Journal of Operational Research, Elsevier, vol. 278(3), pages 942-960.
    15. Alexander Nikiporenko, 2023. "Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation," Papers 2307.04045, arXiv.org.
    16. Benita, Francisco & López-Ramos, Francisco & Nasini, Stefano, 2019. "A bi-level programming approach for global investment strategies with financial intermediation," European Journal of Operational Research, Elsevier, vol. 274(1), pages 375-390.
    17. Andreas Löhne & Birgit Rudloff & Firdevs Ulus, 2014. "Primal and dual approximation algorithms for convex vector optimization problems," Journal of Global Optimization, Springer, vol. 60(4), pages 713-736, December.
    18. 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.
    19. Salo, Ahti & Doumpos, Michalis & Liesiö, Juuso & Zopounidis, Constantin, 2024. "Fifty years of portfolio optimization," European Journal of Operational Research, Elsevier, vol. 318(1), pages 1-18.
    20. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.

    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:inm:ormnsc:v:54:y:2008:i:7:p:1350-1363. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.