Back to Search
Start Over
A note on the paper 'Fractional programming with convex quadratic forms and functions' by H.P. Benson
- Source :
- European Journal of Operational Research, 176(1), 641-642. Elsevier
- Publication Year :
- 2006
-
Abstract
- In this technical note, we give a short proof based on some standard results in convex analysis of some important characterization results listed in Theorems 3 and 4 of Benson [Benson, H.P., 2006. Fractional programming with convex quadratic forms and functions. European Journal of Operational Research]. Actually our result is slightly more general since we do not specify the nonempty convex set X. For clarity we use the same notation for the different equivalent optimization problems as done in Benson (2006).
- Subjects :
- Convex analysis
Convex hull
Information Systems and Management
General Computer Science
jel:C61
Proper convex function
Convex set
Subderivative
Management Science and Operations Research
jel:R4
Industrial and Manufacturing Engineering
Combinatorics
jel:M
jel:M11
Fractional programming
global optimalization, ratio of a convex quadratic and a convex function, single ratio fractional programming
Modeling and Simulation
Convex optimization
Absolutely convex set
Mathematics
Subjects
Details
- ISSN :
- 03772217
- Volume :
- 176
- Issue :
- 1
- Database :
- OpenAIRE
- Journal :
- European Journal of Operational Research
- Accession number :
- edsair.doi.dedup.....47d273b4c1336838be6c8a9816f07c81