Higher-order duality for nondifferentiable minimax programming problem with generalized convexity |
| |
| Authors: | Anurag Jayswal Ioan Stancu-Minasian |
| |
| Affiliation: | a Department of Applied Mathematics, Birla Institute of Technology, Mesra, Ranchi-835215, Jharkhand, Indiab Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 13 Septembrie Street, No.13, 050711 Bucharest, Romania |
| |
| 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. |
| |
| Keywords: | Nondifferentiable minimax programming Generalized convexity Higher-order duality |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
