论文信息 - ProperD-solutions of multiobjective programming problems with set functions

ProperD-solutions of multiobjective programming problems with set functions

A special class of solutions for multiobjective programming problems with set functions is considered. A subset of nondominated solutions, called properD-solution set, with respect to a given domination structure is characterized under two situations, with and without inequality constraints.

Wei-Shen Hsia | T. Y. Lee

[1] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[2] Second order optimality conditions for mathematical prograramming with set functions , 1985, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[3] P. Yu. Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives , 1974 .

[4] Robert J. T. Morris,et al. Optimal constrained selection of a measurable subset , 1979 .

[5] H. Lai,et al. Saddle point and duality in the optimization theory of convex set functions , 1982, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[6] Y. Sawaragi,et al. Duality theory in multiobjective programming , 1979 .

[7] Tan-Yu Lee,et al. Epigraphs of convex set functions , 1986 .

[8] Wei-Shen Hsia,et al. On multiple objective programming problems with set functions , 1985 .