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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have