/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | sepastore.c | 174 SCIP_Real minactivity; in sepastoreIsCutRedundant() local 189 minactivity = SCIProwGetMinActivity(cut, set, stat); in sepastoreIsCutRedundant() 192 if( (SCIPsetIsInfinity(set, -lhs) || SCIPsetIsLE(set, lhs, minactivity)) && in sepastoreIsCutRedundant() 196 SCIProwGetName(cut), lhs, rhs, minactivity, maxactivity); in sepastoreIsCutRedundant() 214 SCIP_Real minactivity; in sepastoreIsCutRedundantOrInfeasible() local 232 minactivity = SCIProwGetMinActivity(cut, set, stat); in sepastoreIsCutRedundantOrInfeasible() 235 if( (SCIPsetIsInfinity(set, -lhs) || SCIPsetIsLE(set, lhs, minactivity)) && in sepastoreIsCutRedundantOrInfeasible() 239 SCIProwGetName(cut), lhs, rhs, minactivity, maxactivity); in sepastoreIsCutRedundantOrInfeasible() 244 if( (!SCIPsetIsInfinity(set, rhs) && SCIPsetIsFeasGT(set, minactivity, rhs)) || in sepastoreIsCutRedundantOrInfeasible() 248 SCIProwGetName(cut), lhs, rhs, minactivity, maxactivity); in sepastoreIsCutRedundantOrInfeasible()
|
H A D | struct_matrix.h | 65 SCIP_Real* minactivity; /**< min activity per row */ member
|
H A D | presol_dualsparsify.c | 235 SCIP_Real minactivity; in getMinActivitySingleRowWithoutCol() local 244 minactivity = 0; in getMinActivitySingleRowWithoutCol() 263 minactivity += val * lb; in getMinActivitySingleRowWithoutCol() 270 minactivity += val * ub; in getMinActivitySingleRowWithoutCol() 274 return minactivity; in getMinActivitySingleRowWithoutCol() 298 SCIP_Real minactivity; in getMinMaxActivityResiduals() local 319 minactivity = SCIPmatrixGetRowMinActivity(matrix, row); in getMinMaxActivityResiduals() 364 *minresactivity = minactivity - val * lb; in getMinMaxActivityResiduals() 410 *minresactivity = minactivity - val * ub; in getMinMaxActivityResiduals()
|
H A D | struct_nlp.h | 99 …SCIP_Real minactivity; /**< minimal activity value w.r.t. the variables' bounds… member
|
H A D | matrix.c | 372 matrix->minactivity[row] = 0; in calcActivityBounds() 408 matrix->minactivity[row] += val * matrix->lb[col]; in calcActivityBounds() 421 matrix->minactivity[row] += val * matrix->ub[col]; in calcActivityBounds() 430 matrix->minactivity[row] = -SCIPinfinity(scip); in calcActivityBounds() 643 SCIP_CALL( SCIPallocBufferArray(scip, &matrix->minactivity, nconss) ); in SCIPmatrixCreate() 1002 SCIPfreeBufferArray(scip, &matrix->minactivity); in SCIPmatrixCreate() 1063 SCIPfreeBufferArray(scip, &((*matrix)->minactivity)); in SCIPmatrixFree() 1166 matrix->minactivity[row] = -SCIPinfinity(scip); in SCIPmatrixRemoveColumnBounds() 1756 return matrix->minactivity[row]; in SCIPmatrixGetRowMinActivity()
|
H A D | cons_linear.c | 1297 consdata->minactivity = 0; in consdataRecomputeMinactivity() 1991 …assert(!SCIPisInfinity(scip, -consdata->minactivity) && !SCIPisInfinity(scip, consdata->minactivit… in consdataUpdateActivitiesLb() 2333 consdata->minactivity = 0.0; in consdataCalcActivities() 2394 assert(minactivity != NULL); in getMinActivity() 2591 assert(minactivity != NULL); in consdataGetActivityBounds() 7144 SCIP_Real minactivity; in tightenBounds() local 7687 SCIP_Real minactivity; in propagateCons() local 14002 SCIP_Real minactivity; in presolStuffing() local 14037 minactivity = SCIP_INVALID; in presolStuffing() 14050 maxactivity = -minactivity; in presolStuffing() [all …]
|
H A D | debug.c | 825 SCIP_Real minactivity; in SCIPdebugCheckRow() local 861 minactivity = SCIProwGetConstant(row); in SCIPdebugCheckRow() 862 maxactivity = minactivity; in SCIPdebugCheckRow() 873 minactivity += vals[i] * solval; in SCIPdebugCheckRow() 878 minactivity += vals[i] * SCIPvarGetLbGlobal(var); in SCIPdebugCheckRow() 883 minactivity += vals[i] * SCIPvarGetUbGlobal(var); in SCIPdebugCheckRow() 888 SCIProwGetName(row), lhs, minactivity, maxactivity, rhs); in SCIPdebugCheckRow() 891 …if( maxactivity + SCIPgetLPFeastol(set->scip) < lhs || minactivity - SCIPgetLPFeastol(set->scip) >… in SCIPdebugCheckRow() 894 …SCIProwGetName(row), lhs, rhs, minactivity, maxactivity, SCIProwIsLocal(row), SCIPgetLPFeastol(set… in SCIPdebugCheckRow()
|
H A D | pub_matrix.h | 263 #define SCIPmatrixGetRowMinActivity(matrix,row) (matrix->minactivity[row])
|
H A D | struct_lp.h | 208 …SCIP_Real minactivity; /**< minimal activity value w.r.t. the column's bounds, … member
|
H A D | nlp.c | 514 nlrow->minactivity = SCIP_INVALID; in nlrowLinearCoefChanged() 566 nlrow->minactivity = SCIP_INVALID; in nlrowQuadElemChanged() 634 nlrow->minactivity = SCIP_INVALID; in nlrowExprtreeChanged() 705 nlrow->minactivity = SCIP_INVALID; in nlrowExprtreeParamChanged() 796 nlrow->minactivity = SCIP_INVALID; in nlrowConstantChanged() 2138 (*nlrow)->minactivity = SCIP_INVALID; in SCIPnlrowCreate() 2181 (*nlrow)->minactivity = sourcenlrow->minactivity; in SCIPnlrowCreateCopy() 3205 assert(nlrow->minactivity < SCIP_INVALID); in SCIPnlrowGetActivityBounds() 3208 if( minactivity != NULL ) in SCIPnlrowGetActivityBounds() 3209 *minactivity = nlrow->minactivity; in SCIPnlrowGetActivityBounds() [all …]
|
H A D | cons_superindicator.c | 228 SCIP_Real* minactivity, /**< pointer to return the minimal activity */ in extractLinearValues() argument 242 assert(minactivity != NULL); in extractLinearValues() 253 *minactivity = 0.0; in extractLinearValues() 281 *minactivity += (val > 0.0) ? val * lb : val * ub; in extractLinearValues() 294 *minactivity = -SCIPinfinity(scip); in extractLinearValues()
|
H A D | prop_genvbounds.c | 771 SCIP_Real minactivity; in resolveGenVBoundPropagation() local 823 …minactivity = getGenVBoundsMinActivityConflict(scip, genvbound->vars, genvbound->coefs, genvbound-… in resolveGenVBoundPropagation() 825 SCIPdebugMsg(scip, "minactivity of right-hand side is minactivity=%.15g\n", minactivity); in resolveGenVBoundPropagation() 831 if( SCIPisLT(scip, minactivity, tmpboundval) ) in resolveGenVBoundPropagation() 838 assert(SCIPisGE(scip, minactivity, tmpboundval)); in resolveGenVBoundPropagation() 840 slack = MAX(minactivity - tmpboundval, 0.0); in resolveGenVBoundPropagation()
|
H A D | scip_nlp.h | 1212 SCIP_Real* minactivity, /**< buffer to store minimal activity, or NULL */
|
H A D | nlp.h | 364 SCIP_Real* minactivity, /**< buffer to store minimal activity, or NULL */
|
H A D | cons_indicator.c | 4900 SCIP_Real minactivity = 0.0; in SCIP_DECL_LINCONSUPGD() local 4964 minactivity = -SCIPinfinity(scip); in SCIP_DECL_LINCONSUPGD() 4967 if ( ! SCIPisInfinity(scip, -minactivity) ) in SCIP_DECL_LINCONSUPGD() 4968 minactivity += val * lb; in SCIP_DECL_LINCONSUPGD() 4992 if ( SCIPisInfinity(scip, -minactivity) && SCIPisInfinity(scip, maxactivity) ) in SCIP_DECL_LINCONSUPGD() 5016 if ( ! SCIPisInfinity(scip, -minactivity) && ! SCIPisInfinity(scip, -lhs) ) in SCIP_DECL_LINCONSUPGD() 5019 if ( SCIPisGE(scip, minactivity, lhs) ) in SCIP_DECL_LINCONSUPGD() 5023 if ( SCIPisGE(scip, minactivity + indval, lhs) ) in SCIP_DECL_LINCONSUPGD() 5104 SCIPinfoMessage(scip, NULL, " (minact: %f, maxact: %f)\n", minactivity, maxactivity); in SCIP_DECL_LINCONSUPGD()
|
H A D | scip_nlp.c | 2010 SCIP_Real* minactivity, /**< buffer to store minimal activity, or NULL */ in SCIPgetNlRowActivityBounds() argument 2016 SCIP_CALL( SCIPnlrowGetActivityBounds(nlrow, scip->set, scip->stat, minactivity, maxactivity) ); in SCIPgetNlRowActivityBounds()
|
H A D | lp.c | 1657 row->minactivity = SCIP_INVALID; in coefChanged() 5183 (*row)->minactivity = SCIP_INVALID; in SCIProwCreate() 5601 assert(row->minactivity < SCIP_INVALID); in SCIProwChgConstant() 6533 row->minactivity = row->constant; in rowCalcActivityBounds() 6546 row->minactivity += val * col->lb; in rowCalcActivityBounds() 6555 row->minactivity += val * col->ub; in rowCalcActivityBounds() 6562 row->minactivity = -SCIPsetInfinity(set); in rowCalcActivityBounds() 6600 assert(row->minactivity < SCIP_INVALID); in SCIProwGetMinActivity() 6603 return row->minactivity; in SCIProwGetMinActivity() 6621 assert(row->minactivity < SCIP_INVALID); in SCIProwGetMaxActivity() [all …]
|
/dports/math/highs/HiGHS-cfe064e/src/presolve/ |
H A D | HighsLpPropagator.h | 60 double Rupper, const HighsCDouble& minactivity,
|
H A D | HighsLpPropagator.cpp | 117 const HighsCDouble& minactivity, in propagateRowUpper() argument 130 minresact = minactivity; in propagateRowUpper() 132 minresact = minactivity - actcontribution; in propagateRowUpper()
|
/dports/math/highs/HiGHS-cfe064e/src/mip/ |
H A D | HighsDomain.cpp | 102 const HighsCDouble& minactivity, int ninfmin, in propagateRowUpper() argument 104 assert(std::isfinite(double(minactivity))); in propagateRowUpper() 114 minresact = minactivity; in propagateRowUpper() 116 minresact = minactivity - actcontribution; in propagateRowUpper()
|
H A D | HighsDomain.h | 62 double Rupper, const HighsCDouble& minactivity,
|
/dports/math/py-PySCIPOpt/PySCIPOpt-3.0.2/src/pyscipopt/ |
H A D | scip.pyx | 2823 cdef SCIP_Real minactivity 2826 …PY_SCIP_CALL( SCIPgetNlRowActivityBounds(self._scip, nlrow.scip_nlrow, &minactivity, &maxactivity)… 2827 return (minactivity, maxactivity)
|
H A D | scip.pxd | 1522 …SCIP_RETCODE SCIPgetNlRowActivityBounds(SCIP* scip, SCIP_NLROW* nlrow, SCIP_Real* minactivity, SCI…
|