Journal ArticleOPEN ACCESS

Complex minimax programming under generalized convexity

Journal of Computational and Applied Mathematics (2004) 167(1) 59-71
DOI: 10.1016/j.cam.2003.09.045
13Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Mishra, S. K., Wang, S. Y., & Lai, K. K. (2004). Complex minimax programming under generalized convexity. Journal of Computational and Applied Mathematics, 167(1), 59–71. https://doi.org/10.1016/j.cam.2003.09.045

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free