| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | heuristics.c | 275 if( !SCIPhasCurrentNodeLP(scip) || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIPperformGenericDivingAlgorithm()
416 while( !lperror && !cutoff && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL && enfosuccess in SCIPperformGenericDivingAlgorithm()
489 if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OBJLIMIT ) in SCIPperformGenericDivingAlgorithm()
499 assert(SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL); in SCIPperformGenericDivingAlgorithm()
742 if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_NOTSOLVED ) in SCIPperformGenericDivingAlgorithm()
767 while( !cutoff && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_NOTSOLVED ); in SCIPperformGenericDivingAlgorithm()
769 assert(cutoff || lperror || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_NOTSOLVED); in SCIPperformGenericDivingAlgorithm()
771 …assert(cutoff || (SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OBJLIMIT && SCIPgetLPSolstat(scip) != S… in SCIPperformGenericDivingAlgorithm()
775 if( ! cutoff && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIPperformGenericDivingAlgorithm()
809 if( !enfosuccess && !lperror && !cutoff && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIPperformGenericDivingAlgorithm()
[all …]
|
| H A D | heur_simplerounding.c | 192 if ( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in performLPSimpleRounding()
439 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL && ! SCIPisRelaxSolValid(scip) ) in SCIP_DECL_HEUREXEC()
|
| H A D | heur_randrounding.c | 308 assert(SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL); in performLPRandRounding()
465 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
| H A D | benderscut_feas.c | 118 assert(SCIPgetLPSolstat(subproblem) == SCIP_LPSOLSTAT_INFEASIBLE); in computeStandardLPFeasibilityCut()
477 ((!nlprelaxation && SCIPgetLPSolstat(subproblem) == SCIP_LPSOLSTAT_INFEASIBLE) || in SCIP_DECL_BENDERSCUTEXEC()
|
| H A D | heur_indicator.c | 186 if ( lperror || cutoff || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in tryOneOpt()
301 if ( lperror || cutoff || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in trySolCandidate()
|
| H A D | heur_oneopt.c | 770 …if( nvars == nintvars || !SCIPhasCurrentNodeLP(scip) || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_O… in SCIP_DECL_HEUREXEC()
837 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
840 if( !lperror && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
| H A D | heur_rootsoldiving.c | 218 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
482 lpsolstat = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
|
| H A D | heur_objpscostdiving.c | 302 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
559 lpsolstat = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
|
| H A D | heur_proximity.c | 203 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in solveLp()
204 if( !lperror && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in solveLp()
447 …if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_ITERLIMIT || SCIPgetNLPIterations(scip) >= heurdata->… in SCIP_DECL_EVENTEXEC()
|
| H A D | heur_intdiving.c | 225 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
577 lpsolstat = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
|
| H A D | prop_obbt.c | 254 lpsolstat = SCIPgetLPSolstat(scip); in solveLP()
562 assert(SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL); in createGenVBound()
849 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in filterExistingLP()
2184 …SCIPdebugMsg(scip, " solved probing LP -> lperror=%u lpstat=%d\n", lperror, SCIPgetLPSolstat(sci… in solveBilinearLP()
2187 if( !lperror && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in solveBilinearLP()
2473 if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in getScoreBilinBound()
3060 …if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL && SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_U… in SCIP_DECL_PROPEXEC()
|
| H A D | branch_relpscost.c | 790 assert(SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL); in execRelpscost()
1685 …if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OBJLIMIT || SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_… in execRelpscost()
1848 …assert(SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_INFEASIBLE && SCIPgetLPSolstat(scip) != SCIP_LPSOL… in execRelpscost()
1971 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_BRANCHEXECLP()
|
| H A D | heur_intshifting.c | 733 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
1105 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
1108 if( !lperror && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
| H A D | heur_bound.c | 219 lpstatus = SCIPgetLPSolstat(scip); in applyBoundHeur()
|
| H A D | cons_integral.c | 87 if( SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_UNBOUNDEDRAY ) in SCIP_DECL_CONSENFOLP()
|
| H A D | sepa_intobj.c | 325 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_SEPAEXECLP()
|
| H A D | sepa_closecuts.c | 256 if ( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_SEPAEXECLP()
|
| H A D | heur_subnlp.c | 1824 if( refpoint || SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIPapplyHeurSubNlp()
1834 … if( REALABS(fixval) > 1E+10 && !refpoint && SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIPapplyHeurSubNlp()
2260 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
2262 if( SCIPgetNNodes(scip) > 1 || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_UNBOUNDEDRAY ) in SCIP_DECL_HEUREXEC()
2265 … no start candidate given and no LP solution available; LP status = %d\n", SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
|
| H A D | heur_nlpdiving.c | 214 if( heurdata->preferlpfracs && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in getNLPFracVars()
1830 lpsolstat = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
2279 if( updatepscost && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
2384 && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL && SCIPisLPSolBasic(scip) ) in SCIP_DECL_HEUREXEC()
2389 lpsolstat = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
|
| H A D | heur_locks.c | 793 lpstatus = SCIPgetLPSolstat(scip); in SCIP_DECL_HEUREXEC()
796 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
|
| /dports/math/SCIP/scip-7.0.3/applications/STP/src/ |
| H A D | pricer_stp.c | 208 SCIPdebugMessage("solstat=%d\n", SCIPgetLPSolstat(scip)); in pricing()
210 if( !farkas && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in pricing()
312 if( !farkas && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in pricing()
345 if( !farkas && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in pricing()
|
| H A D | branch_stp.c | 151 if( !SCIPhasCurrentNodeLP(scip) || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in selectBranchingVertexBySol()
269 if( !SCIPhasCurrentNodeLP(scip) || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in selectBranchingVertexByLp()
313 if( !SCIPhasCurrentNodeLP(scip) || SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in selectBranchingVertexByLp2Flow()
|
| /dports/math/SCIP/scip-7.0.3/applications/CycleClustering/src/ |
| H A D | heur_fuzzyround.c | 69 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
| /dports/math/SCIP/scip-7.0.3/examples/TSP/src/ |
| H A D | HeurFrats.cpp | 113 if( SCIPgetLPSolstat(scip) != SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
| /dports/math/SCIP/scip-7.0.3/applications/Scheduler/src/ |
| H A D | heur_listscheduling.c | 357 … if( SCIPgetStage(scip) == SCIP_STAGE_SOLVING && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in collectEstLst()
672 … if( SCIPgetStage(scip) == SCIP_STAGE_SOLVING && SCIPgetLPSolstat(scip) == SCIP_LPSOLSTAT_OPTIMAL ) in executeHeuristic()
|