QUESTION; 1. Create a Linear Programming Model to minimize the total cost of transportation throughout the...

Transcribed Image Text:

QUESTION; 1. Create a Linear Programming Model to minimize the total cost of transportation throughout the supply chain depicted in the following figure. Plant 1 Plant 2 Plant Z Silos Packaging lines Silo 2 Distribution center Commercial customers Retailers/ customers 2. You are asked to create; a. (15 points) Nodes with city names and the tables of distances between nodes accordingly (km), b. (15 points) The tables of costs for transporting one unit of product for one kilometer (TL/Unit*Km) between Plants and Silos. c. (20) Decision variables (Xij). d. (20 points) Objective function (In short form, but the total cost for each group will be indicated). e. (30 points) Constrain functions (At least two constrain functions for each group) 3. In your scenario, the following numbers will be taken as a basis for determining the number of stations. MINIMUM NUMBER OF NODES Packing Line 3 Distribution Commercial Center 4 Customer 9 Retailer/ Customer 8 Plant 4 4. Assumptions; a. One type of product will be transported. b. The system will be a balanced supply chain. In other words, the inputs will be equal to related outputs. 5. No solution for the model is required. QUESTION; 1. Create a Linear Programming Model to minimize the total cost of transportation throughout the supply chain depicted in the following figure. Plant 1 Plant 2 Plant Z Silos Packaging lines Silo 2 Distribution center Commercial customers Retailers/ customers 2. You are asked to create; a. (15 points) Nodes with city names and the tables of distances between nodes accordingly (km), b. (15 points) The tables of costs for transporting one unit of product for one kilometer (TL/Unit*Km) between Plants and Silos. c. (20) Decision variables (Xij). d. (20 points) Objective function (In short form, but the total cost for each group will be indicated). e. (30 points) Constrain functions (At least two constrain functions for each group) 3. In your scenario, the following numbers will be taken as a basis for determining the number of stations. MINIMUM NUMBER OF NODES Packing Line 3 Distribution Commercial Center 4 Customer 9 Retailer/ Customer 8 Plant 4 4. Assumptions; a. One type of product will be transported. b. The system will be a balanced supply chain. In other words, the inputs will be equal to related outputs. 5. No solution for the model is required. QUESTION; 1. Create a Linear Programming Model to minimize the total cost of transportation throughout the supply chain depicted in the following figure. Plant 1 Plant 2 Plant Z Silos Packaging lines Silo 2 Distribution center Commercial customers Retailers/ customers 2. You are asked to create; a. (15 points) Nodes with city names and the tables of distances between nodes accordingly (km), b. (15 points) The tables of costs for transporting one unit of product for one kilometer (TL/Unit*Km) between Plants and Silos. c. (20) Decision variables (Xij). d. (20 points) Objective function (In short form, but the total cost for each group will be indicated). e. (30 points) Constrain functions (At least two constrain functions for each group) 3. In your scenario, the following numbers will be taken as a basis for determining the number of stations. MINIMUM NUMBER OF NODES Packing Line 3 Distribution Commercial Center 4 Customer 9 Retailer/ Customer 8 Plant 4 4. Assumptions; a. One type of product will be transported. b. The system will be a balanced supply chain. In other words, the inputs will be equal to related outputs. 5. No solution for the model is required.