hideakiv
hideakiv
Changed type definitions to allow DR functions
and update example
Conditioned when the coupling variables are free, e.g., during the temporal decomposition
The original implementation did not add cuts when at least one of the subproblems was dual infeasible. This is fixed to generate columns using extreme rays.
Example: https://github.com/Argonne-National-Laboratory/DSP/blob/master/examples/cpp/farmer.cpp#L69 When the upper bound is set to `1e+20`, the finite lower bound (e.g. `200`, `240`) is ignored. Solver: Gurobi 9.1.2
For DD/DdMasterSubgrad: Changed the part where the lagrangian was used for the subproblem objective coefficient instead of the sum of the original objective and lagrangian.
As mentioned in #54, there is no standard way to access the subproblem solutions once the algorithm is terminated. This code saves the solutions in LD.
The type for `primal_solution` is supposed to be `Dict{Any, Float64}` instead of `Dict{Int, Float64}`, to allow general coupling_id types. This happens when the coupling ID is set to `'y'`, for...