Reinhold Bertram wrote:
Dear all,
is it possible to speed up the repeated solving of a deterministic
multi-period dispatch problem with MOST when only the loadprofile changes?
At the moment SetupTime is about 2 seconds for each iteration. Is it
possible to skip/shorten this time?
Best regards
Reinhold Bertram
This is actually possible, and MOST was designed for this sort of
eventuality, but you need to understand how the constraints are built
inside MOST. The different phases of building the constraints, building
the costs, optionally adding extra "coordination" costs for some
variables (when MOST is used in a decomposition and coordination scheme
as a subproblem), and actually solving the problem are controlled by
several flags. Hence, if you solve a problem the first time, you can
re-use the output structure which already contains the formulation of
the problem in the .QP field, setting the flags so as to not to re-build
the problem, and so that all of the constraint-building code is not
re-executed. But you need to manually alter the corresponding elements
of the L and U vectors in the L <= A*x <= U constraints corresponding to
the bus power balances (you can use the constraint-indexing mechanism in
the optimization model for this) to reflect the changes in the bus
demand vector for each flow.
This query falls in the advanced user category for MOST.
Carlos.
