Scippy

GCG

Branch-and-Price & Column Generation for Everyone

SCIP_RelaxData Struct Reference

Detailed Description

relaxator data

Definition at line 100 of file relax_gcg.c.

Data Fields

SCIP * masterprob
 
SCIP * altmasterprob
 
SCIP ** pricingprobs
 
int npricingprobs
 
int nrelpricingprobs
 
int * blockrepresentative
 
int * nblocksidentical
 
SCIP_CONS ** convconss
 
int ntransvars
 
int nlinkingvars
 
int nvarlinkconss
 
SCIP_Real pricingprobsmemused
 
SCIP_HASHMAP * hashorig2origvar
 
SCIP_CONS ** masterconss
 
SCIP_CONS ** origmasterconss
 
SCIP_CONS ** linearmasterconss
 
SCIP_CONS ** varlinkconss
 
int * varlinkconsblock
 
int maxmasterconss
 
int nmasterconss
 
SCIP_SOL * currentorigsol
 
SCIP_Bool origsolfeasible
 
SCIP_Longint lastmasterlpiters
 
SCIP_SOL * lastmastersol
 
SCIP_CONS ** markedmasterconss
 
int nmarkedmasterconss
 
int maxmarkedmasterconss
 
SCIP_Longint lastsolvednodenr
 
GCG_BRANCHRULE ** branchrules
 
int nbranchrules
 
SCIP_Bool discretization
 
SCIP_Bool mipdiscretization
 
SCIP_Bool aggregation
 
SCIP_Bool masterissetpart
 
SCIP_Bool masterissetcover
 
SCIP_Bool dispinfos
 
DEC_DECMODE mode
 
int origverblevel
 
SCIP_Bool usebliss
 
int searchnodelimit
 
int generatorlimit
 
SCIP_Bool masterinprobing
 
SCIP_HEUR * probingheur
 
SCIP_SOL * storedorigsol
 
SCIP_Bool storedfeasibility
 
DEC_DECOMPdecomp
 
SCIP_Bool relaxisinitialized
 
SCIP_Longint simplexiters
 
SCIP_CLOCK * rootnodetime
 
GCG_PARAMDATAparamsvisu
 

Field Documentation

◆ masterprob

SCIP* SCIP_RelaxData::masterprob

the master problem

Definition at line 103 of file relax_gcg.c.

◆ altmasterprob

SCIP* SCIP_RelaxData::altmasterprob

the master problem for the alternate decomposition algorithm

Definition at line 104 of file relax_gcg.c.

◆ pricingprobs

SCIP** SCIP_RelaxData::pricingprobs

the array of pricing problems

Definition at line 105 of file relax_gcg.c.

◆ npricingprobs

int SCIP_RelaxData::npricingprobs

the number of pricing problems

Definition at line 106 of file relax_gcg.c.

◆ nrelpricingprobs

int SCIP_RelaxData::nrelpricingprobs

the number of relevant pricing problems

Definition at line 107 of file relax_gcg.c.

◆ blockrepresentative

int* SCIP_RelaxData::blockrepresentative

number of the pricing problem, that represents the i-th problem

Definition at line 108 of file relax_gcg.c.

◆ nblocksidentical

int* SCIP_RelaxData::nblocksidentical

number of pricing blocks represented by the i-th pricing problem

Definition at line 109 of file relax_gcg.c.

◆ convconss

SCIP_CONS** SCIP_RelaxData::convconss

array of convexity constraints, one for each block

Definition at line 110 of file relax_gcg.c.

◆ ntransvars

int SCIP_RelaxData::ntransvars

number of variables directly transferred to the master problem

Definition at line 111 of file relax_gcg.c.

◆ nlinkingvars

int SCIP_RelaxData::nlinkingvars

number of linking variables

Definition at line 112 of file relax_gcg.c.

◆ nvarlinkconss

int SCIP_RelaxData::nvarlinkconss

number of constraints that ensure that copies of linking variables have the same value

Definition at line 113 of file relax_gcg.c.

◆ pricingprobsmemused

SCIP_Real SCIP_RelaxData::pricingprobsmemused

sum of memory used after problem creation stage of all pricing problems

Definition at line 114 of file relax_gcg.c.

◆ hashorig2origvar

SCIP_HASHMAP* SCIP_RelaxData::hashorig2origvar

hashmap mapping original variables to themselves

Definition at line 117 of file relax_gcg.c.

◆ masterconss

SCIP_CONS** SCIP_RelaxData::masterconss

array of constraints in the master problem

Definition at line 120 of file relax_gcg.c.

◆ origmasterconss

SCIP_CONS** SCIP_RelaxData::origmasterconss

array of constraints in the original problem that belong to the master problem

Definition at line 121 of file relax_gcg.c.

◆ linearmasterconss

SCIP_CONS** SCIP_RelaxData::linearmasterconss

array of linear constraints equivalent to the cons in the original problem that belong to the master problem

Definition at line 123 of file relax_gcg.c.

◆ varlinkconss

SCIP_CONS** SCIP_RelaxData::varlinkconss

array of constraints ensuring linking vars equality

Definition at line 125 of file relax_gcg.c.

◆ varlinkconsblock

int* SCIP_RelaxData::varlinkconsblock

array of constraints ensuring linking vars equality

Definition at line 126 of file relax_gcg.c.

◆ maxmasterconss

int SCIP_RelaxData::maxmasterconss

length of the array mastercons

Definition at line 127 of file relax_gcg.c.

◆ nmasterconss

