/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/solvers/conic_solvers/ |
H A D | cplex_conif.py | 72 def _handle_solve_status(model, solstat): argument 88 if solstat == status.MIP_optimal: 90 elif solstat == status.MIP_infeasible: 105 elif solstat in unbounded_status_codes: 135 elif solstat in (status.feasible, 138 elif solstat == status.benders_num_best: 141 return solstat 157 elif solstat in (status.abort_user, 181 elif solstat in (status.optimal, 187 elif solstat in (status.infeasible, [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/LP/ |
H A D | lpcplex.c | 379 int solstat; local 419 if (solstat == CPX_UNBOUNDED) { 422 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { 452 int solstat; local 540 if (solstat == CPX_UNBOUNDED) { 547 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS && 548 solstat != CPX_IT_LIM_FEAS && solstat != CPX_OBJ_LIM) { 608 int solstat; local 628 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { 1053 int solmethod, solstat; local [all …]
|
/dports/math/SCIP/scip-7.0.3/src/lpi/ |
H A D | lpi_cpx.c | 704 lpi->solstat = -1; in invalidateSolution() 3036 assert(lpi->solstat >= 0); in SCIPlpiExistsPrimalRay() 3051 assert(lpi->solstat >= 0); in SCIPlpiHasPrimalRay() 3066 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalUnbounded() 3090 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalInfeasible() 3109 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalFeasible() 3126 assert(lpi->solstat >= 0); in SCIPlpiExistsDualRay() 3141 assert(lpi->solstat >= 0); in SCIPlpiHasDualRay() 3156 assert(lpi->solstat >= 0); in SCIPlpiIsDualUnbounded() 3320 return lpi->solstat; in SCIPlpiGetInternalStatus() [all …]
|
H A D | lpi_qso.c | 579 lpi->solstat = 0; in SCIPlpiLoadColLP() 661 lpi->solstat = 0; in SCIPlpiAddCols() 731 lpi->solstat = 0; in SCIPlpiDelCols() 763 lpi->solstat = 0; in SCIPlpiDelColset() 802 lpi->solstat = 0; in SCIPlpiAddRows() 1003 lpi->solstat = 0; in SCIPlpiDelRows() 1035 lpi->solstat = 0; in SCIPlpiDelRowset() 1071 lpi->solstat = 0; in SCIPlpiClear() 1104 lpi->solstat = 0; in SCIPlpiChgBounds() 1155 lpi->solstat = 0; in SCIPlpiChgSides() [all …]
|
H A D | lpi_xprs.c | 633 lpi->solstat = -1; in invalidateSolution() 1893 if( lpi->solstat == XPRS_LP_INFEAS || lpi->solstat == XPRS_LP_UNBOUNDED ) in lpiSolve() 2352 assert(lpi->solstat >= 0); in SCIPlpiExistsPrimalRay() 2368 assert(lpi->solstat >= 0); in SCIPlpiHasPrimalRay() 2387 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalUnbounded() 2406 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalInfeasible() 2423 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalFeasible() 2428 if (lpi->solstat == XPRS_LP_OPTIMAL || lpi->solstat == XPRS_LP_OPTIMAL_SCALEDINFEAS) in SCIPlpiIsPrimalFeasible() 2524 if (lpi->solstat == XPRS_LP_OPTIMAL || lpi->solstat == XPRS_LP_OPTIMAL_SCALEDINFEAS) in SCIPlpiIsDualFeasible() 2613 return (lpi->solstat == XPRS_LP_CUTOFF || lpi->solstat == XPRS_LP_CUTOFF_IN_DUAL); in SCIPlpiIsObjlimExc() [all …]
|
H A D | lpi_grb.c | 878 lpi->solstat = -1; in invalidateSolution() 3638 assert(lpi->solstat >= 0); in SCIPlpiExistsPrimalRay() 3701 assert(lpi->solstat >= 0); in SCIPlpiIsPrimalInfeasible() 3778 assert(lpi->solstat >= 0); in SCIPlpiExistsDualRay() 3881 assert(lpi->solstat >= 0); in SCIPlpiIsOptimal() 3906 assert(lpi->solstat >= 0); in SCIPlpiIsStable() 3979 assert(lpi->solstat >= 0); in SCIPlpiIsObjlimExc() 3991 assert(lpi->solstat >= 0); in SCIPlpiIsIterlimExc() 4003 assert(lpi->solstat >= 0); in SCIPlpiIsTimelimExc() 4016 return lpi->solstat; in SCIPlpiGetInternalStatus() [all …]
|
/dports/math/concorde/concorde/LP/ |
H A D | lpcplex8.c | 429 int solstat; in primalopt() local 481 if (solstat == CPX_STAT_INFEASIBLE) { in primalopt() 494 int solstat; in dualopt() local 546 if (solstat == CPX_STAT_INFEASIBLE) { in dualopt() 567 int solstat; in baropt() local 585 if (solstat != CPX_STAT_OPTIMAL) { in baropt() 599 int solstat; in CClp_limited_dualopt() local 726 if ( solstat==CPX_STAT_ABORT_IT_LIM && in CClp_limited_dualopt() 751 if (solstat == CPX_STAT_INFEASIBLE) { in CClp_limited_dualopt() 1531 int solmethod, solstat; in CClp_status() local [all …]
|
H A D | lpcplex4.c | 405 int solstat; in primalopt() local 459 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in primalopt() 469 int solstat; in dualopt() local 523 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in dualopt() 541 int solstat; in baropt() local 558 if (solstat != CPX_OPTIMAL) { in baropt() 572 int solstat; in CClp_limited_dualopt() local 707 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS && in CClp_limited_dualopt() 708 solstat != CPX_IT_LIM_FEAS && solstat != CPX_OBJ_LIM) { in CClp_limited_dualopt() 1435 int solmethod, solstat; in CClp_status() local [all …]
|
H A D | lpcplex5.c | 428 int solstat; in primalopt() local 482 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in primalopt() 492 int solstat; in dualopt() local 546 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in dualopt() 564 int solstat; in baropt() local 582 if (solstat != CPX_OPTIMAL) { in baropt() 596 int solstat; in CClp_limited_dualopt() local 740 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS && in CClp_limited_dualopt() 741 solstat != CPX_IT_LIM_FEAS && solstat != CPX_OBJ_LIM) { in CClp_limited_dualopt() 1509 int solmethod, solstat; in CClp_status() local [all …]
|
H A D | lpcplex6.c | 428 int solstat; in primalopt() local 513 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in primalopt() 523 int solstat; in dualopt() local 577 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS) { in dualopt() 595 int solstat; in baropt() local 613 if (solstat != CPX_OPTIMAL) { in baropt() 627 int solstat; in CClp_limited_dualopt() local 771 } else if (solstat != CPX_OPTIMAL && solstat != CPX_OPTIMAL_INFEAS && in CClp_limited_dualopt() 772 solstat != CPX_IT_LIM_FEAS && solstat != CPX_OBJ_LIM) { in CClp_limited_dualopt() 1540 int solmethod, solstat; in CClp_status() local [all …]
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | heur_mpec.c | 396 SCIP_NLPSOLSTAT solstat; in heurExec() local 417 solstat = SCIPnlpiGetSolstat(heurdata->nlpi, heurdata->nlpiprob); in heurExec() 420 if( solstat > SCIP_NLPSOLSTAT_LOCINFEASIBLE ) in heurExec() 486 if( solstat <= SCIP_NLPSOLSTAT_FEASIBLE && binaryfeasible ) in heurExec() 513 else if( solstat <= SCIP_NLPSOLSTAT_FEASIBLE && !binaryfeasible ) in heurExec() 543 else if( solstat > SCIP_NLPSOLSTAT_FEASIBLE && regularfeasible ) in heurExec() 552 assert(solstat > SCIP_NLPSOLSTAT_FEASIBLE && !regularfeasible); in heurExec()
|
H A D | nlp.c | 3496 nlp->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in nlpRowChanged() 3663 if( nlp->solstat < SCIP_NLPSOLSTAT_LOCOPT ) in nlpDelNlRowPos() 3664 nlp->solstat = SCIP_NLPSOLSTAT_FEASIBLE; in nlpDelNlRowPos() 3724 nlp->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in nlpUpdateVarBounds() 3958 nlp->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in nlpDelVarPos() 4759 switch( nlp->solstat ) in nlpSolve() 5287 nlp->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in SCIPnlpReset() 5713 solstatus = nlp->solstat; in SCIPnlpRemoveRedundantNlRows() 5724 nlp->solstat = solstatus; in SCIPnlpRemoveRedundantNlRows() 6014 return nlp->solstat; in SCIPnlpGetSolstat() [all …]
|
H A D | struct_nlp.h | 153 …SCIP_NLPSOLSTAT solstat; /**< status of NLP solution (feasible, optimal, unknown.… member
|
H A D | branch_lookahead.c | 2708 SCIP_LPSOLSTAT solstat; in executeBranching() local 2850 solstat = SCIPgetLPSolstat(scip); in executeBranching() 2851 assert(solstat != SCIP_LPSOLSTAT_UNBOUNDEDRAY); in executeBranching() 2855 …status->lperror = status->lperror || (solstat == SCIP_LPSOLSTAT_NOTSOLVED && resultdata->cutoff ==… in executeBranching() 2859 …status->limitreached = (solstat == SCIP_LPSOLSTAT_ITERLIMIT) || (solstat == SCIP_LPSOLSTAT_TIMELIM… in executeBranching() 2879 assert(solstat != SCIP_LPSOLSTAT_INFEASIBLE || resultdata->cutoff); in executeBranching()
|
H A D | cons_soc.c | 4390 SCIP_NLPSOLSTAT solstat; in SCIP_DECL_CONSSEPALP() local 4393 solstat = SCIPgetNLPSolstat(scip); in SCIP_DECL_CONSSEPALP() 4395 if( solstat == SCIP_NLPSOLSTAT_UNKNOWN ) in SCIP_DECL_CONSSEPALP() 4414 solstat = SCIPgetNLPSolstat(scip); in SCIP_DECL_CONSSEPALP() 4415 SCIPdebugMsg(scip, "solved NLP relax, solution status: %d\n", solstat); in SCIP_DECL_CONSSEPALP() 4422 if( solstat == SCIP_NLPSOLSTAT_GLOBINFEASIBLE ) in SCIP_DECL_CONSSEPALP() 4429 if( solstat <= SCIP_NLPSOLSTAT_FEASIBLE ) in SCIP_DECL_CONSSEPALP()
|
H A D | lp.c | 12747 SCIP_LPSOLSTAT solstat; in SCIPlpSolveAndEval() local 12774 solstat = SCIPlpGetSolstat(lp); in SCIPlpSolveAndEval() 12775 assert(solstat != SCIP_LPSOLSTAT_OBJLIMIT); in SCIPlpSolveAndEval() 12777 … if( !(*lperror) && solstat != SCIP_LPSOLSTAT_ERROR && solstat != SCIP_LPSOLSTAT_NOTSOLVED ) in SCIPlpSolveAndEval() 12788 if( solstat == SCIP_LPSOLSTAT_ITERLIMIT && in SCIPlpSolveAndEval() 12800 solstat = SCIPlpGetSolstat(lp); in SCIPlpSolveAndEval() 12806 … if( *lperror || solstat == SCIP_LPSOLSTAT_ERROR || solstat == SCIP_LPSOLSTAT_NOTSOLVED ) in SCIPlpSolveAndEval() 12819 if( solstat == SCIP_LPSOLSTAT_OPTIMAL || solstat == SCIP_LPSOLSTAT_OBJLIMIT in SCIPlpSolveAndEval() 12820 || ( (solstat == SCIP_LPSOLSTAT_ITERLIMIT || solstat == SCIP_LPSOLSTAT_TIMELIMIT) in SCIPlpSolveAndEval() 12852 if( solstat == SCIP_LPSOLSTAT_OPTIMAL ) in SCIPlpSolveAndEval() [all …]
|
H A D | cons_sos1.c | 4342 SCIP_LPSOLSTAT solstat; in performStrongbranchSOS1() local 4427 solstat = SCIP_LPSOLSTAT_INFEASIBLE; in performStrongbranchSOS1() 4439 solstat = SCIPgetLPSolstat(scip); in performStrongbranchSOS1() 4443 if ( solstat == SCIP_LPSOLSTAT_OBJLIMIT || solstat == SCIP_LPSOLSTAT_INFEASIBLE ) in performStrongbranchSOS1() 4450 …else if ( solstat == SCIP_LPSOLSTAT_OPTIMAL || solstat == SCIP_LPSOLSTAT_TIMELIMIT || solstat == S… in performStrongbranchSOS1()
|
/dports/math/SCIP/scip-7.0.3/applications/Ringpacking/src/ |
H A D | pricer_rpa.c | 509 SCIP_STATUS* solstat, /**< pointer to store the solution status */ in solvePricingMINLP() argument 540 assert(solstat != NULL); in solvePricingMINLP() 544 *solstat = SCIP_STATUS_UNKNOWN; in solvePricingMINLP() 720 *solstat = SCIPgetStatus(subscip); in solvePricingMINLP() 800 SCIP_STATUS solstat; in SCIP_DECL_PRICERREDCOST() local 856 …olvePricingMINLP(scip, probdata, lambdas, nlptimelimit, pricerdata->nlpnodelim, &success, &solstat, in SCIP_DECL_PRICERREDCOST() 860 SCIPdebugMsg(scip, "result of pricing MINLP: addedvar=%u soltat=%d\n", success, solstat); in SCIP_DECL_PRICERREDCOST() 881 if( success || solstat == SCIP_STATUS_OPTIMAL || SCIPisFeasGE(scip, redcostslb, 0.0) ) in SCIP_DECL_PRICERREDCOST()
|
/dports/math/SCIP/scip-7.0.3/src/nlpi/ |
H A D | nlpi_filtersqp.c | 732 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in invalidateSolution() 811 problem->solstat = SCIP_NLPSOLSTAT_UNBOUNDED; in processSolveOutcome() 829 problem->solstat = SCIP_NLPSOLSTAT_FEASIBLE; in processSolveOutcome() 837 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 845 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 850 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 863 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 867 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 871 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() 875 problem->solstat = SCIP_NLPSOLSTAT_UNKNOWN; in processSolveOutcome() [all …]
|
H A D | nlpi_all.c | 739 SCIP_NLPSOLSTAT solstat; in SCIP_DECL_NLPISOLVE() local 750 solstat = SCIPnlpiGetSolstat(nlpidata->nlpis[i], problem->nlpiproblems[i]); in SCIP_DECL_NLPISOLVE() 755 if( solstat <= SCIP_NLPSOLSTAT_FEASIBLE ) in SCIP_DECL_NLPISOLVE() 767 …else if( bestsolstat >= SCIP_NLPSOLSTAT_LOCINFEASIBLE && solstat <= SCIP_NLPSOLSTAT_LOCINFEASIBLE ) in SCIP_DECL_NLPISOLVE() 778 bestsolstat = solstat; in SCIP_DECL_NLPISOLVE() 790 _nnlps, SCIPnlpiGetName(nlpidata->nlpis[i]), termstat, solstat, solval, in SCIP_DECL_NLPISOLVE()
|
/dports/math/SCIP/scip-7.0.3/tests/src/nlpi/ |
H A D | nlpi.c | 455 SCIP_NLPSOLSTAT solstat; variable 461 …SCIP_CALL( solveQP(worhpip, 1, 100, -100.0, 100.0, SCIPinfinity(scip), 5, &solval, &solstat, &term… 465 … SCIP_CALL( solveQP(worhpip, 1, 500, -100.0, 100.0, 1.0, INT_MAX, &solval, &solstat, &termstat) ); 472 …SCIP_CALL( solveQP(worhpsqp, 1, 100, -100.0, 100.0, SCIPinfinity(scip), 5, &solval, &solstat, &ter… 476 … SCIP_CALL( solveQP(worhpsqp, 1, 500, -100.0, 100.0, 1.0, INT_MAX, &solval, &solstat, &termstat) );
|
/dports/math/minizinc/libminizinc-2.5.5/solvers/MIP/ |
H A D | MIP_gurobi_wrap.cpp | 1055 int solstat; in solve() local 1056 _error = dll_GRBgetintattr(_model, GRB_INT_ATTR_STATUS, &solstat); in solve() 1058 output.status = convertStatus(solstat); in solve()
|
H A D | MIP_cplex_wrap.cpp | 1300 int solstat = dll_CPXgetstat(_env, _lp); in solve() local 1301 output.status = convertStatus(solstat); in solve() 1302 output.statusName = dll_CPXgetstatstring(_env, solstat, _cplexStatusBuffer); in solve()
|
H A D | MIP_scip_wrap.cpp | 909 SCIP_STATUS solstat = _plugin->SCIPgetStatus(_scip); in solveSCIP() local 910 output.status = convertStatus(solstat); in solveSCIP()
|
/dports/math/casadi/casadi-3.5.5/casadi/interfaces/cplex/ |
H A D | cplex_interface.cpp | 518 int solstat; in solve() local 624 if (CPXXsolution(m->env, m->lp, &solstat, &f, x, lam_a, get_ptr(slack), lam_x)) { in solve()
|