Duality for multiobjective fractional programming involvingn-set functions sup*
Cheong Lai Jo, D.S. Kim, G.M. Lee · Optimization · 1994
For a multiobjective fractional programming problem (MFP) involving vector valued n-set functions, the dual problem (MFD) and the generalized dual problem (GMFD) are formulated and the concept of efficiency is used to prove the weak, strong and strict converse duality results between the associated parametric problem (MFP) λ and (MFD) under generalized ρ-convexity assumptions. Also, those duality results between (MFP) λ, and (GMFD) are obtained