Advanced
OPTIMALITY AND DUALITY IN NONDIFFERENTIABLE MULTIOBJECTIVE FRACTIONAL PROGRAMMING USING α-UNIVEXITY
OPTIMALITY AND DUALITY IN NONDIFFERENTIABLE MULTIOBJECTIVE FRACTIONAL PROGRAMMING USING α-UNIVEXITY
Journal of applied mathematics & informatics. 2014. May, 32(3_4): 359-375
  • Received : September 10, 2013
  • Published : May 30, 2014
Download
PDF
e-PUB
PubReader
PPT
Export by style
Share
Article
Author
Metrics
Cited by
TagCloud
About the Authors
Gupta Rekha
Srivastava Manjari

Abstract
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) <TEX>${\alpha}$</TEX>-univex function is defined to extend the concept of a real valued (generalized) <TEX>${\alpha}$</TEX>-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) <TEX>${\alpha}$</TEX>-univexity assumptions.
Keywords
View Fulltext