Abstract
This paper presents a global optimization approach for solving signomial geometric programming (SGP) problems. We employ an accelerated extended cutting plane (ECP) approach integrated with piecewise linear (PWL) approximations to solve the global optimization of SGP problems. In this approach, we separate the feasible regions determined by the constraints into convex and nonconvex ones in the logarithmic domain. In the nonconvex feasible regions, the corresponding constraint functions are converted into mixed integer linear constraints using PWL approximations, while the other constraints with convex feasible regions are handled by the ECP method. We also use pre-processed initial cuts and batched cuts to accelerate the proposed algorithm. Numerical results show that the proposed approach can solve the global optimization of SGP problems efficiently and effectively.
Similar content being viewed by others
References
Abou-El-Ata, M.O., Kotb, K.A.M.: Multi-item EOQ inventory model with varying holding cost under two restrictions: a geometric programming approach. Prod. Plan. Control 8(6), 608–611 (1997)
Adeli, H., Kamal, O.: Efficient optimization of space trusses. Comput. Struct. 24(3), 501–511 (1986)
Andramonov, M., Rubinov, A.: Cutting angle methods in global optimization. Appl. Math. Lett. 12(3), 95–100 (1999)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Chiang, M.: Balancing transport and physical layers in wireless multihop networks: jointly optimal congestion control and power control. IEEE J. Sel. Areas Commun. 23(1), 104–116 (2005)
Clasen, R.J.: The solution of the chemical equilibrium programming problem with generalized benders decomposition. Oper. Res. 32(1), 70–79 (1984)
Dembo, R.: A set of geometric programming test problems and their solutions. Math. Program. 10(1), 192–213 (1976)
Ding, X., Al-Khayyal, F.: Accelerating convergence of cutting plane algorithms for disjoint bilinear programming. J. Global Optim. 38(3), 421–436 (2007)
Horst, R., Vries, J., Thoai, N.V.: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. Oper. Res. Lett. 7(2), 85–90 (1988)
Kandukuri, S., Boyd, S.: ptimal power control in interference-limited fading wireless channels with outage-probability specifications. IEEE Trans. Wirel. Commun. 1(1), 46–55 (2002)
Kelley, J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703–712 (1960)
Li, H.-L., Lu, H.-C.: Global optimization for generalized geometric programs with mixed free-sign variables. Oper. Res. 57(3), 701–713 (2009)
Li, H.-L., Tsai, J-f: Treating free variables in generalized geometric global optimization programs. J. Global Optim. 33(1), 1–13 (2005)
Lin, M.-H., Tsai, J.-F.: Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems. Eur. J. Oper. Res. 216(1), 17–25 (2012)
Lundell, A., Westerlund, T.: Convex underestimation strategies for signomial functions. Optim. Methods Softw. 24(4–5), 505–522 (2009)
Mandal, N.K., Roy, T., Maiti, M.: Inventory model of deteriorated items with a constraint: a geometric programming approach. Eur. J. Oper. Res. 173(1), 199–210 (2006)
Maranas, C., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351–369 (1997)
Rosenberg, E.: Optimal module sizing in VLSI floorplanning by nonlinear programming. Z. Oper. Res. 33(2), 131–143 (1989)
Sawaya, N., Grossmann, I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29(9), 1891–1913 (2005)
Shen, P., Jiao, H.: Accelerating method of global optimization for signomial geometric programming. J. Comput. Appl. Math. 214(1), 66–77 (2008)
Shen, P., Zhang, K.: Global optimization of signomial geometric programming using linear relaxation. Appl. Math. Comput. 150(1), 99–114 (2004)
Tsai, J.-F., Lin, M.-H., Hu, Y.-C.: On generalized geometric programming problems with non-positive variables. Eur. J. Oper. Res. 178(1), 10–19 (2007)
Tseng, C.-L., Zhan, Y., Zheng, Q., Kumar, M.: A MILP formulation for generalized geometric programming using piecewise-linear approximations. Eur. J. Oper. Res. 245(2), 360–370 (2015)
Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng., 19(Supplement 1), 131–136 (1995) (European Symposium on Computer Aided Process Engineering 3–5)
Westerlund, T., Skrifvars, H., Pörn, R.: An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Eng. 22(3), 357–365 (1998)
Xu, G.: Global optimization of signomial geometric programming problems. Eur. J. Oper. Res. 233(3), 500–510 (2014)
Zhu, Y., Kuno, T.: A disjunctive cutting-plane-based branch-and-cut algorithm for 0–1 mixed-integer convex nonlinear programs. Ind. Eng. Chem. Res. 45(1), 187–196 (2006)
Acknowledgements
This work is in part supported by the AFRL Mathematical Modeling and Optimization Institute, and National Science Foundation through Grant CMMI-1355939. The authors would also like to thank the reviewers and the Editor for their helpful suggestions and comments.
Author information
Authors and Affiliations
Corresponding author
Appendix: Details of the test problems and results
Appendix: Details of the test problems and results
For each test problem, we report the problem statement and the obtained optimal solutions for solving the upper bound problem \((\bar{P}_\epsilon )\) and the lower bound problem \((\underline{P}_\epsilon )\) in Tables 4, 5, 6, 7 and 8. We define the optimality gap as \((\bar{f}_0-\underline{f}_0)/\underline{f}_0\), where \(\bar{f}_0\) and \(\underline{f}_0\) are the obtained upper bound and lower bound for \(f_0\), respectively, to reflect the quality of the obtained solutions. Our obtained optimal solutions for solving the upper bound problems \((\bar{P}_\epsilon )\) are always feasible, which are used to compare with benchmarks. The violated constraints are highlighted in bold face in each table to help observe the feasibility of the solutions provided by different methods.
Example 1
Heat exchange design (Problem 5 in Dembo [7])
Example 2
A 3-stage membrane separation process (Problem 6 in Dembo [7])
Example 3
A 5-stage membrane separation process (Problem 7 in Dembo [7])
Example 4
(Problem 5 in [23])
Example 5
Alkylation process optimization (Problem 3 in Dembo [7])
Rights and permissions
About this article
Cite this article
Zhan, Y., Zheng, Q.P., Tseng, CL. et al. An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming. J Glob Optim 70, 579–599 (2018). https://doi.org/10.1007/s10898-017-0563-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-017-0563-4