Home
last modified time | relevance | path

Searched refs:x_u (Results 1 – 25 of 218) sorted by relevance

123456789

/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/CbcBonmin/Heuristics/
H A DBonHeuristicDive.cpp98 const double* x_u = minlp->x_u(); in solution() local
155 x_l[iColumn] != x_u[iColumn]) { in solution()
157 originalBound[numberAtBoundFixed] = x_u[iColumn]; in solution()
162 else if(fabs(x_u[iColumn]-value)<=integerTolerance && in solution()
163 x_l[iColumn] != x_u[iColumn]) { in solution()
167 minlp->SetVariableLowerBound(iColumn, x_u[iColumn]); in solution()
178 originalBoundBestColumn = x_u[bestColumn]; in solution()
247 if(value < x_l[iColumn] || value > x_u[iColumn]) { in solution()
318 const double* x_u = minlp->x_u(); in isNlpFeasible() local
326 if(value < x_l[iColumn] || value > x_u[iColumn]) { in isNlpFeasible()
H A DBonHeuristicFPump.cpp128 const double* x_u = minlp->x_u(); in solution() local
138 <<"x_u["<<i<<"]= "<<x_u[i]<<" " in solution()
210 else if(value > x_u[iColumn]+primalTolerance) in solution()
253 else if(value > x_u[iColumn]+primalTolerance) in solution()
299 else if(value > x_u[iColumn]+primalTolerance) in solution()
495 const double* x_u = minlp_->x_u(); in round() local
552 else if(value > x_u[iColumn]+primalTolerance) in round()
H A DBonHeuristicDiveMIPFractional.cpp66 const double* x_u = minlp->x_u(); in selectVariableToBranch() local
82 if(above <= x_u[iColumn]) in selectVariableToBranch()
H A DBonHeuristicDiveFractional.cpp64 const double* x_u = minlp->x_u(); in selectVariableToBranch() local
80 if(above <= x_u[iColumn]) in selectVariableToBranch()
H A DBonHeuristicLocalBranching.cpp65 const double* x_u = minlp->x_u(); in validate() local
69 (x_l[i] != 0.0 || x_u[i] != 1.0)) { in validate()
/dports/math/gsl/gsl-2.7/min/
H A Dquad_golden.c128 const double x_u = *x_upper; in quad_golden_iterate() local
145 double x_midpoint = 0.5 * (x_l + x_u); in quad_golden_iterate()
180 if (fabs (quad_step_size) < fabs (0.5 * prev_stored_step) && x_trial > x_l && x_trial < x_u) in quad_golden_iterate()
186 if ((x_trial - x_l) < 2.0 * tol || (x_u - x_trial) < 2.0 * tol) in quad_golden_iterate()
202 inside_interval = x_u - x_m; in quad_golden_iterate()
206 outside_interval = x_u - x_m; in quad_golden_iterate()
244 step = x_u - x_m; in quad_golden_iterate()
330 DEBUG_PRINTF(("[%d] Final State: %g %g %g\n", state->num_iter, x_l, x_m, x_u)); in quad_golden_iterate()
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/nonparametric/
H A Dkernels.py181 def aitchison_aitken_cdf(h, Xi, x_u): argument
182 x_u = int(x_u)
187 if x <= x_u: #FIXME: why a comparison for unordered variables?
193 def wang_ryzin_cdf(h, Xi, x_u): argument
196 if x <= x_u:
/dports/math/ipopt/Ipopt-3.12.13/Ipopt/examples/ScalableProblems/
H A DMittelmannBndryCntrlDiri3D.cpp112 x_u[iy] = ub_y_; in get_bounds_info()
121 x_u[iu] = ub_u_; in get_bounds_info()
128 x_u[iu] = ub_u_; in get_bounds_info()
135 x_u[iu] = ub_u_; in get_bounds_info()
142 x_u[iu] = ub_u_; in get_bounds_info()
149 x_u[iu] = ub_u_; in get_bounds_info()
156 x_u[iu] = ub_u_; in get_bounds_info()
163 x_l[y_index(0,j,0)] = x_u[y_index(0,j,0)] = 0.; in get_bounds_info()
164 x_l[y_index(0,j,N_+1)] = x_u[y_index(0,j,N_+1)] = 0.; in get_bounds_info()
169 x_l[y_index(0,0,k)] = x_u[y_index(0,0,k)] = 0.; in get_bounds_info()
[all …]
H A DMittelmannBndryCntrlDiri3D_27.cpp122 x_u[iy] = ub_y_; in get_bounds_info()
131 x_u[iu] = ub_u_; in get_bounds_info()
138 x_u[iu] = ub_u_; in get_bounds_info()
145 x_u[iu] = ub_u_; in get_bounds_info()
152 x_u[iu] = ub_u_; in get_bounds_info()
159 x_u[iu] = ub_u_; in get_bounds_info()
166 x_u[iu] = ub_u_; in get_bounds_info()
173 x_l[y_index(0,j,0)] = x_u[y_index(0,j,0)] = 0.; in get_bounds_info()
174 x_l[y_index(0,j,N_+1)] = x_u[y_index(0,j,N_+1)] = 0.; in get_bounds_info()
179 x_l[y_index(0,0,k)] = x_u[y_index(0,0,k)] = 0.; in get_bounds_info()
[all …]
H A DMittelmannBndryCntrlDiri.cpp91 MittelmannBndryCntrlDiriBase::get_bounds_info(Index n, Number* x_l, Number* x_u, in get_bounds_info() argument
99 x_u[iy] = ub_y_; in get_bounds_info()
106 x_u[iu] = ub_u_; in get_bounds_info()
111 x_u[iu] = ub_u_; in get_bounds_info()
116 x_u[iu] = ub_u_; in get_bounds_info()
121 x_u[iu] = ub_u_; in get_bounds_info()
126 x_l[y_index(0,0)] = x_u[y_index(0,0)] = 0.; in get_bounds_info()
127 x_l[y_index(0,N_+1)] = x_u[y_index(0,N_+1)] = 0.; in get_bounds_info()
128 x_l[y_index(N_+1,0)] = x_u[y_index(N_+1,0)] = 0.; in get_bounds_info()
129 x_l[y_index(N_+1,N_+1)] = x_u[y_index(N_+1,N_+1)] = 0.; in get_bounds_info()
H A DMittelmannBndryCntrlDiri3Dsin.cpp105 x_u[iy] = ub_y_; in get_bounds_info()
114 x_u[iu] = ub_u_; in get_bounds_info()
121 x_u[iu] = ub_u_; in get_bounds_info()
128 x_u[iu] = ub_u_; in get_bounds_info()
135 x_u[iu] = ub_u_; in get_bounds_info()
142 x_u[iu] = ub_u_; in get_bounds_info()
149 x_u[iu] = ub_u_; in get_bounds_info()
157 x_l[y_index(0,j,0)] = x_u[y_index(0,j,0)] = 0.; in get_bounds_info()
158 x_l[y_index(0,j,N_+1)] = x_u[y_index(0,j,N_+1)] = 0.; in get_bounds_info()
163 x_l[y_index(0,0,k)] = x_u[y_index(0,0,k)] = 0.; in get_bounds_info()
[all …]
H A DMittelmannDistCntrlDiri.cpp91 MittelmannDistCntrlDiriBase::get_bounds_info(Index n, Number* x_l, Number* x_u, in get_bounds_info() argument
99 x_u[iy] = ub_y_; in get_bounds_info()
106 x_u[iu] = ub_u_; in get_bounds_info()
113 x_u[y_index(i,0)] = 0.; in get_bounds_info()
117 x_u[y_index(0,i)] = 0.; in get_bounds_info()
121 x_u[y_index(i,N_+1)] = 0.; in get_bounds_info()
125 x_u[y_index(N_+1,i)] = 0.; in get_bounds_info()
/dports/math/cppad/CppAD-20210000.8/cppad_ipopt/example/
H A Dode_run.hpp58 NumberVector x_i(n), x_l(n), x_u(n); in ipopt_ode_case() local
62 x_u[j] = +1.0e19; // no upper limit in ipopt_ode_case()
67 x_u[ny_inx + j ] = +1.e19; // no upper in ipopt_ode_case()
82 n, m, x_i, x_l, x_u, g_l, g_u, &fg_info, &solution in ipopt_ode_case()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/examples/CppExample/
H A DMyTMINLP.cpp56 MyTMINLP::get_bounds_info(Index n, Number* x_l, Number* x_u, in get_bounds_info() argument
62 x_u[0] = 1.; in get_bounds_info()
65 x_u[1] = DBL_MAX; in get_bounds_info()
68 x_u[2] = DBL_MAX; in get_bounds_info()
71 x_u[3] = 5; in get_bounds_info()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/examples/OptionDocGen/
H A DMyTMINLP.cpp56 MyTMINLP::get_bounds_info(Index n, Number* x_l, Number* x_u, in get_bounds_info() argument
62 x_u[0] = 1.; in get_bounds_info()
65 x_u[1] = DBL_MAX; in get_bounds_info()
68 x_u[2] = DBL_MAX; in get_bounds_info()
71 x_u[3] = 5; in get_bounds_info()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Interfaces/
H A DBonTNLPSolver.cpp85 double * x_u = new double[n]; in zeroDimension() local
90 tnlp->get_bounds_info(n, x_l, x_u, m, g_l , g_u); in zeroDimension()
94 if(x_u[i] - x_l[i] > 1e-5) in zeroDimension()
97 delete [] x_u; in zeroDimension()
118 delete [] x_u; in zeroDimension()
175 const double * currentUpper = model_->x_u(); in writeDiffFiles()
H A DBonTMINLP2TNLP.hpp90 const Ipopt::Number* x_u() in x_u() function in Bonmin::TMINLP2TNLP
177 const Ipopt::Number * x_u);
185 const Ipopt::Number * x_u);
188 void SetVariableBounds(Ipopt::Index var_no, Ipopt::Number x_l, Ipopt::Number x_u);
194 void SetVariableUpperBound(Ipopt::Index var_no, Ipopt::Number x_u);
237 virtual bool get_bounds_info(Ipopt::Index n, Ipopt::Number* x_l, Ipopt::Number* x_u,
H A DBonTMINLP2TNLP.cpp239 const Number * x_u) in SetVariablesBounds() argument
243 IpBlasDcopy(n, x_u, 1, x_u_(), 1); in SetVariablesBounds()
254 const Number * x_u) in SetVariablesUpperBounds() argument
257 IpBlasDcopy(n, x_u, 1, x_u_(), 1); in SetVariablesUpperBounds()
260 void TMINLP2TNLP::SetVariableBounds(Index var_no, Number x_l, Number x_u) in SetVariableBounds() argument
264 x_u_[var_no] = x_u; in SetVariableBounds()
273 void TMINLP2TNLP::SetVariableUpperBound(Index var_no, Number x_u) in SetVariableUpperBound() argument
276 x_u_[var_no] = x_u; in SetVariableUpperBound()
345 bool TMINLP2TNLP::get_bounds_info(Index n, Number* x_l, Number* x_u, in get_bounds_info() argument
351 IpBlasDcopy(n, x_u_(), 1, x_u, 1); in get_bounds_info()
[all …]
/dports/math/cppad/CppAD-20210000.8/cppad_ipopt/test/
H A Dk_gt_one.cpp101 NumberVector x_u(n); in k_gt_one() local
104 x_u[j] = 5.0; in k_gt_one()
125 x_u[2] = check_x[2]; in k_gt_one()
135 n, m, x_i, x_l, x_u, g_l, g_u, fg_info, &solution in k_gt_one()
H A Dretape_k1_l1.cpp60 NumberVector x_u(n); in retape_k1_l1() local
62 { x_l[j] = -10.; x_u[j] = +10.; in retape_k1_l1()
76 n, m, x_i, x_l, x_u, g_l, g_u, fg_info, &solution in retape_k1_l1()
H A Dretape_k1_l2.cpp75 NumberVector x_u(n); in retape_k1_l2() local
78 x_u[j] = +5.0; in retape_k1_l2()
91 n, m, x_i, x_l, x_u, g_l, g_u, fg_info, &solution in retape_k1_l2()
H A Dmultiple_solution.cpp91 NumberVector x_u(n); in multiple_solution() local
97 x_u[i] = +1.0; in multiple_solution()
113 n, m, x_i, x_l, x_u, g_l, g_u, fg_info, &solution in multiple_solution()
/dports/science/py-scipy/scipy-1.7.1/doc/source/tutorial/stats/
H A Ddiscrete_nchypergeom_fisher.rst22 :math:`x \in [x_l, x_u]`,
25 :math:`x_u = \min(N, n)`,
29 P_k = \sum_{y=x_l}^{x_u} \binom{n}{y} \binom{M - n}{N-y} \omega^y y^k,
/dports/math/py-CyLP/CyLP-0.91.4/cylp/tests/
H A Dtest_CyClpSimplex_CyLPModel.py92 x_u= CyLPArray([2., 3.5])
97 model.addConstraint(1.1 <= x[1:3] <= x_u)
135 x_u= CyLPArray([2., 3.5])
140 model.addConstraint(1.1 <= x[1:3] <= x_u)
211 x_u= CyLPArray([2., 3.5])
216 model.addConstraint(1.1 <= x[1:3] <= x_u)
/dports/lang/ghc/ghc-8.10.7/compiler/cmm/
H A DCmmOpt.hs119 MO_Eq _ -> Just $ CmmLit (CmmInt (if x_u == y_u then 1 else 0) (wordWidth dflags))
120 MO_Ne _ -> Just $ CmmLit (CmmInt (if x_u /= y_u then 1 else 0) (wordWidth dflags))
122 MO_U_Gt _ -> Just $ CmmLit (CmmInt (if x_u > y_u then 1 else 0) (wordWidth dflags))
123 MO_U_Ge _ -> Just $ CmmLit (CmmInt (if x_u >= y_u then 1 else 0) (wordWidth dflags))
124 MO_U_Lt _ -> Just $ CmmLit (CmmInt (if x_u < y_u then 1 else 0) (wordWidth dflags))
125 MO_U_Le _ -> Just $ CmmLit (CmmInt (if x_u <= y_u then 1 else 0) (wordWidth dflags))
135 MO_U_Quot r | y /= 0 -> Just $ CmmLit (CmmInt (x_u `quot` y_u) r)
136 MO_U_Rem r | y /= 0 -> Just $ CmmLit (CmmInt (x_u `rem` y_u) r)
145 MO_U_Shr r -> Just $ CmmLit (CmmInt (x_u `shiftR` fromIntegral y) r)
151 x_u = narrowU xrep x function

123456789