/dports/math/casadi/casadi-3.5.5/docs/examples/cplusplus/ |
H A D | chain_qp.cpp | 87 vector<double> lbx, ubx; in main() local 113 ubx.push_back(-2); in main() 115 ubx.push_back( 1); in main() 118 ubx.push_back( 2); in main() 120 ubx.push_back( 1); in main() 123 ubx.push_back( inf); in main() 125 ubx.push_back( inf); in main() 158 {"ubx", ubx}, in main()
|
H A D | parametric_nlp.cpp | 71 vector<double> ubx = { inf, inf, inf}; in main() local 89 arg["ubx"] = ubx; in main()
|
/dports/math/casadi/casadi-3.5.5/docs/examples/python/ |
H A D | chain_qp.py | 68 ubx = [] variable 92 ubx += [-2., 1.] 95 ubx += [ 2., 1.] 98 ubx += [ inf, inf] 121 sol = solver(lbx=lbx, ubx=ubx, lbg=lbg, ubg=ubg)
|
H A D | biegler_10_1.py | 129 ubx = x.nnz()*[100] variable 130 lbx[0] = ubx[0] = z0 132 arg["ubx"] = ubx
|
H A D | nlp_sensitivities.py | 179 sol = solver(x0=w0, lbx=lbw, ubx=ubw, lbg=lbg, ubg=ubg, p=0) 203 lbx=lbw, ubx=ubw, lbg=lbg, ubg=ubg, p=0) 228 out_f=sol['f'], out_g=sol['g'], lbx=lbw, ubx=ubw, lbg=lbg, ubg=ubg, 239 ubx=ubw + h*(fwd_lbx[d]+fwd_ubx[d]), 259 ubx=ubw - h*(fwd_lbx[d]+fwd_ubx[d]), 284 out_f=sol['f'], out_g=sol['g'], lbx=lbw, ubx=ubw, lbg=lbg, ubg=ubg,
|
H A D | lotka_volterra_minlp.py | 41 ubx = [2., 2.] variable 131 ubw += ubx 168 sol = nlp_solver(x0=vertcat(*w0), lbx=lbw, ubx=ubw, lbg=lbg, ubg=ubg)
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | scip_nonlinear.c | 243 assert(SCIPisLE(scip, lbx, ubx)); in SCIPaddBilinMcCormick() 274 cand3 = ubx * lby; in SCIPaddBilinMcCormick() 275 cand4 = ubx * uby; in SCIPaddBilinMcCormick() 325 constant = bilincoef * (ubx > 0.0 ? (lby - uby) * ubx : 0.0); in SCIPaddBilinMcCormick() 359 constant = bilincoef * (ubx > 0.0 ? (uby - lby) * ubx : 0.0); in SCIPaddBilinMcCormick() 446 SCIP_Real xs[2] = {lbx, ubx}; in SCIPcomputeBilinEnvelope1() 471 assert(SCIPisLE(scip, lbx, ubx)); in SCIPcomputeBilinEnvelope1() 495 minx = lbx + 0.01 * (ubx-lbx); in SCIPcomputeBilinEnvelope1() 496 maxx = ubx - 0.01 * (ubx-lbx); in SCIPcomputeBilinEnvelope1() 885 minx = lbx + 0.01 * (ubx-lbx); in SCIPcomputeBilinEnvelope2() [all …]
|
H A D | scip_nonlinear.h | 97 SCIP_Real ubx, /**< upper bound on first variable */ 120 SCIP_Real ubx, /**< upper bound on first variable */ 147 SCIP_Real ubx, /**< upper bound on first variable */
|
/dports/astro/gpsd/gpsd-3.20/ |
H A D | driver_ubx.c | 350 (long long)session->driver.ubx.iTOW, in ubx_msg_nav_hpposecef() 402 (long long)session->driver.ubx.iTOW, in ubx_msg_nav_hpposllh() 434 (long long)session->driver.ubx.iTOW, in ubx_msg_nav_posecef() 658 (long long)session->driver.ubx.iTOW, in ubx_msg_nav_relposned() 985 if (18 > session->driver.ubx.protver) { in ubx_msg_nav_eoe() 987 session->driver.ubx.protver = 18; in ubx_msg_nav_eoe() 1030 MSTOTS(&ts_tow, session->driver.ubx.iTOW); in ubx_msg_nav_timegps() 2036 if ( -1 < session->driver.ubx.iTOW) { in ubx_parse() 2049 if ((session->driver.ubx.last_iTOW != session->driver.ubx.iTOW) && in ubx_parse() 2053 session->driver.ubx.end_msgid = session->driver.ubx.last_msgid; in ubx_parse() [all …]
|
/dports/math/casadi/casadi-3.5.5/docs/api/examples/solvers/ |
H A D | ipopt.py | 42 sol = solver(lbx=-10, ubx=10) 64 sol = solver(lbx=-10, ubx=10, lbg=[0,2], ubg=[1,2]) 87 sol = solver(lbx=-10, ubx=10, p=a_) 94 sol = solver(lbx=-10, ubx=10, p=2*a_)
|
H A D | exacthessian.py | 39 sol = solver(lbx=-10, ubx=10, lbg=0, ubg=1) 44 sol = solver(lbx=-10, ubx=10, lbg=0, ubg=1)
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5sec/tsp_circuit/dznFolder/ |
H A D | tsp_circuit.mzn | 25 int: ubx = length(x), 26 array[lbx..ubx] of var lbx..ubx: z 35 forall(i in lbx+1..ubx) ( 39 forall(i in lbx..ubx-1) ( 43 z[ubx] = lbx
|
/dports/math/casadi/casadi-3.5.5/casadi/core/ |
H A D | nlp_tools.cpp | 36 T& lbx, T& ubx, in detect_simple_bounds_gen() argument 89 ubx = T::inf(nx); in detect_simple_bounds_gen() 129 ubx(sxi_groups[i]) = fmin(ubx(sxi_groups[i]), ub(sgsi_groups[i])); in detect_simple_bounds_gen() 166 ucomp.push_back(ubx(sxi_groups[i])==ub(sgsi_groups[i])); in detect_simple_bounds_gen() 210 SX& lbx, SX& ubx, in detect_simple_bounds() argument 214 gi, lbx, ubx, lam_forward, lam_backward); in detect_simple_bounds() 220 MX& lbx, MX& ubx, in detect_simple_bounds() argument 224 gi, lbx, ubx, lam_forward, lam_backward); in detect_simple_bounds()
|
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5sec/circuit_test/dznFolder/ |
H A D | circuit_test.mzn | 32 int: ubx = max(index_set(x)), 33 array[lbx..ubx] of var lbx..ubx: z 42 forall(i in lbx+1..ubx) ( 46 forall(i in lbx..ubx-1) (
|
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/gnss/ |
H A D | Makefile | 18 obj-$(CONFIG_GNSS_UBX_SERIAL) += gnss-ubx.o 19 gnss-ubx-y := ubx.o
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/gnss/ |
H A D | Makefile | 18 obj-$(CONFIG_GNSS_UBX_SERIAL) += gnss-ubx.o 19 gnss-ubx-y := ubx.o
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/gnss/ |
H A D | Makefile | 18 obj-$(CONFIG_GNSS_UBX_SERIAL) += gnss-ubx.o 19 gnss-ubx-y := ubx.o
|
/dports/math/SCIP/scip-7.0.3/tests/src/scip/ |
H A D | bilinenvelope.c | 118 SCIP_Real lbx, ubx, lby, uby; in Test() local 127 ubx = 5.9824198645533899; in Test() 139 …SCIPcomputeBilinEnvelope1(scip, -325.08, lbx, ubx, refpointx, lby, uby, refpointy, FALSE, alpha, b… in Test() 152 SCIP_Real ubx = 2.0; in Test() local 178 …SCIPcomputeBilinEnvelope2(scip, bilincoefs[i], lbx, ubx, refpointxs[i], lby, uby, refpointys[i], F… in Test() 198 SCIP_Real ubx = 20.0; in Test() local 224 …SCIPcomputeBilinEnvelope2(scip, bilincoefs[i], lbx, ubx, refpointxs[i], lby, uby, refpointys[i], T… in Test()
|
/dports/math/casadi/casadi-3.5.5/casadi/core/runtime/ |
H A D | casadi_bound_consistency.hpp | 10 const T1* lbx, const T1* ubx) { in casadi_bound_consistency() argument 18 ub = ubx ? ubx[i] : 0.; in casadi_bound_consistency()
|
/dports/x11-toolkits/py-fltk/pyFltk-1.3.4.1/contrib/ |
H A D | ListSelect.cpp | 222 int ubx = (int)((w-(abw*2+tbw+abs+atbs))/2); //up button x in resize() local 226 upButton.resize( ubx, by, abw, buh); in resize() 227 downButton.resize( ubx+abw+abs, by, abw, buh ); in resize() 228 toggleButton.resize( ubx+abw+abs+abw+atbs, by, tbw, buh); in resize()
|
/dports/math/py-or-tools/or-tools-9.2/examples/contrib/ |
H A D | divisible_by_9_through_1.py | 76 ubx = x.Max() 77 ubx_neg = -ubx 80 max_x = max(ubx, lbx_neg)
|
H A D | divisible_by_9_through_1.cs | 38 long ubx = x.Max(); in MyMod() 39 long ubx_neg = -ubx; in MyMod() 42 int max_x = (int)Math.Max(ubx, lbx_neg); in MyMod()
|
H A D | DivisibleBy9Through1.java | 34 long ubx = x.max(); in my_mod() local 35 long ubx_neg = -ubx; in my_mod() 38 int max_x = (int) Math.max(ubx, lbx_neg); in my_mod()
|
/dports/math/casadi/casadi-3.5.5/casadi/solvers/ |
H A D | implicit_to_nlp.cpp | 133 m->ubx = w; w += n_; in set_work() 155 fill_n(m->ubx, n_, std::numeric_limits<double>::infinity()); in solve() 156 m->arg[NLPSOL_UBX] = m->ubx; in solve() 159 if (u_c_[k] < 0) m->ubx[k] = 0; in solve()
|
/dports/math/casadi/casadi-3.5.5/casadi/interfaces/ampl/ |
H A D | ampl_interface.cpp | 320 double ubx = d_nlp->ubz[i]; in solve() local 322 if (isinf(ubx)) { // no constraint in solve() 325 nl << "1 " << ubx << "\n"; in solve() 328 if (isinf(ubx)) { // only lower in solve() 330 } else if (ubx==lbx) { // equality in solve() 333 nl << "0 " << lbx << " " << ubx << "\n"; in solve()
|