IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v63y2012i7p1006-1009.html
   My bibliography  Save this article

The transportation problem revisited—preprocessing before using the primal–dual algorithm

Author

Listed:
  • S Haddadi

    (University of the 8th of May, 1945, Guelma, Algeria)

  • O Slimani

    (Badji Mokhtar University, Lanos Lab, Annaba, Algeria)

Abstract

We give a necessary condition for the existence of a feasible solution for the transportation problem through a set of admissible cells, and an algorithm to find a set of admissible cells that satisfies the necessary condition. Either there exists a feasible solution through the admissible cells (which is therefore optimal since the complementary slackness conditions hold) or we could begin using the primal–dual algorithm (PDA) at this point. Our approach has two important advantages: Our O(mn) procedure for updating dual variables takes much less computing time than any procedure for solving a maximum flow problem in the primal phase of the PDA. We are never concerned by the degeneracy problem as we are not seeking basic solutions, but admissible cells. An example is presented for illustrating our approach. We finally provide computational results for a set of 30 randomly generated instances. Comparison of our method with the PDA reveals a real speed up.

Suggested Citation

  • S Haddadi & O Slimani, 2012. "The transportation problem revisited—preprocessing before using the primal–dual algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(7), pages 1006-1009, July.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:7:p:1006-1009
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n7/pdf/jors2011106a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v63/n7/full/jors2011106a.html
    File Function: Link to full text HTML
    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.

    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:pal:jorsoc:v:63:y:2012:i:7:p:1006-1009. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.