Duality for Multiobjective Bilevel Programming Problems with Extremal-Value Function
Received:March 16, 2014  Revised:March 03, 2015
Key Words: multiobjective optimization   bilevel programming problems   conjugate duality   convex programming   composed convex functions  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.11171250).
Author NameAffiliation
Haijun WANG Department of Mathematics, Taiyuan Normal University, Shanxi 030619, P. R. China 
Ruifang ZHANG Department of Mathematics, Taiyuan Normal University, Shanxi 030619, P. R. China 
Hits: 2426
Download times: 2414
Abstract:
      For a multiobjective bilevel programming 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.
Citation:
DOI:10.3770/j.issn:2095-2651.2015.03.009
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.