IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v70y2018i4d10.1007_s10898-017-0581-2.html
   My bibliography  Save this article

A Utility Theory Based Interactive Approach to Robustness in Linear Optimization

Author

Listed:
  • Mehdi Karimi

    (University of Waterloo)

  • Somayeh Moazeni

    (School of Business, Stevens Institute of Technology)

  • Levent Tunçel

    (University of Waterloo)

Abstract

We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms for robust optimization, based on concave and quasi-concave utility functions. In addition to practical advantages, due to the flexibility of our approach, we prove that under a theoretical framework proposed by Bertsimas and Sim (Oper Res 52:35–53, 2004), which establishes the existence of certain convex formulation of robust optimization problems, the robust optimal solutions generated by our algorithms are at least as desirable to the decision maker as any solution generated by many other robust optimization algorithms in the theoretical framework. We present some probabilistic bounds for feasibility of robust solutions and evaluate our approach by means of computational experiments.

Suggested Citation

  • Mehdi Karimi & Somayeh Moazeni & Levent Tunçel, 2018. "A Utility Theory Based Interactive Approach to Robustness in Linear Optimization," Journal of Global Optimization, Springer, vol. 70(4), pages 811-842, April.
    • Handle: RePEc:spr:jglopt:v:70:y:2018:i:4:d:10.1007_s10898-017-0581-2
    DOI: 10.1007/s10898-017-0581-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0581-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/s10898-017-0581-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. Arbel, Ami & Oren, Shmuel S., 1996. "Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm," European Journal of Operational Research, Elsevier, vol. 89(1), pages 202-211, February.
    2. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    3. Jian Hu & Sanjay Mehrotra, 2012. "Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations," Operations Research, INFORMS, vol. 60(4), pages 936-953, August.
    4. Thomas Bortfeld & Timothy C. Y. Chan & Alexei Trofimov & John N. Tsitsiklis, 2008. "Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy," Operations Research, INFORMS, vol. 56(6), pages 1461-1473, December.
    5. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    6. Ralph L. Keeney & Timothy L. McDaniels, 1992. "Value-Focused Thinking about Strategic Decisions at BC Hydro," Interfaces, INFORMS, vol. 22(6), pages 94-109, December.
    7. Murat Köksalan & Jyrki Wallenius & Stanley Zionts, 2011. "Multiple Criteria Decision Making:From Early History to the 21st Century," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 8042, January.
    8. Fengmin Wang & Dachuan Xu & Chenchen Wu, 2016. "Combinatorial approximation algorithms for the robust facility location problem with penalties," Journal of Global Optimization, Springer, vol. 64(3), pages 483-496, March.
    9. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    10. Michel Minoux, 2011. "On 2-stage robust LP with RHS uncertainty: complexity results and applications," Journal of Global Optimization, Springer, vol. 49(3), pages 521-537, March.
    11. Nesterov, Y., 1995. "Complexity estimates of some cutting plane methods based on the analytic barrier," LIDAM Reprints CORE 1167, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    13. Mustafa Sir & Marina Epelman & Stephen Pollock, 2012. "Stochastic programming for off-line adaptive radiotherapy," Annals of Operations Research, Springer, vol. 196(1), pages 767-797, July.
    14. Chan, Timothy C.Y. & Mišić, Velibor V., 2013. "Adaptive and robust radiation therapy optimization for lung cancer," European Journal of Operational Research, Elsevier, vol. 231(3), pages 745-756.
    15. 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.
    16. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    17. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    18. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    19. Da Lu & Fatma Gzara, 2015. "The robust crew pairing problem: model and solution methodology," Journal of Global Optimization, Springer, vol. 62(1), pages 29-54, May.
    20. Amadeu Coco & João Júnior & Thiago Noronha & Andréa Santos, 2014. "An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem," Journal of Global Optimization, Springer, vol. 60(2), pages 265-287, October.
    21. Dimitris Bertsimas & Omid Nohadani, 2010. "Robust optimization with simulated annealing," Journal of Global Optimization, Springer, vol. 48(2), pages 323-334, October.
    22. Kurt M. Anstreicher, 1997. "On Vaidya's Volumetric Cutting Plane Method for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 63-89, February.
    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. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. 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.
    3. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," 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. 28(1), pages 143-166, March.
    4. Hanks, Robert W. & Weir, Jeffery D. & Lunday, Brian J., 2017. "Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets," European Journal of Operational Research, Elsevier, vol. 262(2), pages 636-646.
    5. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    6. Donya Rahmani & Arash Zandi & Sara Behdad & Arezou Entezaminia, 2021. "A light robust model for aggregate production planning with consideration of environmental impacts of machines," Operational Research, Springer, vol. 21(1), pages 273-297, March.
    7. Krumke, Sven O. & Schmidt, Eva & Streicher, Manuel, 2019. "Robust multicovers with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 274(3), pages 845-857.
    8. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    9. Almaraj, Ismail I. & Trafalis, Theodore B., 2019. "An integrated multi-echelon robust closed- loop supply chain under imperfect quality production," International Journal of Production Economics, Elsevier, vol. 218(C), pages 212-227.
    10. Roya Soltani & Seyed J Sadjadi, 2014. "Reliability optimization through robust redundancy allocation models with choice of component type under fuzziness," Journal of Risk and Reliability, , vol. 228(5), pages 449-459, October.
    11. Ban Kawas & Aurelie Thiele, 2017. "Log-robust portfolio management with parameter ambiguity," Computational Management Science, Springer, vol. 14(2), pages 229-256, April.
    12. Shishebori, Davood & Yousefi Babadi, Abolghasem, 2015. "Robust and reliable medical services network design under uncertain environment and system disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 268-288.
    13. Hatami-Marbini, Adel & Arabmaldar, Aliasghar, 2021. "Robustness of Farrell cost efficiency measurement under data perturbations: Evidence from a US manufacturing application," European Journal of Operational Research, Elsevier, vol. 295(2), pages 604-620.
    14. Vahid Nazari-Ghanbarloo & Ali Ghodratnama, 2021. "Optimizing a robust tri-objective multi-period reliable supply chain network considering queuing system and operational and disruption risks," Operational Research, Springer, vol. 21(3), pages 1963-2020, September.
    15. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    16. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    17. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    18. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    19. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    20. Xuejie Bai & Yankui Liu, 2016. "Robust optimization of supply chain network design in fuzzy decision system," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1131-1149, 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:jglopt:v:70:y:2018:i:4:d:10.1007_s10898-017-0581-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.