Complex minimax programming under generalized convexity

S. K. Mishra; S. Y. Wang; K. K. Lai

doi:10.1016/j.cam.2003.09.045

Complex minimax programming under generalized convexity

S. K. Mishra
, S. Y. Wang
, K. K. Lai

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

13 Citations (Scopus)

Abstract

We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. © 2003 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	59-71
Journal	Journal of Computational and Applied Mathematics
Volume	167
Issue number	1
DOIs	https://doi.org/10.1016/j.cam.2003.09.045
Publication status	Published - 1 May 2004

Research Keywords

Duality theorem
Generalized invex function
Minimax programming

Access Output

10.1016/j.cam.2003.09.045Licence: Elsevier user license

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{5b899ec33ffd4f35bbce281363b9a682,

title = "Complex minimax programming under generalized convexity",

abstract = "We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. {\textcopyright} 2003 Elsevier B.V. All rights reserved.",

keywords = "Duality theorem, Generalized invex function, Minimax programming",

author = "Mishra, \{S. K.\} and Wang, \{S. Y.\} and Lai, \{K. K.\}",

year = "2004",

month = may,

day = "1",

doi = "10.1016/j.cam.2003.09.045",

language = "English",

volume = "167",

pages = "59--71",

journal = "Journal of Computational and Applied Mathematics",

issn = "0377-0427",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Complex minimax programming under generalized convexity

AU - Mishra, S. K.

AU - Wang, S. Y.

AU - Lai, K. K.

PY - 2004/5/1

Y1 - 2004/5/1

N2 - We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. © 2003 Elsevier B.V. All rights reserved.

AB - We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. © 2003 Elsevier B.V. All rights reserved.

KW - Duality theorem

KW - Generalized invex function

KW - Minimax programming

UR - https://www.scopus.com/pages/publications/2342429139

UR - https://www.scopus.com/pages/publications/2342429139#tab=impact

U2 - 10.1016/j.cam.2003.09.045

DO - 10.1016/j.cam.2003.09.045

M3 - RGC 21 - Publication in refereed journal

SN - 0377-0427

VL - 167

SP - 59

EP - 71

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

IS - 1

ER -

Complex minimax programming under generalized convexity

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this