| Article ID: | iaor20091254 |
| Country: | Cuba |
| Volume: | 29 |
| Issue: | 1 |
| Start Page Number: | 63 |
| End Page Number: | 70 |
| Publication Date: | Jan 2008 |
| Journal: | Revista Investigacin Operacional |
| Authors: | Nerali Luka, Luka Zrinka, Hunjet Dubravko |
| Keywords: | transportation: general, production, programming: integer, programming: linear |
In this paper we formulate two new models of the production–transportation problem which can be described as follows. Let us suppose that there are several plants at different locations producing certain number of products and large number of customers for their products. Each plant can operate in several modes characterized by different quantities of products and variable production costs. The customers' demand for each product during the considered time period is known. We consider the problem of finding the production program for each plant as well as the transportation of products to customers for which the sum of the production and transportation costs is minimized given the condition that each customer can satisfy its demand for a given type of product from one plant only. We also formulate the problem as a bi-level mixed-integer programming problem.