IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v56y2019i1d10.1007_s12597-019-00363-6.html
   My bibliography  Save this article

Geometric programming technique to optimize power distribution system

Author

Listed:
  • R. R. Ota

    (Institute of Technical Education and Research)

  • J. C. Pati

    (C.V. Raman College of Engineering)

  • A. K. Ojha

    (IIT Bhubaneswar)

Abstract

Geometric programming is an important tool for solving certain optimization problems. In this paper, multi objective geometric programming with $$\epsilon $$ ϵ -constraint method is used to find the maximum radius of a circular power supply substation to supply power in a particular region. The main aim of the proposed method is to formulate a mathematical model for the efficient distribution of the power supply to maximum area from a circular substation with least investment and minimum waste. The proposed multi-objective optimization model has been solved to generate Pareto optimal solutions using weighted sum method. The results so obtained have been compared with that of $$\epsilon $$ ϵ -constraint method by considering suitable numerical examples.

Suggested Citation

  • R. R. Ota & J. C. Pati & A. K. Ojha, 2019. "Geometric programming technique to optimize power distribution system," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 282-299, March.
    • Handle: RePEc:spr:opsear:v:56:y:2019:i:1:d:10.1007_s12597-019-00363-6
    DOI: 10.1007/s12597-019-00363-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00363-6
    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/s12597-019-00363-6?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. Elmor Peterson, 2001. "The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality," Annals of Operations Research, Springer, vol. 105(1), pages 109-153, July.
    Full references (including those not matched with items on IDEAS)

    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. Liu, Shiang-Tai, 2006. "Posynomial geometric programming with parametric uncertainty," European Journal of Operational Research, Elsevier, vol. 168(2), pages 345-353, January.
    2. 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.
    3. Wasim Akram Mandal, 2021. "Weighted Tchebycheff Optimization Technique Under Uncertainty," Annals of Data Science, Springer, vol. 8(4), pages 709-731, December.
    4. Qingjie Hu & Jiguang Wang & Yu Chen, 2020. "New dualities for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 287(1), pages 233-255, April.
    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. S. K. Mishra & Vinay Singh & Vivek Laha, 2016. "On duality for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 243(1), pages 249-272, August.
    7. 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.
    8. Frenk, J.B.G. & Kassay, G., 2004. "Introduction to Convex and Quasiconvex Analysis," ERIM Report Series Research in Management ERS-2004-075-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Liu, Shiang-Tai, 2008. "Posynomial geometric programming with interval exponents and coefficients," European Journal of Operational Research, Elsevier, vol. 186(1), pages 17-27, April.

    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:opsear:v:56:y:2019:i:1:d:10.1007_s12597-019-00363-6. 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.