IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v56y2013i3p1123-1142.html
   My bibliography  Save this article

Branch-reduction-bound algorithm for generalized geometric programming

Author

Listed:
  • Peiping Shen
  • Xiaoai Li

Abstract

This article presents a branch-reduction-bound algorithm for globally solving the generalized geometric programming problem. To solve the problem, an equivalent monotonic optimization problem whose objective function is just a simple univariate is proposed by exploiting the particularity of this problem. In contrast to usual branch-and-bound methods, in the algorithm the upper bound of the subproblem in each node is calculated easily by arithmetic expressions. Also, a reduction operation is introduced to reduce the growth of the branching tree during the algorithm search. The proposed algorithm is proven to be convergent and guarantees to find an approximative solution that is close to the actual optimal solution. Finally, numerical examples are given to illustrate the feasibility and efficiency of the present algorithm. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Peiping Shen & Xiaoai Li, 2013. "Branch-reduction-bound algorithm for generalized geometric programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1123-1142, July.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:3:p:1123-1142
    DOI: 10.1007/s10898-012-9933-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9933-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9933-0?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. 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.
    2. Qu, Shaojian & Zhang, Kecun & Wang, Fusheng, 2008. "A global optimization using linear relaxation for generalized geometric programming," European Journal of Operational Research, Elsevier, vol. 190(2), pages 345-356, October.
    3. El Barmi, Hammou & Dykstra, Richard L., 1994. "Restricted multinomial maximum likelihood estimation based upon Fenchel duality," Statistics & Probability Letters, Elsevier, vol. 21(2), pages 121-130, September.
    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. 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.
    3. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    4. 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.

    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. Karabatsos, George & Walker, Stephen G., 2007. "Bayesian nonparametric inference of stochastically ordered distributions, with Pólya trees and Bernstein polynomials," Statistics & Probability Letters, Elsevier, vol. 77(9), pages 907-913, May.
    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. 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.
    4. 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.
    5. Ying Ji & Mark Goh & Robert Souza, 2016. "Proximal Point Algorithms for Multi-criteria Optimization with the Difference of Convex Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 280-289, April.
    6. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    7. 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.
    8. Xing, Li-Ning & Chen, Ying-Wu & Yang, Ke-Wei, 2009. "A novel mutation operator based on the immunity operation," European Journal of Operational Research, Elsevier, vol. 197(2), pages 830-833, September.
    9. Peiping Shen & Yuan Ma & Yongqiang Chen, 2011. "Global optimization for the generalized polynomial sum of ratios problem," Journal of Global Optimization, Springer, vol. 50(3), pages 439-455, July.
    10. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    11. 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.

    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:56:y:2013:i:3:p:1123-1142. 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.