Article ID Journal Published Year Pages File Type
842945 Nonlinear Analysis: Theory, Methods & Applications 2009 8 Pages PDF
Abstract

In this paper we study a nondifferentiable minimax programming in complex spaces. We establish the Kuhn–Tucker type necessary optimality conditions, and prove the existence theorem for optimality in complex programming under generalized convexity.

Keywords
Related Topics
Physical Sciences and Engineering Engineering Engineering (General)
Preview
Optimality conditions for a nondifferentiable minimax programming in complex spaces
Authors
, ,