Open Access
Translator Disclaimer
2014 A New Linearizing Method for Sum of Linear Ratios Problem with Coefficients
Hongwei Jiao, Yongqiang Chen
J. Appl. Math. 2014: 1-10 (2014). DOI: 10.1155/2014/490297

Abstract

A new linearizing method is presented for globally solving sum of linear ratios problem with coefficients. By using the linearizing method, linear relaxation programming (LRP) of the sum of linear ratios problem with coefficients is established, which can provide the reliable lower bound of the optimal value of the initial problem. Thus, a branch and bound algorithm for solving the sum of linear ratios problem with coefficients is put forward. By successively partitioning the linear relaxation of the feasible region and solving a series of the LRP, the proposed algorithm is convergent to the global optimal solution of the initial problem. Compared with the known methods, numerical experimental results show that the proposed method has the higher computational efficiency in finding the global optimum of the sum of linear ratios problem with coefficients.

Citation

Download Citation

Hongwei Jiao. Yongqiang Chen. "A New Linearizing Method for Sum of Linear Ratios Problem with Coefficients." J. Appl. Math. 2014 1 - 10, 2014. https://doi.org/10.1155/2014/490297

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07010653
MathSciNet: MR3191120
Digital Object Identifier: 10.1155/2014/490297

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.2014 • 2014
Back to Top