IDEAS home Printed from https://ideas.repec.org/a/arp/ajoams/2018p34-42.html
   My bibliography  Save this article

Graph Contraction Technique as an Alternative Approach to Solving Balanced Transportation Problem

Author

Listed:
  • Ben Obakpo Johnson*

    (Department of Mathematics and Statistics, Federal University, Wukari, Taraba State, Nigeria)

  • Dr. A. D. Akwu

    (Department of Mathematics/Statistics/Computer Science, University of Agriculture, Makurdi, Benue State, Nigeria)

  • Dr. T. T. Ashezua

    (Department of Mathematics/Statistics/Computer Science, University of Agriculture, Makurdi, Benue State, Nigeria)

Abstract

In this work, we present an alternative method, namely, Graph Contraction Technique for solving the transportation problem which is a special class of Linear Programming Problem. We represented the transportation problem as a bipartite graph and solved it iteratively. To illustrate the method, two numerical examples are solved and the obtained solutions are compared with those obtained via Vogel approximation method. The present method yields the same initial basic feasible solutions of the problem. However, the present method is found to be very easy to understand; use and implement compared to the Vogel approximation method and can be applied on real life transportation problems by the decision makers.

Suggested Citation

  • Ben Obakpo Johnson* & Dr. A. D. Akwu & Dr. T. T. Ashezua, 2018. "Graph Contraction Technique as an Alternative Approach to Solving Balanced Transportation Problem," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(5), pages 34-42, 05-2018.
    • Handle: RePEc:arp:ajoams:2018:p:34-42
    DOI: arpgweb.com/?ic=journal&journal=17&info=aims
    as

    Download full text from publisher

    File URL: https://www.arpgweb.com/pdf-files/ajams4(5)34-42.pdf
    Download Restriction: no
    File URL: https://www.arpgweb.com/?ic=journal&info=archive&journal=17&month=05-2018&issue=5&volume=4
    Download Restriction: no
    File URL: https://libkey.io/arpgweb.com/?ic=journal&journal=17&info=aims?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
    ---><---

    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:arp:ajoams:2018:p:34-42. 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: Managing Editor (email available below). General contact details of provider: http://arpgweb.com/index.php?ic=journal&journal=17&info=aims .

    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.