Home
last modified time | relevance | path

Searched refs:nlinvars (Results 1 – 25 of 30) sorted by relevance

12

/dports/math/SCIP/scip-7.0.3/tests/src/cons/quadratic/
H A Dprojection.c379 enum nlinvars {nlinvars = 1}; in Test() enumerator
385 SCIP_VAR* linvars[nlinvars]; in Test()
386 SCIP_Real linvals[nlinvars] = {1.0}; in Test()
404 nlinvars, linvars, linvals, nquadterms, quadvars1, quadvars2, quadvals, lhs, rhs) ); in Test()
427 enum nlinvars {nlinvars = 3}; in Test() enum
436 SCIP_VAR* linvars[nlinvars]; in Test()
437 SCIP_Real linvals[nlinvars] = {-1.0,2.0,-1.0}; in Test()
458 nlinvars, linvars, linvals, nquadterms, quadvars1, quadvars2, quadvals, lhs, rhs) ); in Test()
522 enum nlinvars {nlinvars = 3}; in Test() enumerator
529 SCIP_VAR* linvars[nlinvars]; in Test()
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dcons_pseudoboolean.c924 int nlinvars; in checkConsConsistency() local
982 assert(nlinvars == consdata->nlinvars); in checkConsConsistency()
1812 int nlinvars; in consdataPrint() local
2397 int nlinvars; in chgLhs() local
5816 nlinvars = consdata->nlinvars; in tryUpgradingXor()
5838 assert(nlinvars == consdata->nlinvars); in tryUpgradingXor()
6141 nlinvars = consdata->nlinvars; in tryUpgradingLogicor()
6156 assert(nlinvars == consdata->nlinvars); in tryUpgradingLogicor()
6497 assert(nlinvars == consdata->nlinvars); in tryUpgradingLogicor()
9817 if( *nlinvars < consdata->nlinvars ) in SCIPgetLinDatasWithoutAndPseudoboolean()
[all …]
H A Dcons_nonlinear.h160 int nlinvars, /**< number of linear variables in the constraint */
208 int nlinvars, /**< number of linear variables in the constraint */
230 int nlinvars, /**< number of linear variables in the constraint */
278 int nlinvars, /**< number of linear variables in the constraint */
H A Dcons_pseudoboolean.h150 int nlinvars, /**< number of variables of the linear part */
205 int nlinvars, /**< number of variables of the linear part */
287 …int*const nlinvars /**< pointer to store the required array size for and-co…
H A Dcons_nonlinear.c449 if( consdata->nlinvars == 0 ) in consdataUpdateLinearActivity()
1096 if( nlinvars > 0 ) in consdataCreate()
1100 (*consdata)->nlinvars = nlinvars; in consdataCreate()
1235 if( consdata->nlinvars <= 1 ) in consdataSortLinearVars()
1274 if( consdata->nlinvars == 0 ) in consdataFindLinearVar()
1357 ++consdata->nlinvars; in addLinearCoef()
1387 if( consdata->nlinvars == 1 ) in addLinearCoef()
1437 --consdata->nlinvars; in delLinearCoefPos()
1653 if( consdata->nlinvars == 0 ) in mergeAndCleanLinearVars()
1902 int nlinvars; in splitOffLinearPart() local
[all …]
H A Dnlp.c857 if( nlrow->nlinvars == 0 ) in nlrowSearchLinearCoef()
916 pos = nlrow->nlinvars; in nlrowAddLinearCoef()
917 nlrow->nlinvars++; in nlrowAddLinearCoef()
1038 nlrow->nlinvars--; in nlrowDelLinearCoefPos()
1398 nlrow->nlinvars--; in nlrowRemoveFixedLinearCoefPos()
1483 oldlen = nlrow->nlinvars; in nlrowRemoveFixedLinearCoefs()
2057 (*nlrow)->nlinvars = nlinvars; in SCIPnlrowCreate()
2059 if( nlinvars > 0 ) in SCIPnlrowCreate()
3258 return nlrow->nlinvars; in SCIPnlrowGetNLinearVars()
4393 int* nlinvars; in nlpFlushNlRowAdditions() local
[all …]
H A Dcons_quadratic.h204 int nlinvars, /**< number of linear terms (n) */
255 int nlinvars, /**< number of linear terms (n) */
280 int nlinvars, /**< number of linear terms (n) */
318 int nlinvars, /**< number of linear terms (n) */
H A Dreader_pip.c1184 *nlinvars = 0; in getLinearAndQuadraticCoefs()
1209 ++*nlinvars; in getLinearAndQuadraticCoefs()
1356 int nlinvars; in readObjective() local
1470 int nlinvars; in readConstraints() local
2161 for( v = 0; v < nlinvars; ++v ) in printRow()
2642 nactivevars = nlinvars; in printQuadraticCons()
2643 if( nlinvars > 0 ) in printQuadraticCons()
2693 if( nlinvars > 0 ) in printQuadraticCons()
2738 nactivevars = nlinvars; in printNonlinearCons()
2739 if( nlinvars > 0 ) in printNonlinearCons()
[all …]
H A Dcons_quadratic.c775 if( consdata->nlinvars == 0 ) in consdataUpdateLinearActivity()
1364 if( nlinvars > 0 ) in consdataCreate()
1368 (*consdata)->nlinvars = nlinvars; in consdataCreate()
1527 if( consdata->nlinvars <= 1 ) in consdataSortLinearVars()
1565 if( consdata->nlinvars == 0 ) in consdataFindLinearVar()
1933 ++consdata->nlinvars; in addLinearCoef()
1977 if( consdata->nlinvars == 1 ) in addLinearCoef()
2035 --consdata->nlinvars; in delLinearCoefPos()
2890 if( consdata->nlinvars == 0 ) in mergeAndCleanLinearVars()
2897 while( i < consdata->nlinvars ) in mergeAndCleanLinearVars()
[all …]
H A Dsepa_eccuts.c310 assert(linvars != NULL || nlinvars == 0); in nlrowaggrStoreLinearTerms()
311 assert(lincoefs != NULL || nlinvars == 0); in nlrowaggrStoreLinearTerms()
312 assert(nlinvars >= 0); in nlrowaggrStoreLinearTerms()
314 nlrowaggr->nlinvars = nlinvars; in nlrowaggrStoreLinearTerms()
318 if( nlinvars > 0 ) in nlrowaggrStoreLinearTerms()
322 BMScopyMemoryArray(nlrowaggr->linvars, linvars, nlinvars); in nlrowaggrStoreLinearTerms()
323 BMScopyMemoryArray(nlrowaggr->lincoefs, lincoefs, nlinvars); in nlrowaggrStoreLinearTerms()
331 for( i = 0; i < nlrowaggr->nlinvars; ++i ) in nlrowaggrStoreLinearTerms()
575 if( (*nlrowaggr)->nlinvars > 0 ) in nlrowaggrFree()
614 for( i = 0; i < nlrowaggr->nlinvars; ++i ) in nlrowaggrPrint()
[all …]
H A Dreader_gms.c609 int nlinvars, /**< number of linear terms */ in printQuadraticRow() argument
631 assert( nlinvars == 0 || (linvars != NULL && lincoeffs != NULL) ); in printQuadraticRow()
648 if( nlinvars > 0 ) in printQuadraticRow()
726 int nlinvars, /**< number of linear terms */ in printQuadraticCons() argument
740 assert( nlinvars == 0 || (linvars != NULL && lincoeffs != NULL) ); in printQuadraticCons()
756 nlinvars, linvars, lincoeffs, in printQuadraticCons()
766 nlinvars, linvars, lincoeffs, in printQuadraticCons()
774 nlinvars, linvars, lincoeffs, in printQuadraticCons()
1776 int nlinvars, /**< number of linear terms */ in printNonlinearRow() argument
1825 if( nlinvars > 0 ) in printNonlinearRow()
[all …]
H A Dcons_indicator.c959 int nlinvars; in checkIIS() local
999 nlinvars = 1; in checkIIS()
1147 int nlinvars; in checkIIS() local
2284 int nlinvars; in addAltLPConstraint() local
2320 nlinvars = 1; in addAltLPConstraint()
3797 int nlinvars; in propIndicator() local
4537 int nlinvars; in separatePerspective() local
6568 int nlinvars; in SCIP_DECL_CONSLOCK() local
7029 int nlinvars; in SCIP_DECL_CONSGETNVARS() local
7061 *nvars += nlinvars; in SCIP_DECL_CONSGETNVARS()
[all …]
H A Dstruct_nlp.h73 int nlinvars; /**< number of linear variables */ member
H A Dreader_opb.c2291 int nlinvars; in writeOpbObjective() local
2302 assert(linvars != NULL || nlinvars == 0); in writeOpbObjective()
2305 for( w = 0; w < nlinvars; ++w ) in writeOpbObjective()
2994 assert(linvars != NULL || nlinvars == 0); in printPBRow()
2995 assert(linvals != NULL || nlinvars == 0); in printPBRow()
3011 for( v = 0; v < nlinvars; ++v ) in printPBRow()
3054 for( v = 0; v < nlinvars; ++v ) in printPBRow()
3132 assert(linvars != NULL || nlinvars == 0); in printPseudobooleanCons()
3133 assert(linvals != NULL || nlinvars == 0); in printPseudobooleanCons()
3145 nactivelinvars = nlinvars; in printPseudobooleanCons()
[all …]
H A Dreader_lp.c2679 assert( nlinvars == 0 || (linvars != NULL && linvals != NULL) ); in printRow()
2698 for( v = 0; v < nlinvars; ++v ) in printRow()
2817 assert( nlinvars == 0 || linvars != NULL ); in printQuadraticCons()
2826 nactivevars = nlinvars; in printQuadraticCons()
2827 if( nlinvars > 0 ) in printQuadraticCons()
2877 if( nlinvars > 0 ) in printQuadraticCons()
3887 int nlinvars; in SCIPwriteLp() local
3911 nlinvars = SCIPgetNVarsLinear(scip, lincons); in SCIPwriteLp()
3916 if( nlinvars > 1 && !SCIPconsIsDeleted(lincons) ) in SCIPwriteLp()
3928 for( v = 0; v < nlinvars; ++v ) in SCIPwriteLp()
[all …]
H A Dreader_zpl.c405 int nlinvars; in addConsTerm() local
414 nlinvars = 0; in addConsTerm()
431 linvars [nlinvars] = (SCIP_VAR*)mono_get_var(monom, 0); in addConsTerm()
432 lincoefs[nlinvars] = numb_todbl(mono_get_coeff(monom)); in addConsTerm()
433 ++nlinvars; in addConsTerm()
445 …SCIP_CALL( SCIPcreateConsQuadratic(scip, &cons, name, nlinvars, linvars, lincoefs, nquadterms, qua… in addConsTerm()
H A Dscip_nlp.h681 int nlinvars, /**< number of linear variables */
H A Dnlp.h74 int nlinvars, /**< number of linear variables */
H A Dreader_mps.c2376 int nlinvars; in readIndicators() local
2460 nlinvars = SCIPgetNVarsLinear(scip, lincons); in readIndicators()
2476 SCIP_CALL( SCIPallocBufferArray(scip, &vars, nlinvars) ); in readIndicators()
2477 SCIP_CALL( SCIPallocBufferArray(scip, &vals, nlinvars) ); in readIndicators()
2478 for( i = 0; i < nlinvars; ++i ) in readIndicators()
2488 retcode = SCIPcreateConsIndicator(scip, &cons, name, binvar, nlinvars, vars, vals, -lhs, in readIndicators()
2508 for (i = 0; i < nlinvars; ++i) in readIndicators()
H A Dscip_nlp.c1199 int nlinvars, /**< number of linear variables */ in SCIPcreateNlRow() argument
1215 …name, constant, nlinvars, linvars, lincoefs, nquadvars, quadvars, nquadelems, quadelems, expressio… in SCIPcreateNlRow()
H A Dprop_symmetry.c845 int nlinvars, /**< number of linear variables */ in collectCoefficients() argument
863 assert( nlinvars == 0 || linvars != NULL ); in collectCoefficients()
867 if ( nlinvars == 0 ) in collectCoefficients()
875 nvars = nlinvars; in collectCoefficients()
/dports/math/SCIP/scip-7.0.3/applications/PolySCIP/src/
H A DReaderMOP.cpp1838 int nlinvars; in readIndicators() local
1922 nlinvars = SCIPgetNVarsLinear(scip, lincons); in readIndicators()
1945 SCIP_CALL( SCIPallocBufferArray(scip, &vars, nlinvars+1) ); in readIndicators()
1946 SCIP_CALL( SCIPallocBufferArray(scip, &vals, nlinvars+1) ); in readIndicators()
1947 for( i = 0; i < nlinvars; ++i ) in readIndicators()
1957 … SCIP_CALL( SCIPcreateConsIndicator(scip, &cons, name, binvar, nlinvars+1, vars, vals, -lhs, in readIndicators()
1972 for( i = 0; i < nlinvars; ++i ) in readIndicators()
/dports/math/SCIP/scip-7.0.3/src/nlpi/
H A Dexpr.c4816 *nlinvars = 0; in exprsimplifySeparateLinearFromPolynomial()
4870 ++*nlinvars; in exprsimplifySeparateLinearFromPolynomial()
4881 if( *nlinvars > 0 ) in exprsimplifySeparateLinearFromPolynomial()
8972 if( nlinvars != NULL && *nlinvars > 0 ) in SCIPexprtreeSimplify()
13635 *nlinvars = 0; in SCIPexprgraphNodeSplitOffLinear()
13646 *nlinvars = 1; in SCIPexprgraphNodeSplitOffLinear()
13668 *nlinvars = 1; in SCIPexprgraphNodeSplitOffLinear()
13681 *nlinvars = 1; in SCIPexprgraphNodeSplitOffLinear()
13906 *nlinvars = 1; in SCIPexprgraphNodeSplitOffLinear()
14206 ++*nlinvars; in SCIPexprgraphNodeSplitOffLinear()
[all …]
H A Dpub_expr.h634 …int* nlinvars, /**< buffer to store number of linear variables in linea…
947 …int* nlinvars, /**< buffer to store number of linear variables in linea…
1332 …int* nlinvars, /**< buffer to store length of linear term that have bee…
/dports/math/minizinc/libminizinc-2.5.5/include/minizinc/solvers/MIP/
H A DMIP_scip_wrap.hh77 int nlinvars, /**< number of linear terms (n) */

12