# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - BDSCfg-LD.txt - - - - - - - - - - - - - - - -
#
# The ComputeConfig of the BendersDecompositionSolver whose subproblems are
# solved by the recursive Lagrangian dual of TSSBSCfg-LDrec.txt: that of
# BDSCfg.txt, the Solver of the subproblems apart, and with the recovery of
# a feasible solution at the design of the master (BSCfg1-IP.txt), which
# gives the upper bound in both regimes (in the convex one, at the best
# point of the bundle).
#
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

*BDSCfg.txt +

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

0  # number of integer parameters

0  # number of double parameters

2  # number of string parameters

# now all the string parameters
str_Bsub_BSCfg  TSSBSCfg-LDrec.txt  # BlockSolverConfig of the subproblems
strRecoveryBSC  BSCfg1-IP.txt       # the recovery of a feasible solution:
                                    # each subproblem solved as a MILP at the
                                    # design of the master

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 BDSCfg-LD.txt - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
