Lagrange duality in multiobjective fractional programming problems with n-set functions

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free