Nonsmooth Interval-Valued Optimization and Saddle-Point Optimality Criteria

被引:22
|
作者
Jayswal, Anurag [1 ]
Ahmad, I. [2 ]
Banerjee, Jonaki [1 ]
机构
[1] Indian Sch Mines, Dept Appl Math, Dhanbad 826004, Jharkhand, India
[2] King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi Arabia
关键词
Interval-valued programming; Invexity; LU optimal; Sufficiency; Duality; Lagrangian function; PROGRAMMING-PROBLEMS; DUALITY; SUFFICIENCY;
D O I
10.1007/s40840-015-0237-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this article, we focus our attention on a nonsmooth interval-valued optimization problem and establish sufficient optimality conditions for a feasible solution to be an LU optimal solution under the invexity assumption. Appropriate duality theorems for Wolfe and Mond-Weir-type duals are presented in order to relate the LU optimal solution of primal and dual programs. Moreover, saddle-point-type optimality conditions are established in order to find relation between LU optimal solution of primal and saddle point of Lagrangian function.
引用
收藏
页码:1391 / 1411
页数:21
相关论文
共 50 条