the answer is incorrect. It should be (1,1,1,1,0,1,0,1,1,1,0,0). In the solution you have given, the blimp location is showing as 0. Please check the solution once again. thanks!
Hello. Please help me with this problem. Consider a set of city districts 𝐼. There is a candidate for building a medical emergency service station in every city district. The cost of building an ambulance station is given by the parameter 𝑓𝑖 and the total budget for building stations throughout the city is 50 million. Furthermore, if a station is built in city district 2, it must not be station built in city district 6. Determine in which city districts to build ambulance stations so that the maximum travel time is minimized. What is the optimal maximum travel time? The cost of building stations in the city district 𝑖 ∈ 𝐼, 𝑓𝑖 are: [32,20,25,30,40,29] The city districts and the driving distances between them are interpreted in the following graph: ( [[ 0, 4, 12, 27, 25, 58], [ 4, 0, 24, 16, 29, 38], [12, 24, 0, 31, 14, 30], [27, 16, 31, 0, 21, 8], [25, 29, 14, 21, 0, 11], [58, 38, 30, 8, 11, 0]]) The right answer is to build stations in districts 2 and 4, and optimal travel time is 24. But how can I solve it with excel or with Python, please, help me.
This has been extremely useful for me. In my uni courses we start using integer programming and this has visualised the concept of set covering for me
Thank you for this video, it was very helpful in figuring out how to actually solve optimization problems!
Hesap makinesiyle çekseydin keşke videoyu. teşekkürler.....................
how would you define its constraints?
Thx but u could also share the documents. It would helped me a lot.
Thanks!!!
Can you share xls speradsheet
Why 7? Just random?
the answer is incorrect. It should be (1,1,1,1,0,1,0,1,1,1,0,0). In the solution you have given, the blimp location is showing as 0. Please check the solution once again. thanks!
Hi Siddharth, the Blimp Location is Location 7. In the final solution, it is showing 1. The solution is correct. Thanks!
Hello.
Please help me with this problem.
Consider a set of city districts 𝐼. There is a candidate for building a medical emergency service station in every city district. The cost of building an ambulance station is given by the parameter 𝑓𝑖 and the total budget for building stations throughout the city is 50 million. Furthermore, if a station is built in city district 2, it must not be
station built in city district 6. Determine in which city districts to build ambulance stations so that the maximum travel time is minimized. What is the optimal maximum travel time?
The cost of building stations in the city district 𝑖 ∈ 𝐼, 𝑓𝑖
are: [32,20,25,30,40,29]
The city districts and the driving distances between them are interpreted in the following graph:
( [[ 0, 4, 12, 27, 25, 58],
[ 4, 0, 24, 16, 29, 38],
[12, 24, 0, 31, 14, 30],
[27, 16, 31, 0, 21, 8],
[25, 29, 14, 21, 0, 11],
[58, 38, 30, 8, 11, 0]])
The right answer is to build stations in districts 2 and 4, and optimal travel time is 24.
But how can I solve it with excel or with Python, please, help me.