A New Global Optimization Algorithm for a Class of Linear Fractional Programming

In this paper, we propose a new global optimization algorithm, which can better solve a class of linear fractional programming problems on a large scale. First, the original problem is equivalent to a nonlinear programming problem: It introduces <i>p</i> auxiliary variables. At the same...

Full description

Bibliographic Details
Published in:Mathematics
Main Authors: X. Liu, Y.L. Gao, B. Zhang, F.P. Tian
Format: Article
Language:English
Published: MDPI AG 2019-09-01
Subjects:
global optimization
fractional programming
branch and bound
output-space
linear relaxation
Online Access:https://www.mdpi.com/2227-7390/7/9/867

Internet

https://www.mdpi.com/2227-7390/7/9/867

Similar Items