/dports/science/opensim-core/opensim-core-4.1/Bindings/Python/examples/ |
H A D | dynamic_walker_example_optimization.py | 136 bestsol = all_candsols[idx] variable 137 print(bestsol) 140 model.getCoordinateSet().get('LHip_rz').setDefaultValue(bestsol[0]) 141 model.getCoordinateSet().get('RHip_rz').setDefaultValue(bestsol[1]) 142 model.getCoordinateSet().get('LKnee_rz').setDefaultValue(bestsol[2]) 143 model.getCoordinateSet().get('RKnee_rz').setDefaultValue(bestsol[3]) 144 model.getCoordinateSet().get('Pelvis_tx').setDefaultSpeedValue(bestsol[4]) 145 model.getCoordinateSet().get('LHip_rz').setDefaultSpeedValue(bestsol[5]) 146 model.getCoordinateSet().get('RHip_rz').setDefaultSpeedValue(bestsol[6]) 147 model.getCoordinateSet().get('LKnee_rz').setDefaultSpeedValue(bestsol[7]) [all …]
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | heur_trustregion.c | 158 SCIP_SOL* bestsol; in addTrustRegionConstraints() local 174 bestsol = SCIPgetBestSol(scip); in addTrustRegionConstraints() 175 assert( bestsol != NULL ); in addTrustRegionConstraints() 448 SCIP_SOL* bestsol; in SCIP_DECL_HEUREXEC() local 473 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 474 assert(bestsol != NULL); in SCIP_DECL_HEUREXEC() 477 if( SCIPsolIsOriginal(bestsol) ) in SCIP_DECL_HEUREXEC() 485 …if( SCIPsolGetHeur(bestsol) != NULL && strcmp(SCIPheurGetName(SCIPsolGetHeur(bestsol)), "trivial")… in SCIP_DECL_HEUREXEC() 506 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 509 if( heurdata->lastsol != bestsol ) in SCIP_DECL_HEUREXEC() [all …]
|
H A D | branch_mostinf.c | 52 …SCIP_Real* bestsol, /**< proposed branching point of best branching candidat… in updateBestCandidate() argument 170 updateBestCandidate(scip, bestvar, bestscore, bestobj, bestsol, in updateBestCandidate() 184 updateBestCandidate(scip, bestvar, bestscore, bestobj, bestsol, in updateBestCandidate() 203 *bestsol = candsol; in updateBestCandidate() 298 SCIP_Real bestsol; in SCIP_DECL_BRANCHEXECEXT() local 320 bestsol = SCIP_INVALID; in SCIP_DECL_BRANCHEXECEXT() 323 …updateBestCandidate(scip, &bestcand, &bestscore, &bestobj, &bestsol, externcands[i], externcandssc… in SCIP_DECL_BRANCHEXECEXT() 333 brpoint = SCIPgetBranchingPoint(scip, bestcand, bestsol); in SCIP_DECL_BRANCHEXECEXT() 336 nexterncands, SCIPvarGetName(bestcand), bestsol, bestobj, in SCIP_DECL_BRANCHEXECEXT()
|
H A D | branch_leastinf.c | 52 …SCIP_Real* bestsol, /**< proposed branching point of best branching candidat… in updateBestCandidate() argument 170 updateBestCandidate(scip, bestvar, bestscore, bestobj, bestsol, in updateBestCandidate() 184 updateBestCandidate(scip, bestvar, bestscore, bestobj, bestsol, in updateBestCandidate() 203 *bestsol = candsol; in updateBestCandidate() 299 SCIP_Real bestsol; in SCIP_DECL_BRANCHEXECEXT() local 321 bestsol = SCIP_INVALID; in SCIP_DECL_BRANCHEXECEXT() 324 …updateBestCandidate(scip, &bestcand, &bestscore, &bestobj, &bestsol, externcands[i], externcandssc… in SCIP_DECL_BRANCHEXECEXT() 334 brpoint = SCIPgetBranchingPoint(scip, bestcand, bestsol); in SCIP_DECL_BRANCHEXECEXT() 337 nexterncands, SCIPvarGetName(bestcand), bestsol, bestobj, in SCIP_DECL_BRANCHEXECEXT()
|
H A D | heur_localbranching.c | 133 SCIP_SOL* bestsol; in addLocalbranchingConstraintAndObjcutoff() local 157 bestsol = SCIPgetBestSol(scip); in addLocalbranchingConstraintAndObjcutoff() 158 assert( bestsol != NULL ); in addLocalbranchingConstraintAndObjcutoff() 177 solval = SCIPgetSolVal(scip, bestsol, vars[i]); in addLocalbranchingConstraintAndObjcutoff() 522 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 523 assert(bestsol != NULL); in SCIP_DECL_HEUREXEC() 526 if( SCIPsolIsOriginal(bestsol) ) in SCIP_DECL_HEUREXEC() 530 if( SCIPgetNNodes(scip) - SCIPgetSolNodenum(scip, bestsol) < heurdata->nwaitingnodes) in SCIP_DECL_HEUREXEC() 534 …if( SCIPsolGetHeur(bestsol) != NULL && strcmp(SCIPheurGetName(SCIPsolGetHeur(bestsol)), "trivial")… in SCIP_DECL_HEUREXEC() 538 if( heurdata->lastsol != bestsol ) in SCIP_DECL_HEUREXEC() [all …]
|
H A D | heur_guideddiving.c | 211 SCIP_SOL* bestsol; in SCIP_DECL_DIVESETGETSCORE() local 217 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_DIVESETGETSCORE() 218 assert(bestsol != NULL); in SCIP_DECL_DIVESETGETSCORE() 219 assert(!SCIPsolIsOriginal(bestsol)); in SCIP_DECL_DIVESETGETSCORE() 221 bestsolval = SCIPgetSolVal(scip, bestsol, cand); in SCIP_DECL_DIVESETGETSCORE()
|
H A D | heur_indicator.c | 472 SCIP_SOL* bestsol; in SCIP_DECL_HEUREXEC() local 480 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 481 if ( bestsol == heurdata->lastsol ) in SCIP_DECL_HEUREXEC() 483 heurdata->lastsol = bestsol; in SCIP_DECL_HEUREXEC() 486 if ( SCIPsolGetHeur(bestsol) == heur ) in SCIP_DECL_HEUREXEC() 514 val = SCIPgetSolVal(scip, bestsol, binvar); in SCIP_DECL_HEUREXEC() 521 …ebugMsg(scip, "Trying to improve best solution of value %f.\n", SCIPgetSolOrigObj(scip, bestsol) ); in SCIP_DECL_HEUREXEC()
|
H A D | scip_validation.c | 100 SCIP_SOL* bestsol = SCIPgetBestSol(scip); in SCIPvalidateSolve() local 104 assert(bestsol != NULL); in SCIPvalidateSolve() 114 SCIP_CALL( SCIPcheckSolOrig(scip, bestsol, &localfeasible, !quiet, TRUE) ); in SCIPvalidateSolve()
|
H A D | heur_dins.c | 135 SCIP_SOL* bestsol; in computeIntegerVariableBounds() local 146 bestsol = SCIPgetBestSol(scip); in computeIntegerVariableBounds() 147 mipsol = SCIPgetSolVal(scip, bestsol, var); in computeIntegerVariableBounds() 210 SCIP_SOL* bestsol; in determineVariableFixings() local 228 bestsol = SCIPgetBestSol(scip); in determineVariableFixings() 229 assert(bestsol != NULL); in determineVariableFixings() 271 mipsolval = SCIPgetSolVal(scip, bestsol, vars[i]); in determineVariableFixings() 374 SCIP_SOL* bestsol; in addLocalBranchingConstraint() local 392 bestsol = SCIPgetBestSol(scip); in addLocalBranchingConstraint() 393 assert(bestsol != NULL); in addLocalBranchingConstraint() [all …]
|
H A D | heur_oneopt.c | 241 SCIP_SOL* bestsol, /**< incumbent solution */ in setupAndSolveSubscipOneopt() argument 271 … SCIP_CALL( SCIPsetSolVal(subscip, startsol, subvars[i], SCIPgetSolVal(scip, bestsol, vars[i])) ); in setupAndSolveSubscipOneopt() 449 SCIP_SOL* bestsol; /* incumbent solution */ in SCIP_DECL_HEUREXEC() local 486 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 487 if( bestsol == NULL || heurdata->lastsolindex == SCIPsolGetIndex(bestsol) ) in SCIP_DECL_HEUREXEC() 527 … retcode = setupAndSolveSubscipOneopt(scip, subscip, heur, vars, subvars, bestsol, result, &valid); in SCIP_DECL_HEUREXEC() 539 if( SCIPsolIsOriginal(bestsol) ) in SCIP_DECL_HEUREXEC() 568 heurdata->lastsolindex = SCIPsolGetIndex(bestsol); in SCIP_DECL_HEUREXEC() 569 SCIP_CALL( SCIPcreateSolCopy(scip, &worksol, bestsol) ); in SCIP_DECL_HEUREXEC()
|
H A D | scipshell.c | 109 SCIP_SOL* bestsol; in fromCommandLine() local 114 bestsol = SCIPgetBestSol(scip); in fromCommandLine() 115 if ( bestsol == NULL ) in fromCommandLine() 121 SCIP_CALL( SCIPcreateSolCopy(scip, &origsol, bestsol) ); in fromCommandLine()
|
H A D | cons_components.c | 1002 SCIP_SOL* bestsol; in solveComponent() local 1024 bestsol = SCIPgetBestSol(scip); in solveComponent() 1027 if( bestsol != NULL && SCIPsolGetIndex(bestsol) != component->lastbestsolindex ) in solveComponent() 1035 component->lastbestsolindex = SCIPsolGetIndex(bestsol); in solveComponent() 1256 SCIPsolSetHeur(problem->bestsol, NULL); in solveComponent() 1284 SCIP_CALL( SCIPaddSol(scip, problem->bestsol, &feasible) ); in solveComponent() 1288 SCIPgetSolOrigObj(scip, problem->bestsol), in solveComponent() 1365 SCIP_CALL( SCIPcreateSol(scip, &(*problem)->bestsol, NULL) ); in initProblem() 1371 SCIP_CALL( SCIPsetSolVal(scip, (*problem)->bestsol, vars[v], in initProblem() 1397 if( (*problem)->bestsol != NULL ) in freeProblem() [all …]
|
H A D | heur_twoopt.c | 1473 SCIP_SOL* bestsol; in SCIP_DECL_HEUREXEC() local 1503 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 1506 if( bestsol == NULL || heurdata->lastsolindex == SCIPsolGetIndex(bestsol) ) in SCIP_DECL_HEUREXEC() 1509 heurdata->lastsolindex = SCIPsolGetIndex(bestsol); in SCIP_DECL_HEUREXEC() 1512 if( SCIPsolIsOriginal(bestsol) ) in SCIP_DECL_HEUREXEC() 1516 SCIP_CALL( SCIPprintSol(scip, bestsol, NULL, TRUE) ); in SCIP_DECL_HEUREXEC() 1563 SCIP_CALL( SCIPcreateSolCopy(scip, &worksol, bestsol) ); in SCIP_DECL_HEUREXEC() 1641 heurdata->lastsolindex = SCIPsolGetIndex(bestsol); in SCIP_DECL_HEUREXEC() 1646 SCIPsolGetHeur(bestsol) != NULL ? SCIPheurGetName(SCIPsolGetHeur(bestsol)) :"Tree"); in SCIP_DECL_HEUREXEC() 1741 heurdata->lastsolindex = SCIPsolGetIndex(bestsol); in SCIP_DECL_HEUREXEC() [all …]
|
H A D | scip_sol.c | 703 SCIP_SOL* bestsol; in setupAndSolveFiniteSolSubscip() local 794 bestsol = SCIPgetBestSol(subscip); in setupAndSolveFiniteSolSubscip() 796 if( bestsol != NULL ) in setupAndSolveFiniteSolSubscip() 3092 SCIP_SOL* bestsol; in SCIPaddCurrentSol() local 3096 bestsol = SCIPgetBestSol(scip); in SCIPaddCurrentSol() 3137 SCIP_SOL* bestsol; in SCIPtrySol() local 3144 bestsol = SCIPgetBestSol(scip); in SCIPtrySol() 3243 SCIP_SOL* bestsol; in SCIPtrySolFree() local 3250 bestsol = SCIPgetBestSol(scip); in SCIPtrySolFree() 3347 SCIP_SOL* bestsol; in SCIPtryCurrentSol() local [all …]
|
H A D | branch_multaggr.c | 162 SCIP_Real* bestsol, /**< solution value of the best branching candidate */ in selectVarMultAggrBranching() argument 220 …able: <%s> with value: %f is selected by strong branching\n", SCIPvarGetName(*bestcand), *bestsol); in selectVarMultAggrBranching() 501 *bestsol = fixvarssol; in selectVarMultAggrBranching() 849 SCIP_Real bestsol = lpcandssol[bestcandpos]; in SCIP_DECL_BRANCHEXECLP() local 881 …SCIP_CALL( selectVarMultAggrBranching(scip, &bestcand, &bestscore, &bestsol, &bestdown, &bestup, &… in SCIP_DECL_BRANCHEXECLP() 884 …SCIP_CALL( selectVarMultAggrBranching(scip, &bestcand, &bestscore, &bestsol, &bestdown, &bestup, &… in SCIP_DECL_BRANCHEXECLP() 953 SCIPfeasFloor(scip, bestsol) - SCIPvarGetMultaggrConstant(bestcand), in SCIP_DECL_BRANCHEXECLP() 958 … SCIPfeasCeil(scip, bestsol) - SCIPvarGetMultaggrConstant(bestcand), SCIPinfinity(scip), in SCIP_DECL_BRANCHEXECLP() 1004 SCIP_CALL( SCIPbranchVarVal(scip, bestcand, bestsol, &downchild, NULL, &upchild) ); in SCIP_DECL_BRANCHEXECLP()
|
H A D | heur_dualval.c | 1859 SCIP_SOL* bestsol; in maximalslack() local 1873 bestsol = SCIPgetBestSol(heurdata->subscip); in maximalslack() 1896 assert(bestsol != NULL); in maximalslack() 1952 SCIP_CALL( SCIPfreeSol(heurdata->subscip, &bestsol) ); in storeSolution() 1993 SCIP_CALL( SCIPfreeSol(heurdata->subscip, &bestsol) ); in storeSolution() 2033 SCIP_SOL* bestsol; in SCIPapplyHeurDualval() local 2140 bestsol = NULL; in SCIPapplyHeurDualval() 2156 bestsol = SCIPgetBestSol(heurdata->subscip); in SCIPapplyHeurDualval() 2252 bestsol = NULL; in SCIPapplyHeurDualval() 2270 assert(bestsol != NULL); in SCIPapplyHeurDualval() [all …]
|
H A D | heur_rins.c | 127 SCIP_SOL* bestsol; /* incumbent solution of the original problem */ in determineFixings() local 143 bestsol = SCIPgetBestSol(scip); in determineFixings() 144 assert(bestsol != NULL); in determineFixings() 157 solval = SCIPgetSolVal(scip, bestsol, vars[i]); in determineFixings()
|
/dports/math/SCIP/scip-7.0.3/examples/Eventhdlr/src/ |
H A D | event_bestsol.c | 77 SCIP_SOL* bestsol; in SCIP_DECL_EVENTEXEC() local 88 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_EVENTEXEC() 89 assert(bestsol != NULL); in SCIP_DECL_EVENTEXEC() 90 solvalue = SCIPgetSolOrigObj(scip, bestsol); in SCIP_DECL_EVENTEXEC()
|
/dports/math/SCIP/scip-7.0.3/applications/STP/src/ |
H A D | event_bestsol.c | 81 SCIP_SOL* bestsol; in SCIP_DECL_EVENTEXEC() local 96 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_EVENTEXEC() 97 assert(bestsol != NULL); in SCIP_DECL_EVENTEXEC() 98 solvalue = factor * SCIPgetSolOrigObj(scip, bestsol); in SCIP_DECL_EVENTEXEC()
|
H A D | heur_prune.c | 330 SCIP_SOL* bestsol; /* best known solution */ in SCIP_DECL_HEUREXEC() local 368 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 371 if( bestsol == NULL ) in SCIP_DECL_HEUREXEC() 375 …if( SCIPsolGetHeur(bestsol) == heur || heurdata->bestsolindex == SCIPsolGetIndex(SCIPgetBestSol(sc… in SCIP_DECL_HEUREXEC() 378 xval = SCIPprobdataGetXval(scip, bestsol); in SCIP_DECL_HEUREXEC() 432 …SCIPdebugMessage("prune, best: old %f, new %f \n \n", SCIPgetSolOrigObj(scip, bestsol) - SCIPpro… in SCIP_DECL_HEUREXEC() 448 if( SCIPisGT(scip, SCIPgetSolOrigObj(scip, bestsol) - SCIPprobdataGetOffset(scip), pobj) ) in SCIP_DECL_HEUREXEC()
|
H A D | heur_slackprune.c | 351 SCIP_SOL* bestsol; in SCIP_DECL_HEUREXEC() local 391 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 394 if( bestsol == NULL ) in SCIP_DECL_HEUREXEC() 400 …|| (SCIPsolGetHeur(bestsol) == heur || heurdata->bestsolindex == SCIPsolGetIndex(SCIPgetBestSol(sc… in SCIP_DECL_HEUREXEC() 419 xval = SCIPprobdataGetXval(scip, bestsol); in SCIP_DECL_HEUREXEC() 470 …e("SP final solution: best: old %f, new %f \n", SCIPgetSolOrigObj(scip, bestsol), pobj + SCIPprob… in SCIP_DECL_HEUREXEC() 485 if( SCIPisGT(scip, SCIPgetSolOrigObj(scip, bestsol) - SCIPprobdataGetOffset(scip), pobj) ) in SCIP_DECL_HEUREXEC()
|
H A D | heur_ascendprune.c | 153 SCIP_SOL* bestsol; /* best known solution */ in SCIP_DECL_HEUREXEC() local 195 bestsol = SCIPgetBestSol(scip); in SCIP_DECL_HEUREXEC() 198 if( bestsol == NULL ) in SCIP_DECL_HEUREXEC() 208 gap = SCIPgetSolOrigObj(scip, bestsol) - dualbound; in SCIP_DECL_HEUREXEC()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/heuristics/ |
H A D | CouenneFPpool.cpp | 237 std::set <CouenneFPsolution, compareSol>::iterator bestsol = set_. end (); in findClosestAndReplace() local 281 bestsol = i; in findClosestAndReplace() 286 bestsol = set_. begin (); in findClosestAndReplace() 288 if( bestsol != set_. end () ) in findClosestAndReplace() 291 sol = CoinCopyOfArray ((*bestsol).x(), nvars); in findClosestAndReplace() 292 set_. erase(bestsol); in findClosestAndReplace()
|
H A D | CouenneFPscipSolve.cpp | 576 SCIP_SOL* bestsol; in ScipSolve() local 584 bestsol = SCIPgetBestSol(scip); in ScipSolve() 585 assert(bestsol != NULL); in ScipSolve() 595 SCIP_CALL( SCIPgetSolVals(scip, bestsol, problem_ -> nVars (), vars, sol) ); in ScipSolve() 596 obj = SCIPgetSolOrigObj(scip, bestsol); in ScipSolve()
|
/dports/math/SCIP/scip-7.0.3/applications/CycleClustering/src/ |
H A D | heur_cyckerlin.c | 92 SCIP_SOL* bestsol, /**< the solution */ in getSolutionValues() argument 105 assert(bestsol != NULL); in getSolutionValues() 126 solclustering[i][c] = SCIPgetSolVal(scip, bestsol, binvars[i][c]); in getSolutionValues() 389 SCIP_SOL* bestsol; in createSwitchSolution() local 447 bestsol = SCIPgetBestSol(scip); in createSwitchSolution() 478 maxbound = SCIPgetSolOrigObj(scip, bestsol); in createSwitchSolution() 505 objective = SCIPgetSolOrigObj(scip, bestsol); in createSwitchSolution()
|