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

E-differentiable minimax programming under E-convexity

Author

Listed:
  • Tadeusz Antczak

    (University of Łódź)

  • Najeeb Abdulaleem

    (Hadhramout University)

Abstract

In this paper, a new class of minimax programming problems is considered in which the functions involved are E-differentiable. The so-called parametric and nonparametric necessary E-optimality conditions are derived for the considered E-differentiable minimax programming problem. Further, sufficient optimality conditions are established for such nondifferentiable extremum problems under E-convexity hypotheses. Moreover, the example of a nonsmooth minimax programming problem with E-differentiable functions is given to illustrate the aforesaid results. Furthermore, the so-called Mond-Weir E-dual problem and Wolfe E-dual problem are defined for the considered E-differentiable minimax programming problem and several E-duality theorems are established also under appropriate E-convexity hypotheses.

Suggested Citation

  • Tadeusz Antczak & Najeeb Abdulaleem, 2021. "E-differentiable minimax programming under E-convexity," Annals of Operations Research, Springer, vol. 300(1), pages 1-22, May.
    • Handle: RePEc:spr:annopr:v:300:y:2021:i:1:d:10.1007_s10479-020-03925-w
    DOI: 10.1007/s10479-020-03925-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03925-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-020-03925-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. T. Antczak, 2013. "A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 437-453, November.
    2. S. Rivaz & M. Yaghoobi, 2013. "Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients," 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. 21(3), pages 625-649, September.
    3. Deng, Xiao-Tie & Li, Zhong-Fei & Wang, Shou-Yang, 2005. "A minimax portfolio selection strategy with equilibrium," European Journal of Operational Research, Elsevier, vol. 166(1), pages 278-292, October.
    4. D. Bhatia & A. Mehra, 1999. "Optimality Conditions and Duality Involving Arcwise Connected and Generalized Arcwise Connected Functions," Journal of Optimization Theory and Applications, Springer, vol. 100(1), pages 181-194, January.
    5. Antczak, Tadeusz, 2004. "Minimax programming under (p,r)-invexity," European Journal of Operational Research, Elsevier, vol. 158(1), pages 1-19, October.
    6. Stanislav Žaković & Berc Rustem, 2003. "Semi-Infinite Programming and Applications to Minimax Problems," Annals of Operations Research, Springer, vol. 124(1), pages 81-110, November.
    7. Sonali & N. Kailey & V. Sharma, 2016. "On second order duality of minimax fractional programming with square root term involving generalized B-(p, r)-invex functions," Annals of Operations Research, Springer, vol. 244(2), pages 603-617, September.
    8. Shou-Yang Wang & Y. Yamamoto & Mei Yu, 2003. "A minimax rule for portfolio selection in frictional markets," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(1), pages 141-155, April.
    9. Stanislav Žaković & Costas Pantelides & Berc Rustem, 2000. "An Interior Point Algorithm for Computing Saddle Points of Constrained Continuous Minimax," Annals of Operations Research, Springer, vol. 99(1), pages 59-77, 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. Tadeusz Antczak & Najeeb Abdulaleem, 2023. "On the exactness and the convergence of the $$l_{1}$$ l 1 exact penalty E-function method for E-differentiable optimization problems," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1331-1359, September.

    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. P. Parpas & B. Rustem, 2009. "An Algorithm for the Global Optimization of a Class of Continuous Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 461-473, May.
    2. Huang, Xiaoxia, 2008. "Portfolio selection with a new definition of risk," European Journal of Operational Research, Elsevier, vol. 186(1), pages 351-357, April.
    3. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    4. Bhuvnesh Sharma & M. Ramkumar & Nachiappan Subramanian & Bharat Malhotra, 2019. "Dynamic temporary blood facility location-allocation during and post-disaster periods," Annals of Operations Research, Springer, vol. 283(1), pages 705-736, December.
    5. Xiaoxia Huang & Xuting Wang, 2019. "Portfolio Investment with Options Based on Uncertainty Theory," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(03), pages 929-952, May.
    6. Buckley, Winston S. & Brown, Garfield O. & Marshall, Mario, 2012. "A mispricing model of stocks under asymmetric information," European Journal of Operational Research, Elsevier, vol. 221(3), pages 584-592.
    7. S. Rivaz & M. A. Yaghoobi & M. Hladík, 2016. "Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 237-253, September.
    8. P. Kumar & A. K. Bhurjee, 2022. "Multi-objective enhanced interval optimization problem," Annals of Operations Research, Springer, vol. 311(2), pages 1035-1050, April.
    9. Wei Chen, 2009. "Weighted portfolio selection models based on possibility theory," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 115-127, June.
    10. Nikolay A. Andreev, 2015. "Worst-Case Approach To Strategic Optimal Portfolio Selection Under Transaction Costs And Trading Limits," HSE Working papers WP BRP 45/FE/2015, National Research University Higher School of Economics.
    11. Dimitris Bertsimas & Omid Nohadani & Kwong Meng Teo, 2010. "Robust Optimization for Unconstrained Simulation-Based Problems," Operations Research, INFORMS, vol. 58(1), pages 161-178, February.
    12. Kellerer, Belinda, 2019. "Portfolio Optimization and Ambiguity Aversion," Junior Management Science (JUMS), Junior Management Science e. V., vol. 4(3), pages 305-338.
    13. Cinzia Colapinto & Davide Torre & Belaid Aouni, 2019. "Goal programming for financial portfolio management: a state-of-the-art review," Operational Research, Springer, vol. 19(3), pages 717-736, September.
    14. Aouni, Belaid & Colapinto, Cinzia & La Torre, Davide, 2014. "Financial portfolio management through the goal programming model: Current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 234(2), pages 536-545.
    15. Gumsong Jo & Hyokil Kim & Hoyong Kim & Gyongho Ri, 2024. "Fuzzy Portfolio Selection Using Stochastic Correlation," Computational Economics, Springer;Society for Computational Economics, vol. 63(4), pages 1493-1509, April.
    16. Michalis Kapsos & Nicos Christofides & Berc Rustem, 2018. "Robust risk budgeting," Annals of Operations Research, Springer, vol. 266(1), pages 199-221, July.
    17. Nikolay Andreev, 2019. "Robust Portfolio Optimization in an Illiquid Market in Discrete-Time," Mathematics, MDPI, vol. 7(12), pages 1-16, November.
    18. Henriques, C.O. & Luque, M. & Marcenaro-Gutierrez, O.D. & Lopez-Agudo, L.A., 2019. "A multiobjective interval programming model to explore the trade-offs among different aspects of job satisfaction under different scenarios," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 35-46.
    19. Anurag Jayswal & Vivek Singh & Krishna Kummari, 2017. "Duality for nondifferentiable minimax fractional programming problem involving higher order $$(\varvec{C},\varvec{\alpha}, \varvec{\rho}, \varvec{d})$$ ( C , α , ρ , d ) -convexity," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 598-617, September.
    20. Akhter Mohiuddin Rather, 2012. "Portfolio selection using mean-risk model and mean-risk diversification model," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(3), pages 324-342.

    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:300:y:2021:i:1:d:10.1007_s10479-020-03925-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.