IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v216y2012i1p17-25.html
   My bibliography  Save this article

Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems

Author

Listed:
  • Lin, Ming-Hua
  • Tsai, Jung-Fa

Abstract

Many global optimization approaches for solving signomial geometric programming problems are based on transformation techniques and piecewise linear approximations of the inverse transformations. Since using numerous break points in the linearization process leads to a significant increase in the computational burden for solving the reformulated problem, this study integrates the range reduction techniques in a global optimization algorithm for signomial geometric programming to improve computational efficiency. In the proposed algorithm, the non-convex geometric programming problem is first converted into a convex mixed-integer nonlinear programming problem by convexification and piecewise linearization techniques. Then, an optimization-based approach is used to reduce the range of each variable. Tightening variable bounds iteratively allows the proposed method to reach an approximate solution within an acceptable error by using fewer break points in the linearization process, therefore decreasing the required CPU time. Several numerical experiments are presented to demonstrate the advantages of the proposed method in terms of both computational efficiency and solution quality.

Suggested Citation

  • Lin, Ming-Hua & Tsai, Jung-Fa, 2012. "Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 216(1), pages 17-25.
    • Handle: RePEc:eee:ejores:v:216:y:2012:i:1:p:17-25
    DOI: 10.1016/j.ejor.2011.06.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711006023
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.06.046?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C. E. Gounaris & C. A. Floudas, 2008. "Convexity of Products of Univariate Functions and Convexification Transformations for Geometric Programming," Journal of Optimization Theory and Applications, Springer, vol. 138(3), pages 407-427, September.
    2. Han-Lin Li & Hao-Chun Lu, 2009. "Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables," Operations Research, INFORMS, vol. 57(3), pages 701-713, June.
    3. Hao-Chun Lu & Han-Lin Li & Chrysanthos Gounaris & Christodoulos Floudas, 2010. "Convex relaxation for solving posynomial programs," Journal of Global Optimization, Springer, vol. 46(1), pages 147-154, January.
    4. Tsai, Jung-Fa & Lin, Ming-Hua & Hu, Yi-Chung, 2007. "On generalized geometric programming problems with non-positive variables," European Journal of Operational Research, Elsevier, vol. 178(1), pages 10-19, April.
    5. Han-Lin Li & Hao-Chun Lu & Chia-Hui Huang & Nian-Ze Hu, 2009. "A Superior Representation Method for Piecewise Linear Functions," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 314-321, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jiao, Hongwei & Liu, Sanyang & Lu, Nan, 2015. "A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 973-985.
    2. Lu, Hao-Chun, 2020. "Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    3. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    4. Tseng, Chung-Li & Zhan, Yiduo & Zheng, Qipeng P. & Kumar, Manish, 2015. "A MILP formulation for generalized geometric programming using piecewise-linear approximations," European Journal of Operational Research, Elsevier, vol. 245(2), pages 360-370.
    5. Wasim Akram Mandal, 2021. "Weighted Tchebycheff Optimization Technique Under Uncertainty," Annals of Data Science, Springer, vol. 8(4), pages 709-731, December.
    6. Qingcai Yang & Shuying Li & Yunpeng Cao & Fengshou Gu & Ann Smith, 2018. "A Gas Path Fault Contribution Matrix for Marine Gas Turbine Diagnosis Based on a Multiple Model Fault Detection and Isolation Approach," Energies, MDPI, vol. 11(12), pages 1-21, November.
    7. Rashed Khanjani-Shiraz & Salman Khodayifar & Panos M. Pardalos, 2021. "Copula theory approach to stochastic geometric programming," Journal of Global Optimization, Springer, vol. 81(2), pages 435-468, October.
    8. Leyla Aliabadi & Seyed Hessameddin Zegordi & Ali Husseinzadeh Kashan & Mohammad Ali Rastegar, 2024. "A sustainable supply chain model for time-varying deteriorating items under the promotional cost-sharing policy and three-level trade credit financing," Operational Research, Springer, vol. 24(2), pages 1-59, June.
    9. Yiduo Zhan & Qipeng P. Zheng & Chung-Li Tseng & Eduardo L. Pasiliao, 2018. "An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming," Journal of Global Optimization, Springer, vol. 70(3), pages 579-599, March.
    10. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    11. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 1075-1078, September.
    12. Shen, Peiping & Zhu, Zeyi & Chen, Xiao, 2019. "A practicable contraction approach for the sum of the generalized polynomial ratios problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 36-48.
    13. Armin Jabbarzadeh & Leyla Aliabadi & Reza Yazdanparast, 2021. "Optimal payment time and replenishment decisions for retailer’s inventory system under trade credit and carbon emission constraints," Operational Research, Springer, vol. 21(1), pages 589-620, March.
    14. Andreas Lundell & Anders Skjäl & Tapio Westerlund, 2013. "A reformulation framework for global optimization," Journal of Global Optimization, Springer, vol. 57(1), pages 115-141, September.
    15. Mahdiloo, Mahdi & Toloo, Mehdi & Duong, Thach-Thao & Farzipoor Saen, Reza & Tatham, Peter, 2018. "Integrated data envelopment analysis: Linear vs. nonlinear model," European Journal of Operational Research, Elsevier, vol. 268(1), pages 255-267.
    16. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 243-265, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hao-Chun Lu & Liming Yao, 2019. "Efficient Convexification Strategy for Generalized Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 226-234, April.
    2. Jung-Fa Tsai & Ming-Hua Lin, 2011. "An Efficient Global Approach for Posynomial Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 483-492, August.
    3. Lu, Hao-Chun, 2020. "Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    4. Tseng, Chung-Li & Zhan, Yiduo & Zheng, Qipeng P. & Kumar, Manish, 2015. "A MILP formulation for generalized geometric programming using piecewise-linear approximations," European Journal of Operational Research, Elsevier, vol. 245(2), pages 360-370.
    5. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2017. "Linear Reformulation of Polynomial Discrete Programming for Fast Computation," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 108-122, February.
    6. Yiduo Zhan & Qipeng P. Zheng & Chung-Li Tseng & Eduardo L. Pasiliao, 2018. "An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming," Journal of Global Optimization, Springer, vol. 70(3), pages 579-599, March.
    7. Warren P. Adams & Stephen M. Henry, 2012. "Base-2 Expansions for Linearizing Products of Functions of Discrete Variables," Operations Research, INFORMS, vol. 60(6), pages 1477-1490, December.
    8. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2013. "A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 643-653, November.
    9. Hao-Chun Lu, 2017. "Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms," Journal of Global Optimization, Springer, vol. 68(1), pages 95-123, May.
    10. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    11. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 1075-1078, September.
    12. Liu, Haoxiang & Wang, David Z.W., 2015. "Global optimization method for network design problem with stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 20-39.
    13. Rashed Khanjani Shiraz & Madjid Tavana & Hirofumi Fukuyama & Debora Di Caprio, 2017. "Fuzzy chance-constrained geometric programming: the possibility, necessity and credibility approaches," Operational Research, Springer, vol. 17(1), pages 67-97, April.
    14. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    15. S. Fanelli, 2011. "A New Algorithm for Box-Constrained Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 175-196, April.
    16. João Teles & Pedro Castro & Henrique Matos, 2013. "Multi-parametric disaggregation technique for global optimization of polynomial programming problems," Journal of Global Optimization, Springer, vol. 55(2), pages 227-251, February.
    17. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 243-265, July.
    18. Zejian Qin & Bingyuan Cao & Shu-Cherng Fang & Xiao-Peng Yang, 2018. "Geometric Programming with Discrete Variables Subject to Max-Product Fuzzy Relation Constraints," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-8, April.
    19. Ruth Misener & Christodoulos A. Floudas, 2014. "A Framework for Globally Optimizing Mixed-Integer Signomial Programs," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 905-932, June.
    20. Shao, Yu & Zhou, Xinhong & Yu, Tingchao & Zhang, Tuqiao & Chu, Shipeng, 2024. "Pump scheduling optimization in water distribution system based on mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1140-1151.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:216:y:2012:i:1:p:17-25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.