Advanced Search
MyIDEAS: Login to save this article or follow this journal

Finding a Minimal Transport Cost for a Transport Problem


Author Info

  • Dumitru Ileana

    (Petroleum-Gas University of Ploiesti)

  • Teodorescu Ana-Maria

    (Petroleum-Gas University of Ploiesti)

Registered author(s):


    This paper is about finding a solution to a transport problem, using visual programming applications, with one of the specialty software – Visual Basic. Among company’s spendings there are product transport spendings suported by economic agent in his way from each producers to beneficiaries. We presented the transport problem under the form of a table which contains entry data: producers (ex. Bucuresti, Ploiesti, Arad, Pitesti), beneficiaries (ex. Metro, Kaufland, Carrefour, Sellgros) and transport costs from each producers to beneficiaries. We used the minimum cost line method and north-west corner method as economic mathematic methods for determining a minimal transport cost.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by Ovidius University of Constantza, Faculty of Economic Sciences in its journal Ovidius University Annals, Economic Sciences Series.

    Volume (Year): X (2010)
    Issue (Month): 1 (May)
    Pages: 633-637

    as in new window
    Handle: RePEc:ovi:oviste:v:10:y:2010:i:1:p:633-637

    Contact details of provider:
    Web page:
    More information through EDIRC

    Related research

    Keywords: transport problem; transport cost; solution; visual programming application;

    Find related papers by JEL classification:


    No references listed on IDEAS
    You can help add them by filling out this form.



    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:ovi:oviste:v:10:y:2010:i:1:p:633-637. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jeflea Victor).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.