Maximization of the Ratio of Two Convex Quadratic Functions over a Polytope
Authors:
- 1 October 2001
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 20 (1) , 43-60
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Convex Analysis and Global Optimization1998
- A branch and bound algorithm for solving mean-risk-skewness portfolio modelsOptimization Methods and Software, 1998
- Optimization on Low Rank Nonconvex Structures1997
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETSMacroeconomic Dynamics, 1997
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problemsOperations Research Letters, 1995
- Global optimization of fractional programsJournal of Global Optimization, 1991
- Parametric approaches to fractional programsMathematical Programming, 1983
- Fractional Programming. II, On Dinkelbach's AlgorithmManagement Science, 1976
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969
- On Nonlinear Fractional ProgrammingManagement Science, 1967