非光滑多目标广义本性凸规划的最优性条件与对偶

东北数学(英文版)(2008)

Cited 1|Views2
No score
Abstract
In this paper, we introduce generalized essentially pseudoconvex func-tion and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.We set up Mond-Weir type duality and Craven type duality for nonsmooth multiobjective programming with generalized essentially convex functions, and prove them.
More
Translated text
Key words
saddle point,multiobjective programming,duality,optimality condition
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined