Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2013, Article ID 297015, 12 pages
Research Article

Nondifferentiable Minimax Programming Problems in Complex Spaces Involving Generalized Convex Functions

Department of Applied Mathematics, Indian School of Mines, Dhanbad, Jharkhand 826 004, India

Received 17 June 2013; Accepted 7 November 2013

Academic Editor: Sheng-Jie Li

Copyright © 2013 Anurag Jayswal et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We start our discussion with a class of nondifferentiable minimax programming problems in complex space and establish sufficient optimality conditions under generalized convexity assumptions. Furthermore, we derive weak, strong, and strict converse duality theorems for the two types of dual models in order to prove that the primal and dual problems will have no duality gap under the framework of generalized convexity for complex functions.