Generalized Minimax Programming with Nondifferentiable (, )-Invexity

D. H. Yuan and X. L. Liu

Journal of Applied Mathematics, 2013, vol. 2013, 1-7

Abstract:

We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz ( , )-invex. Not only -sufficient but also -necessary optimality conditions are established for problem (P). With -necessary optimality conditions and ( , )-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/854125.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/854125.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:jnljam:854125

DOI: 10.1155/2013/854125

Access Statistics for this article

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