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

Lexicographic α-robustness: An alternative to min–max criteria

Author

Listed:
  • Kalaı¨, Rim
  • Lamboray, Claude
  • Vanderpooten, Daniel

Abstract

Robustness in Operations Research/Decision Aid is often associated with min–max and min–max regret criteria. This common approach to determine robust solutions consists in finding a solution which minimizes the maximal cost or regret. Nevertheless, these criteria are known to be too conservative. In this paper, we present and study a new robustness approach, called lexicographic α-robustness, which compensates for this major drawback and many others. Furthermore, we establish a link between lexicographic α-robustness and a third robustness approach called p-robustness.

Suggested Citation

  • Kalaı¨, Rim & Lamboray, Claude & Vanderpooten, Daniel, 2012. "Lexicographic α-robustness: An alternative to min–max criteria," European Journal of Operational Research, Elsevier, vol. 220(3), pages 722-728.
    • Handle: RePEc:eee:ejores:v:220:y:2012:i:3:p:722-728
    DOI: 10.1016/j.ejor.2012.01.056
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171200094X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.01.056?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    2. Rim Kalai-Jemai & M.A Aloulou & P.H Vallin & D. Vanderpooten, 2010. "Lexicographic α-robustness : an application to the 1-median problem," Post-Print hal-00565530, HAL.
    3. Bisdorff, Raymond & Pirlot, Marc & Roubens, Marc, 2006. "Choices and kernels in bipolar valued digraphs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 155-170, November.
    4. Dubois, Didier & Fortemps, Philippe, 1999. "Computing improved optimal solutions to max-min flexible constraint satisfaction problems," European Journal of Operational Research, Elsevier, vol. 118(1), pages 95-126, October.
    5. B. Roy & Ph. Vincke, 1984. "Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results," Management Science, INFORMS, vol. 30(11), pages 1323-1335, November.
    6. V Gabrel & C Murat, 2010. "Robustness and duality in linear programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(8), pages 1288-1296, August.
    7. Hassene Aissi & Bernard Roy, 2010. "Robustness in Multi-criteria Decision Aiding," International Series in Operations Research & Management Science, in: Matthias Ehrgott & José Rui Figueira & Salvatore Greco (ed.), Trends in Multiple Criteria Decision Analysis, chapter 0, pages 87-121, Springer.
    8. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2007. "Approximation of min-max and min-max regret versions of some combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 179(2), pages 281-290, June.
    9. Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
    10. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    11. Blanquero, R. & Carrizosa, E. & Hendrix, E.M.T., 2011. "Locating a competitive facility in the plane with a robustness criterion," European Journal of Operational Research, Elsevier, vol. 215(1), pages 21-24, November.
    12. Roy, Bernard, 2010. "Robustness in operational research and decision aiding: A multi-faceted issue," European Journal of Operational Research, Elsevier, vol. 200(3), pages 629-638, February.
    13. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    14. Dubois, D. & Fortemps, Ph., 2005. "Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints," European Journal of Operational Research, Elsevier, vol. 160(3), pages 582-598, February.
    15. Kouvelis, Panagiotis & Kurawarwala, Abbas A. & Gutierrez, Genaro J., 1992. "Algorithms for robust single and multiple period layout planning for manufacturing systems," European Journal of Operational Research, Elsevier, vol. 63(2), pages 287-303, December.
    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. Michał Ćwik & Jerzy Józefczyk, 2018. "Heuristic algorithms for the minmax regret flow-shop problem with interval processing times," 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. 26(1), pages 215-238, March.
    2. Sandra Cruz Caçador & Pedro Manuel Cortesão Godinho & Joana Maria Pina Cabral Matos Dias, 2022. "A minimax regret portfolio model based on the investor’s utility loss," Operational Research, Springer, vol. 22(1), pages 449-484, March.
    3. Sandra Caçador & Joana Matos Dias & Pedro Godinho, 2020. "Global minimum variance portfolios under uncertainty: a robust optimization approach," Journal of Global Optimization, Springer, vol. 76(2), pages 267-293, February.
    4. Durbach, Ian N., 2014. "Outranking under uncertainty using scenarios," European Journal of Operational Research, Elsevier, vol. 232(1), pages 98-108.

    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. Roy, Bernard, 2010. "Robustness in operational research and decision aiding: A multi-faceted issue," European Journal of Operational Research, Elsevier, vol. 200(3), pages 629-638, February.
    2. Häntsch, Marius & Huchzermeier, Arnd, 2016. "Transparency of risk for global and complex network decisions in the automotive industry," International Journal of Production Economics, Elsevier, vol. 175(C), pages 81-95.
    3. Jabbarzadeh, Armin & Fahimnia, Behnam & Sheu, Jiuh-Biing, 2017. "An enhanced robustness approach for managing supply and demand uncertainties," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 620-631.
    4. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    5. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    6. Michał Ćwik & Jerzy Józefczyk, 2018. "Heuristic algorithms for the minmax regret flow-shop problem with interval processing times," 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. 26(1), pages 215-238, March.
    7. Schönlein, Michael & Makuschewitz, Thomas & Wirth, Fabian & Scholz-Reiter, Bernd, 2013. "Measurement and optimization of robust stability of multiclass queueing networks: Applications in dynamic supply chains," European Journal of Operational Research, Elsevier, vol. 229(1), pages 179-189.
    8. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    9. Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
    10. De Rosa, Vincenzo & Gebhard, Marina & Hartmann, Evi & Wollenweber, Jens, 2013. "Robust sustainable bi-directional logistics network design under uncertainty," International Journal of Production Economics, Elsevier, vol. 145(1), pages 184-198.
    11. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    12. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    13. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    14. Dan A. Iancu & Nikolaos Trichakis, 2014. "Pareto Efficiency in Robust Optimization," Management Science, INFORMS, vol. 60(1), pages 130-147, January.
    15. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
    16. Fabrice Talla Nobibon & Roel Leus, 2014. "Complexity Results and Exact Algorithms for Robust Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 533-552, May.
    17. Arabmaldar, Aliasghar & Sahoo, Biresh K. & Ghiyasi, Mojtaba, 2023. "A generalized robust data envelopment analysis model based on directional distance function," European Journal of Operational Research, Elsevier, vol. 311(2), pages 617-632.
    18. Nikos Tsotsolas & Spiros Alexopoulos, 2019. "Towards a holistic strategic framework for applying robust facilitated approaches in political decision making," Operational Research, Springer, vol. 19(2), pages 501-541, June.
    19. Selim Mankai & Khaled Guesmi, 2014. "Robust Portfolio Protection: A Scenarios-Based Approach," Working Papers hal-04141326, HAL.
    20. David Kik & Matthias G. Wichmann & Thomas S. Spengler, 2023. "Small- or Medium-Sized Enterprise Uses Operations Research to Select and Develop its Headquarters Location," Interfaces, INFORMS, vol. 53(4), pages 312-331, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:220:y:2012:i:3:p:722-728. 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.