IDEAS home Printed from https://ideas.repec.org/a/ids/ijpman/v11y2018i6p705-721.html
   My bibliography  Save this article

Solving the problem of industry by formulating it as a capacitated transportation problem

Author

Listed:
  • Kavita Gupta

Abstract

This paper presents the solution to the problem of the manager of a trading firm, D.M Chemicals, who deals in the trade of marble powder. The problem of the manager is to determine the quantity (in tons) of marble powder that the firm should purchase from different sellers and sell to the different buyers such that the total cartage and relative purchasing cost is minimised provided the demand and supply conditions are satisfied and the extra demand is also met during emergency situations. The problem under consideration is modelled as a linear plus linear fractional capacitated transportation problem with enhanced flow. The data is taken from the account keeping books of the firm. The solution so obtained by using the developed algorithm is compared with the existing data. Moreover, the solution obtained is verified by a computing software, Excel Solver.

Suggested Citation

  • Kavita Gupta, 2018. "Solving the problem of industry by formulating it as a capacitated transportation problem," International Journal of Procurement Management, Inderscience Enterprises Ltd, vol. 11(6), pages 705-721.
    • Handle: RePEc:ids:ijpman:v:11:y:2018:i:6:p:705-721
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=95653
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    2. Zhi-Ming Chen & Cheng-Hsiung Lee & Hung-Lin Lai, 2022. "Speedup the optimization of maximal closure of a node-weighted directed acyclic graph," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1413-1437, December.

    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:ijpman:v:11:y:2018:i:6:p:705-721. 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=255 .

    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.