A Deterministic Method for Solving the Sum of Linear Ratios Problem

Zhenping Wang and Yonghong Zhang

Mathematical Problems in Engineering, 2020, vol. 2020, 1-8

Abstract:

Since the sum of linear ratios problem (SLRP) has many applications in real life, for globally solving it, an efficient branch and bound algorithm is presented in this paper. By utilizing the characteristic of the problem (SLRP), we propose a convex separation technique and a two-part linearization technique, which can be used to generate a sequence of linear programming relaxation of the initial nonconvex programming problem. For improving the convergence speed of this algorithm, a deleting rule is presented. The convergence of this algorithm is established, and some experiments are reported to show the feasibility and efficiency of the proposed algorithm.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/6174352.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/6174352.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6174352

DOI: 10.1155/2020/6174352

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().