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

Journal of inequalities and applications

Peiping Shen¹ 

关键词: generalized fractional programming;    global optimization;    approximation algorithm;    computational complexity;    90C30;    90C33;    90C15;   

DOI  :  10.1186/s13660-017-1420-1

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

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 optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

【 授权许可】

CC BY