# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - BDSSCfg-pre.txt - - - - - - - - - - - - - - -
#
# The subproblems of BDSSCfg.txt with the presolve on, which makes the first
# round, solved from scratch, several times faster: on a PyPSA network of 20
# nodes and 20 scenarios this saves about 12% with the proximal master of the
# convex regime, and nothing with the trust region, whose rounds are many
# more. It is only for subproblems that are never infeasible (say, a
# continuous design with load shedding), since with the presolve on an
# infeasible one leaves no Farkas certificate and no feasibility cut.
#
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

BlockSolverConfig     # exact type of the Configuration object

0  # the BlockSolverConfig is not a "differential" one

1  # number of (the names of) Solver in this BlockSolverConfig

# now all the names of the Solver - - - - - - - - - - - - - - - - - - - - - -
GRBMILPSolver

1  # number of ComputeConfig in this BlockSolverConfig

# now all the ComputeConfig - - - - - - - - - - - - - - - - - - - - - - - - -
*BDSSMILPCfg.txt +

1  # f_diff == 1 ==> only the entries listed below are changed

1  # number of integer parameters

# now all the integer parameters
Presolve         -1  # automatic: no subproblem is infeasible here

0  # number of double parameters

0  # number of string parameters

0  # number of vector-of-int parameters

0  # number of vector-of-double parameters

0  # number of vector-of-string parameters

# pointer to the "extra" Configuration
* # [none]

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - END BDSSCfg-pre.txt - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
