how can we find best value for P?

I'm confused because if we multiply one objective by w and the other by 1-w, the line will be linear? If this is true, it will not a curve like how pareto frontier is supposed to be @ericdelmelle9734 could you please explain? I kind of tried it right now on my own and it turned into a linear line

Is not SCP different from LSCTP?

Excellently explained!

thank you!

Merci

Hello teacher, I will write a report with cluster coverage 🙁 he said like a thesis. Sir, I saw you on KZbin and needed your help. Is there a book or PDF? What would be your most urgent suggestion?

Hello! Could you please make a video of how to make the code?

It was very helpful

Hello! could you please share the code to make the practice ?

Thank you so much !! finally understand it!

what cplex app is this

could you please provide links to relevant scientific papers?

Thank you very much!

Thanks for the lecture. I do have a question. Since you have a predetermined number of facilities, isn't this considered as a maximum covering location problem since not all demand nodes are satisfied?

Is it possible to apply DNN(Deep neuron network) to help solve this kind of problem?

Great!

excuse me, could you please share the python code for solving this problem?

Thank you!

It’s extraordinary. Thank you for your time in spending to write it on the blackboard. Thank you

Good explanation.

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.

THANKS !!! 😇

loved it

what are the pareto sets

I finally understand it! Thank you!!!

Thank you very much, Sir.

I live in a country with very bad educational and economic conditions, I was finally able to get a true sense of coverage by watching these videos Thank you for producing and publishing this content, and I hope again to help science and help those who do not have good educational conditions. Keep doing this.

Thank you very much, I hope you continue to produce more of these videos. I've been looking for a great explanation of backup coverage for a long time and now I found it here.

thanks. I learned from a research article about it and complemented the material with your videos. Definitely, I will give a big thumb and hit subscribe button.

Awesome explanation!!!

Thank you for this lecture!

God knows I’ve been stuck on this for a while and you summarized it perfectly!

Thank you so much, sir! The lecture is understandable and is extremely helpful for my studies. Highly appreciated!!!

Very interesting, thank you !

Thank you !

Merci beaucoup!

Great explanation! Love from 🇮🇳

Thank you. It is so helpful. You have taught it in a great way.

The KZbin algorithm didn't do your content justice. This is such a nice and clean description of the Pareto front and MOOP that it should not have taken me days of searching to find it.

Thank

Thank you so much for your awesome video. How can I find the MCLP toolbox that you have been used?

a question. In the arcgis software you will find the network analysis option, the assignment location option. What is the difference between the code created in python and this tool?

Very helpful video! Which software would you suggest for solving the MCLP in a large scale ( for example 3000+ demand nodes)?

Bien expliqué merci

This is an excellent and extremely concise explanation of the p-median problem, thank you Sir!

Hello sir, I have a question sir, is it possible to use spatial optimization for solar photovoltaic panel installation layout on a roof of a building? Thank you 🙏

Thnx sir

Thank you for your clear guide ♡

I love your every lecture! Thank you for detailed formulation!