/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/CutGen/Decomp/ |
H A D | decomp_lp.c | 20 int i, cpx_status, itlim; in load_decomp_lp() local 42 cpx_status = CPXgetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &itlim); in load_decomp_lp() 48 cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, itlim); in load_decomp_lp()
|
/dports/cad/feappv/feappv-4.1i/program/ |
H A D | subsp.f | 48 integer nf,nv,neq,imas,its, itlim, it,itt, num,nmas 103 itlim = its 104 if(nv.eq.nf) itlim = 1 105 do it = 1,itlim 188 if(itlim.gt.1) then
|
/dports/math/SCIP/scip-7.0.3/src/lpi/ |
H A D | lpi.h | 526 int itlim, /**< iteration limit for strong branchings */ 543 int itlim, /**< iteration limit for strong branchings */ 559 int itlim, /**< iteration limit for strong branchings */ 576 int itlim, /**< iteration limit for strong branchings */
|
H A D | lpi_spx2.cpp | 2495 int itlim, /**< iteration limit for strong branchings */ argument 2561 (void) spx->setIntParam(SoPlex::ITERLIMIT, itlim); 2616 && !fromparentbasis && spx->numIterations() < itlim); 2621 itlim - spx->numIterations()); 2622 spx->setIntParam(SoPlex::ITERLIMIT, itlim - spx->numIterations()); 2656 (void) spx->setIntParam(SoPlex::ITERLIMIT, itlim); 2711 && !fromparentbasis && spx->numIterations() < itlim); 2717 spx->setIntParam(SoPlex::ITERLIMIT, itlim - spx->numIterations()); 2760 int itlim, /**< iteration limit for strong branchings */ argument 2773 retcode = lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter); [all …]
|
H A D | lpi_spx1.cpp | 404 const int itlim in setIterationLimit() argument 407 m_itlim = itlim; in setIterationLimit() 3061 int itlim, /**< iteration limit for strong branchings */ argument 3118 spx->setIterationLimit(itlim); 3161 spx->setIterationLimit(itlim - spx->iterations()); 3195 spx->setIterationLimit(itlim); 3239 spx->setIterationLimit(itlim - spx->iterations()); 3279 int itlim, /**< iteration limit for strong branchings */ argument 3292 retcode = lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter); 3310 int itlim, /**< iteration limit for strong branchings */ argument [all …]
|
H A D | lpi_clp.cpp | 2021 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranch() argument 2031 SCIPdebugMessage("calling SCIPlpiStrongbranch() on variable %d (%d iterations)\n", col, itlim); in lpiStrongbranch() 2058 clp->setMaximumIterations(itlim); in lpiStrongbranch() 2142 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranches() argument 2183 clp->setMaximumIterations(itlim); in lpiStrongbranches() 2273 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 2284 SCIP_CALL( lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchFrac() 2295 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 2319 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 2330 SCIP_CALL( lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchInt() [all …]
|
H A D | lpi_cpx.c | 2488 int itlim; in SCIPlpiSolveDual() local 2494 itlim = getIntParam(lpi, CPX_PARAM_ITLIM); in SCIPlpiSolveDual() 2517 setIntParam(lpi, CPX_PARAM_ITLIM, itlim); in SCIPlpiSolveDual() 2637 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranchIntegral() argument 2673 if( itlim > CPX_INT_MAX ) in lpiStrongbranchIntegral() 2674 itlim = CPX_INT_MAX; in lpiStrongbranchIntegral() 2676 setIntParam(lpi, CPX_PARAM_ITLIM, itlim); in lpiStrongbranchIntegral() 2769 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 2802 retval = CPXstrongbranch(lpi->cpxenv, lpi->cpxlp, &col, 1, down, up, itlim); in SCIPlpiStrongbranchFrac() 2834 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument [all …]
|
H A D | lpi_grb.c | 2995 double itlim; in SCIPlpiSolveDual() local 3030 SCIP_CALL( getDblParam(lpi, GRB_DBL_PAR_ITERATIONLIMIT, &itlim) ); in SCIPlpiSolveDual() 3031 if ( itlim < GRB_INFINITY ) in SCIPlpiSolveDual() 3276 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranch() argument 3323 if( itlim < 0 ) in lpiStrongbranch() 3324 itlim = INT_MAX; in lpiStrongbranch() 3327 SCIP_CALL( setDblParam(lpi, GRB_DBL_PAR_ITERATIONLIMIT, (double) itlim) ); in lpiStrongbranch() 3456 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 5567 double itlim; in SCIPlpiSetIntpar() local 5568 itlim = (ival >= INT_MAX ? GRB_INFINITY : ival); in SCIPlpiSetIntpar() [all …]
|
H A D | lpi_xprs.c | 2021 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranch() argument 2045 SCIPdebugMessage("calling Xpress strong branching on variable %d (%d iterations)\n", col, itlim); in lpiStrongbranch() 2106 int itlim, /**< iteration limit for strong branchings */ in lpiStrongbranches() argument 2215 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 2226 SCIP_CALL( lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchFrac() 2237 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 2248 …SCIP_CALL( lpiStrongbranches(lpi, cols, ncols, psols, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchesFrac() 2258 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 2269 SCIP_CALL( lpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchInt() 2280 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesInt() argument [all …]
|
H A D | lpi_glop.cpp | 1506 int itlim, /**< iteration limit for strong branchings */ in strongbranch() argument 1523 SCIPdebugMessage("calling strongbranching on variable %d (%d iterations)\n", col_index, itlim); in strongbranch() 1553 …SCIPdebugMessage("down: itlim=%d col=%d [%f,%f] obj=%f status=%d iter=%ld.\n", itlim, col_index, l… in strongbranch() 1584 …SCIPdebugMessage("up: itlim=%d col=%d [%f,%f] obj=%f status=%d iter=%ld.\n", itlim, col_index, EPS… in strongbranch() 1616 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 1633 …ugMessage("calling strongbranching on fractional variable %d (%d iterations)\n", col_index, itlim); in SCIPlpiStrongbranchFrac() 1635 SCIP_CALL( strongbranch(lpi, col_index, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchFrac() 1646 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 1675 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 1692 SCIP_CALL( strongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchInt() [all …]
|
H A D | lpi_none.c | 816 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 841 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 867 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 892 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesInt() argument
|
H A D | lpi_qso.c | 1999 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 2018 …e("calling QSopt strong branching on variable %d with fractional value (%d it lim)\n", col, itlim); in SCIPlpiStrongbranchFrac() 2027 QS_CONDRET( QSopt_strongbranch(lpi->prob, 1, &col, &psol, down, up, itlim, QS_MAXDOUBLE) ); in SCIPlpiStrongbranchFrac() 2044 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 2066 …calling QSopt strong branching on %d variables with fractional value (%d it lim)\n", ncols, itlim); in SCIPlpiStrongbranchesFrac() 2077 QS_CONDRET( QSopt_strongbranch(lpi->prob, ncols, cols, psols, down, up, itlim, QS_MAXDOUBLE) ); in SCIPlpiStrongbranchesFrac() 2093 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 2112 …age("calling QSopt strong branching on variable %d with integral value (%d it lim)\n", col, itlim); in SCIPlpiStrongbranchInt() 2138 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesInt() argument 2159 …("calling QSopt strong branching on %d variables with integral value (%d it lim)\n", ncols, itlim); in SCIPlpiStrongbranchesInt()
|
H A D | lpi_msk.c | 2834 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranch() argument 2883 MOSEK_CALL( MSK_putintparam(lpi->task, MSK_IPAR_SIM_MAX_ITERATIONS, itlim) ); in SCIPlpiStrongbranch() 3092 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchFrac() argument 3103 SCIP_CALL( SCIPlpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchFrac() 3117 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesFrac() argument 3143 …SCIP_CALL( SCIPlpiStrongbranch(lpi, cols[j], psols[j], itlim, &(down[j]), &(up[j]), &(downvalid[j]… in SCIPlpiStrongbranchesFrac() 3156 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchInt() argument 3167 SCIP_CALL( SCIPlpiStrongbranch(lpi, col, psol, itlim, down, up, downvalid, upvalid, iter) ); in SCIPlpiStrongbranchInt() 3181 int itlim, /**< iteration limit for strong branchings */ in SCIPlpiStrongbranchesInt() argument 3207 …SCIP_CALL( SCIPlpiStrongbranch(lpi, cols[j], psols[j], itlim, &(down[j]), &(up[j]), &(downvalid[j]… in SCIPlpiStrongbranchesInt()
|
/dports/math/octave/octave-6.4.0/libinterp/dldfcn/ |
H A D | __glpk__.cc | 64 int itlim; member 204 smcp.it_lim = par->itlim; in glpk() 523 par.itlim = std::numeric_limits<int>::max (); 524 OCTAVE_GLPK_GET_INT_PARAM ("itlim", par.itlim);
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | scip_var.h | 1201 int itlim, /**< iteration limit for strong branchings */ 1245 int itlim, /**< iteration limit for strong branchings */ 1285 int itlim, /**< iteration limit for strong branchings */ 1317 int itlim, /**< iteration limit for strong branchings */ 1348 int itlim, /**< iteration limit for strong branchings */ 1416 …int itlim /**< iteration limit applied to the strong branching cal…
|
H A D | scip_probing.h | 312 …int itlim, /**< maximal number of LP iterations to perform, or -1 f…
|
H A D | lp.h | 217 …int itlim /**< iteration limit applied to the strong branching cal… 236 int itlim, /**< iteration limit for strong branchings */ 257 int itlim, /**< iteration limit for strong branchings */ 1046 …SCIP_Longint itlim, /**< maximal number of LP iterations to perform, or -1 f…
|
H A D | scip_probing.c | 700 …int itlim, /**< maximal number of LP iterations to perform, or -1 f… in solveProbingLP() argument 743 …scip->eventqueue, scip->eventfilter, scip->transprob, (SCIP_Longint)itlim, FALSE, FALSE, FALSE, lp… in solveProbingLP() 812 …int itlim, /**< maximal number of LP iterations to perform, or -1 f… in SCIPsolveProbingLP() argument 820 SCIP_CALL( solveProbingLP(scip, itlim, FALSE, FALSE, FALSE, -1, lperror, cutoff) ); in SCIPsolveProbingLP()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/ |
H A D | lp_solver.c | 1047 void set_itlim(LPdata *lp_data, int itlim) in set_itlim() argument 1049 if (itlim < 0) itlim = LP_MAX_ITER; in set_itlim() 1639 int itlim; in refactorize() local 1895 void set_itlim(LPdata *lp_data, int itlim) in dual_simplex() argument 1897 if (itlim < 0) in dual_simplex() 1899 CPX_PARAM_ITLIM, &itlim, NULL, NULL); in dual_simplex() 2983 void set_itlim(LPdata *lp_data, int itlim) in dual_simplex() argument 2985 if (itlim < 0) itlim = LP_MAX_ITER; in dual_simplex() 2989 retval = lp_data->si->setIntParam(key, itlim); in dual_simplex() 2996 if (itlim < 0) itlim = LP_MAX_ITER; in dual_simplex() [all …]
|
H A D | lp_pseudo_branch.c | 143 int itlim = 0, cnum = 0; in select_branching_object() local 344 itlim++; in select_branching_object() 403 itlim++; in select_branching_object() 471 ("Itlim reached %i times out of %i .\n\n", itlim, cnum)); in select_branching_object()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/ |
H A D | sym_lp_solver.h | 266 void set_itlim PROTO((LPdata *lp_data, int itlim)); 267 void set_itlim_hotstart PROTO((LPdata *lp_data, int itlim));
|
/dports/cad/ngspice_rework/ngspice-35/examples/cider/bjt/ |
H A D | ecp.cir | 53 + method ac=direct itlim=10
|
/dports/math/SCIP/scip-7.0.3/src/nlpi/ |
H A D | nlpi_worhp.c | 104 int itlim; /**< NLP iteration limit */ member 1018 (*problem)->itlim = DEFAULT_MAXITER; in SCIP_DECL_NLPICREATEPROBLEM() 1586 par->MaxIter = problem->itlim; in SCIP_DECL_NLPISOLVE() 1970 *ival = problem->itlim; in SCIP_DECL_NLPIGETINTPAR() 2066 problem->itlim = ival; in SCIP_DECL_NLPISETINTPAR()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/LP/ |
H A D | lpcplex.c | 425 int itlim; local 426 rval = CPXgetintparam (lp->cplex_env, CPX_PARAM_ITLIM, &itlim); 428 printf ("cplex interation limit: %d\n", itlim);
|
/dports/math/glpk/glpk-5.0/examples/cplex/ |
H A D | cplex.h | 287 int goodlen, double downpen[], double uppen[], int itlim);
|