Article ID: | iaor19952280 |
Country: | Germany |
Volume: | 16 |
Issue: | 4 |
Start Page Number: | 249 |
End Page Number: | 254 |
Publication Date: | Dec 1994 |
Journal: | OR Spektrum |
Authors: | Tammer C., Ohlendorf E. |
Keywords: | programming: fractional |
This paper deals with multicriteria fractional problems. Since these problems in general are not convex, the basic problem will be transformed into a convex optimization problem by using an extension of the conception of Dinkelbach to vector optimization. It will be formulated a dual problem to the transformed optimization problem, where conjugate functions are used. There will be proved strong and converse duality theorems with conclusions to basic fractional problem.