A new deterministic global computing algorithm for solving a kind of linear fractional programming

This paper investigates a class of linear fractional programming (LFP) problem, which minimizes the sum of a finite number of linear fractional functions over a polyhedral region. Firstly, the equivalence problem (EP) of the LFP problem is given by a new two-stage transformation method. Secondly, co...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization Vol. 72; no. 6; pp. 1485 - 1513
Main Authors:	Zhang, Bo, Gao, YueLin, Liu, Xia, Huang, XiaoLi
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 03.06.2023 Taylor & Francis LLC
Subjects:	Algorithms branch and bound Global optimization linear fractional programming Mathematical programming Optimization output-space
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!