An efficient algorithm for computing a class of multiplicative optimization problem

References

• G.Eason, B.Noble, and I.N.Sneddon, “On certain integrals of Lipschitz-Hankel type involving products of Bessel functions,” Phil. Trans. Roy. Soc. London, vol. A247, 1955,pp. 529–551. doi: 10.1098/rsta.1955.0005
   Web of Science ®Google Scholar
• J.M. Mulvey, R.J. Vanderbei and S.A. Zenios, Robust optimization of large-scale systems. Operations Research, 43, 1995,pp. 264-281. doi: 10.1287/opre.43.2.264
   Web of Science ®Google Scholar
• T. Kuno, Y. Yajima, H. Konno, An outer approximation method for minimizing the product of several convex functions on a convex set. Journal of Global optimization, 3(3),1993,pp.325–335. doi: 10.1007/BF01096774
   Web of Science ®Google Scholar
• H.P. Benson, Decomposition branch and bound based algorithm for linear programs with additional multiplicative constraints. Journal of Optimization Theory and Applications, 126(1), 2005,pp. 41–46. doi: 10.1007/s10957-005-2655-4
   Web of Science ®Google Scholar
• J. Yin, Y. Liu, B. Ma, D. Shi, An Effective Computational Algorithm for a Class of Linear Multiplicative Programming, Journal of Software, 8(1), 2013, pp.110–117. doi: 10.4304/jsw.8.1.110-117
   Google Scholar
• H. Jiao, K. Li, J. Wang, An optimization algorithm for solving a class of multiplicative problems, Journal of Chemical and Pharmaceutical Research, 6(1), 2014, pp.271–277.
   Google Scholar
• T. Kuno, A finite branch and bound algorithm for linear multiplicative programming. Computational Optimization and Application, 20, pp. 119–135, 2001. doi: 10.1023/A:1011250901810
   Web of Science ®Google Scholar
• H.S. Ryoo and N. V.sahinidis, Global Optimization of Multiplicative Programs. Journal of Global Optimization, 26, 2003, pp. 387–418. doi: 10.1023/A:1024700901538
   Web of Science ®Google Scholar
• P. Shen, H. Jiao, P. Shen，Linearization method for a class of multiplicative programming with exponent, Applied Mathematics and Computation, 183(1), 2006, pp.328–336. doi: 10.1016/j.amc.2006.05.074
   Web of Science ®Google Scholar
• H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Analysis, 70(2), 2009, pp.1113–1123. doi: 10.1016/j.na.2008.02.005
   Web of Science ®Google Scholar
• S. Schaible and C. Sodini, Finite algorithm for generalized linear multiplicative programming. Journal of Optimization Theory and Applications, 87(2) , 1995, pp. 441–455. doi: 10.1007/BF02192573
   Web of Science ®Google Scholar
• H.P. Benson and G.M. Boger, Outcome-space cutting-plane algorithm for linear multiplicative programming. Journal of Optimization Theory and Applications, 104(2) , 2000, pp. 301–322. doi: 10.1023/A:1004657629105
   Web of Science ®Google Scholar
• X.J. Liu, T. Umegaki, and Y. Yamamoto, Heuristic methods for linear multiplicative programming. Journal of Global Optimization, 4(15), 1999, pp. 433–447. doi: 10.1023/A:1008308913266
   Web of Science ®Google Scholar
• Q. Feng, H. Mao, Y. Wei, H. Jiao, New Computational Method for a Class of Optimization Problems in Production System and System Engineering, Applied Mechanics and Materials, 29(5), 2010, pp.1016–1021 doi: 10.4028/www.scientific.net/AMM.29-32.1016
   Google Scholar
• H. Jiao, K. Li, Optimization Algorithm for Solving a Kind of Mathematical Problems, Applied Mechanics and Materials, 44, 2010, pp.3423–3426. doi: 10.4028/www.scientific.net/AMM.44-47.3423
   Google Scholar
• H. Konno, P. T. Thach, H. Tuy, Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, (1997).
   Google Scholar
• H. Mao, Q. Feng, A kind of computational method for solving a class of fractional problems using deleting technique, Journal of Computational Information Systems, 6(4), 2010, pp. 1243–1250.
   Google Scholar
• Y. Wang, K. Zhang, Global optimization of nonlinear sum of ratios problem, Applied Mathematics and Computation, 158, 2004, pp. 319–330. doi: 10.1016/j.amc.2003.08.113
   Web of Science ®Google Scholar
• H.-W. Jiao, S.-Y. Liu, Y.-F. Zhao, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Applied Mathematical Modelling, vol. 39, 2015, pp. 7568–7582. doi: 10.1016/j.apm.2015.03.025
   Web of Science ®Google Scholar
• H. Jiao, S. Liu, N. Lu, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, Applied Mathematics and Computation, vol. 250, 2015, pp. 973–985. doi: 10.1016/j.amc.2014.11.032
   Web of Science ®Google Scholar
• H. Jiao, et al., Global optimization algorithm for sum of generalized polynomial ratios problem, Applied Mathematics Modelling, Vol. 37, no. 1-2, 2013, pp. 187–197. doi: 10.1016/j.apm.2012.02.023
   Web of Science ®Google Scholar
• H.-W. Jiao, Y.-Q. Chen, W.-X. Cheng, A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs, Abstract and Applied Analysis, Volume 2014, Article ID 698489, 11 pages, doi:10.1155/2014/698489.
   Google Scholar
• H. Jiao, S. Liu, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Computational and Applied Mathematics, 2015.
   Google Scholar
• H.-W. Jiao, S.-Y. Liu, A practicable branch and bound algorithm for sum of linear ratios problem, European Journal of Operational Research, 243(3), 2015, pp.723–730. doi: 10.1016/j.ejor.2015.01.039
   Web of Science ®Google Scholar
• H. Jiao, J. Yin, Y. Guo, Optimization Method for Globally Solving a Kind of Multiplicative Problems with Coefficients, Key Engineering Materials, (467-469), 2011,pp.526–530. doi: 10.4028/www.scientific.net/KEM.467-469.526
   Google Scholar
• H. Jiao, Y. Guo, P. Shen, Global optimization of generalized linear fractional programming with nonlinear constraints, Applied Mathematics and Computation, 183(2), 2006, pp.717–728. doi: 10.1016/j.amc.2006.05.102
   Web of Science ®Google Scholar