Fractional programming with convex quadratic forms and functions

This article is concerned with two global optimization problems (P1) and (P2). Each of these problems is a fractional programming problem involving the maximization of a ratio of a convex function to a convex function, where at least one of the convex functions is a quadratic form. First, the articl...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 173; no. 2; pp. 351 - 369
Main Author:	Benson, Harold P.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.2006 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Branch & bound algorithms Branch and bound Exact sciences and technology Fractional programming Global optimization Operational research. Management science Operations research Optimization algorithms Problem solving Quadratic form Studies Global optimization Fractional programming Branch and bound Quadratic form Branch and bound method Global optimum Convex function Quadratic programming Rational function Convex programming Quadratic function
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!