Duality For NonditTerentiable Multiobjective Programming Without A Constraint Qualification
| dc.contributor.author | 劉正傳 | zh_tw |
| dc.contributor.author | J. C. Liu | en_US |
| dc.date.accessioned | 2016-04-28T02:30:50Z | |
| dc.date.available | 2016-04-28T02:30:50Z | |
| dc.date.issued | 1993-07-?? | |
| dc.description.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. | en_US |
| dc.identifier | 37D4A71B-EE38-BBE9-F412-18143DADFD03 | |
| dc.identifier.uri | http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/77689 | |
| dc.language | 英文 | |
| dc.publisher | 國立僑生大學先修班 | zh_tw |
| dc.relation | 1，395-412 | |
| dc.relation.ispartof | 國立僑生大學先修班學報 | zh_tw |
| dc.title | Duality For NonditTerentiable Multiobjective Programming Without A Constraint Qualification | zh-tw |