/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/problem/ |
H A D | CouenneSolverInterface.cpp | 102 bool CouenneSolverInterface<T>::isProvenPrimalInfeasible() const { in isProvenPrimalInfeasible() function in Couenne::CouenneSolverInterface 103 return knowInfeasible_ || T::isProvenPrimalInfeasible(); in isProvenPrimalInfeasible() 334 if (isProvenPrimalInfeasible ()) knowInfeasible_ = true; in solveFromHotStart()
|
H A D | CouenneSolverInterface.hpp | 45 virtual bool isProvenPrimalInfeasible () const;
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/examples/ |
H A D | cgl_data_test.cpp | 102 if(clp->isProvenPrimalInfeasible()) { in main() 174 if(clp->isProvenPrimalInfeasible()) { in main()
|
/dports/math/osi/Osi-0.108.6/Osi/src/OsiCommonTest/ |
H A D | OsiSolverInterfaceTest.cpp | 210 ret = ret && !s->isProvenPrimalInfeasible(); in test1VivianDeSmedt() 225 ret = ret && !s->isProvenPrimalInfeasible(); in test1VivianDeSmedt() 304 ret = ret && !s->isProvenPrimalInfeasible(); in test2VivianDeSmedt() 319 ret = ret && !s->isProvenPrimalInfeasible(); in test2VivianDeSmedt() 361 ret = ret && !s->isProvenPrimalInfeasible(); in test3VivianDeSmedt() 376 ret = ret && !s->isProvenPrimalInfeasible(); in test3VivianDeSmedt() 418 ret = ret && !s->isProvenPrimalInfeasible(); in test4VivianDeSmedt() 433 ret = ret && !s->isProvenPrimalInfeasible(); in test4VivianDeSmedt() 489 ret = ret && !s->isProvenPrimalInfeasible(); in test5VivianDeSmedt() 597 ret = ret && s->isProvenPrimalInfeasible(); in test7VivianDeSmedt() [all …]
|
/dports/math/clp/Clp-1.17.3/Osi/src/OsiCommonTest/ |
H A D | OsiSolverInterfaceTest.cpp | 210 ret = ret && !s->isProvenPrimalInfeasible(); in test1VivianDeSmedt() 225 ret = ret && !s->isProvenPrimalInfeasible(); in test1VivianDeSmedt() 304 ret = ret && !s->isProvenPrimalInfeasible(); in test2VivianDeSmedt() 319 ret = ret && !s->isProvenPrimalInfeasible(); in test2VivianDeSmedt() 361 ret = ret && !s->isProvenPrimalInfeasible(); in test3VivianDeSmedt() 376 ret = ret && !s->isProvenPrimalInfeasible(); in test3VivianDeSmedt() 418 ret = ret && !s->isProvenPrimalInfeasible(); in test4VivianDeSmedt() 433 ret = ret && !s->isProvenPrimalInfeasible(); in test4VivianDeSmedt() 489 ret = ret && !s->isProvenPrimalInfeasible(); in test5VivianDeSmedt() 597 ret = ret && s->isProvenPrimalInfeasible(); in test7VivianDeSmedt() [all …]
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/OaGenerators/ |
H A D | BonEcpCuts.cpp | 104 if (lpManip->si()->isProvenPrimalInfeasible()) { in generateCuts() 125 if (lpManip->si()->isProvenPrimalInfeasible()) in generateCuts()
|
/dports/math/osi/Osi-0.108.6/Osi/examples/ |
H A D | query.cpp | 61 if (si->isProvenPrimalInfeasible()) in main()
|
H A D | parameters.cpp | 72 if (si->isProvenPrimalInfeasible()) in main()
|
/dports/math/clp/Clp-1.17.3/Osi/examples/ |
H A D | query.cpp | 61 if (si->isProvenPrimalInfeasible()) in main()
|
H A D | parameters.cpp | 72 if (si->isProvenPrimalInfeasible()) in main()
|
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/heuristics/ |
H A D | CouenneIterativeRounding.cpp | 442 if (nlp_->isProvenPrimalInfeasible() || nlp_->isProvenDualInfeasible() || in feasibilityIR() 447 if (nlp_->isProvenPrimalInfeasible() || nlp_->isProvenDualInfeasible() || in feasibilityIR() 676 if (nlp_->isProvenPrimalInfeasible() || in feasibilityIR() 684 if (!nlp->isProvenPrimalInfeasible() && in feasibilityIR() 777 if (nlp_->isProvenPrimalInfeasible() || nlp_->isProvenDualInfeasible() || in improvementIR() 782 if (nlp_->isProvenPrimalInfeasible() || nlp_->isProvenDualInfeasible() || in improvementIR()
|
/dports/math/ogdf/OGDF/src/ogdf/lib/abacus/ |
H A D | osiif.cpp | 447 if (osiLP_->isProvenPrimalInfeasible()) return Infeasible; in _primalSimplex() 481 if (osiLP_->isProvenPrimalInfeasible()) return Infeasible; in _dualSimplex() 526 if (osiLP_->isProvenPrimalInfeasible()) return Infeasible; in _approx() 620 << "<> isProvenPrimalInfeasible: " << osiLP_->isProvenPrimalInfeasible() << std::endl in getSol() 645 if( !osiLP_->isProvenPrimalInfeasible() && !osiLP_->isAbandoned() ) { in getSol()
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/CbcBonmin/ |
H A D | BonCbcNode.cpp | 139 if (model->solver()->isProvenPrimalInfeasible()) in BonCbcPartialNodeInfo()
|
H A D | BonCbcNlpStrategy.cpp | 99 else if (solver->isProvenPrimalInfeasible()) { in status()
|
/dports/math/cgl-conic/CGL-CONIC-releases-1.0.0-6-gc96de60/src/CglConicIPM/ |
H A D | CglConicIPM.cpp | 118 if (si.isProvenPrimalInfeasible()) { in method1() 207 if (solver_->isProvenPrimalInfeasible() || solver_->isProvenDualInfeasible()) { in method1() 457 if (si.isProvenPrimalInfeasible()) { in method3() 561 if (solver_->isProvenPrimalInfeasible() || solver_->isProvenDualInfeasible()) { in method3()
|
/dports/math/cgl-conic/CGL-CONIC-releases-1.0.0-6-gc96de60/src/CglConicIPMint/ |
H A D | CglConicIPMint.cpp | 110 if (si.isProvenPrimalInfeasible()) { in method1() 196 if (solver_->isProvenPrimalInfeasible() || solver_->isProvenDualInfeasible()) { in method1() 445 if (si.isProvenPrimalInfeasible()) { in method3() 545 if (solver_->isProvenPrimalInfeasible() || solver_->isProvenDualInfeasible()) { in method3()
|
/dports/math/osiipopt/OsiIpopt-releases-0.1-8-gc808091/src/ |
H A D | OsiIpoptSolverInterface.hpp | 125 virtual bool isProvenPrimalInfeasible() const;
|
/dports/math/highs/HiGHS-cfe064e/src/interfaces/ |
H A D | OsiHiGHSSolverInterface.hpp | 74 virtual bool isProvenPrimalInfeasible() const;
|
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
H A D | clp.cc | 396 } else if (_prob->isProvenPrimalInfeasible()) { in _getPrimalType() 410 } else if (_prob->isProvenPrimalInfeasible()) { in _getDualType()
|
/dports/math/lemon/lemon-1.3.1/lemon/ |
H A D | clp.cc | 396 } else if (_prob->isProvenPrimalInfeasible()) { in _getPrimalType() 410 } else if (_prob->isProvenPrimalInfeasible()) { in _getDualType()
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
H A D | clp.cc | 396 } else if (_prob->isProvenPrimalInfeasible()) { in _getPrimalType() 410 } else if (_prob->isProvenPrimalInfeasible()) { in _getDualType()
|
/dports/math/osi/Osi-0.108.6/Osi/src/OsiXpr/ |
H A D | OsiXprSolverInterface.hpp | 78 virtual bool isProvenPrimalInfeasible() const;
|
/dports/math/clp/Clp-1.17.3/Osi/src/OsiXpr/ |
H A D | OsiXprSolverInterface.hpp | 78 virtual bool isProvenPrimalInfeasible() const;
|
/dports/math/ogdf/OGDF/src/ogdf/lpsolver/ |
H A D | LPSolver.cpp | 192 } else if(osi->isProvenPrimalInfeasible()) in optimize()
|
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/Branching/ |
H A D | BonLpBranchingSolver.cpp | 160 if (lin->isProvenPrimalInfeasible() || in solveFromHotStart()
|