IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v38y2020i1p19-30.html
   My bibliography  Save this article

A modified generalised inverse method for solving geometric programming problems with extended degrees of difficulties (K ≥ 0)

Author

Listed:
  • Harrison O. Amuji
  • Fidelis I. Ugwuowo
  • Walford I.E. Chukwu
  • Peter. I. Uche

Abstract

We have developed a new method of solving geometric programming problems with as many positive degrees of difficulties as possible. Geometric programming has no direct solution whenever its degrees of difficulties are greater than zero; this has hindered the development of geometric programming and discouraged so many researchers into the area. The indirect solution, which has been in existence, involves the conversion of geometric programming problems to linear programming, separable programming, augmented programming etc. These conversions make the beauty of geometric programming to be lost and also terminate the existence of geometric programming. The newly developed method (modified generalised inverse method) consistently produces global optimal solutions; satisfies the orthogonality and normality conditions; optimal objective function; and produce optimal primal and dual decision variables which satisfy the optimal objective function. The method was applied on some positive degrees of difficulty geometric programming problems and the results compare to the results from existing methods. The method was validated by some proposition; corollary and lemma. With this breakthrough, geometric programming problems can be modeled and solved without restrictions.

Suggested Citation

  • Harrison O. Amuji & Fidelis I. Ugwuowo & Walford I.E. Chukwu & Peter. I. Uche, 2020. "A modified generalised inverse method for solving geometric programming problems with extended degrees of difficulties (K ≥ 0)," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 38(1), pages 19-30.
    • Handle: RePEc:ids:ijores:v:38:y:2020:i:1:p:19-30
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=106358
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijores:v:38:y:2020:i:1:p:19-30. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.