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

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 optimizatio...

Descripción completa

Detalles Bibliográficos
Autores principales: Shen, Peiping, Zhang, Tongli, Wang, Chunfeng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2017
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5487952/
https://www.ncbi.nlm.nih.gov/pubmed/28680250
http://dx.doi.org/10.1186/s13660-017-1420-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5487952/
https://www.ncbi.nlm.nih.gov/pubmed/28680250
http://dx.doi.org/10.1186/s13660-017-1420-1

Ejemplares similares