首页 | 本学科首页   官方微博 | 高级检索  
     检索      

On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping
作者姓名:YUDA  HU
作者单位:YUDA HU(Dept. Of Applied Math.,Shanghai Jiao Tong University,Shanghai,200030)ZHIQING MENG(Dept. of Computer Science,Xiang Tan University,Hanan,411105)
摘    要:1.IntroductionTheoptimalityconditionsofmathematicalprogrammingisaveryimportantsubjectbecausetLeyprovideausefulanalyticaltoolforstudingthedualitytheoryandnonlinearprogrammingalgoirthms.Inrecelltyears,someauthorshavebeguntostudytheoptimalityconditionsforvectoroptimizationproblemofset-valuedmapping,suchas4]51.Inthispaperlwedefinetheconceptofcone--weaklyefficientsubdifferentialofset-valuedmappinginthecaseofgeneralpartiallyorderedlocallyconvextopologicalvectorspaces.Thecone-weaklysubdifferential…


On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping
YUDA HU.On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping[J].OR Transactions,1998(4).
Authors:YUDA HU
Abstract:In this paper, concepts such as cone-weakly efficient subdifferential and subgradientwith respect to set-valued mapping in a locally convex topological vector space are to beintroduced. And a number of the necessary and sufficient conditions for the cone-weaklyefficient solutions of vector optimization problem based on convex set-valued mapping arethen to be established.
Keywords:Set-valued mapping  cone-weakly efficient subgradient  cone-weakly efficient subdifferential  cone-weakly efficient solution  Fritz John condition  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号