SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
collected values of a row which depend on the LP solution We store these values in each row to recover the LP solution at start of diving or probing mode, say, without having to resolve the LP. We do not store the dualfarkas value since we expect a node with infeasible LP to be pruned anyway. In this unlikely case, we have to resolve the LP.
Definition at line 96 of file struct_lp.h.
#include <struct_lp.h>
Data Fields | |
| SCIP_Real | dualsol |
| SCIP_Real | activity |
| unsigned int | basisstatus:2 |
| SCIP_Real SCIP_RowSolVals::dualsol |
dual solution value in LP, is 0 if row is not in LP
Definition at line 98 of file struct_lp.h.
Referenced by rowRestoreSolVals(), rowStoreSolVals(), and SCIPconflictAnalyzeLP().
| SCIP_Real SCIP_RowSolVals::activity |
row activity value in LP, or SCIP_INVALID if not yet calculated
Definition at line 99 of file struct_lp.h.
Referenced by rowRestoreSolVals(), rowStoreSolVals(), and SCIPconflictAnalyzeLP().
| unsigned int SCIP_RowSolVals::basisstatus |
basis status of row in last LP solution, invalid for non-LP rows
Definition at line 100 of file struct_lp.h.
Referenced by rowRestoreSolVals(), rowStoreSolVals(), and SCIPconflictAnalyzeLP().