| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | sepastore.c | 567 if( !SCIPsetIsInfinity(set, bound) && SCIPsetIsFeasLE(set, bound, SCIPvarGetUbLocal(var)) ) in sepastoreApplyLb()
594 … if( !SCIPsetIsInfinity(set, bound) && SCIPsetIsFeasLE(set, bound, SCIPvarGetUbGlobal(var)) ) in sepastoreApplyLb()
|
| H A D | primal.c | 748 …if( SCIPsetIsFeasLE(set, obj, SCIPprobInternObjval(transprob, origprob, set, SCIPprobGetObjlim(ori… in primalAddSol()
867 if( SCIPsetIsFeasLE(set, SCIPsolGetOrigObj(sol), SCIPprobGetObjlim(prob, set)) ) in primalAddOrigSol()
1029 …(set, solobj, obj) || (REALABS(obj) > 1e+13 * SCIPsetEpsilon(set) && SCIPsetIsFeasLE(set, solobj, … in primalExistsSol()
|
| H A D | set.h | 1308 SCIP_Bool SCIPsetIsFeasLE(
1629 #define SCIPsetIsFeasLE(set, val1, val2) ( !EPSP(SCIPrelDiff(val1, val2), (set)->num_feastol) ) macro
|
| H A D | scip_numerics.h | 792 #define SCIPisFeasLE(scip, val1, val2) SCIPsetIsFeasLE((scip)->set, val1, val2)
|
| H A D | sol.c | 561 if( SCIPsetIsFeasLE(set, activity, rhs) && SCIPsetIsFeasLE(set, lhs, activity) ) in SCIPsolAdjustImplicitSolVals()
584 assert(SCIPsetIsFeasLE(set, newsolval, SCIPvarGetUbGlobal(var))); in SCIPsolAdjustImplicitSolVals()
|
| H A D | scip_numerics.c | 808 return SCIPsetIsFeasLE(scip->set, val1, val2); in SCIPisFeasLE()
|
| H A D | var.c | 6661 assert(SCIPsetIsFeasLE(set, var->glbdom.lb, var->locdom.lb)); in varProcessChgLbGlobal()
6662 assert(SCIPsetIsFeasLE(set, var->locdom.ub, var->glbdom.ub)); in varProcessChgLbGlobal()
6675 assert(SCIPsetIsFeasLE(set, newbound, var->glbdom.ub)); in varProcessChgLbGlobal()
6694 assert( SCIPsetIsFeasLE(set, var->glbdom.lb, var->locdom.lb) ); in varProcessChgLbGlobal()
6695 assert( SCIPsetIsFeasLE(set, var->locdom.ub, var->glbdom.ub) ); in varProcessChgLbGlobal()
6837 assert(SCIPsetIsFeasLE(set, var->glbdom.lb , var->locdom.lb)); in varProcessChgUbGlobal()
6838 assert(SCIPsetIsFeasLE(set, var->locdom.ub, var->glbdom.ub)); in varProcessChgUbGlobal()
6870 assert( SCIPsetIsFeasLE(set, var->glbdom.lb, var->locdom.lb) ); in varProcessChgUbGlobal()
6871 assert( SCIPsetIsFeasLE(set, var->locdom.ub, var->glbdom.ub) ); in varProcessChgUbGlobal()
7555 assert(SCIPsetIsFeasLE(set, parentnewbound, parentvar->glbdom.ub)); in varProcessChgLbLocal()
[all …]
|
| H A D | tree.c | 1763 assert(SCIPsetIsFeasLE(set, bound, SCIPvarGetUbGlobal(var))); in treeAddPendingBdchg()
1898 assert(SCIPsetIsFeasLE(set, newbound, oldub)); in SCIPnodeAddBoundinfer()
2553 if( SCIPsetIsFeasLE(set, implbounds[j], lb) ) in SCIPnodePropagateImplics()
5544 assert(SCIPsetIsFeasLE(set, val, SCIPvarGetUbLocal(var))); in SCIPtreeBranchVar()
5666 if( SCIPsetIsFeasLE(set, fixval+1.0, ub) ) in SCIPtreeBranchVar()
5813 assert(SCIPsetIsFeasLE(set, right, SCIPvarGetUbLocal(var))); in SCIPtreeBranchVarHole()
6027 assert(SCIPsetIsFeasLE(set, val, SCIPvarGetUbLocal(var))); in SCIPtreeBranchVarNary()
|
| H A D | reopt.c | 3650 …if( boundtype == SCIP_BOUNDTYPE_LOWER && SCIPsetIsGT(set, newbound, oldlb) && SCIPsetIsFeasLE(set,… in changeAncestorBranchings()
3701 …type == SCIP_BOUNDTYPE_LOWER && SCIPsetIsGT(set, newbound, oldlb) && SCIPsetIsFeasLE(set, newbound… in changeAncestorBranchings()
3845 …if( boundtype == SCIP_BOUNDTYPE_LOWER && SCIPsetIsGT(set, newbound, oldlb) && SCIPsetIsFeasLE(set,… in addSplitcons()
4076 && SCIPsetIsFeasLE(set, val, SCIPvarGetUbLocal(var)) ) in fixBounds()
4219 && SCIPsetIsFeasLE(set, val, SCIPvarGetUbLocal(var)) ) in fixInterdiction()
|
| H A D | conflict.c | 2240 if( SCIPsetIsFeasLE(set, SCIPvarGetUbGlobal(var), bound) ) in checkRedundancy()
4245 … || (boundtype == SCIP_BOUNDTYPE_UPPER && SCIPsetIsFeasLE(set, bound, SCIPvarGetLbGlobal(var))))); in isBoundchgUseless()
7085 if( infdelta || SCIPsetIsFeasLE(set, *farkasact, SCIPaggrRowGetRhs(farkasrow))) in getFarkasProof()
7309 if( infdelta || SCIPsetIsFeasLE(set, *farkasact, SCIPaggrRowGetRhs(farkasrow))) in getDualProof()
7760 if( SCIPsetIsFeasLE(set, minact, rhs) ) in conflictAnalyzeDualProof()
|
| H A D | lp.c | 12278 … assert(SCIPsetIsInfinity(set, col->lazyub) || SCIPsetIsFeasLE(set, col->primsol, col->lazyub)); in checkLazyBounds()
14418 SCIPsetIsFeasLE(set, lpicols[c]->primsol, lpicols[c]->ub), in SCIPlpGetSol()
14446 SCIPsetIsFeasLE(set, lpicols[c]->primsol, lpicols[c]->ub), in SCIPlpGetSol()
14478 …&& (SCIPsetIsInfinity(set, lpirows[r]->rhs) || SCIPsetIsFeasLE(set, lpirows[r]->activity, lpirows[… in SCIPlpGetSol()
14502 SCIPsetIsFeasLE(set, lpirows[r]->activity, lpirows[r]->rhs), in SCIPlpGetSol()
14524 SCIPsetIsFeasLE(set, lpirows[r]->activity, lpirows[r]->rhs), in SCIPlpGetSol()
14552 stillprimalfeasible = SCIPsetIsFeasLE(set, primalbound, lp->lpobjval); in SCIPlpGetSol()
14554 …SCIPsetIsFeasLE(set, primalbound, lp->lpobjval), primalfeasible != NULL ? stillprimalfeasible : TR… in SCIPlpGetSol()
14851 …&& (SCIPsetIsInfinity(set, lpirows[r]->rhs) || SCIPsetIsFeasLE(set, lpirows[r]->activity, lpirows[… in SCIPlpGetUnboundedSol()
|
| H A D | debug.c | 645 *solcontained = SCIPsetIsFeasLE(set, varsol, boundchgs[i].newbound); in isSolutionInNode()
|
| H A D | branch.c | 271 assert(SCIPsetIsInfinity(set, col->ub) || SCIPsetIsFeasLE(set, primsol, col->ub)); in branchcandCalcLPCands()
|
| H A D | set.c | 5729 #undef SCIPsetIsFeasLE
6352 SCIP_Bool SCIPsetIsFeasLE( in SCIPsetIsFeasLE() function
|
| H A D | nlp.c | 3716 ((SCIPsetIsInfinity(set, -lb) || SCIPsetIsFeasLE(set, lb, SCIPvarGetNLPSol(var))) && in nlpUpdateVarBounds()
4804 …SCIPsetIsFeasLE(set, solval, SCIPvarGetUbLocal(nlp->vars[i])) || nlp->solstat > SCIP_NLPSOLSTAT_FE… in nlpSolve()
|
| H A D | implics.c | 687 … if( poslower >= 0 && SCIPsetIsFeasLE(set, implbound, (*implics)->bounds[varfixing][poslower]) ) in SCIPimplicsAdd()
|