Solving generalized polynomial problem by using new affine relaxed technique

References

• X. Bao, A. Khajavirad, N.V. Sahinidis, and M. Tawarmalani, Global optimization of nonconvex problems with multilinear intermediates, Math. Program. Comput. 7(1) (2015), pp. 1–37.
   Web of Science ®Google Scholar
• X. Bao, N.V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs, Optim. Methods Softw. 24(4–5) (2009), pp. 485–504.
   Web of Science ®Google Scholar
• J. Costa, A branch & cut technique to solve a weighted-sum of linear ratios, Pac. J. Optim. 6(1) (2010), pp. 21–38.
   Web of Science ®Google Scholar
• K. Das, T.K. Roy, and M. Maiti, Multi-item inventory model with under imprecise objective and restrictions: A geometric programming approach, Prod. Plan. Control 11(8) (2000), pp. 781–788.
   Web of Science ®Google Scholar
• C.A. Floudas and V. Visweswaran, Quadratic Optimization, in Handbook of Global Optimization, Nonconvex Optimization and its Applications, R. Horst, and P.M. Pardalos, eds., Dordrecht, Kluwer Academic Publishers, 1995, pp. 217–270.
   Google Scholar
• Y. Gao and F. Wei, A new bound-and-reduce approach of nonconvex quadratic programming problems, Appl. Math. Comput. 250 (2015), pp. 298–308.
   Web of Science ®Google Scholar
• Y.L. Gao, C.X. Xu, and Y.L. Yan, An outcome-space finite algorithm for solving linear multiplicative programming, Appl. Math. Comput. 179(2) (2006), pp. 494–505.
   Web of Science ®Google Scholar
• H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal.-Theor. 70 (2009), pp. 1113–1123.
   Web of Science ®Google Scholar
• H. Jiao and S. Liu, A practicable branch and bound algorithm for sum of linear ratios problem, Eur. J. Oper. Res. 243(3) (2015), pp. 723–730.
   Web of Science ®Google Scholar
• H. Jiao and S. Liu, An efficient algorithm for quadratic sum-of-ratios fractional programs problem, Numer. Funct. Anal. Opt. 38(11) (2017), pp. 1426–1445.
   Web of Science ®Google Scholar
• H. Jiao, S. Liu, and N. Lu, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, Appl. Math. Comput. 250 (2015), pp. 973–985.
   Web of Science ®Google Scholar
• H. Jiao, S. Liu, and Y. Zhao, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Appl. Math. Model. 39(23–24) (2015), pp. 7568–7582.
   Web of Science ®Google Scholar
• A. Khajavirad, J.J. Michalek, and N.V. Sahinidis, Relaxations of factorable functions with convex-transformable intermediates, Math. Program. 144 (2014), pp. 107–140.
   Web of Science ®Google Scholar
• A. Khajavirad and N.V. Sahinidis, A hybrid LP/NLP paradigm for global optimization relaxations, Math. Program. Comput. 10(3) (2018), pp. 383–421.
   Web of Science ®Google Scholar
• H. Konno and K. Fukaishi, A branch-and-bound algorithm for solving low-rank linear multiplicative and fractional programming problems, J. Glob. Optim. 18 (2000), pp. 283–299.
   Web of Science ®Google Scholar
• M.-H. Lin and J.-F. Tsai, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, Eur. J. Oper. Res. 216 (2012), pp. 17–25.
   Web of Science ®Google Scholar
• C.D. Maranas and C.A. Floudas, Global optimization in generalized geometric programming, Comput. Chem. Engin. 21(4) (1997), pp. 351–369.
   Web of Science ®Google Scholar
• T.H.P. Nguyen and H. Tuy, A unified monotonic approach to generalized linear fractional programming, J. Glob. Optim. 26 (2003), pp. 229–259.
   Web of Science ®Google Scholar
• C.J. Nohra and N.V. Sahinidis, Global optimization of nonconvex problems with convex-transformable intermediates, J. Glob. Optim. 72 (2018), pp. 255–276.
   Web of Science ®Google Scholar
• E. Phan-huy-Hao, Quadratically constrained quadratic programming: Some applications and a method for solution, Zeitschrift Für Oper. Res. 26 (1982), pp. 105–119.
   Google Scholar
• J. Qin, X. Xu, Q. Wu, and T.C.E. Cheng, Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem, Comput. Oper. Res. 66 (2016), pp. 199–214.
   Web of Science ®Google Scholar
• H.-S. Ryoo and N.V. Sahinidis, A branch-and-reduce approach to global optimization, J. Glob. Optim.8 (1996), pp. 107–138.
   Web of Science ®Google Scholar
• H.-S. Ryoo and N.V. Sahinidis, Analysis of bounds for multilinear functions, J. Glob. Optim. 19 (2001), pp. 403–424.
   Web of Science ®Google Scholar
• H.-S. Ryoo and N.V. Sahinidis, Global optimization of multiplicative programs, J. Glob. Optim. 26 (2003), pp. 387–418.
   Web of Science ®Google Scholar
