Advanced Search
Home > Journals > Taiwanese J. Math. > Volume 8 > Issue 4 > Article
Open Access
2004 OPTIMALITY CONDITIONS FOR MINIMAX PROGRAMMING OF ANALYTIC FUNCTIONS
H. C. Lai H. C. Lai, J. C. Chen J. C. Chen
Taiwanese J. Math. 8(4): 673-686 (2004). DOI: 10.11650/twjm/1500407711

Abstract

In this paper, we investigate a minimax complex programming problem. Several sufficient Optimality conditions are established under the framework of generalized convexity for analytic functions. Employing the sufficient optimality conditions, we have proved the weak, strong and strict converse duality theorems for the complex minimax programming problem.

Citation

Download Citation

H. C. Lai H. C. Lai. J. C. Chen J. C. Chen. "OPTIMALITY CONDITIONS FOR MINIMAX PROGRAMMING OF ANALYTIC FUNCTIONS." Taiwanese J. Math. 8 (4) 673 - 686, 2004. https://doi.org/10.11650/twjm/1500407711

Information

Published: 2004
First available in Project Euclid: 18 July 2017

zbMATH: 1129.90376
MathSciNet: MR2105558
Digital Object Identifier: 10.11650/twjm/1500407711

Subjects:
Primary: 26A51‎ , 49A50 , 90C25

Keywords: $(\mathcal{F}, \rho, \theta)$-pseudo/-quasi convex , $(\mathcal{F},\rho,\theta)$-convex , complex minimax programming , Duality

Rights: Copyright © 2004 The Mathematical Society of the Republic of China

JOURNAL ARTICLE
 14 PAGES
DOWNLOAD PDF + SAVE TO MY LIBRARY
GET CITATION
< Previous Article
|
Next Article >
Vol.8 • No. 4 • 2004
Mathematical Society of the Republic of China
Subscribe to Project Euclid
Receive erratum alerts for this article
Back to Top