Use Python-Gurobi to find the optimal values. Enter the numerical values in the blank response fields....

 

Transcribed Image Text:

Use Python-Gurobi to find the optimal values. Enter the numerical values in the blank response fields. A company wants to plan the distribution of its products between the supply nodes and demand nodes. The following arrays provide ) the exact demand amount of demand node j, i) the unit transportation cost between supply node i and demand node j, and il) the supply amount of supply node i. demand - [26, 41, 33, 31, 21] cost = [1, 7, 4, 1, 61. (5, 2, 3, 5, 41. 17, 4, 4, 6, 21. 12. 6, 1, 1, 41) supply = (310, 295, 420, 310] (a, 1 pts) Formulate this problem to minimize the total cost (assume that the decision variables can be fractional). What is the optimal value? (b, 2 pts) In addition to Part (a), auppose that at least 3 units must be sent between each supply-demand pair. What is the optimal value with this additional constraint? (c, 2 pts) in addition to Part (a), suppose that the amount sent from 3 to 1 is not less than the amount sent from 4 to 3. What is the optimal value with this additional constraint? Note: This part is independent of Part (b). You can comment the lines in your code related to Part (b). Use Python-Gurobi to find the optimal values. Enter the numerical values in the blank response fields. A company wants to plan the distribution of its products between the supply nodes and demand nodes. The following arrays provide ) the exact demand amount of demand node j, i) the unit transportation cost between supply node i and demand node j, and il) the supply amount of supply node i. demand - [26, 41, 33, 31, 21] cost = [1, 7, 4, 1, 61. (5, 2, 3, 5, 41. 17, 4, 4, 6, 21. 12. 6, 1, 1, 41) supply = (310, 295, 420, 310] (a, 1 pts) Formulate this problem to minimize the total cost (assume that the decision variables can be fractional). What is the optimal value? (b, 2 pts) In addition to Part (a), auppose that at least 3 units must be sent between each supply-demand pair. What is the optimal value with this additional constraint? (c, 2 pts) in addition to Part (a), suppose that the amount sent from 3 to 1 is not less than the amount sent from 4 to 3. What is the optimal value with this additional constraint? Note: This part is independent of Part (b). You can comment the lines in your code related to Part (b).

Answer rating: 100% (QA)

a the optimal value is 1725 Gurobi Optimizer version 910 build v910rc0 win64 Thread count 4 physical ... View the full answer