Published online by Cambridge University Press: 17 April 2009
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.