owing table. The demand of each grocery store can be supplied by only one truck, but a truck may deliver to more than one grocery. The daily demands of each grocery are shown in table. 1. Formulate an Integer Programming model that can be used to minimize the daily cost of meeting the demands of the five groceries 2. Present an enumeration algorith
Four trucks are available to deliver milk to five groceries. The capacity and daily operating cost of each truck are shown in the following table.
The demand of each grocery store can be supplied by only one truck, but a truck may deliver to more than one grocery. The daily demands of each grocery are shown in table.
1. Formulate an Integer Programming model that can be used to minimize the daily cost of meeting the demands of the five groceries
2. Present an enumeration algorithm to find the optimal solution to the ILP model (Hint: You can use the total demand and the capacities to determine at least how many trucks have to be used to meet the total demand, and which truck has to be used.)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
