ISSN:
1573-2878
Keywords:
D-convex set functions
;
D-extreme points
;
vector-valued Lagrangian functions
;
primal maps
;
dual maps
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Using the concept of vector-valued Lagrangian functions, we characterize a special class of solutions,D-solutions, of a multiobjective programming problem with set functions in which the domination structure is described by a closed convex coneD. Properties of two perturbation functions, primal map and dual map, are also studied. Results lead to a general duality theorem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00938538
Permalink