Nondifferentiable Minimax Programming Problems in Complex Spaces Involving Generalized Convex Functions. (22nd December 2013)

• Record Type: Journal Article
• Authors: Jayswal, Anurag; Prasad, Ashish Kumar; Kummari, Krishna
• Other Names: Li Sheng-Jie Academic Editor.
• Is Part Of: Journal of optimization. Volume 2013(2013)
• Publication Date: 2013-12-22
• Subjects: Mathematical optimization -- Periodicals; Structural optimization -- Periodicals; Mathematical optimization; Structural optimization; Periodicals; Electronic journals; 519.6
• DOI: 10.1155/2013/297015
• Languages: English
• ISSNs: 2356-752X

Abstract

Abstract : 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.