Optimality and duality in complex minimax optimization under generalized α-invexity

S. K. Mishra, J. S. Rautela, R. P. Pant

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

In the present paper we extend the classes of invex functions (Mishra, Wang and Lai [14]) to generalized α-invex and related functions in context of complex space and establish the Kuhn-Tucker type sufficient optimality conditions for complex minimax programming under aforesaid conditions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong, and strict converse duality theorems.

Original languageEnglish
Pages (from-to)357-368
Number of pages12
JournalJournal of Nonlinear and Convex Analysis
Volume11
Issue number2
Publication statusPublished - Aug 2010
Externally publishedYes

Keywords

  • Complex minimax programming
  • Duality
  • α-Invexity

ASJC Scopus subject areas

  • Analysis
  • Geometry and Topology
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Optimality and duality in complex minimax optimization under generalized α-invexity'. Together they form a unique fingerprint.

Cite this