Duality for Multiobjective Bilevel Programming Problems with Extremal-Value Function  

作　　者：Haijun WANG Ruifang ZHANG 

机构地区：[1]Department of Mathematics,Taiyuan Normal University

出　　处：《Journal of Mathematical Research with Applications》2015年第3期311-320,共10页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.11171250)

摘　　要：For a multiobjective bilevel programnfing problem （P） with an extremal-value function, its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved. Under some convexity and monotonicity assumptions, the weak and strong duality assertions are obtained.For a multiobjective bilevel programnfing problem （P） with an extremal-value function, its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved. Under some convexity and monotonicity assumptions, the weak and strong duality assertions are obtained.

关 键 词：multiobjective optimization bilevel programming problems conjugate duality convex programming composed convex functions 

分 类 号：O221[理学—运筹学与控制论]