Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 490297, 10 pages
http://dx.doi.org/10.1155/2014/490297
Research Article

A New Linearizing Method for Sum of Linear Ratios Problem with Coefficients

1School of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, China
2Department of Mathematics, Henan Normal University, Xinxiang 453007, China
3Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China

Received 11 December 2013; Accepted 24 February 2014; Published 26 March 2014

Academic Editor: Ferenc Hartung

Copyright © 2014 Hongwei Jiao and Yongqiang Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. S. Colantoni, R. P. Manes, and A. Whinston, “Programming, profit rates, and pricing decisions,” Accounting Review, vol. 44, pp. 467–481, 1969. View at Google Scholar
  2. M. R. Rao, “Cluster analysis and mathematical programming,” Journal of the American Statistical Association, vol. 66, pp. 622–626, 1971. View at Google Scholar
  3. H. Konno and H. Watanabe, “Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach,” Journal of the Operations Research Society of Japan, vol. 39, no. 3, pp. 295–306, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. H. Konno, Y. Yajima, and T. Matsui, “Parametric simplex algorithms for solving a special class of nonconvex minimization problems,” Journal of Global Optimization, vol. 1, no. 1, pp. 65–81, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. Y. J. Wang, P. P. Shen, and Z. A. Liang, “A branch-and-bound algorithm to globally solve the sum of several linear ratios,” Applied Mathematics and Computation, vol. 168, no. 1, pp. 89–101, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. C.-F. Wang and P.-P. Shen, “A global optimization algorithm for linear fractional programming,” Applied Mathematics and Computation, vol. 204, no. 1, pp. 281–287, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. Y. Ji, K.-C. Zhang, and S.-J. Qu, “A deterministic global optimization algorithm,” Applied Mathematics and Computation, vol. 185, no. 1, pp. 382–387, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P.-P. Shen and C.-F. Wang, “Global optimization for sum of linear ratios problem with coefficients,” Applied Mathematics and Computation, vol. 176, no. 1, pp. 219–229, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. Y. Gao and S. Jin, “A global optimization algorithm for sum of linear ratios problem,” Journal of Applied Mathematics, vol. 2013, Article ID 276245, 7 pages, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. Y. Pei and D. Zhu, “Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region,” Journal of Applied Mathematics and Computing, vol. 41, no. 1-2, pp. 153–169, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  11. R. Horst and H. Tuy, Global Optimization, Deterministic Approaches, Springer, Berlin, Germany, 1990. View at MathSciNet