Abstract
We derive necessary and sufficient optimality conditions for the discrete minimax programming problem with subdifferentiable (I,ρ,θ)-convex set functions. Then we apply these optimality criteria to construct two models of parameter-free dual problems and a third model of another dual problem. We also establish weak, strong, and strictly converse duality theorems.
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 callSimilar Papers
More From: Journal of Mathematical Analysis and Applications
Disclaimer: 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.
