| 4 | An Exact l(1) Penalty Approach for Interval-Valued Programming Problem显示文摘The objective of this paper is to propose an exact l1 penalty method for constrained interval-valued programming problems which transform the constrained problem into an unconstrained interval-valued penalized optimization problem.Under some suitable conditions,we establish the equivalence between an optimal solution of interval-valued primal and penalized optimization problem.Moreover,saddle-point type optimality conditions are also established in order to find the relation between an optimal solution of penalized optimization problem and saddle-point of Lagrangian function.Numerical examples are given to illustrate the derived results. | Anurag Jayswal Jonaki Banerjee | 2016 | Journal of the Operations Research Society of China2016，4，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员