We consider a nonsmooth vector optimization continuous-time problem. We establish weak and strong duality theorems under generalized convexity assumptions.
We consider a nonsmooth vector optimization continuous-time problem. We establish weak and strong duality theorems under generalized convexity assumptions.
In this paper, vector continuous-time programming problems with inequality type of constraints are considered. All the results are obtained under convexity assumptions. The main tool employed in the derivation of the ...
详细信息
In this paper, vector continuous-time programming problems with inequality type of constraints are considered. All the results are obtained under convexity assumptions. The main tool employed in the derivation of the zero order optimality conditions is a new version of theorem of the alternative in functional spaces. To apply the alternative theorem, a certain regularity condition must be satisfied. No differentiability assumption is imposed.
A nonsmooth multiobjective continuous-time problem is introduced. We establish the necessary and sufficient optimality conditions under generalized convexity assumptions on the functions involved.
A nonsmooth multiobjective continuous-time problem is introduced. We establish the necessary and sufficient optimality conditions under generalized convexity assumptions on the functions involved.
暂无评论