Abstract
We revisit optimization theory involving set functions which are defined on a family of measurable subsets in a measure space. In this paper, we focus on a minimax fractional programming problem with subdifferentiable set functions. Using nonparametric necessary optimality conditions, we introduce generalized $(\mathcal{F},\rho, \theta)$-convexity to establish several sufficient optimality conditions for a minimax programming problem, and construct a new dual model to unify the Wolfe type dual and the Mond-Weir type dual as special cases of this dual programming problem. Finally we establish a weak, strong, and strict converse duality theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
