Abstract. In this paper, we prove a necessary optimality theorem for a nonsmooth optimization problem in the face of data uncertainty, which is called a robust optimization problem. Recently, the robust optimization problems have been intensively studied by many authors. Moreover, we give examples showing that the convexity of the uncertain sets and the concavity of the constraint functions are essential in the optimality theorem. We present an example illustrating that our main assumptions in the optimality theorem can be weakened.
In this paper, we consider the vector quasivariational inequalities and the vector quasivariational-like inequalities for multifunctions with vector values and prove some existence theorems of solutions for our inequalities. Also, we give the relationship between a kind of the vector variational inequality for multifunctions and a vector optimization problem involving nondifferentiable Lipschitz functions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.