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

Investigation of path-following algorithms for signomial geometric programming problems

Author

Listed:
  • Yang, Hsu-Hao
  • Bricker, Dennis L.

Abstract

No abstract is available for this item.

Suggested Citation

  • Yang, Hsu-Hao & Bricker, Dennis L., 1997. "Investigation of path-following algorithms for signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 103(1), pages 230-241, November.
    • Handle: RePEc:eee:ejores:v:103:y:1997:i:1:p:230-241
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00265-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. K. O. Kortanek & Jishan Zhu, 1993. "A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 116-127, February.
    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. Liu, Shiang-Tai, 2006. "Posynomial geometric programming with parametric uncertainty," European Journal of Operational Research, Elsevier, vol. 168(2), pages 345-353, January.
    2. G. S. Mahapatra & T. K. Mandal, 2012. "Posynomial Parametric Geometric Programming with Interval Valued Coefficient," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 120-132, July.
    3. 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.
    4. Wasim Akram Mandal, 2021. "Weighted Tchebycheff Optimization Technique Under Uncertainty," Annals of Data Science, Springer, vol. 8(4), pages 709-731, December.
    5. Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2018. "Integrating geometric programming with rough set theory," Operational Research, Springer, vol. 18(1), pages 1-32, April.
    6. 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.
    7. Wasim Akram Mandal & Sahidul Islam, 2017. "Multiobjective geometric programming problem under uncertainty," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 27(4), pages 85-109.
    8. 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.
    9. 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. J. H. Wu, 1997. "Modified Primal Path-Following Scheme for the Monotone Variational Inequality Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(1), pages 189-208, October.
    2. J. H. Wu, 1998. "Long-Step Primal Path-Following Algorithm for Monotone Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 99(2), pages 509-531, November.

    More about this item

    Statistics

    Access and download statistics

    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:103:y:1997:i:1:p:230-241. 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.