/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | benderscut_feas.c | 111 SCIP_Real dualsol; in computeStandardLPFeasibilityCut() local 131 dualsol = SCIProwGetDualfarkas(lprow); in computeStandardLPFeasibilityCut() 132 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardLPFeasibilityCut() 137 if( dualsol > 0.0 ) in computeStandardLPFeasibilityCut() 170 if( SCIPisZero(subproblem, dualsol) ) in computeStandardLPFeasibilityCut() 235 SCIP_Real dualsol; in computeStandardNLPFeasibilityCut() local 263 dualsol = SCIPnlrowGetDualsol(nlrow); in computeStandardNLPFeasibilityCut() 264 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardNLPFeasibilityCut() 266 if( SCIPisZero(subproblem, dualsol) ) in computeStandardNLPFeasibilityCut() 274 if( dualsol > 0.0 ) in computeStandardNLPFeasibilityCut() [all …]
|
H A D | misc_linear.c | 351 SCIP_Real* dualsol, /**< pointer to store the dual solution */ in SCIPconsGetDualsol() argument 369 *dualsol = SCIPgetDualsolLinear(scip, cons); in SCIPconsGetDualsol() 373 *dualsol = SCIPgetDualsolSetppc(scip, cons); in SCIPconsGetDualsol() 377 *dualsol = SCIPgetDualsolLogicor(scip, cons); in SCIPconsGetDualsol() 381 *dualsol = SCIPgetDualsolKnapsack(scip, cons); in SCIPconsGetDualsol() 385 *dualsol = SCIPgetDualsolVarbound(scip, cons); in SCIPconsGetDualsol() 390 *dualsol = 0.0; in SCIPconsGetDualsol() 395 *dualsol = 0.0; in SCIPconsGetDualsol()
|
H A D | benderscut_opt.c | 290 SCIP_Real dualsol; in computeStandardLPOptimalityCut() local 316 dualsol = SCIProwGetDualsol(lprow); in computeStandardLPOptimalityCut() 317 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardLPOptimalityCut() 319 if( SCIPisZero(subproblem, dualsol) ) in computeStandardLPOptimalityCut() 322 if( dualsol > 0.0 ) in computeStandardLPOptimalityCut() 444 SCIP_Real dualsol; in computeStandardNLPOptimalityCut() local 505 dualsol = consdualvals[idx]; in computeStandardNLPOptimalityCut() 508 dualsol = SCIPnlrowGetDualsol(nlrow); in computeStandardNLPOptimalityCut() 509 assert( !SCIPisInfinity(subproblem, dualsol) && !SCIPisInfinity(subproblem, -dualsol) ); in computeStandardNLPOptimalityCut() 511 if( SCIPisZero(subproblem, dualsol) ) in computeStandardNLPOptimalityCut() [all …]
|
H A D | heur_actconsdiving.c | 128 SCIP_Real dualsol; in getNActiveConsScore() local 140 dualsol = SCIProwGetDualsol(row); in getNActiveConsScore() 147 if( SCIPisFeasPositive(scip, dualsol) ) in getNActiveConsScore() 161 if( SCIPisFeasNegative(scip, dualsol) ) in getNActiveConsScore()
|
H A D | branch_cloud.c | 294 SCIP_Real dualsol; in SCIP_DECL_BRANCHEXECLP() local 295 dualsol = SCIProwGetDualsol(lprows[i]); in SCIP_DECL_BRANCHEXECLP() 296 if( !SCIPisZero(scip, dualsol) ) in SCIP_DECL_BRANCHEXECLP() 298 …if( dualsol > 0 && SCIPisFeasEQ(scip, SCIProwGetLhs(lprows[i]), SCIPgetRowActivity(scip,lprows[i])… in SCIP_DECL_BRANCHEXECLP() 302 …else if( dualsol < 0 && SCIPisFeasEQ(scip, SCIProwGetRhs(lprows[i]), SCIPgetRowActivity(scip,lprow… in SCIP_DECL_BRANCHEXECLP()
|
H A D | pub_misc_linear.h | 95 SCIP_Real* dualsol, /**< pointer to store the dual solution */
|
H A D | struct_lp.h | 98 …SCIP_Real dualsol; /**< dual solution value in LP, is 0 if row is not in LP… member 204 …SCIP_Real dualsol; /**< dual solution value in LP, is 0 if row is not in LP… member
|
H A D | struct_nlp.h | 104 … SCIP_Real dualsol; /**< dual value associated with row in last NLP solve */ member
|
H A D | sepa_mcf.c | 1025 SCIP_Real dualsol; in extractFlowRows() local 1031 dualsol = 0.0; in extractFlowRows() 1033 dualsol = ABS(dualsol); in extractFlowRows() 1035 dualsol = -dualsol; in extractFlowRows() 1391 SCIP_Real dualsol; in extractCapacityRows() local 1397 dualsol = 0.0; in extractCapacityRows() 1399 dualsol = ABS(dualsol); in extractCapacityRows() 1401 dualsol = -dualsol; in extractCapacityRows() 1570 if( !SCIPisZero(scip, dualsol) && dualsol != SCIP_INVALID ) /*lint !e777*/ in addFlowrowToCommodity() 1572 if( dualsol > 0.0 ) in addFlowrowToCommodity() [all …]
|
H A D | heur_lpface.c | 253 SCIP_Real dualsol; in createRows() local 295 dualsol = SCIProwGetDualsol(rows[i]); in createRows() 299 if( dualbasisequations && ! SCIPisDualfeasZero(scip, dualsol) ) in createRows() 301 if( dualsol > 0.0 && SCIPisFeasEQ(scip, rowsolactivity, lhs) ) in createRows() 303 else if( dualsol < 0.0 && SCIPisFeasEQ(scip, rowsolactivity, rhs) ) in createRows()
|
H A D | heur_octane.c | 450 SCIP_Real dualsol; in generateAverageNBRay() local 457 dualsol = SCIProwGetDualsol(rows[i]); in generateAverageNBRay() 458 if( SCIPisFeasPositive(scip, dualsol) ) in generateAverageNBRay() 460 else if( SCIPisFeasNegative(scip, dualsol) ) in generateAverageNBRay()
|
H A D | lp.c | 557 storedsolvals->dualsol = row->dualsol; in rowStoreSolVals() 587 row->dualsol = storedsolvals->dualsol; in rowRestoreSolVals() 597 row->dualsol = 0.0; in rowRestoreSolVals() 3848 assert(dualsol != NULL); in SCIPcolCalcRedcost() 5179 (*row)->dualsol = 0.0; in SCIProwCreate() 8158 row->dualsol = 0.0; in markRowDeleted() 8290 row->dualsol = SCIP_INVALID; in lpFlushAddRows() 10758 SCIP_Real* dualsol; in lpLexDualSimplex() local 14303 SCIP_Real* dualsol; in SCIPlpGetSol() local 14470 lpirows[r]->dualsol = dualsol[r]; in SCIPlpGetSol() [all …]
|
H A D | sepa_aggregation.c | 1209 SCIP_Real dualsol; in separateCuts() local 1222 dualsol = (sol == NULL ? SCIProwGetDualsol(rows[r]) : 1.0); in separateCuts() 1233 dualscore = MAX(fracscore * dualsol/objnorm, 0.0001); in separateCuts() 1245 dualscore = MAX(-fracscore * dualsol/objnorm, 0.0001); in separateCuts()
|
H A D | pub_lp.h | 512 #define SCIProwGetDualsol(row) ((row)->lppos >= 0 ? (row)->dualsol : 0.0)
|
H A D | sepa_eccuts.c | 2093 SCIP_Real* dualsol; in SCIPcomputeConvexEnvelopeFacet() local 2095 SCIP_CALL( SCIPallocBufferArray(scip, &dualsol, nrows) ); in SCIPcomputeConvexEnvelopeFacet() 2098 SCIP_CALL( SCIPlpiGetSol(sepadata->lpi, NULL, NULL, dualsol, NULL, NULL) ); in SCIPcomputeConvexEnvelopeFacet() 2101 facet[i] = dualsol[i]; in SCIPcomputeConvexEnvelopeFacet() 2104 facet[ecaggr->nvars] = dualsol[nrows - 1]; in SCIPcomputeConvexEnvelopeFacet() 2106 SCIPfreeBufferArray(scip, &dualsol); in SCIPcomputeConvexEnvelopeFacet()
|
/dports/math/SCIP/scip-7.0.3/tests/src/lpi/ |
H A D | solve_behavior.c | 136 SCIP_Real* dualsol; in Test() local 156 BMSallocMemoryArray(&dualsol, nrows); in Test() 159 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, NULL, NULL) ); in Test() 168 …cr_assert_float_eq(dualsol[i], exp_dualsol[i], EPS, "Violation of dual solution %d: %g != %g\n", i… in Test() 173 BMSfreeMemoryArray(&dualsol); in Test()
|
H A D | solve.c | 106 SCIP_Real* dualsol; in solveTest() local 227 BMSallocMemoryArray(&dualsol, nrows); in solveTest() 235 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, activity, redcost) ); in solveTest() 282 …cr_assert_float_eq(dualsol[i], exp_dualsol[i], EPS, "Violation of dual solution %d: %g != %g\n", i… in solveTest() 302 SCIP_CALL( SCIPlpiGetDualfarkas(lpi, dualsol) ); in solveTest() 308 …cr_assert_float_eq(dualsol[i], exp_dualsol[i], EPS, "Violation of dual ray %d: %g != %g\n", i, dua… in solveTest() 311 scalingfactor = dualsol[i]/exp_dualsol[i]; in solveTest() 319 …cr_assert_float_eq(dualsol[i], scalingfactor * exp_dualsol[i], EPS, "Violation of dual ray %d: %g … in solveTest() 320 cr_assert( ! SCIPlpiIsInfinity(lpi, -lhs[i]) || dualsol[i] <= -EPS ); in solveTest() 321 cr_assert( ! SCIPlpiIsInfinity(lpi, rhs[i]) || dualsol[i] >= EPS ); in solveTest() [all …]
|
H A D | change.c | 953 SCIP_Real dualsol[2]; in Test() local 969 SCIP_CALL( SCIPlpiGetSol(lpi, &objval, primsol, dualsol, activity, redcost) ); in Test() 980 cr_assert_arr_eq( dualsol, dualsol2, 2*sizeof(SCIP_Real) ); in Test()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/ |
H A D | lp_solver.c | 57 FREE(lp_data->dualsol); in free_lp_arrays() 191 FREE(lp_data->dualsol); in size_lp_arrays() 196 lp_data->dualsol = (double *) realloc((char *)lp_data->dualsol, in size_lp_arrays() 1119 lp_data->dualsol[i] = - lp_data->dualsol[i]; in get_dj_pi() 2614 if (lp_data->dualsol && lp_data->dj) { in dual_simplex() 2635 lb += si->getRowUpper()[i]*lp_data->dualsol[i]; in dual_simplex() 2637 lb += si->getRowLower()[i]*lp_data->dualsol[i]; in dual_simplex() 2723 if (lp_data->dualsol && lp_data->dj) { in dual_simplex() 2744 lb += si->getRowUpper()[i]*lp_data->dualsol[i]; in dual_simplex() 2817 if (lp_data->dualsol && lp_data->dj) { in dual_simplex() [all …]
|
H A D | lp_rowfunc.c | 165 if (fabs(lp_data->dualsol[i]) < lpetol && stat[i] != VIOLATED_ROW){ in check_row_effectiveness()
|
/dports/math/SCIP/scip-7.0.3/check/coverage/ |
H A D | commands.bat | 13 disp dualsol
|
/dports/math/SCIP/scip-7.0.3/check/interactiveshell/ |
H A D | interactiveshell.bat.in | 13 disp dualsol
|
/dports/math/py-PySCIPOpt/PySCIPOpt-3.0.2/src/pyscipopt/ |
H A D | lp.pxi | 385 dualsol = [0.0] * nrows 387 dualsol[i] = c_dualsol[i] 390 return dualsol
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/ |
H A D | sym_lp_solver.h | 204 double *dualsol; /* maxm */ /* BB */ member
|
/dports/math/SCIP/scip-7.0.3/src/lpi/ |
H A D | lpi.h | 754 SCIP_Real* dualsol, /**< dual solution vector, may be NULL if not needed */
|