An efficient global approach for posynomial geometric programming problems

INFORMS Journal on Computing

Volumn 23, Issue 3, 2011, Pages 483-492

  Tsai, Jung Fa ^a   Lin, Ming Hua ^b  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b SHIH CHIEN UNIVERSITY   (Taiwan)

Author keywords

Convex underestimation; Global optimization; Piecewise linear function; Posynomial geometric programming; Signomial geometric programming

Indexed keywords

EID: 79961077412     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0403     Document Type: Article

References (51)

1. Adjiman, C. S., I. P. Androulakis, C. A. Floudas. 2000. Global optimization of mixed-integer nonlinear problems. AIChE J. 46(9) 1769-1797.
2. Akrotirianakis, I. G., C. A. Floudas. 2004. A new class of improved convex underestimators for twice continuously differentiable constrained NLPs. J. Global Optim. 30(4) 367-390. (Pubitemid 40308453)
3. Avriel, M., A. C. Williams. 1970. Complementary geometric programming. SIAM J. Appl. Math. 19(1) 125-141.
4. Beale, E. L. M., J. A. Tomlin. 1970. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. J. Lawrence, ed. Proc. Fifth Internat. Conf. OR. Tavistock Publications, London, 447-454.
5. Bradley, J., H. M. Clyne. 1976. Applications of geometric programming to building design problem. L. C. W. Dixon, ed. Optimization in Action. Academic Press, London, 478-516.
6. Caratzoulas, S., C. A. Floudas. 2005. Trigonometric convex underestimator for the base functions in Fourier space. J. Optim. Theory Appl. 124(2) 339-362. (Pubitemid 40900315)
7. Chang, C.-T. 2002. On the posynomial fractional programming problems. Eur. J. Oper. Res. 143(1) 42-52.
8. Choi, J. C., D. L. Bricker. 1996. Effectiveness of a geometric programming algorithm for optimization of machining economics models. Comput. Oper. Res. 23(10) 957-961.
9. Daems, W., G. Gielen, W. Sansen. 2003. Simulation-based generation of posynomial performance models for the sizing of analog integrated circuits. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 22(5) 517-534.
10. Dembo, R. S. 1976. A set of geometric programming test problems and their solutions. Math. Programming 10(1) 192-213.
11. Dembo, R. S., M. Avriel. 1978. Optimal design of a membrane separation process using signomial programming. Math. Programming 15(1) 12-25. (Pubitemid 8632872)
12. Duffin, R. J., E. L. Peterson. 1972. Reversed geometric programming treated by harmonic means. Indian Univ. Math. J. 22 531-550.
13. Floudas, C. A. 2000. Deterministic Global Optimization: Theory, Methods and Application. Nonconvex Optimization and Its Applications, Vol. 37. Kluwer Academic Publishers, Boston.
14. Floudas, C. A., V. Visweswaran. 1994. Quadratic optimization. R. Horst, P. M. Pardalos, eds. Handbook of Global Optimization. Nonconvex Optimization and Its Applications, 1st ed. Kluwer Academic Publishers, Boston, 217-270.
15. Floudas, C. A., I. G. Akrotirianakis, S. Caratzoulas, C. A. Meyer, J. Kallrath. 2005. Global optimization in the 21st century: Advances and challenges. Comput. Chem. Engrg. 29(6) 1185-1202. (Pubitemid 40633581)
16. Floudas, C. A., P. M. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gümüs, S. T. Harding, J. L. Klepeis, C. A. Meyer, C. A. Schweiger. 1999. Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Boston.
17. Gounaris, C. E., C. A. Floudas. 2008. Convexity of products of univariate functions and convexification transformations for geometric programming. J. Optim. Theory Appl. 138(3) 407-427.
18. Hamed, A. S. E. 1991. Calculation of bounds on variables and underestimating convex functions for nonconvex functions. Ph.D. thesis, George Washington University, Washington, DC.
19. Hershenson, M. D., S. P. Boyd, T. H. Lee. 2001. Optimal design of a CMOS op-amp via geometric programming. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 20(1) 1-21. (Pubitemid 32296860)
20. Jung, H., C. M. Klein. 2001. Optimal inventory policies under decreasing cost functions via geometric programming. Eur. J. Oper. Res. 132(3) 628-642. (Pubitemid 32487104)
21. Kortanek, K. O., X. Xu, Y. Ye. 1997. An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Programming 76(1) 155-181. (Pubitemid 127417009)
22. Lee, W. J. 1993. Determining order quantity and selling price by geometric programming: Optimal solution, bounds, and sensitivity. Decision Sci. 24(1) 76-87.
23. Li, H. L., J.-F. Tsai, C. A. Floudas. 2008. Convex underestimation for posynomial functions of positive variables. Optim. Lett. 2(3) 333-340. (Pubitemid 351653785)
24. Li, H.-L., H.-C. Lu, C.-H. Huang, N.-Z. Hu. 2009. A superior representation method for piecewise linear functions. INFORMS J. Comput. 21(2) 314-321.
25. LINGO. 2004. Release 11.0. Lindo System, Chicago.
26. Lu, H.-C., H.-L. Li, C. E. Gounaris, C. A. Floudas. 2010. Convex relaxation for solving posynomial programs. J. Global Optim. 46(1) 147-154.
27. Lundell, A., T. Westerlund. 2009a. Convex underestimation strategies for signomial functions. Optim. Methods Software 24(4-5) 505-522.
28. Lundell, A., T. Westerlund. 2009b. On the relationship between power and exponential transformations for positive signomial functions. Chemical Engrg. Trans. 17 1287-1292.
29. Lundell, A., J. Westerlund, T. Westerlund. 2009. Some transformation techniques with applications in global optimization. J. Global Optim. 43(2-3) 391-405.
30. Maranas, C. D., C. A. Floudas. 1995. Finding all solutions of nonlinearly constrained systems of equations. J. Global Optim. 7(2) 143-182.
31. Maranas, C. D., C. A. Floudas. 1997. Global optimization in generalized geometric programming. Comput. Chemical Engrg. 21(4) 351-370.
32. Meyer, C. A., C. A. Floudas. 2003. Trilinear monomials with positive or negative domains: Facets of the convex and concave envelopes. C. A. Floudas, P. M. Pardalos, eds. Frontiers in Global Optimization. Kluwer Academic Publishers, Boston, 327-352.
33. Meyer, C. A., C. A. Floudas. 2004. Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes. J. Global Optim. 29(2) 125-155.
34. Passy, U. 1971. Generalized weighted mean programming. SIAM J. Appl. Math. 20(4) 763-778.
35. Passy, U., D. J. Wilde. 1967. Generalized polynomial optimization. SIAM J. Appl. Math. 15(5) 1344-1356.
36. Pörn, R., K.-M. Björk, T. Westerlund. 2008. Global solution of optimization problems with signomial parts. Discrete Optim. 5(1) 108-120. (Pubitemid 351180037)
37. Pörn, R., I. Harjunkoski, T. Westerlund. 1999. Convexification of different classes of non-convex MINLP problems. Comput. Chemical Engrg. 23(3) 439-448. (Pubitemid 29179700)
38. Prasad, A. V. S. R. K., P. N. Rao, U. R. K. Rao. 1997. Optimal selection of process parameters for turning operations in a CAPP system. Internat. J. Production Res. 35(6) 1495-1522. (Pubitemid 127549679)
39. Rijckaert, M. J., X. M. Martens. 1978. Comparison of generalized geometric programming algorithms. J. Optim. Theory Appl. 26(2) 205-242. (Pubitemid 9437207)
40. Ryoo, H. S., N. V. Sahinidis. 2001. Analysis of bounds for multilinear functions. J. Global Optim. 19(4) 403-424. (Pubitemid 33672346)
41. Scott, C. H., T. R. Jefferson. 1995. Allocation of resources in project management. Internat. J. Systems Sci. 26(2) 413-420.
42. Shen, P., K. Zhang. 2004. Global optimization of signomial geometric programming using linear relaxation. Appl. Math. Comput. 150(1) 99-114.
43. Sherali, H. D. 1998. Global optimization of nonconvex polynomial programming problems having rational exponents. J. Global Optim. 12(3) 267-283. (Pubitemid 128508068)
44. Sherali, H. D., C. H. Tuncbilek. 1992. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1) 101-112.
45. Sherali, H. D., C. H. Tuncbilek. 1995. A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7(1) 1-31.
46. Tsai, J.-F., H.-L. Li, N.-Z. Hu. 2002. Global optimization for signomial discrete programming problems in engineering design. Engrg. Optim. 34(6) 613-622.
47. Vielma, J. P., G. Nemhauser. 2011. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Programming 128(1-2) 49-72.
48. Westerlund, T. 2007. Some transformation techniques in global optimization. L. Liberti, N. Maculan, eds. Global Optimization: From Theory to Implementation. Springer, New York, 45-74.
49. Westerlund, T., J. Westerlund. 2003. GGPECP-An algorithm for solving non-convex MINLP problems by cutting plane and transformation techniques. Chemical Engrg. Trans. 3 1045-1050.
50. Worrall, B. M., M. A. Hall. 1982. The analysis of an inventory control model using posynomial geometric programming. Internat. J. Production Res. 20(5) 657-667.
51. Yang, H.-H., D. L. Bricker. 1997. Investigation of path-following algorithms for signomial geometric programming problems. Eur. J. Oper. Res. 103(1) 230-241. (Pubitemid 127396742)