Solving a class of generalized fractional programming problems using the feasibility of linear programs

Solving a class of generalized fractional programming problems using the feasibility of linear programs

Abstract This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent op...

Full description

Bibliographic Details
Main Authors: Peiping Shen, Tongli Zhang, Chunfeng Wang
Format: Article
Language:English
Published: SpringerOpen 2017-06-01
Series:Journal of Inequalities and Applications
Subjects:
generalized fractional programming
global optimization
approximation algorithm
computational complexity
Online Access:http://link.springer.com/article/10.1186/s13660-017-1420-1

Internet

http://link.springer.com/article/10.1186/s13660-017-1420-1

Similar Items