Home
last modified time | relevance | path

Searched refs:redcost (Results 1 – 25 of 42) sorted by relevance

12

/dports/math/cbc/Cbc-releases-2.10.5/Cbc/test/
H A DgamsTest.cpp259 redcost[0] = 0.; in sos2a()
261 redcost[1] = 0.; in sos2a()
263 redcost[2] = 0.; in sos2a()
265 redcost[3] = 0.; in sos2a()
267 redcost[4] = 0.; in sos2a()
269 redcost[5] = 1.; in sos2a()
271 redcost[6] = 1.; in sos2a()
347 delete[] redcost; in sos2a()
416 redcost[1] = 1.0; in semicon1()
417 redcost[2] = 1.0; in semicon1()
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dprop_redcost.c244 SCIP_Real redcost; in propagateRedcostBinvar() local
254 redcost = SCIPgetVarRedcost(scip, var); in propagateRedcostBinvar()
263 if( redcost > requiredredcost ) in propagateRedcostBinvar()
266 SCIPvarGetName(var), requiredredcost, redcost); in propagateRedcostBinvar()
275 redcost = SCIPgetVarRedcost(scip, var); in propagateRedcostBinvar()
284 if( -redcost > requiredredcost ) in propagateRedcostBinvar()
375 SCIP_Real redcost; in propagateRedcostVar() local
380 redcost = SCIPgetColRedcost(scip, col); in propagateRedcostVar()
390 if( SCIPisDualfeasPositive(scip, redcost) ) in propagateRedcostVar()
437 redcost = SCIPgetColRedcost(scip, col); in propagateRedcostVar()
[all …]
H A Dprop_rootredcost.c184 SCIP_Real redcost; in countNonZeroRootRedcostVars() local
188 redcost = SCIPvarGetBestRootRedcost(vars[v]); in countNonZeroRootRedcostVars()
189 if( !SCIPisDualfeasZero(scip, redcost) ) in countNonZeroRootRedcostVars()
266 SCIP_Real redcost; in propdataInit() local
270 redcost = SCIPvarGetBestRootRedcost(var); in propdataInit()
272 if( SCIPisDualfeasZero(scip, redcost) ) in propdataInit()
H A Dbenderscut_opt.c349 SCIP_Real redcost; in computeStandardLPOptimalityCut() local
359 redcost = SCIPgetVarRedcost(subproblem, var); in computeStandardLPOptimalityCut()
368 coef = -1.0*(SCIPvarGetObj(var) + redcost); in computeStandardLPOptimalityCut()
378 if( !SCIPisZero(subproblem, redcost) ) in computeStandardLPOptimalityCut()
382 if( SCIPisPositive(subproblem, redcost) ) in computeStandardLPOptimalityCut()
383 addval = redcost*SCIPvarGetLbLocal(var); in computeStandardLPOptimalityCut()
384 else if( SCIPisNegative(subproblem, redcost) ) in computeStandardLPOptimalityCut()
385 addval = redcost*SCIPvarGetUbLocal(var); in computeStandardLPOptimalityCut()
H A Dprop_obbt.c418 SCIP_Real redcost; in includeVarGenVBound() local
426 redcost = SCIPgetVarRedcost(scip, var); in includeVarGenVBound()
427 assert(redcost != SCIP_INVALID); /*lint !e777 */ in includeVarGenVBound()
429 if( redcost == SCIP_INVALID ) /*lint !e777 */ in includeVarGenVBound()
432 if( redcost < SCIPdualfeastol(scip) && redcost > -SCIPdualfeastol(scip) ) in includeVarGenVBound()
658 SCIP_Real redcost; in createGenVBound() local
660 redcost = SCIPgetVarRedcost(scip, xk); in createGenVBound()
662 assert(redcost != SCIP_INVALID); /*lint !e777 */ in createGenVBound()
676 genvboundcoefs[idx] = redcost; in createGenVBound()
681 assert(redcost >= 0 || !SCIPisInfinity(scip, SCIPvarGetUbLocal(xk))); in createGenVBound()
[all …]
H A Dstruct_lp.h87 …SCIP_Real redcost; /**< reduced cost value in LP, or SCIP_INVALID if not ye… member
140 …SCIP_Real redcost; /**< reduced cost value in LP, or SCIP_INVALID if not ye… member
H A Dheur_lpface.c167 SCIP_Real redcost; in determineVariableFixings() local
185 redcost = SCIPgetColRedcost(scip, col); in determineVariableFixings()
192 if( ! SCIPisDualfeasZero(scip, redcost) ) in determineVariableFixings()
195 if( (redcost > 0 && SCIPisFeasEQ(scip, solval, lbglobal)) || in determineVariableFixings()
196 (redcost < 0 && SCIPisFeasEQ(scip, solval, ubglobal)) ) in determineVariableFixings()
H A Dlp.c475 storedsolvals->redcost = col->redcost; in colStoreSolVals()
500 col->redcost = storedsolvals->redcost; in colRestoreSolVals()
3842 SCIP_Real redcost; in SCIPcolCalcRedcost() local
3850 redcost = col->obj; in SCIPcolCalcRedcost()
3883 return redcost; in SCIPcolCalcRedcost()
3893 SCIP_Real redcost; in colCalcInternalRedcost() local
3900 redcost = col->obj; in colCalcInternalRedcost()
3937 return redcost; in colCalcInternalRedcost()
3961 return col->redcost; in SCIPcolGetRedcost()
14305 SCIP_Real* redcost; in SCIPlpGetSol() local
[all …]
H A Dheur_alns.c1248 SCIP_Real redcost; in getVariableRedcostScore() local
1259 redcost = SCIPvarGetBestRootRedcost(var); in getVariableRedcostScore()
1264 assert(SCIPisDualfeasZero(scip, redcost) in getVariableRedcostScore()
1265 … || (SCIPisDualfeasNegative(scip, redcost) && ! SCIPisFeasPositive(scip, refsolval - bestbound)) in getVariableRedcostScore()
1266 … || (SCIPisDualfeasPositive(scip, redcost) && ! SCIPisFeasNegative(scip, refsolval - bestbound))); in getVariableRedcostScore()
1274 redcost = SCIPgetVarRedcost(scip, var); in getVariableRedcostScore()
1280 assert(SCIPisDualfeasZero(scip, redcost) || SCIPisFeasIntegral(scip, bestbound)); in getVariableRedcostScore()
1282 score = redcost * (refsolval - bestbound); in getVariableRedcostScore()
H A Dvar.c13220 return redcost; in getImplVarRedcost()
13271 SCIP_Real redcost; in SCIPvarGetImplRedcost() local
13359 implredcost += redcost; in SCIPvarGetImplRedcost()
13384 SCIP_Real redcost; in SCIPvarGetImplRedcost() local
13409 redcost = 0.0; in SCIPvarGetImplRedcost()
13423 redcost *= (lb - bounds[v]); in SCIPvarGetImplRedcost()
13425 redcost *= (bounds[v] - lb); in SCIPvarGetImplRedcost()
13433 redcost *= (bounds[v] - ub); in SCIPvarGetImplRedcost()
13435 redcost *= (ub - bounds[v]); in SCIPvarGetImplRedcost()
13449 redcost *= (lb - bounds[v]); in SCIPvarGetImplRedcost()
[all …]
/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dpricer_stp.c191 SCIP_Real redcost; /* reduced cost */ in pricing() local
303 redcost = 0.0; in pricing()
307 redcost += edgecosts[path[tail].edge]; in pricing()
310 redcost -= pricerdata->mi[t]; in pricing()
314 newlowerbound += redcost; in pricing()
317 if( SCIPisNegative(scip, redcost) ) in pricing()
325 SCIP_CALL( SCIPaddPricedVar(scip, var, -redcost) ); in pricing()
H A Dcons_stp.h66 SCIP_Real* RESTRICT redcost, /**< array to store reduced costs or NULL */
85 SCIP_Real* redcost, /**< array to store reduced costs or NULL */
H A Dprop_stp.c375 SCIP_Real* redcost; in reduceRedcostExtended() local
389 SCIP_CALL( SCIPallocBufferArray(scip, &redcost, nedges) ); in reduceRedcostExtended()
398 setRedcosts(scip, vars, nedges, redcost); in reduceRedcostExtended()
401 setVnoiDistances(scip, redcost, propgraph, vnoi, redcostrev, pathdist, pathedge, vbase); in reduceRedcostExtended()
404 …extnfixed = reduce_extendedEdge(scip, propgraph, vnoi, redcost, pathdist, NULL, minpathcost, propg… in reduceRedcostExtended()
413 SCIPfreeBufferArray(scip, &redcost); in reduceRedcostExtended()
H A Dreduce_bnd.c364 treecost += redcost[treeedges[i]]; in shortenSubtree()
378 return (treecostold - redcost[lastedge]); in shortenSubtree()
401 *treecost += redcost[curredge]; in extendSubtreeHead()
433 *treecost += redcost[curredge]; in extendSubtreeTail()
1943 SCIP_Real redcost; in reduceSPG() local
1951 redcost = pathdist[k] + vnoi[k].dist; in reduceSPG()
1961 …(SCIPisGT(scip, redcost, minpathcost) || (solgiven && SCIPisEQ(scip, redcost, minpathcost) && !nod… in reduceSPG()
1984 if( SCIPisGT(scip, redcost, minpathcost) in reduceSPG()
2235 assert(redcost != NULL); in reduceCheckEdge()
2488 assert(redcost != NULL); in reduce_check3Tree()
[all …]
H A Dcons_stp.c1689 SCIP_Real* RESTRICT redcost, /**< array to store reduced costs or NULL */ argument
1771 if( redcost == NULL )
1774 rescap = redcost;
2258 if( redcost == NULL )
2270 SCIP_Real* redcost, /**< array to store reduced costs or NULL */ argument
2359 if( redcost == NULL )
2365 rescap = redcost;
2689 if( redcost == NULL )
/dports/math/SCIP/scip-7.0.3/tests/src/lpi/
H A Dsolve.c108 SCIP_Real* redcost; in solveTest() local
229 BMSallocMemoryArray(&redcost, ncols); in solveTest()
235 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, activity, redcost) ); in solveTest()
241 …cr_assert_float_eq(redcost[j], exp_redcost[j], EPS, "Violation of reduced cost of solution %d: %g … in solveTest()
277 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, activity, redcost) ); in solveTest()
332 BMSfreeMemoryArray(&redcost); in solveTest()
H A Dchange.c955 SCIP_Real redcost[2]; in Test() local
969 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, activity, redcost) ); in Test()
982 cr_assert_arr_eq( redcost, redcost2, 2*sizeof(SCIP_Real) ); in Test()
/dports/math/SCIP/scip-7.0.3/src/lpi/
H A Dlpi_qso.c2510 SCIP_Real* redcost /**< reduced cost vector, may be NULL if not needed */ in SCIPlpiGetSol() argument
2529 QS_CONDRET( QSget_solution(lpi->prob, objval, primsol, dualsol, lpi->irng, redcost) ); in SCIPlpiGetSol()
2583 if( fabs(redcost[i])> FEASTOL ) in SCIPlpiGetSol()
2585 …orMessage("stat col[%d] = %c, rd[%d] = %lg sense %d\n", i, icstat[i], i, redcost[i] * sense, sense… in SCIPlpiGetSol()
2591 if( redcost[i] * sense > FEASTOL ) in SCIPlpiGetSol()
2593 …orMessage("stat col[%d] = %c, rd[%d] = %lg sense %d\n", i, icstat[i], i, redcost[i] * sense, sense… in SCIPlpiGetSol()
2599 if( redcost[i] * sense < -FEASTOL ) in SCIPlpiGetSol()
2601 …orMessage("stat col[%d] = %c, rd[%d] = %lg sense %d\n", i, icstat[i], i, redcost[i] * sense, sense… in SCIPlpiGetSol()
2607 …SCIPerrorMessage("unknown stat col[%d] = %c, rd[%d] = %lg\n", i, icstat[i], i, redcost[i] * sense); in SCIPlpiGetSol()
H A Dlpi.h756 SCIP_Real* redcost /**< reduced cost vector, may be NULL if not needed */
H A Dlpi_msk.c3615 SCIP_Real* redcost /**< reduced cost vector, may be NULL if not needed */ in SCIPlpiGetSol() argument
3634 if( redcost ) in SCIPlpiGetSol()
3683 primsol, dualsol, NULL, NULL, redcost, sux, NULL) ); in SCIPlpiGetSol()
3689 primsol, dualsol, NULL, NULL, redcost, sux, NULL) ); in SCIPlpiGetSol()
3693 if( redcost ) in SCIPlpiGetSol()
3698 redcost[i] -= sux[i]; in SCIPlpiGetSol()
/dports/math/py-PySCIPOpt/PySCIPOpt-3.0.2/src/pyscipopt/
H A Dlp.pxi437 redcost = []
439 redcost[i].append(c_redcost[i])
442 return redcost
/dports/math/osi/Osi-0.108.6/Osi/src/OsiMsk/
H A DOsiMskSolverInterface.cpp3711 double *redcost; in setRowPrice() local
3732 redcost = new double[nc]; in setRowPrice()
3738 mtx->transposeTimes(rs,redcost) ; in setRowPrice()
3742 redcost[j] = getObjCoefficients()[j]-redcost[j]; in setRowPrice()
3744 tslx[j] = CoinMax(0.0,redcost[j]); in setRowPrice()
3745 tsux[j] = CoinMax(0.0,-redcost[j]); in setRowPrice()
3862 delete [] redcost; in setRowPrice()
/dports/math/clp/Clp-1.17.3/Osi/src/OsiMsk/
H A DOsiMskSolverInterface.cpp3711 double *redcost; in setRowPrice() local
3732 redcost = new double[nc]; in setRowPrice()
3738 mtx->transposeTimes(rs,redcost) ; in setRowPrice()
3742 redcost[j] = getObjCoefficients()[j]-redcost[j]; in setRowPrice()
3744 tslx[j] = CoinMax(0.0,redcost[j]); in setRowPrice()
3745 tsux[j] = CoinMax(0.0,-redcost[j]); in setRowPrice()
3862 delete [] redcost; in setRowPrice()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/bound_tightening/
H A Dobbt_iter.cpp304 CouNumber *redcost = NULL; in obbt_iter()
/dports/math/SCIP/scip-7.0.3/scripts/trainEstimation/testdata/
H A D4_neos-1211578.scip.periodic_report.out559 redcost : 13250 0 0 0
570 redcost : 0.02 0.00 0.00 0.01 0.00 0.01

12