The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with (<i>B<sub>K</sub>,ρ</i>)−Invexity
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 mathem...
Main Authors: | Hong Yang, Angang Cui |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/20/4240 |
Similar Items
-
Multiobjective Fractional Symmetric Duality in Mathematical Programming with (<i>C</i>,<i>G<sub>f</sub></i>)-Invexity Assumptions
by: Ramu Dubey, et al.
Published: (2019-08-01) -
Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity
by: Upadhyay B.B., et al.
Published: (2022-01-01) -
On the Consecutive <i>k</i><sub>1</sub> and <i>k</i><sub>2</sub>-out-of-<i>n</i> Reliability Systems
by: Ioannis S. Triantafyllou
Published: (2020-04-01) -
Discrete Group Actions on Digital Objects and Fixed Point Sets by <i>Iso<sub>k</sub></i>(·)-Actions
by: Sang-Eon Han
Published: (2021-02-01) -
Rapid Detection of <i>bla</i><sub>KPC-9</sub> Allele from Clinical Isolates
by: Konstantina Gartzonika, et al.
Published: (2021-04-01)