IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i20p4240-d1257146.html
   My bibliography  Save this article

The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity

Author

Listed:
  • Hong Yang

    (School of Mathematics and Statistics, Yulin University, Yulin 719000, China)

  • Angang Cui

    (School of Mathematics and Statistics, Yulin University, Yulin 719000, China)

Abstract

Minimax fractional semi-infinite programming is an important research direction for semi-infinite programming, and has a wide range of applications, such as military allocation problems, economic theory, cooperative games, and other fields. Convexity theory plays a key role in many aspects of mathematical programming and is the foundation of mathematical programming research. The relevant theories of semi-infinite programming based on different types of convex functions have their own applicable scope and limitations. It is of great value to study semi-infinite programming on the basis of more generalized convex functions and obtain more general results. In this paper, we defined a new type of generalized convex function, based on the concept of the K −directional derivative, that is, uniform ( B K , ρ ) − invex, strictly uniform ( B K , ρ ) − invex, uniform ( B K , ρ ) − pseudoinvex, strictly uniform ( B K , ρ ) − pseudoinvex, uniform ( B K , ρ ) − quasiinvex and weakly uniform ( B K , ρ ) − quasiinvex function. Then, we studied a class of non-smooth minimax fractional semi-infinite programming problems involving this generalized convexity and obtained sufficient optimality conditions.

Suggested Citation

  • Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:20:p:4240-:d:1257146
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/20/4240/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/20/4240/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jean-Philippe Vial, 1983. "Strong and Weak Convexity of Sets and Functions," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 231-259, May.
    2. VIAL, Jean-Philippe, 1983. "Strong and weak convexity of sets and functions," LIDAM Reprints CORE 529, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. J. J. Rückmann & A. Shapiro, 1999. "First-Order Optimality Conditions in Generalized Semi-Infinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 101(3), pages 677-691, June.
    4. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    5. Z. A. Liang & H. X. Huang & P. M. Pardalos, 2001. "Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 611-619, September.
    6. Francisco Guerra-Vázquez & Jan-J. Rückmann & Ralf Werner, 2012. "On saddle points in nonconvex semi-infinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 433-447, November.
    7. M. H. Kim & G. M. Lee, 2001. "On Duality Theorems for Nonsmooth Lipschitz Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 669-675, September.
    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. 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.
    2. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    3. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    4. Altannar Chinchuluun & Dehui Yuan & Panos Pardalos, 2007. "Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity," Annals of Operations Research, Springer, vol. 154(1), pages 133-147, October.
    5. Sorger, Gerhard, 2004. "Consistent planning under quasi-geometric discounting," Journal of Economic Theory, Elsevier, vol. 118(1), pages 118-129, September.
    6. Huynh Ngai & Nguyen Huu Tron & Nguyen Vu & Michel Théra, 2022. "Variational Analysis of Paraconvex Multifunctions," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 180-218, June.
    7. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    8. T. R. Gulati & I. Ahmad & D. Agarwal, 2007. "Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 411-427, December.
    9. S. Nobakhtian, 2006. "Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (Fρ)-convexity," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 361-367, August.
    10. Thai Doan Chuong & José Vicente-Pérez, 2025. "Conic relaxations for conic minimax convex polynomial programs with extensions and applications," Journal of Global Optimization, Springer, vol. 91(4), pages 743-763, April.
    11. Sorger, Gerhard, 1995. "On the sensitivity of optimal growth paths," Journal of Mathematical Economics, Elsevier, vol. 24(4), pages 353-369.
    12. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.
    13. Sedi Bartz & Minh N. Dao & Hung M. Phan, 2022. "Conical averagedness and convergence analysis of fixed point algorithms," Journal of Global Optimization, Springer, vol. 82(2), pages 351-373, February.
    14. Z. Y. Wu & A. M. Rubinov, 2010. "Global Optimality Conditions for Some Classes of Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(1), pages 164-185, April.
    15. Arshpreet Kaur & Mahesh K Sharma, 2022. "Correspondence between a new class of generalized cone convexity and higher order duality," OPSEARCH, Springer;Operational Research Society of India, vol. 59(2), pages 550-560, June.
    16. Hugo Leiva & Nelson Merentes & Kazimierz Nikodem & José Sánchez, 2013. "Strongly convex set-valued maps," Journal of Global Optimization, Springer, vol. 57(3), pages 695-705, November.
    17. Venditti, Alain, 1997. "Strong Concavity Properties of Indirect Utility Functions in Multisector Optimal Growth Models," Journal of Economic Theory, Elsevier, vol. 74(2), pages 349-367, June.
    18. Venditti Alain, 2019. "Competitive equilibrium cycles for small discounting in discrete-time two-sector optimal growth models," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 23(4), pages 1-14, September.
    19. Albert Ferrer & Adil Bagirov & Gleb Beliakov, 2015. "Solving DC programs using the cutting angle method," Journal of Global Optimization, Springer, vol. 61(1), pages 71-89, January.
    20. Francisco Facchinei & Jong-Shi Pang & Gesualdo Scutari, 2014. "Non-cooperative games with minmax objectives," Computational Optimization and Applications, Springer, vol. 59(1), pages 85-112, October.

    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:gam:jmathe:v:11:y:2023:i:20:p:4240-:d:1257146. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.