Scippy

SCIP

Solving Constraint Integer Programs

benders.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2019 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scip.zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file scip/src/scip/benders.h
17  * @ingroup INTERNALAPI
18  * @brief internal methods for Benders' decomposition
19  * @author Stephen J. Maher
20  */
21 
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
23 
24 #ifndef __SCIP_BENDERS_H__
25 #define __SCIP_BENDERS_H__
26 
27 #include "blockmemshell/memory.h"
28 #include "scip/def.h"
29 #include "scip/type_benders.h"
30 #include "scip/type_benderscut.h"
31 #include "scip/type_message.h"
32 #include "scip/type_misc.h"
33 #include "scip/type_result.h"
34 #include "scip/type_retcode.h"
35 #include "scip/type_scip.h"
36 #include "scip/type_set.h"
37 #include "scip/type_sol.h"
38 #include "scip/type_stat.h"
39 #include "scip/type_var.h"
40 
41 #ifdef __cplusplus
42 extern "C" {
43 #endif
44 
45 
46 /** copies the given Benders' decomposition to a new scip */
48  SCIP_BENDERS* benders, /**< Benders' decomposition */
49  SCIP_SET* sourceset, /**< SCIP_SET of SCIP to copy from */
50  SCIP_SET* targetset, /**< SCIP_SET of SCIP to copy to */
51  SCIP_HASHMAP* varmap, /**< a hashmap to store the mapping of source variables corresponding
52  * target variables; must not be NULL */
53  SCIP_Bool* valid /**< was the copying process valid? */
54  );
55 
56 /** creates a Benders' decomposition */
58  SCIP_BENDERS** benders, /**< pointer to Benders' decomposition data structure */
59  SCIP_SET* set, /**< global SCIP settings */
60  SCIP_MESSAGEHDLR* messagehdlr, /**< message handler */
61  BMS_BLKMEM* blkmem, /**< block memory for parameter settings */
62  const char* name, /**< name of Benders' decomposition */
63  const char* desc, /**< description of Benders' decomposition */
64  int priority, /**< priority of the Benders' decomposition */
65  SCIP_Bool cutlp, /**< should Benders' cuts be generated for LP solutions */
66  SCIP_Bool cutpseudo, /**< should Benders' cuts be generated for pseudo solutions */
67  SCIP_Bool cutrelax, /**< should Benders' cuts be generated for relaxation solutions */
68  SCIP_Bool shareauxvars, /**< should this Benders' use the highest priority Benders aux vars */
69  SCIP_DECL_BENDERSCOPY ((*benderscopy)), /**< copy method of Benders' decomposition or NULL if you don't want to copy your plugin into sub-SCIPs */
70  SCIP_DECL_BENDERSFREE ((*bendersfree)), /**< destructor of Benders' decomposition */
71  SCIP_DECL_BENDERSINIT ((*bendersinit)), /**< initialize Benders' decomposition */
72  SCIP_DECL_BENDERSEXIT ((*bendersexit)), /**< deinitialize Benders' decomposition */
73  SCIP_DECL_BENDERSINITPRE((*bendersinitpre)),/**< presolving initialization method for Benders' decomposition */
74  SCIP_DECL_BENDERSEXITPRE((*bendersexitpre)),/**< presolving deinitialization method for Benders' decomposition */
75  SCIP_DECL_BENDERSINITSOL((*bendersinitsol)),/**< solving process initialization method of Benders' decomposition */
76  SCIP_DECL_BENDERSEXITSOL((*bendersexitsol)),/**< solving process deinitialization method of Benders' decomposition */
77  SCIP_DECL_BENDERSGETVAR((*bendersgetvar)),/**< returns the master variable for a given subproblem variable */
78  SCIP_DECL_BENDERSCREATESUB((*benderscreatesub)),/**< creates a Benders' decomposition subproblem */
79  SCIP_DECL_BENDERSPRESUBSOLVE((*benderspresubsolve)),/**< called prior to the subproblem solving loop */
80  SCIP_DECL_BENDERSSOLVESUBCONVEX((*benderssolvesubconvex)),/**< the solving method for convex Benders' decomposition subproblems */
81  SCIP_DECL_BENDERSSOLVESUB((*benderssolvesub)),/**< the solving method for the Benders' decomposition subproblems */
82  SCIP_DECL_BENDERSPOSTSOLVE((*benderspostsolve)),/**< called after the subproblems are solved. */
83  SCIP_DECL_BENDERSFREESUB((*bendersfreesub)),/**< the freeing method for the Benders' decomposition subproblems */
84  SCIP_BENDERSDATA* bendersdata /**< Benders' decomposition data */
85  );
86 
87 /** calls destructor and frees memory of Benders' decomposition */
89  SCIP_BENDERS** benders, /**< pointer to Benders' decomposition data structure */
90  SCIP_SET* set /**< global SCIP settings */
91  );
92 
93 /** initializes Benders' decomposition */
95  SCIP_BENDERS* benders, /**< Benders' decomposition */
96  SCIP_SET* set /**< global SCIP settings */
97  );
98 
99 /** calls exit method of Benders' decomposition */
101  SCIP_BENDERS* benders, /**< Benders' decomposition */
102  SCIP_SET* set /**< global SCIP settings */
103  );
104 
105 /** informs the Benders' decomposition that the presolving process is being started */
107  SCIP_BENDERS* benders, /**< Benders' decomposition */
108  SCIP_SET* set, /**< global SCIP settings */
109  SCIP_STAT* stat /**< dynamic problem statistics */
110  );
111 
112 /** informs the Benders' decomposition that the presolving process has completed */
114  SCIP_BENDERS* benders, /**< Benders' decomposition */
115  SCIP_SET* set, /**< global SCIP settings */
116  SCIP_STAT* stat /**< dynamic problem statistics */
117  );
118 
119 /** informs Benders' decomposition that the branch and bound process is being started */
121  SCIP_BENDERS* benders, /**< Benders' decomposition */
122  SCIP_SET* set /**< global SCIP settings */
123  );
124 
125 /** informs Benders' decomposition that the branch and bound process data is being freed */
127  SCIP_BENDERS* benders, /**< Benders' decomposition */
128  SCIP_SET* set /**< global SCIP settings */
129  );
130 
131 /** activates Benders' decomposition such that it is called in LP solving loop */
133  SCIP_BENDERS* benders, /**< the Benders' decomposition structure */
134  SCIP_SET* set, /**< global SCIP settings */
135  int nsubproblems /**< the number subproblems used in this decomposition */
136  );
137 
138 /** deactivates Benders' decomposition such that it is no longer called in LP solving loop */
140  SCIP_BENDERS* benders, /**< the Benders' decomposition structure */
141  SCIP_SET* set /**< global SCIP settings */
142  );
143 
144 /** enables or disables all clocks of Benders' decomposition depending on the value of the flag */
146  SCIP_BENDERS* benders, /**< the Benders' decomposition for which all clocks should be enabled or disabled */
147  SCIP_Bool enable /**< should the clocks of the Benders' decomposition be enabled? */
148  );
149 
150 /** solves the subproblem using the current master problem solution.
151  *
152  * The checkint flag indicates whether integer feasibility can be assumed. If it is not assumed, i.e. checkint ==
153  * FALSE, then only the convex relaxations of the subproblems are solved. If integer feasibility is assumed, i.e.
154  * checkint == TRUE, then the convex relaxations and the full CIP are solved to generate Benders' cuts and check
155  * solution feasibility.
156  */
158  SCIP_BENDERS* benders, /**< Benders' decomposition */
159  SCIP_SET* set, /**< global SCIP settings */
160  SCIP_SOL* sol, /**< primal CIP solution */
161  SCIP_RESULT* result, /**< result of the pricing process */
162  SCIP_Bool* infeasible, /**< is the master problem infeasible with respect to the Benders' cuts? */
163  SCIP_Bool* auxviol, /**< set to TRUE only if the solution is feasible but the aux vars are violated */
164  SCIP_BENDERSENFOTYPE type, /**< the type of solution being enforced */
165  SCIP_Bool checkint /**< should the integer solution be checked by the subproblems */
166  );
167 
168 /** Executes the subproblem solving process. */
170  SCIP_BENDERS* benders, /**< Benders' decomposition */
171  SCIP_SET* set, /**< global SCIP settings */
172  SCIP_SOL* sol, /**< primal CIP solution */
173  int probnum, /**< the subproblem number */
174  SCIP_BENDERSSOLVELOOP solveloop, /**< the solve loop iteration. The first iter is for LP, the second for IP */
175  SCIP_Bool enhancement, /**< is the solve performed as part of an enhancement? */
176  SCIP_Bool* solved, /**< flag to indicate whether the subproblem was solved */
177  SCIP_Bool* infeasible, /**< returns whether the current subproblem is infeasible */
178  SCIP_BENDERSENFOTYPE type /**< the enforcement type calling this function */
179  );
180 
181 /** sets up the subproblem using the solution to the master problem */
183  SCIP_BENDERS* benders, /**< Benders' decomposition */
184  SCIP_SET* set, /**< global SCIP settings */
185  SCIP_SOL* sol, /**< primal CIP solution */
186  int probnum /**< the subproblem number */
187  );
188 
189 /** Solve a Benders' decomposition subproblems. This will either call the user defined method or the generic solving
190  * methods. If the generic method is called, then the subproblem must be set up before calling this method. */
192  SCIP_BENDERS* benders, /**< Benders' decomposition */
193  SCIP_SET* set, /**< global SCIP settings */
194  SCIP_SOL* sol, /**< primal CIP solution, can be NULL */
195  int probnumber, /**< the subproblem number */
196  SCIP_Bool* infeasible, /**< returns whether the current subproblem is infeasible */
197  SCIP_BENDERSENFOTYPE type, /**< the enforcement type calling this function */
198  SCIP_Bool solvecip, /**< directly solve the CIP subproblem */
199  SCIP_Real* objective /**< the objective function value of the subproblem, can be NULL */
200  );
201 
202 /** frees the subproblems */
204  SCIP_BENDERS* benders, /**< Benders' decomposition */
205  SCIP_SET* set, /**< global SCIP settings */
206  int probnumber /**< the subproblem number */
207  );
208 
209 /** compares the subproblem objective value with the auxiliary variable value for optimality */
211  SCIP_BENDERS* benders, /**< the benders' decomposition structure */
212  SCIP_SET* set, /**< global SCIP settings */
213  SCIP_SOL* sol, /**< primal CIP solution */
214  int probnumber, /**< the subproblem number */
215  SCIP_Bool* optimal /**< flag to indicate whether the current subproblem is optimal for the master */
216  );
217 
218 /** returns the value of the auxiliary variable value in a master problem solution */
220  SCIP_BENDERS* benders, /**< the benders' decomposition structure */
221  SCIP_SET* set, /**< global SCIP settings */
222  SCIP_SOL* sol, /**< primal CIP solution */
223  int probnumber /**< the subproblem number */
224  );
225 
226 /** Solves an independent subproblem to identify its lower bound. The lower bound is then used to update the bound on
227  * the auxiliary variable.
228  */
230  SCIP_BENDERS* benders, /**< Benders' decomposition */
231  SCIP_SET* set, /**< global SCIP settings */
232  int probnumber, /**< the subproblem to be evaluated */
233  SCIP_Real* lowerbound, /**< the lowerbound for the subproblem */
234  SCIP_Bool* infeasible /**< was the subproblem found to be infeasible? */
235  );
236 
237 /** merges a subproblem into the master problem. This process just adds a copy of the subproblem variables and
238  * constraints to the master problem, but keeps the subproblem stored in the Benders' decomposition data structure.
239  * The reason for keeping the subproblem available is for when it is queried for solutions after the problem is solved.
240  *
241  * Once the subproblem is merged into the master problem, then the subproblem is flagged as disabled. This means that
242  * it will not be solved in the subsequent subproblem solving loops.
243  *
244  * The associated auxiliary variables are kept in the master problem. The objective function of the merged subproblem
245  * is added as an underestimator constraint.
246  */
248  SCIP_BENDERS* benders, /**< Benders' decomposition */
249  SCIP_SET* set, /**< global SCIP settings */
250  SCIP_HASHMAP* varmap, /**< a hashmap to store the mapping of subproblem variables corresponding
251  * to the newly created master variables, or NULL */
252  SCIP_HASHMAP* consmap, /**< a hashmap to store the mapping of subproblem constraints to the
253  corresponding newly created constraints, or NULL */
254  int probnumber /**< the number of the subproblem that will be merged into the master problem*/
255  );
256 
257 /** sets priority of Benders' decomposition */
259  SCIP_BENDERS* benders, /**< Benders' decomposition */
260  SCIP_SET* set, /**< global SCIP settings */
261  int priority /**< new priority of the Benders' decomposition */
262  );
263 
264 /** sets copy callback of Benders' decomposition */
265 void SCIPbendersSetCopy(
266  SCIP_BENDERS* benders, /**< Benders' decomposition */
267  SCIP_DECL_BENDERSCOPY ((*benderscopy)) /**< copy callback of Benders' decomposition */
268  );
269 
270 /** sets destructor callback of Benders' decomposition */
271 void SCIPbendersSetFree(
272  SCIP_BENDERS* benders, /**< Benders' decomposition */
273  SCIP_DECL_BENDERSFREE ((*bendersfree)) /**< destructor of Benders' decomposition */
274  );
275 
276 /** sets initialization callback of Benders' decomposition */
277 void SCIPbendersSetInit(
278  SCIP_BENDERS* benders, /**< Benders' decomposition */
279  SCIP_DECL_BENDERSINIT((*bendersinit)) /**< initialize Benders' decomposition */
280  );
281 
282 /** sets deinitialization callback of Benders' decomposition */
283 void SCIPbendersSetExit(
284  SCIP_BENDERS* benders, /**< Benders' decomposition */
285  SCIP_DECL_BENDERSEXIT((*bendersexit)) /**< deinitialize Benders' decomposition */
286  );
287 
288 /** sets presolving initialization callback of Benders' decomposition */
290  SCIP_BENDERS* benders, /**< Benders' decomposition */
291  SCIP_DECL_BENDERSINITPRE((*bendersinitpre))/**< initialize presolving for Benders' decomposition */
292  );
293 
294 /** sets presolving deinitialization callback of Benders' decomposition */
296  SCIP_BENDERS* benders, /**< Benders' decomposition */
297  SCIP_DECL_BENDERSEXITPRE((*bendersexitpre))/**< deinitialize presolving for Benders' decomposition */
298  );
299 
300 /** sets solving process initialization callback of Benders' decomposition */
302  SCIP_BENDERS* benders, /**< Benders' decomposition */
303  SCIP_DECL_BENDERSINITSOL((*bendersinitsol))/**< solving process initialization callback of Benders' decomposition */
304  );
305 
306 /** sets solving process deinitialization callback of Benders' decomposition */
308  SCIP_BENDERS* benders, /**< Benders' decomposition */
309  SCIP_DECL_BENDERSEXITSOL((*bendersexitsol))/**< solving process deinitialization callback of Benders' decomposition */
310  );
311 
312 /** sets the pre subproblem solve callback of Benders' decomposition */
314  SCIP_BENDERS* benders, /**< Benders' decomposition */
315  SCIP_DECL_BENDERSPRESUBSOLVE((*benderspresubsolve))/**< called prior to the subproblem solving loop */
316  );
317 
318 /** sets convex solve callback of Benders' decomposition */
320  SCIP_BENDERS* benders, /**< Benders' decomposition */
321  SCIP_DECL_BENDERSSOLVESUBCONVEX((*benderssolvesubconvex))/**< solving method for the convex Benders' decomposition subproblem */
322  );
323 
324 /** sets solve callback of Benders' decomposition */
326  SCIP_BENDERS* benders, /**< Benders' decomposition */
327  SCIP_DECL_BENDERSSOLVESUB((*benderssolvesub))/**< solving method for a Benders' decomposition subproblem */
328  );
329 
330 /** sets post-solve callback of Benders' decomposition */
332  SCIP_BENDERS* benders, /**< Benders' decomposition */
333  SCIP_DECL_BENDERSPOSTSOLVE((*benderspostsolve))/**< solving process deinitialization callback of Benders' decomposition */
334  );
335 
336 /** sets free subproblem callback of Benders' decomposition */
338  SCIP_BENDERS* benders, /**< Benders' decomposition */
339  SCIP_DECL_BENDERSFREESUB((*bendersfreesub))/**< the freeing callback for the subproblem */
340  );
341 
342 /** Returns the corresponding master or subproblem variable for the given variable.
343  * This provides a call back for the variable mapping between the master and subproblems. */
345  SCIP_BENDERS* benders, /**< Benders' decomposition */
346  SCIP_SET* set, /**< global SCIP settings */
347  SCIP_VAR* var, /**< the variable for which the corresponding variable is desired */
348  SCIP_VAR** mappedvar, /**< the variable that is mapped to var */
349  int probnumber /**< the problem number for the desired variable, -1 for the master problem */
350  );
351 
352 /** adds a subproblem to the Benders' decomposition data */
354  SCIP_BENDERS* benders, /**< Benders' decomposition */
355  SCIP* subproblem /**< subproblem to be added to the data storage */
356  );
357 
358 /** removes the subproblems from the Benders' decomposition data */
360  SCIP_BENDERS* benders /**< Benders' decomposition */
361  );
362 
363 /** sets the subproblem setup flag */
365  SCIP_BENDERS* benders, /**< Benders' decomposition */
366  int probnumber, /**< the subproblem number */
367  SCIP_Bool issetup /**< flag to indicate whether the subproblem has been setup */
368  );
369 
370 /** returns the subproblem setup flag */
372  SCIP_BENDERS* benders, /**< Benders' decomposition */
373  int probnumber /**< the subproblem number */
374  );
375 
376 /** Sets whether the subproblem is enabled or disabled. A subproblem is disabled if it has been merged into the master
377  * problem.
378  */
380  SCIP_BENDERS* benders, /**< Benders' decomposition */
381  int probnumber, /**< the subproblem number */
382  SCIP_Bool enabled /**< flag to indicate whether the subproblem is enabled */
383  );
384 
385 /** changes all of the master problem variables in the given subproblem to continuous */
387  SCIP_BENDERS* benders, /**< Benders' decomposition */
388  SCIP_SET* set, /**< global SCIP settings */
389  int probnumber /**< the subproblem number */
390  );
391 
392 /** sets a flag to indicate whether the master variables are all set to continuous */
394  SCIP_BENDERS* benders, /**< Benders' decomposition */
395  int probnumber, /**< the subproblem number */
396  SCIP_Bool arecont /**< flag to indicate whether the master problem variables are continuous */
397  );
398 
399 /** returns whether the master variables are all set to continuous */
401  SCIP_BENDERS* benders, /**< Benders' decomposition */
402  int probnumber /**< the subproblem number */
403  );
404 
405 /** inserts a Benders' cut algorithm plugin into the Benders' cuts plugin list */
407  SCIP_BENDERS* benders, /**< Benders' decomposition structure */
408  SCIP_SET* set, /**< global SCIP settings */
409  SCIP_BENDERSCUT* benderscut /**< Benders' cut */
410  );
411 
412 /** sets the Benders' cuts sorted flags in the Benders' decomposition */
414  SCIP_BENDERS* benders, /**< Benders' decomposition structure */
415  SCIP_Bool sorted /**< the value to set the sorted flag to */
416  );
417 
418 /** sorts Benders' decomposition cuts by priorities */
420  SCIP_BENDERS* benders /**< Benders' decomposition */
421  );
422 
423 /** sorts Benders' decomposition cuts by name */
425  SCIP_BENDERS* benders /**< Benders' decomposition */
426  );
427 
428 #ifdef __cplusplus
429 }
430 #endif
431 
432 #endif
enum SCIP_Result SCIP_RESULT
Definition: type_result.h:52
#define SCIP_DECL_BENDERSCREATESUB(x)
Definition: type_benders.h:170
void SCIPbendersSetSubproblemIsSetup(SCIP_BENDERS *benders, int probnumber, SCIP_Bool issetup)
Definition: benders.c:4581
SCIP_RETCODE SCIPbendersGetVar(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_VAR *var, SCIP_VAR **mappedvar, int probnumber)
Definition: benders.c:4021
void SCIPbendersSetExit(SCIP_BENDERS *benders, SCIP_DECL_BENDERSEXIT((*bendersexit)))
Definition: benders.c:4101
void SCIPbendersSetBenderscutsSorted(SCIP_BENDERS *benders, SCIP_Bool sorted)
Definition: benders.c:4780
type definitions for miscellaneous datastructures
SCIP_RETCODE SCIPbendersAddSubproblem(SCIP_BENDERS *benders, SCIP *subproblem)
Definition: benders.c:4379
#define SCIP_DECL_BENDERSINITSOL(x)
Definition: type_benders.h:130
#define SCIP_DECL_BENDERSFREE(x)
Definition: type_benders.h:82
SCIP_RETCODE SCIPbendersFree(SCIP_BENDERS **benders, SCIP_SET *set)
Definition: benders.c:1048
void SCIPbendersSetFreesub(SCIP_BENDERS *benders, SCIP_DECL_BENDERSFREESUB((*bendersfreesub)))
Definition: benders.c:4200
#define SCIP_DECL_BENDERSINITPRE(x)
Definition: type_benders.h:111
SCIP_RETCODE SCIPbendersInitsol(SCIP_BENDERS *benders, SCIP_SET *set)
Definition: benders.c:1738
SCIP_RETCODE SCIPbendersMergeSubproblemIntoMaster(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, int probnumber)
Definition: benders.c:3838
SCIP_RETCODE SCIPbendersFreeSubproblem(SCIP_BENDERS *benders, SCIP_SET *set, int probnumber)
Definition: benders.c:3606
#define SCIP_DECL_BENDERSGETVAR(x)
Definition: type_benders.h:339
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
enum SCIP_BendersEnfoType SCIP_BENDERSENFOTYPE
Definition: type_benders.h:42
SCIP_Bool SCIPbendersSubproblemIsSetup(SCIP_BENDERS *benders, int probnumber)
Definition: benders.c:4594
type definitions for global SCIP settings
void SCIPbendersSetPriority(SCIP_BENDERS *benders, SCIP_SET *set, int priority)
Definition: benders.c:4241
void SCIPbendersSetInitsol(SCIP_BENDERS *benders, SCIP_DECL_BENDERSINITSOL((*bendersinitsol)))
Definition: benders.c:4134
#define SCIP_DECL_BENDERSINIT(x)
Definition: type_benders.h:91
type definitions for return codes for SCIP methods
type definitions for problem statistics
void SCIPbendersRemoveSubproblems(SCIP_BENDERS *benders)
Definition: benders.c:4397
SCIP_RETCODE SCIPbendersExitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)
Definition: benders.c:1712
#define SCIP_DECL_BENDERSFREESUB(x)
Definition: type_benders.h:323
SCIP_RETCODE SCIPbendersExecSubproblemSolve(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, int probnum, SCIP_BENDERSSOLVELOOP solveloop, SCIP_Bool enhancement, SCIP_Bool *solved, SCIP_Bool *infeasible, SCIP_BENDERSENFOTYPE type)
Definition: benders.c:2944
SCIP_RETCODE SCIPbendersCheckSubproblemOptimality(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, int probnumber, SCIP_Bool *optimal)
Definition: benders.c:3656
SCIP_RETCODE SCIPbendersChgMastervarsToCont(SCIP_BENDERS *benders, SCIP_SET *set, int probnumber)
Definition: benders.c:4511
#define SCIP_DECL_BENDERSEXIT(x)
Definition: type_benders.h:100
void SCIPbendersSetSolvesub(SCIP_BENDERS *benders, SCIP_DECL_BENDERSSOLVESUB((*benderssolvesub)))
Definition: benders.c:4178
#define SCIP_DECL_BENDERSSOLVESUB(x)
Definition: type_benders.h:265
type definitions for SCIP&#39;s main datastructure
SCIP_RETCODE SCIPbendersActivate(SCIP_BENDERS *benders, SCIP_SET *set, int nsubproblems)
Definition: benders.c:1827
void SCIPbendersSortBenderscuts(SCIP_BENDERS *benders)
Definition: benders.c:4881
SCIP_RETCODE SCIPbendersSetupSubproblem(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, int probnum)
Definition: benders.c:3119
void SCIPbendersSetFree(SCIP_BENDERS *benders, SCIP_DECL_BENDERSFREE((*bendersfree)))
Definition: benders.c:4079
struct SCIP_BendersData SCIP_BENDERSDATA
Definition: type_benders.h:63
#define SCIP_DECL_BENDERSSOLVESUBCONVEX(x)
Definition: type_benders.h:232
type definitions for problem variables
void SCIPbendersSetCopy(SCIP_BENDERS *benders, SCIP_DECL_BENDERSCOPY((*benderscopy)))
Definition: benders.c:4068
#define SCIP_DECL_BENDERSCOPY(x)
Definition: type_benders.h:74
void SCIPbendersDeactivate(SCIP_BENDERS *benders, SCIP_SET *set)
Definition: benders.c:1890
#define SCIP_Bool
Definition: def.h:70
void SCIPbendersSetExitsol(SCIP_BENDERS *benders, SCIP_DECL_BENDERSEXITSOL((*bendersexitsol)))
Definition: benders.c:4145
SCIP_RETCODE SCIPbendersIncludeBenderscut(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_BENDERSCUT *benderscut)
Definition: benders.c:4792
SCIP_RETCODE SCIPbendersSetMastervarsCont(SCIP_BENDERS *benders, int probnumber, SCIP_Bool arecont)
Definition: benders.c:4698
void SCIPbendersSetInit(SCIP_BENDERS *benders, SCIP_DECL_BENDERSINIT((*bendersinit)))
Definition: benders.c:4090
SCIP_RETCODE SCIPbendersInit(SCIP_BENDERS *benders, SCIP_SET *set)
Definition: benders.c:1323
SCIP_Bool SCIPbendersGetMastervarsCont(SCIP_BENDERS *benders, int probnumber)
Definition: benders.c:4725
type definitions for Benders&#39; decomposition methods
void SCIPbendersSetSolvesubconvex(SCIP_BENDERS *benders, SCIP_DECL_BENDERSSOLVESUBCONVEX((*benderssolvesubconvex)))
Definition: benders.c:4167
type definitions for storing primal CIP solutions
type definitions for Benders&#39; decomposition cut
void SCIPbendersSetExitpre(SCIP_BENDERS *benders, SCIP_DECL_BENDERSEXITPRE((*bendersexitpre)))
Definition: benders.c:4123
void SCIPbendersSetPresubsolve(SCIP_BENDERS *benders, SCIP_DECL_BENDERSPRESUBSOLVE((*benderspresubsolve)))
Definition: benders.c:4156
enum SCIP_BendersSolveLoop SCIP_BENDERSSOLVELOOP
Definition: type_benders.h:51
#define SCIP_DECL_BENDERSEXITSOL(x)
Definition: type_benders.h:141
void SCIPbendersEnableOrDisableClocks(SCIP_BENDERS *benders, SCIP_Bool enable)
Definition: benders.c:4317
void SCIPbendersSortBenderscutsName(SCIP_BENDERS *benders)
Definition: benders.c:4896
#define SCIP_Real
Definition: def.h:164
SCIP_RETCODE SCIPbendersComputeSubproblemLowerbound(SCIP_BENDERS *benders, SCIP_SET *set, int probnumber, SCIP_Real *lowerbound, SCIP_Bool *infeasible)
Definition: benders.c:3709
result codes for SCIP callback methods
SCIP_RETCODE SCIPbendersCreate(SCIP_BENDERS **benders, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, int priority, SCIP_Bool cutlp, SCIP_Bool cutpseudo, SCIP_Bool cutrelax, SCIP_Bool shareauxvars, SCIP_DECL_BENDERSCOPY((*benderscopy)), SCIP_DECL_BENDERSFREE((*bendersfree)), SCIP_DECL_BENDERSINIT((*bendersinit)), SCIP_DECL_BENDERSEXIT((*bendersexit)), SCIP_DECL_BENDERSINITPRE((*bendersinitpre)), SCIP_DECL_BENDERSEXITPRE((*bendersexitpre)), SCIP_DECL_BENDERSINITSOL((*bendersinitsol)), SCIP_DECL_BENDERSEXITSOL((*bendersexitsol)), SCIP_DECL_BENDERSGETVAR((*bendersgetvar)), SCIP_DECL_BENDERSCREATESUB((*benderscreatesub)), SCIP_DECL_BENDERSPRESUBSOLVE((*benderspresubsolve)), SCIP_DECL_BENDERSSOLVESUBCONVEX((*benderssolvesubconvex)), SCIP_DECL_BENDERSSOLVESUB((*benderssolvesub)), SCIP_DECL_BENDERSPOSTSOLVE((*benderspostsolve)), SCIP_DECL_BENDERSFREESUB((*bendersfreesub)), SCIP_BENDERSDATA *bendersdata)
Definition: benders.c:969
SCIP_RETCODE SCIPbendersExec(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, SCIP_RESULT *result, SCIP_Bool *infeasible, SCIP_Bool *auxviol, SCIP_BENDERSENFOTYPE type, SCIP_Bool checkint)
Definition: benders.c:2502
void SCIPbendersSetSubproblemEnabled(SCIP_BENDERS *benders, int probnumber, SCIP_Bool enabled)
Definition: benders.c:4660
SCIP_RETCODE SCIPbendersInitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)
Definition: benders.c:1668
#define SCIP_DECL_BENDERSPOSTSOLVE(x)
Definition: type_benders.h:301
#define SCIP_DECL_BENDERSEXITPRE(x)
Definition: type_benders.h:119
type definitions for message output methods
SCIP_RETCODE SCIPbendersCopyInclude(SCIP_BENDERS *benders, SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_HASHMAP *varmap, SCIP_Bool *valid)
Definition: benders.c:777
SCIP_RETCODE SCIPbendersExitsol(SCIP_BENDERS *benders, SCIP_SET *set)
Definition: benders.c:1771
void SCIPbendersSetPostsolve(SCIP_BENDERS *benders, SCIP_DECL_BENDERSPOSTSOLVE((*benderspostsolve)))
Definition: benders.c:4189
SCIP_RETCODE SCIPbendersExit(SCIP_BENDERS *benders, SCIP_SET *set)
Definition: benders.c:1551
common defines and data types used in all packages of SCIP
struct BMS_BlkMem BMS_BLKMEM
Definition: memory.h:427
void SCIPbendersSetInitpre(SCIP_BENDERS *benders, SCIP_DECL_BENDERSINITPRE((*bendersinitpre)))
Definition: benders.c:4112
SCIP_RETCODE SCIPbendersSolveSubproblem(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, int probnumber, SCIP_Bool *infeasible, SCIP_BENDERSENFOTYPE type, SCIP_Bool solvecip, SCIP_Real *objective)
Definition: benders.c:3218
SCIP_Real SCIPbendersGetAuxiliaryVarVal(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_SOL *sol, int probnumber)
Definition: benders.c:3688
#define SCIP_DECL_BENDERSPRESUBSOLVE(x)
Definition: type_benders.h:192
memory allocation routines