benderscut_feasalt.h
Go to the documentation of this file.
21 * The alternative feasibility cut for Benders' decomposition uses the optimality cut generation code to generate a cut
23 * Consider the linear Benders' decomposition subproblem that takes the master problem solution \f$\bar{x}\f$ as input:
27 * If the subproblem is infeasible as a result of the solution \f$\bar{x}\f$, then some of the constraints are violated.
28 * In this case, we define an alternative/auxiliary subproblem to find a solution that minimises the constraint
34 * This auxiliary problem is guaranteed to always be feasible. Given a solution to this problem, it is possible to
35 * generate a classical Benders' optimality cut. For such a cut, the reader is referred to \ref benderscut_opt.h.
37 * If the Benders' decomposition subproblem contains non-linear constraints, an equivalent auxiliary subproblem can be
41 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:59
type definitions for return codes for SCIP methods
Definition: struct_benders.h:48
type definitions for SCIP's main datastructure
SCIP_RETCODE SCIPincludeBenderscutFeasalt(SCIP *scip, SCIP_BENDERS *benders)
Definition: benderscut_feasalt.c:443
type definitions for Benders' decomposition methods
common defines and data types used in all packages of SCIP
Definition: objbenders.h:33