Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 103569, 7 pages
http://dx.doi.org/10.1155/2014/103569
Research Article
Global Optimization for a Class of Nonlinear Sum of Ratios Problem
1Basic Course Department, Henan Mechanical and Electrical Engineering College, Xinxiang 453003, China
2College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China
Received 5 November 2013; Revised 6 February 2014; Accepted 8 February 2014; Published 3 April 2014
Academic Editor: Baocang Ding
Copyright © 2014 Li Jin and Xue-Ping Hou. 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
- H. Konno, P. T. Thach, and H. Tuy, Optimization on Low Rank Nonconvex Structures, vol. 15 of Nonconvex Optimization and Its Applications, Kluwer Academic, Dodrecht, The Netherlands, 1997. View at MathSciNet
- Y. Almogy and O. Levin, “Parametric analysis of a multistage stochastic shipping problem,” Operations Research, vol. 69, pp. 359–370, 1970. View at Google Scholar
- J. Majhi, R. Janardan, M. Smid, and P. Gupta, “On some geometric optimization problems in layered manufacturing,” Computational Geometry, vol. 12, no. 3-4, pp. 219–239, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- 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
- H. Konno and M. Inori, “Bond portfolio optimization by bilinear fractional programming,” Journal of the Operations Research Society of Japan, vol. 32, no. 2, pp. 143–158, 1989. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- I. M. Stancu-Minasian, Fractional Programming: Theory, Methods and Applications, vol. 409 of Mathematics and Its Applications, Kluwer Academic, Dodrecht, The Netherlands, 1997. View at MathSciNet
- 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
- T. Kuno, “A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-ratios problems,” Journal of Global Optimization, vol. 33, no. 2, pp. 215–234, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
- H. P. Benson, “A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem,” European Journal of Operational Research, vol. 182, no. 2, pp. 597–611, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- H. P. Benson, “Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs,” Journal of Optimization Theory and Applications, vol. 146, no. 1, pp. 1–18, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- 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
- R. W. Freund and F. Jarre, “Solving the sum-of-ratios problem by an interior-point method,” Journal of Global Optimization, vol. 19, no. 1, pp. 83–102, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- Y. Dai, J. Shi, and S. Wang, “Conical partition algorithm for maximizing the sum of dc ratios,” Journal of Global Optimization, vol. 31, no. 2, pp. 253–270, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- 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
- H. P. Benson, “Using concave envelopes to globally solve the nonlinear sum of ratios problem,” Journal of Global Optimization, vol. 22, no. 1–4, pp. 343–364, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- H. P. Benson, “Global optimization algorithm for the nonlinear sum of ratios problem,” Journal of Optimization Theory and Applications, vol. 112, no. 1, pp. 1–29, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- R. Yamamoto and H. Konno, “An efficient algorithm for solving convex-convex quadratic fractional problems,” Journal of Optimization Theory and Applications, vol. 133, no. 2, pp. 241–255, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
- P. Shen and L. Jin, “Using conical partition to globally maximizing the nonlinear sum of ratios,” Applied Mathematical Modelling, vol. 34, no. 9, pp. 2396–2413, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- H. Jiao and P. Shen, “A note on the paper global optimization of nonlinear sum of ratios,” Applied Mathematics and Computation, vol. 188, no. 2, pp. 1812–1815, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- L. A. Wolsey, Integer Programming, John Wiley & Sons, New York, NY, USA, 1998. View at MathSciNet
- R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, Springer, Berlin, Germany, 2nd edition, 1993. View at MathSciNet
- A. W. Lo and A. C. Mackinlay, “Maximizing predictability in the stock and bond markets,” Macroeconomic Dynamics, vol. 1, no. 1, pp. 102–134, 1997. View at Google Scholar · View at Zentralblatt MATH · View at Scopus