Nondifferentiable Minimax Programming Problems in Complex Spaces Involving Generalized Convex Functions

Anurag Jayswal, Ashish Kumar Prasad and Krishna Kummari

Journal of Optimization, 2013, vol. 2013, 1-12

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.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/7179/2013/297015.pdf (application/pdf)
http://downloads.hindawi.com/journals/7179/2013/297015.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjopti:297015

DOI: 10.1155/2013/297015

Access Statistics for this article

More articles in Journal of Optimization from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().