IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v319y2022i2d10.1007_s10479-021-04179-w.html
   My bibliography  Save this article

Minimax programming as a tool for studying robust multi-objective optimization problems

Author

Listed:
  • Zhe Hong

    (Yanbian University
    Pukyong National University)

  • Kwan Deok Bae

    (Pukyong National University)

  • Do Sang Kim

    (Pukyong National University)

Abstract

This paper aims to investigate optimality conditions for a weakly Pareto solution to a robust multi-objective optimization problem with locally Lipschitzian data. We do this by using a minimax programming approach, namely, by establishing the necessary optimality condition for a (local) optimal solution to a robust minimax optimization problem under a suitable constraint qualification, we then employ it to arrive in the desired target. In addition, some duality results for both robust minimax optimization problems and robust multi-objective optimization problems are also provided.

Suggested Citation

  • Zhe Hong & Kwan Deok Bae & Do Sang Kim, 2022. "Minimax programming as a tool for studying robust multi-objective optimization problems," Annals of Operations Research, Springer, vol. 319(2), pages 1589-1606, December.
  • Handle: RePEc:spr:annopr:v:319:y:2022:i:2:d:10.1007_s10479-021-04179-w
    DOI: 10.1007/s10479-021-04179-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04179-w
    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-021-04179-w?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. Thai Doan Chuong & Do Sang Kim, 2016. "A class of nonsmooth fractional multiobjective optimization problems," Annals of Operations Research, Springer, vol. 244(2), pages 367-383, September.
    2. Ehrgott, Matthias & Ide, Jonas & Schöbel, Anita, 2014. "Minmax robustness for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 239(1), pages 17-31.
    3. Thai Chuong & Do Kim, 2014. "Optimality conditions and duality in nonsmooth multiobjective optimization problems," Annals of Operations Research, Springer, vol. 217(1), pages 117-136, June.
    4. Hang-Chin Lai & Tone-Yau Huang, 2012. "Nondifferentiable minimax fractional programming in complex spaces with parametric duality," Journal of Global Optimization, Springer, vol. 53(2), pages 243-254, June.
    5. Thai Doan Chuong & Do Sang Kim, 2017. "Nondifferentiable minimax programming problems with applications," Annals of Operations Research, Springer, vol. 251(1), pages 73-87, April.
    6. Jiawei Chen & Elisabeth Köbis & Jen-Chih Yao, 2019. "Optimality Conditions and Duality for Robust Nonsmooth Multiobjective Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 411-436, May.
    7. 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.
    8. T. Son & D. Kim, 2013. "ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints," Journal of Global Optimization, Springer, vol. 57(2), pages 447-465, October.
    9. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    10. Thai Doan Chuong & Do Sang Kim, 2018. "Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications," Annals of Operations Research, Springer, vol. 267(1), pages 81-99, August.
    11. Liguo Jiao & Jae Hyoung Lee, 2021. "Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data," Annals of Operations Research, Springer, vol. 296(1), pages 803-820, January.
    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. Henan Li & Zhe Hong & Do Sang Kim, 2024. "A Minimax-Program-Based Approach for Robust Fractional Multi-Objective Optimization," Mathematics, MDPI, vol. 12(16), pages 1-14, August.
    2. Thai Doan Chuong, 2021. "Optimality and duality in nonsmooth composite vector optimization and applications," Annals of Operations Research, Springer, vol. 296(1), pages 755-777, January.
    3. Fakhar, Majid & Mahyarinia, Mohammad Reza & Zafarani, Jafar, 2018. "On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 265(1), pages 39-48.
    4. Jonas Ide & Anita Schöbel, 2016. "Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 235-271, January.
    5. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2018. "A Unified Characterization of Multiobjective Robustness via Separation," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 86-102, October.
    6. Erin K. Doolittle & Hervé L. M. Kerivin & Margaret M. Wiecek, 2018. "Robust multiobjective optimization with application to Internet routing," Annals of Operations Research, Springer, vol. 271(2), pages 487-525, December.
    7. Jiawei Chen & Suliman Al-Homidan & Qamrul Hasan Ansari & Jun Li & Yibing Lv, 2021. "Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 189(1), pages 221-243, April.
    8. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2018. "Characterizations for Optimality Conditions of General Robust Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(3), pages 835-856, June.
    9. Schmidt, M. & Schöbel, Anita & Thom, Lisa, 2019. "Min-ordering and max-ordering scalarization methods for multi-objective robust optimization," European Journal of Operational Research, Elsevier, vol. 275(2), pages 446-459.
    10. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "A Unified Approach Through Image Space Analysis to Robustness in Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 466-493, February.
    11. Yue Zhou-Kangas & Kaisa Miettinen, 2019. "Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 391-413, June.
    12. T. D. Chuong & V. H. Mak-Hau & J. Yearwood & R. Dazeley & M.-T. Nguyen & T. Cao, 2022. "Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty," Annals of Operations Research, Springer, vol. 319(2), pages 1533-1564, December.
    13. Li, Xingchen & Xu, Guangcheng & Wu, Jie & Xu, Chengzhen & Zhu, Qingyuan, 2024. "Evaluation of bank efficiency by considering the uncertainty of nonperforming loans," Omega, Elsevier, vol. 126(C).
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    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:annopr:v:319:y:2022:i:2:d:10.1007_s10479-021-04179-w. 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.