吉林大学学报(工学版) ›› 2001, Vol. ›› Issue (1): 57-61.

Previous Articles     Next Articles

Sufficient Conditions of Multiobjective Programming for a Kind of Generalized Arcwise Convex Functions

WANG Ying-ying1, DONG Jia-li2   

  1. 1. Dept of Fundamental Sciences, Jinlin Institute of Civil Engineering, Changchun 130021, China;
    2. College of Sciences, Jilin University, Nanling Campus, Changchun 130025, China
  • Received:2000-06-18 Online:2001-01-25

Abstract: In this paper,a kind of more generalized arcwise convex functions:ρ arcwise convexity functions is defined.On the basis of definitions,sufficient conditions of multiobjective programming are proved.

Key words: multiobjective programming, sufficient condition, ρ arcwise convexity functions, efficient solution, weak efficient solution

CLC Number: 

  • O221
[1] 林锉云,董加礼.多目标优化的方法与理论[M].长春:吉林教育出版社,1992.
[2] 王英英.广义凸多目标规划的最优性条件及对偶理论[D].长春:吉林工业大学理学院,1994.
[3] Hanson M A. On sufficiency of the kuhn-tucker conditions[J].J. Math. Anal. Appl., 1981,80:545~550.
[4] Hanson M A, Mond B. Further generalizations of convexity in mathematica programming[J]. J. Inform. Optim. Sci.,1982,3:25~32.
[5] Wang Y Y. Duqlity theorems of the multiobjective programming for generalized arcwise quasiconvex and pseudoconvex functions[J]. Journal of Jilin Architectural and Civil Engineering Institute, 1996, 31(4):29~35.
[1] WANG Ying-ying, LUO Rui-ping. Duality Theorems of Multiobjective Programming for ρ-Arcwise Convex Function [J]. 吉林大学学报(工学版), 2002, (1): 57-61.
[2] LI Feng . Optimization Conditions and Duality Theory of Semiconvex Multiobjective Programming [J]. 吉林大学学报(工学版), 2000, 30(01): 57-62.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!