A note on the paper Fractional Programming with convex quadratic forms and functions by H.P.Benson
2005-04-03
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ERS 2005 004 LIS.pdf, 0.1MB) |
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 [1]. 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 [1].
Keywords
- global optimalization
- ratio of a convex quadratic and a convex function
- single ratio fractional programming
Classifications using
Journal of Economic Literature (JEL) Classification System
- C61 : Optimization Techniques; Programming Models; Dynamic Analysis
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- problem
- optimization problem
- function
- optimization
- research
- result
- paper
- management
- theorem 3
- report
- programming
- objective value t
- equivalent optimization problems
- theorem
- solution
- series
- rotterdam
- matrix
- semidefinite matrix
- region
