Mixed type duality in multiobjective programming problems

Journal of Mathematical Analysis and Applications

Volumn 198, Issue 3, 1996, Pages 621-635

  Xu, Zengkun ^a  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030584596     PISSN: 0022247X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jmaa.1996.0103     Document Type: Article

References (10)

1. T. Weir and B. Mond, Generalized convexity and duality in multiple objective programming, Bull. Austral. Math. Soc. 39 (1989), 287-299.
2. T. Weir, A duality theorem for multiple objective fractional optimization problem, Bull. Austral. Math. Soc. 34 (1986), 415-425.
3. R. R. Egudo, Proper efficiency and multiobjective duality in non-linear programming, J. Inform. Optim. Sci. 8 (1987), 155-166.
4. R. R. Egudo, Efficiency and generalized convex duality for multiobjective programs, J. Math. Anal. Appl. 138 (1989), 84-94.
5. V. Preda, On efficiency and duality for multiobjective programs, J. Math. Anal. Appl. 166 (1992), 365-377.
6. M. A. Hanson and B. Mond, Further generalizations of convexity in mathematical programming, J. Inform. Optim. Sci. 3 (1982), 22-35.
7. J. P. Vial, Strong and weak convexity of sets and functions, Math. Oper. Res. 8 (1983), 231-259.
8. Y. D. Hu and F. Zhang, Two dual types of multiobjective fractional programming, Acta Math. Appl. Sinica 14 (1991), 128-135. [Chinese].
9. R. N. Mukherjee, Generalized convex duality for multiobjective fractional programs, J. Math. Anal. Appl. 162 (1991), 309-316.
10. M. Avriel, "Nonlinear Programming: Analysis and Methods," Prentice-Hall, Englewood Cliffs, NJ, 1976.