Sufficiency and duality in nonsmooth multiobjective optimization involving generalized (F, a, p, d)-Type I functions
In this paper, new classes of generalized (F, alpha, rho, d)-Type I functions are introduced for a nonsmooth multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established. Weak, strong, and strict converse duality theorems are also derived for Wolfe and Mond-Weir type multiobjective dual programs in order to relate the efficient and weak efficient solutions of primal and dual problems. (c) 2006 Elsevier Ltd. All rights reserved.
sufficiency duality nonsmooth multiobjective programming efficiency (f, alpha, p, d)-type i function