Objective: 41575.0 Open facilities: y0 y1 y2 Facility-Client assignments: 100.00 0.00 0.00 0.00 80.00 0.00 0.00 90.00 0.00 0.00 0.00 75.00 0.00 0.00 125.00 150.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 Nice example BTW, this should be the optimal solution, using the first three facilities, according to Google OR-Tools (CBC_MIXED_INTEGER_PROGRAMMING solver)
God, this video is very clear, concise, and everything it needs to be. You are a great teacher sir. Thank you for the video.
you have really qualities of great professor thanks ,I understand
Thanks for the video ! It was very understandable and clear.
Very well, thanks.
By the way , Which method should be used for calculating this problems ?
Objective: 41575.0
Open facilities: y0 y1 y2
Facility-Client assignments:
100.00 0.00 0.00 0.00 80.00 0.00
0.00 90.00 0.00 0.00 0.00 75.00
0.00 0.00 125.00 150.00 0.00 0.00
0.00 0.00 0.00 0.00 0.00 0.00
Nice example BTW, this should be the optimal solution, using the first three facilities, according to Google OR-Tools (CBC_MIXED_INTEGER_PROGRAMMING solver)
Obs: If you try to decrease capacities, you can see that the demand is splitted among facilities
Hi, do you have the updated link to the slide? The link is dead
Great video!!!
I'll never understand why 6 and 5 were left as non feasible. I suppose that's arbitrary
are you turkish