in this paper, a unified higherorder dual is formulated for a nondifferentiable multiobjective programming problem, where every component of the objective function contains a term involving the support function of a ...
详细信息
in this paper, a unified higherorder dual is formulated for a nondifferentiable multiobjective programming problem, where every component of the objective function contains a term involving the support function of a compact convex set. Results about duality are presented under more suitable conditions. This higherorder symmetric dual formulation unifies the symmetric dual formulations in the literature. (C) 2011 Elsevier Ltd. All rights reserved.
暂无评论