Home
last modified time | relevance | path

Searched refs:nsubvars (Results 1 – 7 of 7) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur_subnlp.c365 int nsubvars; in freeSubSCIP() local
381 assert(nsubvars == heurdata->nsubvars); in freeSubSCIP()
406 heurdata->nsubvars = 0; in freeSubSCIP()
1589 int nsubvars; in forbidFixation() local
1604 assert(nsubvars == heurdata->nsubvars); in forbidFixation()
1799 int nsubvars; in SCIPapplyHeurSubNlp() local
1804 assert(nsubvars == heurdata->nsubvars); in SCIPapplyHeurSubNlp()
1923 int nsubvars; in SCIPapplyHeurSubNlp() local
1928 assert(nsubvars == heurdata->nsubvars); in SCIPapplyHeurSubNlp()
2001 assert(nsubvars == heurdata->nsubvars); in SCIPresolveSolHeurSubNlp()
[all …]
H A Dbenderscut_feas.c109 int nsubvars; in computeStandardLPFeasibilityCut() local
154 nsubvars = SCIPgetNVars(subproblem); in computeStandardLPFeasibilityCut()
158 for( i = 0; i < nsubvars; i++ ) in computeStandardLPFeasibilityCut()
232 int nsubvars; in computeStandardNLPFeasibilityCut() local
246 nsubvars = SCIPgetNNLPVars(subproblem); in computeStandardNLPFeasibilityCut()
289 for( i = 0; i < nsubvars; i++ ) in computeStandardNLPFeasibilityCut()
H A Dheur_lpface.c94 int nsubvars; /**< number of sub-problem variables */ member
545 subscipdata->nsubvars = 0; in subscipdataReset()
569 assert(subscipdata->nsubvars > 0); in subscipdataFreeSubscip()
570 SCIPfreeBlockMemoryArray(scip, &subscipdata->subvars, subscipdata->nsubvars); in subscipdataFreeSubscip()
599 subscipdata->nsubvars = nvars; in subscipdataCopySubscip()
1198 if( heurdata->subscipdata->subscip != NULL && heurdata->subscipdata->nsubvars != nvars ) in SCIP_DECL_HEUREXEC()
1201 nvars, heurdata->subscipdata->nsubvars); in SCIP_DECL_HEUREXEC()
1218 nvars = heurdata->subscipdata->nsubvars; in SCIP_DECL_HEUREXEC()
1292 assert(heurdata->subscipdata->nsubvars == nvars); in SCIP_DECL_HEUREXEC()
H A Dbenderscut_opt.c288 int nsubvars; in computeStandardLPOptimalityCut() local
339 nsubvars = SCIPgetNVars(subproblem); in computeStandardLPOptimalityCut()
345 for( i = 0; i < nsubvars + nfixedvars; i++ ) in computeStandardLPOptimalityCut()
351 if( i < nsubvars ) in computeStandardLPOptimalityCut()
354 var = fixedvars[i - nsubvars]; in computeStandardLPOptimalityCut()
441 int nsubvars; in computeStandardNLPOptimalityCut() local
469 nsubvars = SCIPgetNNLPVars(subproblem); in computeStandardNLPOptimalityCut()
521 for( i = 0; i < nsubvars; i++ ) in computeStandardNLPOptimalityCut()
H A Dheur_dualval.c1040 assert( SCIPvarGetProbindex(subvar) <= heurdata->nsubvars ); in createSubSCIP()
1493 heurdata->nsubvars = 0; in freeSubSCIP()
1516 int nsubvars; in createSolFromNLP() local
1537 for( i = 0; i < nsubvars; ++i ) in createSolFromNLP()
1651 int nsubvars; in freeMemory() local
1862 int nsubvars; in maximalslack() local
1866 nsubvars = SCIPgetNOrigVars(heurdata->subscip); in maximalslack()
1876 for( i = 0; i < nsubvars; i++ ) in maximalslack()
2054 int nsubvars; in SCIPapplyHeurDualval() local
2104 assert(heurdata->nsubvars > 0); in SCIPapplyHeurDualval()
[all …]
H A Dheur_proximity.c115 …int nsubvars; /**< the number of subvars … member
412 SCIPfreeBlockMemoryArray(scip, &heurdata->subvars, heurdata->nsubvars); in deleteSubproblem()
517 heurdata->nsubvars = 0; in SCIP_DECL_HEURINIT()
1009 heurdata->nsubvars = nvars; in SCIPapplyProximity()
H A Dheur_padm.c107 …int nsubvars; /**< number of variables belonging to this block (withou… member
210 block->nsubvars = 0; in initBlock()
450 block->nsubvars = nsubscipvars; in blockCreateSubscip()
1647 nblockvars = (problem->blocks[b]).nsubvars; in SCIP_DECL_HEUREXEC()