论文信息 - Multiobjective symmetric duality involving cones

Multiobjective symmetric duality involving cones

Abstract In this paper, a pair of multiobjective symmetric dual programs over arbitrary cones are formulated for cone-convex functions. Weak, strong, converse and self-duality theorems are proved for these programs.

[1] Do Sang Kim,et al. Multiobjective symmetric duality with cone constraints , 1998, Eur. J. Oper. Res..

[2] Santanu K. Mishra,et al. Second order symmetric duality in mathematical programming with F-convexity , 2000, Eur. J. Oper. Res..

[3] Suresh Chandra,et al. Symmetric dual fractional programming , 1985, Z. Oper. Research.

[4] I. Husain,et al. Symmetric dual nondifferentiable programs , 1981, Bulletin of the Australian Mathematical Society.

[5] Sudarsan Nanda,et al. Pseudo-invexity and symmetric duality in nonlinear fractional programming , 1994 .

[6] Santanu K. Mishra,et al. Multiobjective second order symmetric duality with cone constraints , 2000, Eur. J. Oper. Res..

[7] G. Devi,et al. Symmetric duality for nonlinear programming problem involving η-bonvex functions , 1998 .

[8] G. Dantzig,et al. Symmetric dual nonlinear programs. , 1965 .

[9] Mokhtar S. Bazaraa,et al. On Symmetric Duality in Nonlinear Programming , 1973, Oper. Res..