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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 173; číslo 2; s. 351 - 369
Hlavní autor:	Benson, Harold P.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.09.2006 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!