| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4630139 | Applied Mathematics and Computation | 2011 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Anurag Jayswal, Ioan Stancu-Minasian, I. Ahmad,