Home
last modified time | relevance | path

Searched refs:isProvenOptimal (Results 1 – 25 of 178) sorted by relevance

12345678

/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/problem/
H A DCouenneSolverInterface.cpp107 bool CouenneSolverInterface<T>::isProvenOptimal() const { in isProvenOptimal() function in Couenne::CouenneSolverInterface
108 return knowOptimal_ || T::isProvenOptimal(); in isProvenOptimal()
171 if(isProvenOptimal()) { in resolve()
188 if(isProvenOptimal () && in resolve()
203 if(isProvenOptimal () && in resolve()
258 if ((nsi -> isProvenOptimal () && isProvenOptimal ()) || in resolve()
259 (!(nsi -> isProvenOptimal ()) && !isProvenOptimal ())) { in resolve()
261 if (nsi -> isProvenOptimal () && in resolve()
276 if ((csi -> isProvenOptimal () && isProvenOptimal ()) || in resolve()
277 (!(csi -> isProvenOptimal ()) && !isProvenOptimal ())) { in resolve()
[all …]
H A DCouenneSolverInterface.hpp48 virtual bool isProvenOptimal () const;
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Examples/
H A Dwarm_start3.c34 termcode = si.isProvenOptimal(); in main()
39 termcode = si.isProvenOptimal(); in main()
/dports/math/osi/Osi-0.108.6/Osi/src/OsiCommonTest/
H A DOsiSolverInterfaceTest.cpp209 ret = ret && s->isProvenOptimal(); in test1VivianDeSmedt()
224 ret = ret && s->isProvenOptimal(); in test1VivianDeSmedt()
303 ret = ret && s->isProvenOptimal(); in test2VivianDeSmedt()
318 ret = ret && s->isProvenOptimal(); in test2VivianDeSmedt()
360 ret = ret && s->isProvenOptimal(); in test3VivianDeSmedt()
375 ret = ret && s->isProvenOptimal(); in test3VivianDeSmedt()
417 ret = ret && s->isProvenOptimal(); in test4VivianDeSmedt()
432 ret = ret && s->isProvenOptimal(); in test4VivianDeSmedt()
497 ret = ret && s->isProvenOptimal(); in test5VivianDeSmedt()
539 ret = ret && s->isProvenOptimal(); in test6VivianDeSmedt()
[all …]
H A DOsiNetlibTest.cpp265 … OSIUNITTEST_ASSERT_ERROR(vecSiP[i]->isProvenOptimal(), {}, *vecSiP[i], "netlib " + mpsName[m]); in OsiSolverInterfaceMpsUnitTest()
266 if (vecSiP[i]->isProvenOptimal()) { in OsiSolverInterfaceMpsUnitTest()
/dports/math/clp/Clp-1.17.3/Osi/src/OsiCommonTest/
H A DOsiSolverInterfaceTest.cpp209 ret = ret && s->isProvenOptimal(); in test1VivianDeSmedt()
224 ret = ret && s->isProvenOptimal(); in test1VivianDeSmedt()
303 ret = ret && s->isProvenOptimal(); in test2VivianDeSmedt()
318 ret = ret && s->isProvenOptimal(); in test2VivianDeSmedt()
360 ret = ret && s->isProvenOptimal(); in test3VivianDeSmedt()
375 ret = ret && s->isProvenOptimal(); in test3VivianDeSmedt()
417 ret = ret && s->isProvenOptimal(); in test4VivianDeSmedt()
432 ret = ret && s->isProvenOptimal(); in test4VivianDeSmedt()
497 ret = ret && s->isProvenOptimal(); in test5VivianDeSmedt()
539 ret = ret && s->isProvenOptimal(); in test6VivianDeSmedt()
[all …]
H A DOsiNetlibTest.cpp265 … OSIUNITTEST_ASSERT_ERROR(vecSiP[i]->isProvenOptimal(), {}, *vecSiP[i], "netlib " + mpsName[m]); in OsiSolverInterfaceMpsUnitTest()
266 if (vecSiP[i]->isProvenOptimal()) { in OsiSolverInterfaceMpsUnitTest()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/bound_tightening/
H A Dobbt_supplement.cpp22 if (!(csi -> isProvenOptimal ())) in obbt_supplement()
/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/src/
H A DDcoBranchStrategyStrong.cpp51 if (dco_model->solver()->isProvenOptimal() in updateScore()
73 if (dco_model->solver()->isProvenOptimal() in updateScore()
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/MSVisualStudio/v10/CbcWithInstalledLibraries/
H A Dmain.cpp33 bool optimal = solver.isProvenOptimal(); in main()
/dports/math/osi/Osi-0.108.6/Osi/examples/
H A Dbasic.cpp27 if ( si->isProvenOptimal() ) { in main()
H A Dquery.cpp41 if ( si->isProvenOptimal() ) { in main()
H A Dparameters.cpp52 if ( si->isProvenOptimal() ) { in main()
H A Dbuild.cpp89 if ( si->isProvenOptimal() ) { in main()
/dports/math/clp/Clp-1.17.3/Osi/examples/
H A Dbasic.cpp27 if ( si->isProvenOptimal() ) { in main()
H A Dquery.cpp41 if ( si->isProvenOptimal() ) { in main()
H A Dbuild.cpp89 if ( si->isProvenOptimal() ) { in main()
H A Dparameters.cpp52 if ( si->isProvenOptimal() ) { in main()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/test/
H A DInterfaceTest.cpp128 MyAssert(si.isProvenOptimal()); in testOptimAndSolutionQuery()
171 MyAssert(si.isProvenOptimal()); in testSetMethods()
184 MyAssert(si.isProvenOptimal()); in testSetMethods()
/dports/math/bcps/CHiPPS-BiCePS-releases-0.99.2/Bcps/examples/Blis/
H A DBlisBranchStrategyStrong.cpp230 if (!solver->isProvenOptimal()) { in createCandBranchObjects()
336 if (solver->isProvenOptimal()) { in createCandBranchObjects()
431 if (solver->isProvenOptimal()) { in createCandBranchObjects()
H A DBlisHelp.cpp136 if (solver->isProvenOptimal()) { in BlisStrongBranch()
209 if (solver->isProvenOptimal()) { in BlisStrongBranch()
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcNode.cpp850 if (!solver->isProvenOptimal()) { in chooseBranch()
1136 if (solver->isProvenOptimal()) in chooseBranch()
1243 if (solver->isProvenOptimal()) in chooseBranch()
2301 if (!solver->isProvenOptimal()) { in chooseDynamicBranch()
2429 if (!solver->isProvenOptimal()) { in chooseDynamicBranch()
3037 if (!solver->isProvenOptimal()) { in chooseDynamicBranch()
3110 if (solver->isProvenOptimal()) in chooseDynamicBranch()
3331 if (solver->isProvenOptimal()) in chooseDynamicBranch()
4182 if (solver->isProvenOptimal()) { in solveAnalyze()
4284 if (solver->isProvenOptimal()) { in solveAnalyze()
[all …]
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/test/
H A DgamsTest.cpp112 if (!model.isProvenOptimal()) { in sos1a()
303 if (!model.isProvenOptimal()) { in sos2a()
485 if (!model.isProvenOptimal()) { in semicon1()
719 if (!model.isProvenOptimal()) { in semiint1()
/dports/math/ogdf/OGDF/src/ogdf/lib/abacus/
H A Dosiif.cpp446 if (osiLP_->isProvenOptimal()) return Optimal; in _primalSimplex()
480 if (osiLP_->isProvenOptimal()) return Optimal; in _dualSimplex()
525 if (osiLP_->isProvenOptimal()) return Optimal; in _approx()
618 Logger::ifout() << "<> isProvenOptimal: " << osiLP_->isProvenOptimal() << std::endl in getSol()
669 if (osiLP_->isProvenOptimal() || osiLP_->isIterationLimitReached()) { in getSol()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/heuristics/
H A DBonNlpHeuristic.cpp319 double obj = (nlp_ -> isProvenOptimal()) ? nlp_ -> getObjValue (): COIN_DBL_MAX; in solution()
321 if (nlp_ -> isProvenOptimal () && in solution()

12345678