Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2008, Article ID 646205, 13 pages
http://dx.doi.org/10.1155/2008/646205
Research Article

Global Optimization for Sum of Linear Ratios Problem Using New Pruning Technique

1Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, China
2College of Mechanical and Electric Engineering, Henan Institute of Science and Technology, Xinxiang 453003, China
3Jiangsu Provincial Key Laboratory of Modern Agricultural Equipment and Technology, Jiangsu University, Zhenjiang 212013, China
4College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China

Received 7 June 2008; Accepted 21 November 2008

Academic Editor: Alexander P. Seyranian

Copyright © 2008 Hongwei Jiao et al. 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. 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
  2. W. Yanjun, S. Peiping, and L. Zhian, “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
  3. N. T. Hoai Phuong and H. Tuy, “A unified monotonic approach to generalized linear fractional programming,” Journal of Global Optimization, vol. 26, no. 3, pp. 229–259, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. T. Kuno, “A branch-and-bound algorithm for maximizing the sum of several linear ratios,” Journal of Global Optimization, vol. 22, no. 1–4, pp. 155–174, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. H. Jiao, Y. Guo, and P. Shen, “Global optimization of generalized linear fractional programming with nonlinear constraints,” Applied Mathematics and Computation, vol. 183, no. 2, pp. 717–728, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. 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
  7. H. Jiao and Y. Chen, “A note on a deterministic global optimization algorithm,” Applied Mathematics and Computation, vol. 202, no. 1, pp. 67–70, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  8. 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. H. Tuy, “Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms,” Journal of Global Optimization, vol. 1, no. 1, pp. 23–36, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. R. Horst, “Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization,” Journal of Optimization Theory and Applications, vol. 58, no. 1, pp. 11–37, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet