# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - -  BDSSCfg.txt  - - - - - - - - - - - - - - - -
#
# The subproblems of TSSBSCfg-BDS.txt: a :MILPSolver on the linear
# program of a scenario, with the presolve off, which a Farkas
# certificate needs.
#
# - the duals of an optimal solution, which give the optimality cut: any
#   optimal dual solution does, basic or not, an interior-point one included;
#
# - the unbounded dual direction of an infeasible one, i.e., a Farkas
#   certificate, which gives the feasibility cut: it is a ray of the dual
#   polyhedron, hence any method can produce it, but the presolve cannot, it
#   detecting the infeasibility on the reduced problem and leaving no
#   certificate for the original one.
#
# With Gurobi nothing else is needed, the InfUnbdInfo parameter being set by
# GRBMILPSolver itself; the equivalent configurations are
#
#   CPXMILPSolver:   CPXPARAM_Preprocessing_Presolve 0
#   HiGHSMILPSolver: presolve off
#
# while SCIPMILPSolver has no Farkas certificate at all: with it, only
# subproblems that are always feasible can be dealt with.
#
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

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

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