Optimality and Duality in Nondifferentiable Multiobjective Fractional Programming using $\alpha$-Univexity

By Rekha Gupta
..........1515

Generic
Number - 1515

References
- 0

Written
Date -
May 16th, 14

Modified
Date -
May 16th, 14

Downloaded
Counts - 70

Visited
Counts - 179

Original
File

Summary

In this paper, a multiobjective nondifferentiable fractional programming problem
(MFP) is considered where the objective function contains a term involving the
support function of a compact convex set. A vector valued (generalized) $\alpha$-
univex function is defined to extend the concept of a real valued (generalized)
$\alpha$-univex function. Using these functions, sufficient optimality criteria are
obtained for a feasible solution of (MFP) to be an efficient or weakly efficient
solution of (MFP). Duality results are obtained for a Mond-Weir type dual under
(generalized) $\alpha$-univexity assumptions.