Skip navigation
Skip navigation

Global solutions to fractional programming problem with ratio of nonconvex functions

Ruan, N.; Gao, D.Y.


This paper presents a canonical dual approach for minimizing a sum of quadratic function and a ratio of nonconvex functions in Rⁿ. By introducing a parameter, the problem is first equivalently reformed as a nonconvex polynomial minimization with elliptic constraint. It is proved that under certain conditions, the canonical dual is a concave maximization problem in R² that exhibits no duality gap. Therefore, the global optimal solution of the primal problem can be obtained by solving the...[Show more]

CollectionsANU Research Publications
Date published: 2015-03-15
Type: Journal article
Source: Applied Mathematics and Computation
DOI: 10.1016/j.amc.2014.08.060


File Description SizeFormat Image
Ruan and Gao Global Solutions to Fractional Programming Problem 2015.pdf116.65 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator