Journal of the Operations Research Society of China >
2018 , Vol. 6 >Issue 4: 611 - 626
DOI: https://doi.org/https://doi.org/10.1007/s40305-018-0206-6
Interval-Valued Programming Problem with Infinite Constraints
Online published: 2018-12-30
Supported by
Bharti Sharma was supported by Council of Scientific and Industrial Research, Senior Research Fellowship, India (No. 09/045(1350)/2014-EMR-1). Jyoti Dagar was supported by University Grant Commission Non-NET research fellowship, India (No. Non-NET/139/Ext-136/2014).
In this paper, we explore a class of interval-valued programming problem where constraints are interval-valued and infinite. Necessary optimality conditions are derived. Notion of generalized invexity is utilized to establish sufficient optimality conditions. Further, two duals, namely Wolfe and Mond–Weir, are proposed for which duality results are proved.
Promila Kumar, Bharti Sharma, Jyoti Dagar . Interval-Valued Programming Problem with Infinite Constraints[J]. Journal of the Operations Research Society of China, 2018 , 6(4) : 611 -626 . DOI: https://doi.org/10.1007/s40305-018-0206-6
/
| 〈 |
|
〉 |
