IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v189y2021i1d10.1007_s10957-021-01829-8.html
   My bibliography  Save this article

Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data

Author

Listed:
  • Jiawei Chen

    (Southwest University)

  • Suliman Al-Homidan

    (King Fahd University of Petroleum and Minerals)

  • Qamrul Hasan Ansari

    (King Fahd University of Petroleum and Minerals
    Aligarh Muslim University)

  • Jun Li

    (Southwest University)

  • Yibing Lv

    (Yangtze University)

Abstract

In this paper, we study robust necessary optimality conditions for a nondifferentiable complex fractional programming with uncertain data. A robust counterpart of uncertain complex fractional programming is introduced in the worst-case scenario. The concept of robust optimal solution of the uncertain complex fractional programming is introduced by using robust counterpart. We give an equivalence between the optimal solutions of the robust counterpart and a minimax nonfractional parametric programming. Finally, Fritz John-type and Karush–Kuhn–Tucker-type robust necessary optimality conditions of the uncertain complex fractional programming are established under some suitable conditions.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:189:y:2021:i:1:d:10.1007_s10957-021-01829-8
    DOI: 10.1007/s10957-021-01829-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01829-8
    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/s10957-021-01829-8?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. H. C. Lai & J. C. Liu & S. Schaible, 2008. "Complex Minimax Fractional Programming of Analytic Functions," Journal of Optimization Theory and Applications, Springer, vol. 137(1), pages 171-184, April.
    2. V. Jeyakumar & G. Y. Li, 2011. "Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 292-303, November.
    3. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    4. 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.
    5. 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.
    6. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    7. Bram L. Gorissen, 2015. "Robust Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 508-528, August.
    8. Jiawei Chen & Jun Li & Xiaobing Li & Yibing Lv & Jen-Chih Yao, 2020. "Radius of Robust Feasibility of System of Convex Inequalities with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 384-399, February.
    9. Xiangkai Sun & Kok Lay Teo & Liping Tang, 2019. "Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 984-1000, September.
    10. Chenchen Wu & Dachuan Xu & Donglei Du & Wenqing Xu, 2016. "An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1017-1035, November.
    11. J. C. Chen & H. C. Lai & S. Schaible, 2005. "Complex Fractional Programming and the Charnes-Cooper Transformation," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 203-213, July.
    12. Werner Dinkelbach, 1967. "On Nonlinear Fractional Programming," Management Science, INFORMS, vol. 13(7), pages 492-498, March.
    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. Jie Wang & Shengjie Li & Min Feng, 2022. "Unified Robust Necessary Optimality Conditions for Nonconvex Nonsmooth Uncertain Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 226-248, October.

    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. 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.
    2. 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.
    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. Roberto Gomes de Mattos & Fabricio Oliveira & Adriana Leiras & Abdon Baptista de Paula Filho & Paulo Gonçalves, 2019. "Robust optimization of the insecticide-treated bed nets procurement and distribution planning under uncertainty for malaria prevention and control," Annals of Operations Research, Springer, vol. 283(1), pages 1045-1078, December.
    5. 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.
    6. 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.
    7. 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.
    8. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2009. "Robust Optimization for Empty Repositioning Problems," Operations Research, INFORMS, vol. 57(2), pages 468-483, April.
    9. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    10. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    11. Xiangkai Sun & Kok Lay Teo & Xian-Jun Long, 2021. "Some Characterizations of Approximate Solutions for Robust Semi-infinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 281-310, October.
    12. Pätzold, Julius & Schöbel, Anita, 2020. "Approximate cutting plane approaches for exact solutions to robust optimization problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 20-30.
    13. Jia Shu & Miao Song, 2014. "Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 135-149, February.
    14. 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.
    15. 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.
    16. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:joptap:v:189:y:2021:i:1:d:10.1007_s10957-021-01829-8. 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.