Article ID Journal Published Year Pages File Type
841062 Nonlinear Analysis: Theory, Methods & Applications 2011 10 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Engineering Engineering (General)
Authors
, ,