IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v70y2018i3d10.1007_s10898-017-0563-4.html
   My bibliography  Save this article

An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming

Author

Listed:
  • Yiduo Zhan

    (University of Central Florida)

  • Qipeng P. Zheng

    (University of Central Florida)

  • Chung-Li Tseng

    (UNSW)

  • Eduardo L. Pasiliao

    (Air Force Research Laboratory)

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.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:70:y:2018:i:3:d:10.1007_s10898-017-0563-4
    DOI: 10.1007/s10898-017-0563-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0563-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-017-0563-4?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. Mandal, Nirmal Kumar & Roy, Tapan Kumar & Maiti, Manoranjan, 2006. "Inventory model of deteriorated items with a constraint: A geometric programming approach," European Journal of Operational Research, Elsevier, vol. 173(1), pages 199-210, August.
    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. 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. 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.
    6. Richard J. Clasen, 1984. "The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition," Operations Research, INFORMS, vol. 32(1), pages 70-79, February.
    7. 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.
    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. 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.
    2. 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.

    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. 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.
    2. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    3. 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.
    4. 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.
    5. 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.
    6. 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).
    7. Wasim Akram Mandal, 2021. "Weighted Tchebycheff Optimization Technique Under Uncertainty," Annals of Data Science, Springer, vol. 8(4), pages 709-731, December.
    8. 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.
    9. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    10. 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.
    11. Ata Allah Taleizadeh & Leila Aliabadi & Park Thaichon, 2022. "A sustainable inventory system with price-sensitive demand and carbon emissions under partial trade credit and partial backordering," Operational Research, Springer, vol. 22(4), pages 4471-4516, September.
    12. 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.
    13. Liu, Ming & Ding, Yueyu & Chu, Feng & Dolgui, Alexandre & Zheng, Feifeng, 2024. "Robust actions for improving supply chain resilience and viability," Omega, Elsevier, vol. 123(C).
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Dennis L. Bricker & K. O. Kortanek, 2017. "Perfect Duality in Solving Geometric Programming Problems Under Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 1055-1065, June.

    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:spr:jglopt:v:70:y:2018:i:3:d:10.1007_s10898-017-0563-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.