Thanks a lot for helping me out!!!

this is really clear and understandable, thanks man!

Hi Mike! Thank you for your videos, which are very helpful. Can you share directly the code somewhere?

Why was is "11.4 worse than 11.61"? I mean, node 16 has lower cost than node 8, i.e. 11.40 < 11.61. Am I missing something?

EDIT: i initially thought that shouldn't z-ub be updated as 11.72 after the 7th node when we branch out for the first time? why did we keep it as 11.93 (4th node value)? then i found out that "when we branch from a node with a higher objective function value (z), we typically do not update its z value in the table. Instead, our focus shifts to exploring other branches in search of potentially better solutions. The rationale behind this approach is that the current node’s value already serves as an upper bound for the remaining subproblems. If we encounter a better feasible solution later, we adjust the upper bound (z-ub) accordingly."

Thanks for this series, it's a great introduction to optimization, and more specifically its application with Pyomo. I have one question : could you explain more in detail the importance of using the energy stored as a variable ? Since it's totally defined by the power sold at time t, I don't see it's relevance, because we could instead ensuring that the intial storage charge state plus the net produced energy is between 0 and S0 (so : for each time step, we could have the following constraint : 0 <= S0 + sum(Qi - Wi) <= S0 for i in range(1, t))

Thanks. I am using gurobi but it says infeasible solution. Why did I not reach the same answer as you did?

these are so helpful, thank you!

Thanks Mike. Can we use glpk instead of cbc?

Great work!! Please watch and subscribe PYOMO WITH INHERITANCE - GEHRING & HOMBERGER'S 200 CUSTOMER INSTANCES kzbin.info/www/bejne/nZLcgmiZmJeipbs

Great stuff!

Thank you for these videos

been trying to read some paper but was intimidated by the monstrous notation and formula

any. good project regarding to optimization?

thanks！

Thank you so much for this video! It's really helping me remember these concepts, it has been a while😅

wow thank you so much. really i am doing a research project on MIP and this series really helped a LOT

Thanks for the tutorial mike; it really helped me

Hi Mike, thanks for this great series of lectures. I'm following the steps given by you. I just had one doubt - Why have you written 2 different constraints for the energy balance? Why can't we have a single constraint - St - St-1 = Qt - Wt for all t? Why is it only for t>=2? The next constraint is similar to this once so why is it written separately?

Where do you get the values 12.25 and 12.04?

hey, Great tutorial. I was looking for something like this and yours was the more clear tutorial. I think you have a bug in line 89. Should the last term not be model.s[t-1] instead of model.S0? Maybe I'm not understanding something.

This series is a great introduction into linear programming. Exactly what I have been looking for. Thanks a lot for creating it.

Great Tutorial! The visualization of the simplex method helps understanding tremendously. i had two university classes sovering simplex, and here it is explained the best way

Similar name😂

Check out mike wagher

4:10 shouldn't one of the two conditions be different? If y_m >= y_k, shouldn't the other condition be y_n < y_k since we need one variable to take the lower bound, and the other one to take the upper bound?

Hi, I have a question. How did you make the diagram with the upper and lower bound over time in 5:03? I can't manage to extract the data from the log and then create a dagram. I would be very happy if you tell me with what command to get the data from the log

👍

Thank you so much for this videos!