SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
collected values of a column which depend on the LP solution We store these values in each column to recover the LP solution at start of diving or probing mode, say, without having to resolve the LP. Note that we do not store the farkascoef value since we do expect a node with infeasible LP to be pruned anyway.
Definition at line 84 of file struct_lp.h.
#include <struct_lp.h>
Data Fields | |
| SCIP_Real | primsol |
| SCIP_Real | redcost |
| unsigned int | basisstatus:2 |
| SCIP_Real SCIP_ColSolVals::primsol |
primal solution value in LP, is 0 if col is not in LP
Definition at line 86 of file struct_lp.h.
Referenced by colRestoreSolVals(), colStoreSolVals(), and SCIPconflictAnalyzeLP().
| SCIP_Real SCIP_ColSolVals::redcost |
reduced cost value in LP, or SCIP_INVALID if not yet calculated
Definition at line 87 of file struct_lp.h.
Referenced by colRestoreSolVals(), colStoreSolVals(), and SCIPconflictAnalyzeLP().
| unsigned int SCIP_ColSolVals::basisstatus |
basis status of column in last LP solution, invalid for non-LP columns
Definition at line 88 of file struct_lp.h.
Referenced by colRestoreSolVals(), colStoreSolVals(), and SCIPconflictAnalyzeLP().