Finding a Minimal Transport Cost for a Transport Problem
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.
Volume (Year): X (2010)
Issue (Month): 1 (May)
|Contact details of provider:|| Web page: http://www.univ-ovidius.ro/facultatea-de-stiinte-economice|
More information through EDIRC
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 references are entirely missing, you can add them using this form.