Abstract
In this paper, we are concerned with a class of nondifferentiable minimax programming problems and its two types of higher-order dual models. We establish weak, strong and strict converse duality theorems in the framework of generalized convexity in order to relate the optimal solutions of primal and dual problems. Our study improves and extends some of the known results in the literature.
Full Text
Published Version
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 call