SCIP
Solving Constraint Integer Programs
lpexact_bounding.c File Reference
Detailed Description
safe exact rational bounding methods
Definition in file lpexact_bounding.c.
#include <stdio.h>#include <assert.h>#include "lpi/lpi.h"#include "lpiexact/lpiexact.h"#include "scip/lpexact_bounding.h"#include "scip/pub_message.h"#include "scip/pub_misc.h"#include "scip/pub_var.h"#include "scip/clock.h"#include "scip/lp.h"#include "scip/lpexact.h"#include "scip/prob.h"#include "scip/rational.h"#include "scip/rationalgmp.h"#include "scip/scip_certificate.h"#include "scip/scip_message.h"#include "scip/scip_prob.h"#include "scip/scip_tree.h"#include "scip/sepastoreexact.h"#include "scip/set.h"#include "scip/stat.h"#include "scip/struct_lpexact.h"#include "scip/struct_scip.h"#include "scip/struct_set.h"#include "scip/primal.h"Go to the source code of this file.
Functions | |
| SCIP_RETCODE | SCIPlpExactComputeSafeBound (SCIP_LP *lp, SCIP_LPEXACT *lpexact, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *prob, SCIP_Bool *lperror, SCIP_Bool usefarkas, SCIP_Real *safebound, SCIP_Bool *primalfeasible, SCIP_Bool *dualfeasible) |
Function Documentation
◆ SCIPlpExactComputeSafeBound()
| SCIP_RETCODE SCIPlpExactComputeSafeBound | ( | SCIP_LP * | lp, |
| SCIP_LPEXACT * | lpexact, | ||
| SCIP_SET * | set, | ||
| SCIP_MESSAGEHDLR * | messagehdlr, | ||
| BMS_BLKMEM * | blkmem, | ||
| SCIP_STAT * | stat, | ||
| SCIP_EVENTQUEUE * | eventqueue, | ||
| SCIP_PROB * | prob, | ||
| SCIP_Bool * | lperror, | ||
| SCIP_Bool | usefarkas, | ||
| SCIP_Real * | safebound, | ||
| SCIP_Bool * | primalfeasible, | ||
| SCIP_Bool * | dualfeasible | ||
| ) |
computes a safe bound for the current floating point LP
- Parameters
-
lp LP data lpexact exact LP data set global SCIP settings messagehdlr message handler blkmem block memory buffers stat problem statistics eventqueue event queue prob problem data lperror pointer to store whether an unresolved LP error occurred usefarkas should infeasibility be proven? safebound pointer to store the calculated safe bound primalfeasible pointer to store whether the solution is primal feasible, or NULL dualfeasible pointer to store whether the solution is dual feasible, or NULL
Definition at line 2304 of file lpexact_bounding.c.
References SCIP_LpExact::allowexactsolve, SCIP_Lp::diving, SCIP_LpExact::dualfeasible, FALSE, SCIP_LpExact::forceexactsolve, SCIP_LpExact::forcesafebound, SCIP_Lp::hasprovedbound, SCIP_Lp::lpsolstat, SCIP_LpExact::lpsolstat, SCIP_Stat::nfailexlp, SCIP_Stat::nfailexlpinf, NULL, SCIP_LpExact::primalfeasible, SCIP_Lp::probing, SCIP_LpExact::projshiftdata, SCIP_Bool, SCIP_CALL, SCIP_LPSOLSTAT_ITERLIMIT, SCIP_LPSOLSTAT_NOTSOLVED, SCIP_LPSOLSTAT_TIMELIMIT, SCIP_OKAY, SCIPABORT, SCIPdebugMessage, SCIPerrorMessage, SCIPgetDepth(), SCIPlpExactAllowExactSolve(), SCIPlpExactSolveAndEval(), SCIPlpGetSolstat(), SCIP_Lp::solved, SCIP_Lp::strongbranchprobing, TRUE, and SCIP_LpExact::wasforcedsafebound.
Referenced by SCIPlpSolveAndEval().