A Global Optimization Algorithm for Sum of Linear Ratios Problem

Yuelin Gao and Siqiao Jin

Journal of Applied Mathematics, 2013, vol. 2013, 1-7

Abstract:

We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/276245.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/276245.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:jnljam:276245

DOI: 10.1155/2013/276245

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().