| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | benderscut_feas.c | 116 assert(subproblem != NULL); in computeStandardLPFeasibilityCut()
132 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardLPFeasibilityCut()
155 subvars = SCIPgetVars(subproblem); in computeStandardLPFeasibilityCut()
239 assert(subproblem != NULL); in computeStandardNLPFeasibilityCut()
264 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardNLPFeasibilityCut()
300 dualsol = SCIPgetNLPVarsUbDualsol(subproblem)[i] - SCIPgetNLPVarsLbDualsol(subproblem)[i]; in computeStandardNLPFeasibilityCut()
354 assert(subproblem != NULL); in generateAndApplyBendersCuts()
370 if( SCIPisNLPConstructed(subproblem) && SCIPgetNNlpis(subproblem) ) in generateAndApplyBendersCuts()
450 SCIP* subproblem; in SCIP_DECL_BENDERSCUTEXEC() local
461 if( subproblem == NULL ) in SCIP_DECL_BENDERSCUTEXEC()
[all …]
|
| H A D | benderscut_opt.c | 72 assert(subproblem != NULL); in polishSolution()
163 assert(subproblem != NULL); in resolveNLPWithTighterFeastol()
298 assert(subproblem != NULL); in computeStandardLPOptimalityCut()
317 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardLPOptimalityCut()
452 assert(subproblem != NULL); in computeStandardNLPOptimalityCut()
634 SCIP* subproblem; in SCIP_DECL_BENDERSCUTEXEC() local
663 if( subproblem == NULL ) in SCIP_DECL_BENDERSCUTEXEC()
673 nlprelaxation = SCIPisNLPConstructed(subproblem) && SCIPgetNNlpis(subproblem); in SCIP_DECL_BENDERSCUTEXEC()
821 assert(subproblem != NULL); in SCIPgenerateAndApplyBendersOptCut()
861 if( SCIPisNLPConstructed(subproblem) && SCIPgetNNlpis(subproblem) ) in SCIPgenerateAndApplyBendersOptCut()
[all …]
|
| H A D | benders.c | 831 SCIP* subproblem; in resetSubproblemObjectiveValue() local
1437 SCIP* subproblem; in addSlackVarsToConstraints() local
1489 SCIP* subproblem; in initialiseSubproblem() local
1529 SCIP* subproblem; in initialiseLPSubproblem() local
1577 SCIP* subproblem; in checkSubproblemConvexity() local
1814 SCIP* subproblem; in createSubproblems() local
4202 SCIP* subproblem; in SCIPbendersExecSubproblemSolve() local
4367 SCIP* subproblem; in SCIPbendersSetupSubproblem() local
4561 …(*objective) = SCIPgetSolOrigObj(subproblem, SCIPgetBestSol(subproblem))*(int)SCIPgetObjsense(subp… in SCIPbendersSolveSubproblem()
4757 SCIP* subproblem; in SCIPbendersSolveSubproblemLP() local
[all …]
|
| H A D | benderscut_feasalt.c | 198 benderscutdata->nlpinvars = SCIPgetNVars(subproblem); in createAuxiliaryNonlinearSubproblem()
199 benderscutdata->nlpinrows = SCIPgetNNLPNlRows(subproblem); in createAuxiliaryNonlinearSubproblem()
200 benderscutdata->nlpi = SCIPgetNlpis(subproblem)[0]; in createAuxiliaryNonlinearSubproblem()
212 …SCIP_CALL( SCIPcreateNlpiProb(subproblem, benderscutdata->nlpi, SCIPgetNLPNlRows(subproblem), bend… in createAuxiliaryNonlinearSubproblem()
260 assert(subproblem != NULL); in updateAuxiliaryNonlinearSubproblem()
307 assert(subproblem != NULL); in generateAndApplyBendersCuts()
427 SCIP* subproblem; in SCIP_DECL_BENDERSCUTEXEC() local
436 subproblem = SCIPbendersSubproblem(benders, probnumber); in SCIP_DECL_BENDERSCUTEXEC()
439 nlprelaxation = SCIPisNLPConstructed(subproblem) && SCIPgetNNlpis(subproblem) in SCIP_DECL_BENDERSCUTEXEC()
445 if( SCIPgetStage(subproblem) == SCIP_STAGE_SOLVING && in SCIP_DECL_BENDERSCUTEXEC()
[all …]
|
| /dports/lang/mit-scheme/mit-scheme-9.2/src/compiler/fgopt/ |
| H A D | simple.scm | 33 (for-each (lambda (subproblem)
34 (set-subproblem-simple?! subproblem 'UNKNOWN))
41 (define (walk/subproblem subproblem)
42 (if (eq? (subproblem-simple? subproblem) 'UNKNOWN)
43 (update-subproblem! subproblem))
44 (subproblem-simple? subproblem))
51 (update-subproblem! subproblem))
53 (define (update-subproblem! subproblem)
55 subproblem
56 (if (subproblem-canonical? subproblem)
[all …]
|
| H A D | order.scm | 92 (prefix (subproblem-prefix subproblem)))
93 (if (subproblem-canonical? subproblem)
115 (subproblem-rvalue subproblem))))
169 (map (lambda (subproblem)
182 (lambda (subproblem)
184 subproblem
263 (map (lambda (variable subproblem)
264 (cons subproblem variable))
350 (let ((subproblem
359 subproblem))
[all …]
|
| H A D | subfre.scm | 37 (lambda (subproblem)
38 (set-subproblem-free-variables! subproblem 'UNKNOWN))
45 (define (new-subproblem/compute-free-variables! subproblem)
46 (with-analysis-state (lambda () (walk-subproblem subproblem))))
48 (define (walk-subproblem subproblem)
49 (let ((free (subproblem-free-variables subproblem)))
52 (set-subproblem-free-variables! subproblem 'BEING-COMPUTED)
54 (let ((free (walk-rvalue (subproblem-rvalue subproblem))))
55 (if (subproblem-canonical? subproblem)
58 (walk-node (subproblem-entry-node subproblem)))
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/Higher/ |
| H A D | rewriteConditionState.cc | 57 subproblem = 0; in RewriteConditionState()
64 delete subproblem; in ~RewriteConditionState()
75 if (subproblem != 0) in solve()
77 if (subproblem->solve(false, solution)) in solve()
79 delete subproblem; in solve()
80 subproblem = 0; in solve()
93 if (matcher->match(stateGraph.getStateDag(stateNr), solution, subproblem)) in solve()
95 if (subproblem == 0 || subproblem->solve(true, solution)) in solve()
97 delete subproblem; in solve()
98 subproblem = 0; in solve()
|
| H A D | assignmentConditionState.cc | 57 subproblem = 0; in AssignmentConditionState()
58 succeeded = matcher->match(rhsContext->root(), original, subproblem); in AssignmentConditionState()
63 delete subproblem; in ~AssignmentConditionState()
72 if (subproblem == 0) in solve()
79 if (subproblem->solve(findFirst, solution)) in solve()
|
| /dports/lang/mit-scheme/mit-scheme-9.2/src/compiler/base/ |
| H A D | subprb.scm | 50 (define-structure (subproblem
59 (define-integrable (subproblem-entry-node subproblem)
60 (cfg-entry-node (subproblem-prefix subproblem)))
62 (define-integrable (subproblem-canonical? subproblem)
63 (procedure? (subproblem-continuation subproblem)))
65 (define-integrable (subproblem-type subproblem)
66 (continuation*/type (subproblem-continuation subproblem)))
68 (define-integrable (set-subproblem-type! subproblem type)
71 (define-integrable (subproblem-register subproblem)
74 (define (subproblem-context subproblem)
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/Core/ |
| H A D | variableAbstractionSubproblem.cc | 54 subproblem = 0; in VariableAbstractionSubproblem()
60 delete subproblem; in ~VariableAbstractionSubproblem()
71 if (!(abstractedPattern->match(v, local, subproblem, 0))) in solve()
76 if (subproblem == 0 || subproblem->solve(true, solution)) in solve()
81 if (subproblem != 0 && subproblem->solve(false, solution)) in solve()
90 delete subproblem; in solve()
91 subproblem = 0; in solve()
|
| H A D | extensionMatchSubproblem.cc | 54 subproblem = 0; in ExtensionMatchSubproblem()
60 delete subproblem; in ~ExtensionMatchSubproblem()
73 if (!(pattern->match(d, local, subproblem))) in solve()
78 if (subproblem == 0 || subproblem->solve(true, solution)) in solve()
83 if (subproblem != 0 && subproblem->solve(false, solution)) in solve()
92 delete subproblem; in solve()
93 subproblem = 0; in solve()
|
| H A D | subproblemDisjunction.cc | 57 delete op.subproblem; in ~SubproblemDisjunction()
64 Subproblem* subproblem, in addOption() argument
71 op.subproblem = subproblem; in addOption()
98 Subproblem* subproblem = so.subproblem; in solve() local
99 if (subproblem == 0) in solve()
106 if (subproblem->solve(findFirst, solution)) in solve()
|
| /dports/math/SCIP/scip-7.0.3/examples/VRP/src/ |
| H A D | pqueue.h | 270 node* subproblem in create_new_node() argument
273 assert( subproblem != NULL ); in create_new_node()
275 if ( subproblem->sleft == 0 ) in create_new_node()
280 subproblem->left = nn; in create_new_node()
281 subproblem->sleft = 1; in create_new_node()
285 if ( subproblem->sright == 0 ) in create_new_node()
290 subproblem->right = nn; in create_new_node()
291 subproblem->sright = 1; in create_new_node()
298 if ( subproblem->sleft <= subproblem->sright ) in create_new_node()
300 subproblem->sleft += 1; in create_new_node()
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/AU_Theory/ |
| H A D | AU_FullMatcher.cc | 34 if (subproblem == 0) in fullMatch()
36 subproblems.add(subproblem); in fullMatch()
39 subproblem->complete(); in fullMatch()
47 AU_Subproblem* subproblem, in addVariableBlocks() argument
71 subproblem->addTopVariable(layerNr, in addVariableBlocks()
111 Subproblem*& subproblem) in fullMatchRigidBlock() argument
132 Subproblem*& subproblem, in fullMatchRigidBlock2() argument
246 AU_Subproblem* subproblem = in buildLeftmostPath() local
258 delete subproblem; in buildLeftmostPath()
266 return subproblem; in buildLeftmostPath()
[all …]
|
| H A D | AU_CollapseMatcher.cc | 96 Subproblem* subproblem; in uniqueCollapseMatch() local
99 subproblems.add(subproblem); in uniqueCollapseMatch()
103 Subproblem* subproblem; in uniqueCollapseMatch() local
106 subproblems.add(subproblem); in uniqueCollapseMatch()
268 Subproblem* subproblem; in multiwayCollapseMatch() local
270 local, subproblem, extensionInfo)) in multiwayCollapseMatch()
280 subproblems.add(subproblem); in multiwayCollapseMatch()
282 subproblem = subproblems.extractSubproblem(); in multiwayCollapseMatch()
284 alternatives.addOption(local, subproblem, extensionInfo); in multiwayCollapseMatch()
300 Subproblem* subproblem; in collapseMatch() local
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/ACU_Theory/ |
| H A D | ACU_CollapseMatcher.cc | 57 Subproblem* subproblem; in uniqueCollapseMatch() local
60 subproblems.add(subproblem); in uniqueCollapseMatch()
69 Subproblem* subproblem; in uniqueCollapseMatch() local
72 subproblems.add(subproblem); in uniqueCollapseMatch()
210 Subproblem* subproblem; in multiwayCollapseMatch() local
212 local, subproblem, extensionInfo)) in multiwayCollapseMatch()
222 subproblems.add(subproblem); in multiwayCollapseMatch()
224 subproblem = subproblems.extractSubproblem(); in multiwayCollapseMatch()
226 alternatives.addOption(local, subproblem, extensionInfo); in multiwayCollapseMatch()
242 Subproblem* subproblem; in collapseMatch() local
[all …]
|
| H A D | ACU_Matcher.cc | 427 if (subproblem == 0) in fullMatch()
439 delete subproblem; in fullMatch()
452 delete subproblem; in fullMatch()
467 delete subproblem; in fullMatch()
514 delete subproblem; in fullMatch()
533 delete subproblem; in fullMatch()
537 subproblems.add(subproblem); in fullMatch()
581 ACU_Subproblem* subproblem = in buildBipartiteGraph() local
614 delete subproblem; in buildBipartiteGraph()
648 delete subproblem; in buildBipartiteGraph()
[all …]
|
| /dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/contrib/benders/ |
| H A D | benders_cuts.py | 223 self.subproblems.append(subproblem)
232 subproblem_solver.set_instance(subproblem)
240 subproblem = self.subproblems[local_subproblem_ndx]
246 subproblem.fix_complicating_vars = pyo.ConstraintList()
254 subproblem.fix_eta = pyo.Constraint(expr=subproblem._eta - root_eta.value == 0)
255 subproblem._eta.value = root_eta.value
275 subproblem.solutions.load_from(res)
278 …ta_coeffs[global_subproblem_ndx] = sign_convention * pyo.value(subproblem.dual[subproblem.obj_con])
289 del subproblem.fix_complicating_vars
290 del subproblem.fix_complicating_vars_index
[all …]
|
| /dports/lang/mit-scheme/mit-scheme-9.2/src/compiler/improvements/ |
| H A D | rewsub.scm | 24 (define (new-subproblem-rvalue subproblem)
25 (if (subproblem-simplified? subproblem)
27 (car (continuation/returns (subproblem-continuation subproblem))))
28 (subproblem-rvalue subproblem)))
30 (define (subproblem-simplified? subproblem)
31 (and (subproblem-canonical? subproblem)
32 (let ((continuation (subproblem-continuation subproblem)))
|
| /dports/math/optpp/optpp-2.4/src/PDS/ |
| H A D | pdsstep.C | 212 subproblem.setOutputFile(*fout); in pdsstep()
225 subproblem.setSSS(sss); in pdsstep()
230 subproblem.setFcnTol(0.9); in pdsstep()
231 subproblem.setMaxIter(10); in pdsstep()
301 subproblem.setSimplexType(4); in pdsstep()
361 subproblem.setSimplexType(4); in pdsstep()
382 subproblem.setScale(vscale); in pdsstep()
390 subproblem.setCreateFlag(); in pdsstep()
400 subproblem.setTRPDS(true); in pdsstep()
407 subproblem.optimize(); in pdsstep()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/OPTPP/src/PDS/ |
| H A D | pdsstep.C | 237 subproblem.setOutputFile(*fout); in pdsstep()
250 subproblem.setSSS(sss); in pdsstep()
255 subproblem.setFcnTol(0.9); in pdsstep()
256 subproblem.setMaxIter(10); in pdsstep()
334 subproblem.setSimplexType(4); in pdsstep()
413 subproblem.setSimplexType(4); in pdsstep()
436 subproblem.setScale(vscale); in pdsstep()
444 subproblem.setCreateFlag(); in pdsstep()
454 subproblem.setTRPDS(true); in pdsstep()
461 subproblem.optimize(); in pdsstep()
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/StrategyLanguage/ |
| H A D | matchProcess.cc | 62 Subproblem* subproblem, in MatchProcess() argument
75 subproblem(subproblem), // take over ownership of subproblem in MatchProcess()
90 delete subproblem; in ~MatchProcess()
103 if (subproblem) in run()
105 success = subproblem->solve(findFirst, *matchContext); in run()
|
| /dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/contrib/gdpopt/ |
| H A D | branch_and_bound.py | 300 from_list=subproblem.GDPopt_utils.variable_list,
312 from_list=subproblem.GDPopt_utils.variable_list,
323 from_list=subproblem.GDPopt_utils.variable_list,
330 from_list=subproblem.GDPopt_utils.variable_list,
337 from_list=subproblem.GDPopt_utils.variable_list,
345 from_list=subproblem.GDPopt_utils.variable_list,
366 from_list=subproblem.GDPopt_utils.variable_list,
378 from_list=subproblem.GDPopt_utils.variable_list,
389 from_list=subproblem.GDPopt_utils.variable_list,
396 from_list=subproblem.GDPopt_utils.variable_list,
[all …]
|
| /dports/lang/maude/maude-2.7.1/src/FreeTheory/ |
| H A D | freeRemainder.cc | 217 if(!(equation->getLhsAutomaton()->match(subject, context, subproblem))) in slowMatchReplace2()
219 if (subproblem != 0 && subproblem->solve(true, context) == false) in slowMatchReplace2()
221 delete subproblem; in slowMatchReplace2()
284 subproblems.add(subproblem); in slowMatchReplace2()
292 subproblem = subproblems.extractSubproblem(); in slowMatchReplace2()
293 if (subproblem != 0 && subproblem->solve(true, context) == false) in slowMatchReplace2()
295 delete subproblem; in slowMatchReplace2()
312 bool r = equation->checkCondition(subject, context, subproblem); in slowMatchReplace2()
316 delete subproblem; in slowMatchReplace2()
330 delete subproblem; in slowMatchReplace2()
[all …]
|