int SCIP_RelaxData::nmasterconss

number of constraints saved in mastercons

Definition at line 128 of file relax_gcg.c.

◆ currentorigsol

SCIP_SOL* SCIP_RelaxData::currentorigsol

current lp solution transformed into the original space

Definition at line 130 of file relax_gcg.c.

◆ origsolfeasible

SCIP_Bool SCIP_RelaxData::origsolfeasible

is the current lp solution primal feasible in the original space?

Definition at line 131 of file relax_gcg.c.

◆ lastmasterlpiters

SCIP_Longint SCIP_RelaxData::lastmasterlpiters

number of lp iterations when currentorigsol was updated the last time

Definition at line 132 of file relax_gcg.c.

◆ lastmastersol

SCIP_SOL* SCIP_RelaxData::lastmastersol

last feasible master solution that was added to the original problem

Definition at line 133 of file relax_gcg.c.

◆ markedmasterconss

SCIP_CONS** SCIP_RelaxData::markedmasterconss

array of conss that are marked to be in the master

Definition at line 134 of file relax_gcg.c.

◆ nmarkedmasterconss

int SCIP_RelaxData::nmarkedmasterconss

number of elements in array of conss that are marked to be in the master

Definition at line 135 of file relax_gcg.c.

◆ maxmarkedmasterconss

int SCIP_RelaxData::maxmarkedmasterconss

capacity of markedmasterconss

Definition at line 136 of file relax_gcg.c.

◆ lastsolvednodenr

SCIP_Longint SCIP_RelaxData::lastsolvednodenr

node number of the node that was solved at the last call of the relaxator

Definition at line 137 of file relax_gcg.c.

◆ branchrules

GCG_BRANCHRULE** SCIP_RelaxData::branchrules

branching rules registered in the relaxator

Definition at line 140 of file relax_gcg.c.

◆ nbranchrules

int SCIP_RelaxData::nbranchrules

number of branching rules registered in the relaxator

Definition at line 141 of file relax_gcg.c.

◆ discretization

SCIP_Bool SCIP_RelaxData::discretization

TRUE: use discretization approach; FALSE: use convexification approach

Definition at line 144 of file relax_gcg.c.

◆ mipdiscretization

SCIP_Bool SCIP_RelaxData::mipdiscretization

TRUE: use discretization approach in MIPs; FALSE: use convexification approach in MIPs

Definition at line 145 of file relax_gcg.c.

◆ aggregation

SCIP_Bool SCIP_RelaxData::aggregation

should identical blocks be aggregated (only for discretization approach)?

Definition at line 146 of file relax_gcg.c.

◆ masterissetpart

SCIP_Bool SCIP_RelaxData::masterissetpart

is the master a set partitioning problem?

Definition at line 147 of file relax_gcg.c.

◆ masterissetcover

SCIP_Bool SCIP_RelaxData::masterissetcover

is the master a set covering problem?

Definition at line 148 of file relax_gcg.c.

◆ dispinfos

SCIP_Bool SCIP_RelaxData::dispinfos

should additional information be displayed?

Definition at line 149 of file relax_gcg.c.

◆ mode

DEC_DECMODE SCIP_RelaxData::mode

the decomposition mode for GCG. 0: Dantzig-Wolfe (default), 1: Benders' decomposition, 2: automatic

Definition at line 150 of file relax_gcg.c.

◆ origverblevel

int SCIP_RelaxData::origverblevel

the verbosity level of the original problem

Definition at line 151 of file relax_gcg.c.

◆ usebliss

SCIP_Bool SCIP_RelaxData::usebliss

should bliss be used to check for identical blocks?

Definition at line 152 of file relax_gcg.c.

◆ searchnodelimit

int SCIP_RelaxData::searchnodelimit

bliss search node limit (requires patched bliss version)

Definition at line 153 of file relax_gcg.c.

◆ generatorlimit

int SCIP_RelaxData::generatorlimit

bliss generator limit (requires patched bliss version)

Definition at line 154 of file relax_gcg.c.

◆ masterinprobing

SCIP_Bool SCIP_RelaxData::masterinprobing

is the master problem in probing mode?

Definition at line 157 of file relax_gcg.c.

◆ probingheur

SCIP_HEUR* SCIP_RelaxData::probingheur

heuristic that started probing in master problem, or NULL

Definition at line 158 of file relax_gcg.c.

◆ storedorigsol

SCIP_SOL* SCIP_RelaxData::storedorigsol

original solution that was stored before the probing

Definition at line 159 of file relax_gcg.c.

◆ storedfeasibility

SCIP_Bool SCIP_RelaxData::storedfeasibility

is the stored original solution feasible?

Definition at line 160 of file relax_gcg.c.

◆ decomp

DEC_DECOMP* SCIP_RelaxData::decomp

structure information

Definition at line 163 of file relax_gcg.c.

◆ relaxisinitialized

SCIP_Bool SCIP_RelaxData::relaxisinitialized

indicates whether the relaxator is initialized

Definition at line 164 of file relax_gcg.c.

◆ simplexiters

SCIP_Longint SCIP_RelaxData::simplexiters

cumulative simplex iterations

Definition at line 167 of file relax_gcg.c.

◆ rootnodetime

SCIP_CLOCK* SCIP_RelaxData::rootnodetime

time in root node

Definition at line 168 of file relax_gcg.c.

◆ paramsvisu

GCG_PARAMDATA* SCIP_RelaxData::paramsvisu

parameters for visualization

Definition at line 171 of file relax_gcg.c.