On increasing sequences of absolutely convex sets in locally convex spaces

1971 ◽  
Vol 192 (4) ◽  
pp. 257-261 ◽  
Author(s):  
M. De Wilde ◽  
C. Houet
2005 ◽  
Vol 71 (2) ◽  
pp. 183-192 ◽  
Author(s):  
Yihong Xu ◽  
Chuanxi Zhu

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.


Sign in / Sign up

Export Citation Format

Share Document