• N.V. Sahinidis, BARON: A general purpose global optimization software package, J. Global Optim.8 (1996), pp. 201–205.
   Web of Science ®Google Scholar
• S. Schaible and J. Shi, Fractional programming: The sum-of-ratios case, Optim. Meth. Softw. 18 (2003), pp. 219–229.
   Web of Science ®Google Scholar
• P. Shen, Linearization method of global optimization for generalized geometric programming, Appl. Math. Comput. 162 (2005), pp. 353–370.
   Web of Science ®Google Scholar
• P. Shen and B. Huang, Global algorithm for solving linear multiplicative programming problems, Optim. Lett. (2019), pp. Available at https://doi.org/https://doi.org/10.1007/s11590-018-1378-z.
   Web of Science ®Google Scholar
• P. Shen, B. Huang, and L. Wang, Range division and linearization algorithm for a class of linear ratios optimization problems, J. Comput. Appl. Math. 350 (2019), pp. 324–342.
   Web of Science ®Google Scholar
• P. Shen and H. Jiao, Linearization method for a class of multiplicative programming with exponent, Appl. Math. Comput. 183(1) (2006), pp. 328–336.
   Web of Science ®Google Scholar
• P. Shen and X. Li, Branch-reduction-bound algorithm for generalized geometric programming, J. Glob. Optim. 56(3) (2013), pp. 1123–1142.
   Web of Science ®Google Scholar
• P.-P. Shen, X.-A. Li, and H.-W. Jiao, Accelerating method of global optimization for signomial geometric programming, J. Comput. Appl. Math. 214 (2008), pp. 66–77.
   Web of Science ®Google Scholar
• P. Shen and C. Wang, Linear decomposition approach for a class of nonconvex programming problems, J. Inequal. Appl. 2017 (2017), pp. 472.
   Web of Science ®Google Scholar
• P. Shen and K. Zhang, Global optimization of signomial geometric programming using linear relaxation, Appl. Math. Comput. 150 (2004), pp. 99–114.
   Web of Science ®Google Scholar
• P. Shen, Z. Zhu, and X. Chen, A practicable contraction approach for the sum of the generalized polynomial ratios problem, Eur. J. Oper. Res. 278(1) (2019), pp. 36–48.
   Web of Science ®Google Scholar
• H.D. Sherali and A. Alameddine, A new reformulation-linearization technique for bilinear programming problems, J. Glob. Optim. 2 (1992), pp. 379–410.
   Google Scholar
• I.M. Stancu-Minasian, Fractional Programming: Theory, Methods and Applications, Kluwer, Dordrecht, 1997.
   Google Scholar
• I.M. Stancu-Minasian, A eighth bibliography of fractional programming, Optim. 66(3) (2017), pp. 439–470.
   Web of Science ®Google Scholar
• Y.K. Sui, The expansion of functions under transformation and its application to optimization, Comput. Method Appl. M. 113 (1994), pp. 253–262.
   Web of Science ®Google Scholar
• M. Tawarmalani and N.V. Sahinidis, Semidefinite relaxations of fractional programs via novel convexification techniques, J. Glob. Optim. 20(2) (2001), pp. 133–154.
   Web of Science ®Google Scholar
• M. Tawarmalani and N.V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Kluwer, Dordrecht, 2002.
   Google Scholar
• M. Tawarmalani and N.V. Sahinidis, Convex extensions and convex envelopes of l.s.c functions, Math. Program. 93 (2002), pp. 247–263.
   Web of Science ®Google Scholar
• M. Tawarmalani and N.V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Math. Program. 103 (2005), pp. 225–249.
   Web of Science ®Google Scholar
• J.-F. Tsai, Global optimization of nonlinear fractional programming problems in engineering design, Eng. Optim. 37(4) (2005), pp. 399–409.
   Web of Science ®Google Scholar
• C.-F. Wang, Y.-Q. Bai, and P.-P. Shen, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming, Optimization, 66 (2017), pp. 397–405.
   Web of Science ®Google Scholar
• Y.J. Wang and Z.A. Liang, A deterministic global optimization algorithm for generalized geometric programming, Appl. Math. Comput. 168 (2005), pp. 722–737.
   Web of Science ®Google Scholar
• C.F. Wang and S.Y. Liu, A new linearization method for generalized linear multiplicative programming, Comput. Oper. Res. 38 (2011), pp. 1008–1013.
   Web of Science ®Google Scholar
• C.-F. Wang, S.-Y. Liu, and P.-P. Shen, Global minimization of a generalized linear multiplicative programming, Appl. Math. Model. 36(6) (2012), pp. 2446–2451.
   Web of Science ®Google Scholar
• Y. Wang and A.P. Punnen, The boolean quadratic programming problem with generalized upper bound constraints, Comput. Oper. Res. 77 (2017), pp. 1–10.
   Web of Science ®Google Scholar
• A. Weintraub and J. Vera, A cutting plane approach for chance-constrained linear programs, Oper. Res. 39 (1991), pp. 776–785.
   Web of Science ®Google Scholar