Home
last modified time | relevance | path

Searched refs:inequality (Results 1 – 25 of 3639) sorted by relevance

12345678910>>...146

/dports/math/openturns/openturns-1.18/lib/test/
H A Dt_NLopt_std.expout1 algo=AUGLAG minimization=1 bounds=1 inequality=1 equality=1
3 algo=AUGLAG minimization=1 bounds=0 inequality=1 equality=1
5 algo=AUGLAG minimization=1 bounds=1 inequality=1 equality=0
7 algo=AUGLAG minimization=1 bounds=0 inequality=1 equality=0
9 algo=AUGLAG minimization=1 bounds=1 inequality=0 equality=1
11 algo=AUGLAG minimization=1 bounds=0 inequality=0 equality=1
13 algo=AUGLAG minimization=1 bounds=1 inequality=0 equality=0
15 algo=AUGLAG minimization=1 bounds=0 inequality=0 equality=0
17 algo=AUGLAG minimization=0 bounds=1 inequality=1 equality=1
19 algo=AUGLAG minimization=0 bounds=1 inequality=1 equality=0
[all …]
H A Dt_NLopt_std.cxx72 for (SignedInteger inequality = 1; inequality >= 0; -- inequality) in main() local
80 if (inequality) in main()
94 …mization=" << minimization << " bounds=" << bound << " inequality=" << inequality << " equality=" … in main()
101 …int << "-- Not supported: algo=" << algoNames[i] << " inequality=" << (inequality == 1 ? "true" : … in main()
/dports/math/openturns/openturns-1.18/python/test/
H A Dt_NLopt_std.expout1 algo= AUGLAG minimization= True bounds= True inequality= True equality= True
3 algo= AUGLAG minimization= True bounds= False inequality= True equality= True
5 algo= AUGLAG minimization= True bounds= True inequality= True equality= False
7 algo= AUGLAG minimization= True bounds= False inequality= True equality= False
9 algo= AUGLAG minimization= True bounds= True inequality= False equality= True
11 algo= AUGLAG minimization= True bounds= False inequality= False equality= True
13 algo= AUGLAG minimization= True bounds= True inequality= False equality= False
15 algo= AUGLAG minimization= True bounds= False inequality= False equality= False
17 algo= AUGLAG minimization= False bounds= True inequality= True equality= True
19 algo= AUGLAG minimization= False bounds= True inequality= True equality= False
[all …]
/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/lib/
H A Dgeometry.gi32 local centergram, pointgram, inequality;
40 return inequality;
48 local centergram, centernorm, pointgram, inequality;
54 inequality:=Concatenation([-center^2+point^2],2*(center-point));
55 return inequality;
63 function(vector,inequality)
65 size:=Size(inequality);
70 if not ForAll(Union(vector,inequality),IsRat)
74 return WhichSideOfHyperplaneNC(vector,inequality);
80 function(vector,inequality)
[all …]
/dports/science/py-inequality/inequality-1.0.0/
H A DPKG-INFO2 Name: inequality
4 Summary: Spatial inequality analysis for PySAL A library of spatial analysis functions.
9 Download-URL: https://pypi.python.org/pypi/inequality
13 …Build Status](https://travis-ci.org/pysal/inequality.svg?branch=master)](https://travis-ci.org/pys…
15 Methods for measuring spatial inequality.
21 Install inequality by running:
24 $ pip install inequality
34 PySAL-inequality is under active development and contributors are welcome.
36 …inequality/issues) on GitHub. To submit patches, please follow the PySAL development [guidelines](…
H A DREADME.md4 …Build Status](https://travis-ci.org/pysal/inequality.svg?branch=master)](https://travis-ci.org/pys…
6 Methods for measuring spatial inequality.
12 Install inequality by running:
15 $ pip install inequality
25 PySAL-inequality is under active development and contributors are welcome.
27 …inequality/issues) on GitHub. To submit patches, please follow the PySAL development [guidelines](…
/dports/science/py-inequality/inequality-1.0.0/inequality.egg-info/
H A DPKG-INFO2 Name: inequality
4 Summary: Spatial inequality analysis for PySAL A library of spatial analysis functions.
9 Download-URL: https://pypi.python.org/pypi/inequality
13 …Build Status](https://travis-ci.org/pysal/inequality.svg?branch=master)](https://travis-ci.org/pys…
15 Methods for measuring spatial inequality.
21 Install inequality by running:
24 $ pip install inequality
34 PySAL-inequality is under active development and contributors are welcome.
36 …inequality/issues) on GitHub. To submit patches, please follow the PySAL development [guidelines](…
/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/
H A Dutilities.py28 def lower_ineq_to_nonpos(inequality): argument
29 lhs = inequality.args[0]
30 rhs = inequality.args[1]
31 return NonPos(lhs - rhs, constr_id=inequality.constr_id)
34 def lower_ineq_to_nonneg(inequality): argument
35 lhs = inequality.args[0]
36 rhs = inequality.args[1]
37 return NonNeg(rhs - lhs, constr_id=inequality.constr_id)
/dports/math/maxima/maxima-5.43.2/share/simplification/
H A Dineq.dem3 /* a sample inequality */
5 /* add a second, strict inequality, and note that the result is strict */
7 /* multiply an inequality by a positive number */
9 /* multiply an inequality by a negative number, and note change of > to < */
16 /* another inequality */
22 /* yet another inequality */
30 /* use inequality manipulation to determine truth of assertion */
/dports/java/avis/avis-1.2.0/server/src/main/org/avis/subscription/ast/nodes/
H A DCompare.java47 public int inequality; field in Compare
88 int inequality, boolean equality) in Compare() argument
90 this.inequality = inequality; in Compare()
142 if (inequality < 0) in expr()
144 else if (inequality > 0) in expr()
206 return inequality < 0; in evaluate()
208 return inequality > 0; in evaluate()
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/repn/tests/ampl/
H A Dsmall12_testCase.py19 from pyomo.environ import ConcreteModel, Var, Param, Objective, Constraint, inequality
66 model.c15 = Constraint(expr= Expr_if(IF=inequality(-1, model.vN2, 1), THEN=(model.vTru…
67 model.c16 = Constraint(expr= Expr_if(IF=inequality(-1*model.vP1, model.vN1, 1), THEN=(model.vTru…
68 model.c17 = Constraint(expr= Expr_if(IF=inequality(-1*model.vP1**2, model.v0, 1), THEN=(model.vTru…
69 model.c18 = Constraint(expr= Expr_if(IF=inequality(model.vN1, model.vP1, 1), THEN=(model.vTru…
70 model.c19 = Constraint(expr= Expr_if(IF=inequality(-1, model.vP2, 1), THEN=(model.vTru…
73 model.c20 = Constraint(expr= Expr_if(IF=inequality(-1, model.vN2, 1, strict=True), THEN=(model.vTru…
74 model.c21 = Constraint(expr= Expr_if(IF=inequality(-1, model.vN1, 1*model.vP1, strict=True), THEN=(…
75 model.c22 = Constraint(expr= Expr_if(IF=inequality(-1, model.v0, 1*model.vP1**2, strict=True), THE…
76 model.c23 = Constraint(expr= Expr_if(IF=inequality(-1, model.vP1, model.vP1, strict=True), THEN=(mo…
[all …]
/dports/math/R-cran-VGAM/VGAM/man/
H A DparetoIVUC.Rd30 dparetoIV(x, location = 0, scale = 1, inequality = 1, shape = 1, log = FALSE)
31 pparetoIV(q, location = 0, scale = 1, inequality = 1, shape = 1,
33 qparetoIV(p, location = 0, scale = 1, inequality = 1, shape = 1,
35 rparetoIV(n, location = 0, scale = 1, inequality = 1, shape = 1)
36 dparetoIII(x, location = 0, scale = 1, inequality = 1, log = FALSE)
37 pparetoIII(q, location = 0, scale = 1, inequality = 1,
39 qparetoIII(p, location = 0, scale = 1, inequality = 1,
41 rparetoIII(n, location = 0, scale = 1, inequality = 1)
67 \item{scale, shape, inequality}{the (positive) scale,
68 inequality and shape parameters. }
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/hashicorp/hcl/v2/specsuite/tests/expressions/
H A Doperators.hcl16 inequality "<" {
21 inequality "<=" {
26 inequality ">" {
31 inequality ">=" {
/dports/sysutils/terraform-docs/terraform-docs-0.16.0/vendor/github.com/hashicorp/hcl/v2/specsuite/tests/expressions/
H A Doperators.hcl16 inequality "<" {
21 inequality "<=" {
26 inequality ">" {
31 inequality ">=" {
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/hashicorp/hcl/v2/specsuite/tests/expressions/
H A Doperators.hcl16 inequality "<" {
21 inequality "<=" {
26 inequality ">" {
31 inequality ">=" {
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/core/tests/unit/
H A Dtest_logical_expr.py180 e = inequality(lower=m.a, upper=m.b)
203 e = inequality(body=m.b, upper=m.a)
212 inequality(None, None)
218 inequality(m.a, None)
260 e = inequality(m.a, m.b, m.c)
305 e = inequality(0, m.a, 0)
320 e = inequality(0, m.a, 0, True)
334 e = inequality(0, m.v, 2)
336 e = inequality(0, m.v, 1)
338 e = inequality(0, m.v, 2, strict=True)
[all …]
/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/tests/unit_tests/neldermead/
H A Dneldermead_rosensuzuki.dia.ref30 // Non linear inequality constraints are positive.
357 Scaling inequality constraint with alpha = 0.5
360 Scaling inequality constraint with alpha = 0.25
370 Scaling inequality constraint with alpha = 0.5
373 Scaling inequality constraint with alpha = 0.25
380 Scaling inequality constraint with alpha = 0.5
383 Scaling inequality constraint with alpha = 0.25
396 Scaling inequality constraint with alpha = 0.5
409 Scaling inequality constraint with alpha = 0.5
422 Scaling inequality constraint with alpha = 0.5
[all …]
/dports/math/gambit/gambit-16.0.1/library/src/enummixed/
H A Dlrsenum.cc290 long *inequality; in lrs_getfirstbasis2() local
311 inequality = Q->inequality; in lrs_getfirstbasis2()
320 inequality[i] = linearity[i]; in lrs_getfirstbasis2()
335 inequality[k++] = i; in lrs_getfirstbasis2()
395 inequality[i] = i; in lrs_getfirstbasis2()
399 inequality[linearity[i]] = 0; in lrs_getfirstbasis2()
403 while (k <= m && inequality[k] == 0) in lrs_getfirstbasis2()
405 inequality[i] = inequality[k++]; in lrs_getfirstbasis2()
487 j = inequality[B[i] - lastdv]; in lrs_getfirstbasis2()
488 inequality[B[i] - lastdv] = inequality[C[0] - lastdv]; in lrs_getfirstbasis2()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/
H A Dvariables-linear_inequality_upper_bounds2 Define upper bounds for the linear inequality constraint
4 In the inequality case, the
11 As with nonlinear inequality constraints (see \ref responses-objective_functions), the
12 default linear inequality constraint bounds are selected so that
31 Examples of specifying linear inequality constraints to Dakota are
H A Dvariables-linear_inequality_lower_bounds2 Define lower bounds for the linear inequality constraint
4 In the inequality case, the
11 As with nonlinear inequality constraints (see \ref responses-objective_functions), the
12 default linear inequality constraint bounds are selected so that
31 Examples of specifying linear inequality constraints to Dakota are
H A DDUPLICATE-nonlinear_constraints-scales7 used in scaling each nonlinear inequality (equality) constraint. They
16 nonlinear inequality (equality) constraints. Otherwise a value must
17 be specified for each nonlinear inequality (equality) constraint.
22 is assumed to be 'value' for this set of nonlinear inequality
/dports/math/glpk/glpk-5.0/examples/
H A Dmin01ks.mod1 /* min01ks.mod - finding minimal equivalent 0-1 knapsack inequality */
5 /* It is obvious that for a given 0-1 knapsack inequality
12 Given a[j]'s and b this model allows to find an inequality
54 /* number of variables in the knapsack inequality */
76 i.e. satisfy to the original knapsack inequality (1) */
92 printf "\nOriginal 0-1 knapsack inequality:\n";
96 printf "\nMinimized equivalent inequality:\n";
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/util/tests/
H A Dtest_blockutil.py19 from pyomo.environ import ConcreteModel, Constraint, Var, inequality
36 m.c5 = Constraint(expr=inequality(5, m.z, 10), doc="Range infeasible")
39 m.c8 = Constraint(expr=inequality(3, m.x, 6), doc="Range lb infeasible")
40 m.c9 = Constraint(expr=inequality(0, m.x, 0.5), doc="Range ub infeasible")
/dports/math/sleef/sleef-3.5.0/src/gencoef/
H A Dsimplexfr.c30 static int *col, *row, *nonzero_row, *inequality; variable
86 inequality = calloc(m+1, sizeof(int)); in init()
123 free(inequality); in dispose()
131 if (inequality[i] == GEQ) { in prepare()
136 if (inequality[i] == LEQ) { in prepare()
142 if (inequality[i] != LEQ) { in prepare()
337 inequality[i+1] = ineq0[i]; in solve_fr()
340 if (inequality[i+1] == GEQ) inequality[i+1] = LEQ; in solve_fr()
341 else if (inequality[i+1] == LEQ) inequality[i+1] = GEQ; in solve_fr()
343 } else if (mpfr_cmp_d(a[i+1][0], 0) == 0 && inequality[i+1] == GEQ) { in solve_fr()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang-tools-extra/docs/clang-tidy/checks/
H A Dreadability-string-compare.rst9 equality or inequality operators. The compare method is intended for sorting
12 If an equality or inequality check can suffice, that is recommended. This is
14 and to simplify the code. The string equality and inequality operators can
54 inequality of two strings instead of using the correct operators.

12345678910>>...146