Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors

被引:27
|
作者
Suneja, S. K. [1 ]
Kohli, B. [1 ]
机构
[1] Univ Delhi, Dept Math, Delhi 110007, India
关键词
Bilevel optimization; Value function; Convexifactor; Optimality and duality; GENERALIZED CONVEXITY; OPTIMIZATION PROBLEMS; CONVEXIFICATORS; 1ST-ORDER;
D O I
10.1007/s10957-011-9819-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The paper is devoted to the applications of convexifactors to bilevel programming problem. Here we have defined a, (au)-convex, a, (au)-pseudoconvex and a, (au)-quasiconvex bifunctions in terms of convexifactors on the lines of Dutta and Chandra (Optimization 53:77-94, 2004) and Li and Zhang (J. Opt. Theory Appl. 131:429-452, 2006). We derive sufficient optimality conditions for the bilevel programming problem by using these functions, and we establish various duality results by associating the given problem with two dual problems, namely Wolfe type dual and Mond-Weir type dual.
引用
收藏
页码:1 / 19
页数:19
相关论文
共 50 条