New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Initial point #13
Comments
05fc020 implements a solution reader and a warmstart method. If a solution is given, and the algorithm is |
Nice, but with this implementation, this adds details that have to be taken care of. The solution that has to be entered (in json form), I guess, should be as If there are no convex hull variables? Then we should have a method to also write the solution which ignores the presence of any convex hull variables? i.e., the least they should be able to do this, load the file written by our software and get a solution in 1 iteration without any fiddling. Second, we might also need smart way to handle when the user knows things like, "I know solar production will happen at maximum capacity" (says that the dual to capacity constraint can be non zero, but the capacity constraint should be at bounds). Coal production is non-zero (says that the corresponding equation should be forced to be equal to zero). In many cases, this could happen only for certain players/certain producers. And the user might have no idea about the rest. In such cases, we might need a way to give importance to the user's expert suggestions. |
The commit is just a first sketch of what we can do. As you said, there is a lot to take care of. |
To take care. |
Two things to be implemented.
Game::EPEC::sol_x
) in a text file. I should be able to load the solution and prove optimum in 1 iteration.Game::EPEC::sol_x
to a file.The text was updated successfully, but these errors were encountered: