Vadim Avkhimenia

Thank you Steven. I restarted my kernel and got the same answer as you. Now I was wondering about something else. As you can see I am calculating y based on z, and z based on x, for every time inte...

Hello Jaromil. Thank you very much for the suggestions. The problem ended up being consistently subtracting (step+1)/113880 term from D which makes it less than 0. I had another question. Is ther...

Thank you Jaromil. Yes, absolutely, the latest version is here: https://stackoverflow.com/questions/69640879/gurobi-says-model-is-infeasible-yet-i-am-able-to-find-a-solution-by-hand . It works for ...

Additionally, I should be able to pick an A large enough so that it will never become less than 0 and it appears this problem should be feasible.

Thank you Jaromil. That solved the previous issue.  Now I do have another question. When I increase the number of steps (num_steps) from 3 to 12 I get a solution. When I increase it past 12 to 13 G...

I should mention, in my simulation, some of the model variables (like J) are calculated based on other variables that I am actually trying to optimize. J being the absolute difference between E and...

When I run the code to determine constrains that aren't satisfied, I only get the 'H constraint' that does not work: print('\nThe following constraint cannot be satisfied:')removed = []for c in f.g...

When I make these changes I still do get the 'model infeasible' error. 

Thank you very much Jaromil. My mistake, I should've paid more attention to my code. However, if I change my L to 10, and my G upper limit to 8, I still do get a solution by hand. Is there anything...

For easy-to-follow code, please see here: https://stackoverflow.com/questions/69600967/gurobi-says-the-model-is-infeasible-yet-i-can-come-up-with-a-solution-by-hand