In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:4119 / 4127
页数:9
相关论文
共 20 条
[1]
[Anonymous], 2003, Linear programming 2: theory and extensions
机构:
Sichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R ChinaSichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R China
Li, Jun
;
Xu, Jiuping
论文数: 0引用数: 0
h-index: 0
机构:
Sichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R ChinaSichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R China
机构:
Sichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R ChinaSichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R China
Li, Jun
;
Xu, Jiuping
论文数: 0引用数: 0
h-index: 0
机构:
Sichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R ChinaSichuan Univ, Sch Business & Adm, Uncertainty Decis Making Lab, Chengdu 610064, Peoples R China