In this paper, Lagrange multiplier theorems are developed for the multiobjective fractional programming problem involving n-set functions. A Lagrange dual is introduced and duality results in terms of efficient solutions are established. © 1999 Academic Press.
CITATION STYLE
Bhatia, D., & Mehra, A. (1999). Lagrange duality in multiobjective fractional programming problems with n-set functions. Journal of Mathematical Analysis and Applications, 236(2), 300–311. https://doi.org/10.1006/jmaa.1999.6425
Mendeley helps you to discover research relevant for your work.