Please use this identifier to cite or link to this item:
|Title:||Duality For NonditTerentiable Multiobjective Programming Without A Constraint Qualification|
J. C. Liu
|Abstract:||Necessary and sufficient conditions without constraint qualification for pareto optimality of multiobjective programming are derived. This article suggests the establishment of a Wolfe-type duality theorem for nondifferentiable, convex, multiobjective minimization problems. The vector Lagrangian and the generalized saddle point for pareto optimality are studied. Key works. Multiobjective programming, pareto optimality, cone of directions, vector Lagrangian, Pareto saddle point.|
|Appears in Collections:||國立僑生大學先修班學報|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.