Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2014 (2014), Article ID 697321, 10 pages.
A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems
Xue-Gang Zhou and Bing-Yuan Cao
Full-text: Open access
Abstract
A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF) and a linear lower bounding function (LLBF) of a natural logarithm function and an exponential function with e as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.
Article information
Source
J. Appl. Math., Volume 2014 (2014), Article ID 697321, 10 pages.
Dates
First available in Project Euclid: 2 March 2015
Permanent link to this document
https://projecteuclid.org/euclid.jam/1425305547
Digital Object Identifier
doi:10.1155/2014/697321
Mathematical Reviews number (MathSciNet)
MR3176826
Zentralblatt MATH identifier
07010716
Citation
Zhou, Xue-Gang; Cao, Bing-Yuan. A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems. J. Appl. Math. 2014 (2014), Article ID 697321, 10 pages. doi:10.1155/2014/697321. https://projecteuclid.org/euclid.jam/1425305547
References
- S. Schaible and T. Ibaraki, “Fractional programming,” European Journal of Operational Research, vol. 12, no. 4, pp. 325–338, 1983.Mathematical Reviews (MathSciNet): MR703439
Zentralblatt MATH: 0529.90088
Digital Object Identifier: doi:10.1016/0377-2217(83)90153-4 - C. D. Maranas, I. P. Androulakis, C. A. Floudas, A. J. Berger, and J. M. Mulvey, “Solving long-term financial planning problems via global optimization,” Journal of Economic Dynamics & Control, vol. 21, no. 8-9, pp. 1405–1425, 1997.
- J. M. Mulvey, R. J. Vanderbei, and S. A. Zenios, “Robust optimization of large-scale systems,” Operations Research, vol. 43, no. 2, pp. 264–281, 1995.Mathematical Reviews (MathSciNet): MR1327415
Zentralblatt MATH: 0832.90084
Digital Object Identifier: doi:10.1287/opre.43.2.264 - M. C. Dorneich and N. V. Sahinidis, “Global optimization algorithms for chip design and compaction,” Engineering Optimization, vol. 25, no. 2, pp. 131–154, 1995.
- K. P. Bennett and O. L. Mangasarian, “Bilinear separation of two sets in n-space,” Computational Optimization and Applications, vol. 2, no. 3, pp. 207–227, 1993.
- Z. Drezner, S. Schaible, and D. Simchi-Levi, “Queueing-location problems on the plane,” Naval Research Logistics, vol. 37, no. 6, pp. 929–935, 1990.Mathematical Reviews (MathSciNet): MR1079881
Zentralblatt MATH: 0716.90068
Digital Object Identifier: doi:10.1002/1520-6750(199012)37:6<929::AID-NAV3220370611>3.0.CO;2-8 - S. Zhang, “Stochastic Queue Location Problems,” Tinbergen Institute Research Series 14, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1991.
- 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.
- H. M. Markowitz, Portfolio Selection, Basil Blackwell, Oxford, UK, 2nd edition, 1991.
- H. W. Zhang, W. L. Xu, S. L. Di, and P. F. Thomson, “Quadratic programming method in numerical simulation of metal forming process,” Computer Methods in Applied Mechanics and Engineering, vol. 191, no. 49-50, pp. 5555–5578, 2002.
- H. Jiao, “A branch and bound algorithm for globally solving a class of nonconvex programming problems,” Nonlinear Analysis. Theory, Methods & Applications, vol. 70, no. 2, pp. 1113–1123, 2009.
- P. Shen, X. Bai, and W. Li, “A new accelerating method for globally solving a class of nonconvex programming problems,” Nonlinear Analysis. Theory, Methods & Applications, vol. 71, no. 7-8, pp. 2866–2876, 2009.
- 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.Mathematical Reviews (MathSciNet): MR2192206
Digital Object Identifier: doi:10.1007/s10898-004-1952-z - P.-P. Shen and C.-F. Wang, “Global optimization for sum of generalized fractional functions,” Journal of Computational and Applied Mathematics, vol. 214, no. 1, pp. 1–12, 2008.Mathematical Reviews (MathSciNet): MR2391667
Zentralblatt MATH: 1144.65043
Digital Object Identifier: doi:10.1016/j.cam.2007.01.022 - H. Konno and T. Kuno, “Generalized linear multiplicative and fractional programming,” Annals of Operations Research, vol. 25, no. 1-4, pp. 147–161, 1990.Mathematical Reviews (MathSciNet): MR1084427
Zentralblatt MATH: 0725.90082
Digital Object Identifier: doi:10.1007/BF02283691 - H. Konno and T. Kuno, “Linear multiplicative programming,” Mathematical Programming, vol. 56, no. 1, pp. 51–64, 1992.Mathematical Reviews (MathSciNet): MR1175558
Zentralblatt MATH: 0761.90080
Digital Object Identifier: doi:10.1007/BF01580893 - P. Shen and H. Jiao, “Linearization method for a class of multiplicative programming with exponent,” Applied Mathematics and Computation, vol. 183, no. 1, pp. 328–336, 2006.Mathematical Reviews (MathSciNet): MR2282815
Zentralblatt MATH: 1110.65051
Digital Object Identifier: doi:10.1016/j.amc.2006.05.074 - X.-G. Zhou and K. Wu, “A method of acceleration for a class of multiplicative programming problems with exponent,” Journal of Computational and Applied Mathematics, vol. 223, no. 2, pp. 975–982, 2009.Mathematical Reviews (MathSciNet): MR2478895
Zentralblatt MATH: 1159.65067
Digital Object Identifier: doi:10.1016/j.cam.2008.03.031 - H.-S. Ryoo and N. V. Sahinidis, “Global optimization of multiplicative programs,” Journal of Global Optimization, vol. 26, no. 4, pp. 387–418, 2003.Mathematical Reviews (MathSciNet): MR1989747
Zentralblatt MATH: 1052.90091
Digital Object Identifier: doi:10.1023/A:1024700901538 - S. Schaible, “A note on the sum of a linear and linear-fractional function,” Naval Research Logistics Quarterly, vol. 24, pp. 691–693, 1977.
- T. Matsui, “NP-hardness of linear multiplicative programming and related problems,” Journal of Global Optimization, vol. 9, no. 2, pp. 113–119, 1996.Mathematical Reviews (MathSciNet): MR1411603
Zentralblatt MATH: 0868.90111
Digital Object Identifier: doi:10.1007/BF00121658 - 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.Mathematical Reviews (MathSciNet): MR1263839
Zentralblatt MATH: 0746.90056
Digital Object Identifier: doi:10.1007/BF00120666 - A. Cambini, L. Martein, and S. Schaible, “On maximizing a sum of ratios,” Journal of Information & Optimization Sciences, vol. 10, no. 1, pp. 65–79, 1989.
- H. Konno, T. Kuno, and Y. Yajima, “Global minimization of a generalized convex multiplicative function,” Journal of Global Optimization, vol. 4, no. 1, pp. 47–62, 1994.Mathematical Reviews (MathSciNet): MR1257076
Zentralblatt MATH: 0791.90045
Digital Object Identifier: doi:10.1007/BF01096534 - H. Konno and H. Yamashita, “Minimizing sums and products of linear fractional functions over a polytope,” Naval Research Logistics, vol. 46, no. 5, pp. 583–596, 1999.Mathematical Reviews (MathSciNet): MR1700144
Zentralblatt MATH: 0948.90132
Digital Object Identifier: doi:10.1002/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5 - M. Dür, R. Horst, and N. Van Thoai, “Solving sum-of-ratios fractional programs using efficient points,” Optimization, vol. 49, no. 5-6, pp. 447–466, 2001.Mathematical Reviews (MathSciNet): MR1891078
Digital Object Identifier: doi:10.1080/02331930108844543 - H. Konno and K. Fukaishi, “A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems,” Journal of Global Optimization, vol. 18, no. 3, pp. 283–299, 2000.Mathematical Reviews (MathSciNet): MR1809874
Zentralblatt MATH: 0971.90065
Digital Object Identifier: doi:10.1023/A:1008314922240 - I. Quesada and I. E. Grossmann, “A global optimization algorithm for linear fractional and bilinear programs,” Journal of Global Optimization, vol. 6, no. 1, pp. 39–76, 1995.Mathematical Reviews (MathSciNet): MR1318128
Zentralblatt MATH: 0835.90074
Digital Object Identifier: doi:10.1007/BF01106605 - 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.Mathematical Reviews (MathSciNet): MR1878140
Zentralblatt MATH: 1045.90071
Digital Object Identifier: doi:10.1023/A:1013807129844 - 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.Mathematical Reviews (MathSciNet): MR2324550
Zentralblatt MATH: 1121.90102
Digital Object Identifier: doi:10.1016/j.ejor.2006.08.036 - N. T. H. 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.Mathematical Reviews (MathSciNet): MR1977949
Zentralblatt MATH: 1039.90079
Digital Object Identifier: doi:10.1023/A:1023274721632 - S. Schaible and J. Shi, “Fractional programming: the sum-of-ratios case,” Optimization Methods & Software, vol. 18, no. 2, pp. 219–229, 2003.
- H. D. Sherali, “Global optimization of nonconvex polynomial programming problems having rational exponents,” Journal of Global Optimization, vol. 12, no. 3, pp. 267–283, 1998.Mathematical Reviews (MathSciNet): MR1617944
Zentralblatt MATH: 0905.90146
Digital Object Identifier: doi:10.1023/A:1008249414776 - H. D. Sherali and C. H. Tuncbilek, “New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems,” Operations Research Letters, vol. 21, no. 1, pp. 1–9, 1997.Mathematical Reviews (MathSciNet): MR1471663
Zentralblatt MATH: 0885.90105
Digital Object Identifier: doi:10.1016/S0167-6377(97)00013-8 - N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992.Mathematical Reviews (MathSciNet): MR1620179
- J. B. Lasserre, “Global optimization with polynomials and the problem of moments,” SIAM Journal on Optimization, vol. 11, no. 3, pp. 796–817, 2000/01.Mathematical Reviews (MathSciNet): MR1814045
Digital Object Identifier: doi:10.1137/S1052623400366802 - J. B. Lasserre, “Semidefinite programming versus LP relaxations for polynomial programming,” Mathematics of Operations Research, vol. 27, no. 2, pp. 347–360, 2002.Mathematical Reviews (MathSciNet): MR1908532
Zentralblatt MATH: 1082.90554
Digital Object Identifier: doi:10.1287/moor.27.2.347.322 - P. Shen, “Linearization method of global optimization for generalized geometric programming,” Applied Mathematics and Computation, vol. 162, no. 1, pp. 353–370, 2005.Mathematical Reviews (MathSciNet): MR2108720
Zentralblatt MATH: 1071.65089
Digital Object Identifier: doi:10.1016/j.amc.2003.12.101 - H. Tuy, Convex Analysis and Global Optimization, vol. 22, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.Mathematical Reviews (MathSciNet): MR1615096
- R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, Springer, Berlin, Germany, 2nd edition, 1993. \endinputMathematical Reviews (MathSciNet): MR1274246
- You have access to this content.
- You have partial access to this content.
- You do not have access to this content.
More like this
- A Global Optimization Algorithm for Generalized Quadratic Programming
Jiao, Hongwei and Chen, Yongqiang, Journal of Applied Mathematics, 2013 - A Global Optimization Algorithm for Signomial Geometric Programming Problem
Hou, Xue-Ping, Shen, Pei-Ping, and Chen, Yong-Qiang, Abstract and Applied Analysis, 2014 - Global Optimization for the Sum of Concave-Convex Ratios Problem
Zhou, XueGang and Yang, JiHui, Journal of Applied Mathematics, 2014
- A Global Optimization Algorithm for Generalized Quadratic Programming
Jiao, Hongwei and Chen, Yongqiang, Journal of Applied Mathematics, 2013 - A Global Optimization Algorithm for Signomial Geometric Programming Problem
Hou, Xue-Ping, Shen, Pei-Ping, and Chen, Yong-Qiang, Abstract and Applied Analysis, 2014 - Global Optimization for the Sum of Concave-Convex Ratios Problem
Zhou, XueGang and Yang, JiHui, Journal of Applied Mathematics, 2014 - An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
Jiao, Hong-Wei, Wang, Feng-Hui, and Chen, Yong-Qiang, Journal of Applied Mathematics, 2014 - A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
Horai, Mio, Kobayashi, Hideo, and Nitta, Takashi G., Abstract and Applied Analysis, 2016 - A New Linearizing Method for Sum of Linear Ratios Problem with Coefficients
Jiao, Hongwei and Chen, Yongqiang, Journal of Applied Mathematics, 2014 - A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming
Zhou, Xue-Gang and Cao, Bing-Yuan, Journal of Applied Mathematics, 2013 - A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs
Jiao, Hongwei, Chen, Yong-Qiang, and Cheng, Wei-Xin, Abstract and Applied Analysis, 2014 - A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Yang, Lin-Peng, Shen, Pei-Ping, and Pei, Yong-Gang, Abstract and Applied Analysis, 2014 - Complete Solutions to General Box-Constrained Global Optimization Problems
Wu, Dan and Shang, Youlin, Journal of Applied Mathematics, 2011