scientific article; zbMATH DE number 3908192

From MaRDI portal
Publication:3686520





[For the entire collection see Zbl 0552.00016.] Efficient solutions of the multiobjective fractional programming problem \[ V\max \{F(x)=[\ell_ 1(x)/m_ 1(x),\quad \ell_ 2(x)/m_ 2(x),...,\ell_ p(x)/m_ x(x)]^ t: x\in X\} \] are first related to efficient solutions of the non-fractional multiobjective problems \[ V\max \{G(x)=[\ell_ 1(x),...,\ell_ p(x),\quad -m_ 1(x),...,-m_ p(x)]^ t: x\in X\} \] and \[ V\max \{H(x)=[\ell_ 1(x),...,\ell_ p(x),\quad m_ 1(x),...,m_ p(x)]^ t: x\in X\}. \] Optimal solutions of the single-objective fractional programming problem (1) \(\max \{f(x)=\ell (x)/m(x):\) \(x\in X\}\) are then related to (2) \(V\max \{\Phi (x)=[\ell (x),-m(x)]^ t:\) \(x\in X\}\) and (3) \(V\max \{\Gamma (x)=[\ell (x),m(x)]^ t:\) \(x\in X\}\). The equivalence of (2), given certain convexity conditions, to the parametric problem \(\max \{\Phi (x,t)=(1- t)\ell (x)-t\) m(x): \(x\in X\), \(t\in (0,1)\}\) is then utilized to obtain an algorithm for finding an optimal solution of the fractional problem (1).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686520)