A note on the paper Fractional Programming with convex quadratic forms and functions by H.P.Benson
In this technical note we give a short proof based on standard results in convex analysis of some important characterization results listed in Theorem 3 and 4 of . Actually our result is slightly general since we do not specify the convex set X. For clarity we use the same notation for the different equivalent optimization problems as done in .
|Keywords||global optimalization, ratio of a convex quadratic and a convex function, single ratio fractional programming|
Frenk, J.B.G.. (2005). A note on the paper Fractional Programming with convex quadratic forms and functions by H.P.Benson (No. ERS-2005-004-LIS). ERIM report series research in management Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/1928