On super efficiency in set-valued optimisation in locally convex spaces
2005 ◽
Vol 71
(2)
◽
pp. 183-192
◽
Keyword(s):
The set-valued optimisation problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of nearly cone-subconvexlikeness, by applying the separation theorem for convex sets, Kuhn-Tucker and Lagrange necessary conditions for the set-valued optimisation problem to attain its super efficient solutions are obtained. Also, Kuhn-Tucker and Lagrange sufficient conditions are derived. Finally two kinds of unconstrained programs equivalent to set-valued optimisation problems are established.
Keyword(s):
1968 ◽
Vol 9
(2)
◽
pp. 111-118
◽
Keyword(s):
1969 ◽
Vol 27
(1)
◽
pp. 103-115
◽
2005 ◽
Vol 26
(04)
◽
pp. 611-632
◽
2020 ◽
pp. 2050027
Keyword(s):
1970 ◽
Vol 68
(1)
◽
pp. 95-97
◽
Keyword(s):