haku: @indexterm Multiobjective programming / yhteensä: 88
viite: 5 / 88
Tekijä:Suneja, S. K.
Aggarwal, S.
Davar, S.
Otsikko:Multiobjective symmetric duality involving cones
Lehti:European Journal of Operational Research
2002 : SEP, VOL. 141:3, p. 471-479
Asiasana:CONVEX PROGRAMMING
OPTIMIZATION
MULTIOBJECTIVE PROGRAMMING
ANALYTICAL REVIEW
Kieli:eng
Tiivistelmä:In this paper, the authors consider the pair of multiobjective symmetric dual programs over arbitrary cones is formulated for cone-convex functions. The authors also state that weak, strong, converse and self- duality theorems are proved for these programs. In conclusion the authors state that a pair of symmetric dual programs have been formulated by considering the optimization with respect to an arbitrary cone under the assumption of cone convexity. The results may be further generalized by relaxing the condition of cone-convexity to cone-pseudoconvexity. The paper provides a substantial list of reference on this subject.
SCIMA tietueen numero: 237926
lisää koriin
SCIMA