|
|||||
|
|
On sufficiency and duality for a class of interval-valued programming problems |
|
| Authors: | Anurag Jayswal Ioan Stancu-Minasian |
| Institution: | a Department of Applied Mathematics, Indian School of Mines, Dhanbad 826 004, Jharkhand, India b Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 13 Septembrie Street, No. 13, 050711 Bucharest, Romania c Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, P.O. Box 728, Dhahran 31261, Saudi Arabia |
| Abstract: | 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. |
| Keywords: | Interval-valued programming problems Generalized convexity Efficiency Sufficient optimality conditions Duality |
| 本文献已被 ScienceDirect 等数据库收录！ | |