Home
last modified time | relevance | path

Searched refs:rowUp (Results 1 – 24 of 24) sorted by relevance

/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Algorithms/QuadCuts/
H A DBonOuterApprox.cpp60 vector<double> rowUp(m); in extractLinearRelaxation() local
64 model->get_bounds_info(n, &colLow[0], &colUp[0], m, &rowLow[0], &rowUp[0]); in extractLinearRelaxation()
76 if(rowUp[i] < nlp_infty){ in extractLinearRelaxation()
77 rowUp[i] = (rowUp[i] - g[i]); in extractLinearRelaxation()
78 if(1 || const_types[i] != Ipopt::TNLP::LINEAR) rowUp[i] += 1e-07; in extractLinearRelaxation()
87 rowLow[iRow[i]], rowUp[iRow[i]], in extractLinearRelaxation()
90 rowUp[iRow[i]], tiny_, veryTiny_)) { in extractLinearRelaxation()
92 rowUp[iRow[i]] += vals[i] *x[jCol[i]]; in extractLinearRelaxation()
100 si->loadProblem(mat, &colLow[0], &colUp[0], &obj[0], &rowLow[0], &rowUp[0]); in extractLinearRelaxation()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/test/
H A DInterfaceTest.cpp85 const double * rowUp = si.getRowUpper(); in testGetMethods() local
86 DblEqAssert(rowUp[0], 1./4.); in testGetMethods()
87 DblEqAssert(rowUp[1], 0.); in testGetMethods()
88 DblEqAssert(rowUp[2], 2.); in testGetMethods()
223 const double * rowUp = lp.getRowUpper(); in testOa() local
225 if(!eq(rowUp[0], 1./2. + 3./(2 * sqrt5))){ in testOa()
226 double error = fabs(rowUp[0] - 1./2. - 3./(2 * sqrt5)); in testOa()
230 DblEqAssert(rowUp[1], 0. + rhs_relax); in testOa()
231 DblEqAssert(rowUp[2], 2. * (1 + rhs_relax)); in testOa()
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/experimental/Separable/
H A DSepaTMINLP2OsiLP.cpp44 Bonmin::vector<double> rowUp(m); in extract() local
64 rowUp[i] = (rowUpper[i] - g[i]) + 1e-07; in extract()
66 rowUp[i] = infty; in extract()
75 rowUp[i] = (rowUpper[i]); in extract()
78 rowUp[i] = infty; in extract()
93 rowUp[iRow_[i]], tiny_, very_tiny_)) { in extract()
96 if(rowUp[iRow_[i]] < infty) in extract()
97 rowUp[iRow_[i]] += value_[i] *x[jCol_[i]]; in extract()
109 assert(act[j] + 1e-5 > rowLow[j] && act[j] - 1e-5 < rowUp[j] + g[j]); in extract()
118 si->loadProblem(mat, colLower, colUpper, obj(), rowLow(), rowUp()); in extract()
H A DBonHeuristicInnerApproximation.cpp352 vector<double> rowUp(m - numNonLinear); in extractInnerApproximation() local
363 rowUp[ind] = (rowUpper[i]); in extractInnerApproximation()
365 rowUp[ind] = infty; in extractInnerApproximation()
383 obj(), rowLow(), rowUp()); in extractInnerApproximation()
H A DSepaHeuristicInnerApproximation.cpp373 Bonmin::vector<double> rowUp(m - numNonLinear); in extractInnerApproximation() local
384 rowUp[ind] = (rowUpper[i]); in extractInnerApproximation()
386 rowUp[ind] = infty; in extractInnerApproximation()
404 obj(), rowLow(), rowUp()); in extractInnerApproximation()
/dports/databases/kexi/kexi-3.2.0/src/formeditor/
H A Deditlistviewdialog.cpp76 QToolButton *rowUp = new QToolButton(m_contentsPageItem->widget());
77 rowUp->setIconSet(koIcon("arrow-up"));
78 rowUp->setTextLabel(xi18n("Move Item &Up"), true);
79 vlayout->addWidget(rowUp);
80 m_buttons.insert(BRowUp, rowUp);
81 connect(rowUp, SIGNAL(clicked()), this, SLOT(MoveRowUp()));
/dports/math/ogdf/OGDF/src/coin/CoinUtils/
H A DCoinStructuredModel.cpp1193 delete [] rowUp ; in decompose()
1217 rowUp[numberRow2]=rowUpper[iRow]; in decompose()
1236 rowLo,rowUp,NULL,NULL,NULL); in decompose()
1265 rowUp[numberRow2]=rowUpper[iRow]; in decompose()
1286 rowLo,rowUp, in decompose()
1296 delete [] rowUp ; in decompose()
1673 delete [] rowUp ; in decompose()
1705 rowUp[numberRow2]=rowUpper[iRow]; in decompose()
1754 rowUp[numberRow2]=rowUpper[iRow]; in decompose()
1766 rowLo,rowUp, in decompose()
[all …]
/dports/math/osi/Osi-0.108.6/CoinUtils/src/
H A DCoinStructuredModel.cpp1158 double *rowUp = new double[numberRows]; in decompose() local
1211 delete[] rowUp; in decompose()
1254 rowLo, rowUp, NULL, NULL, NULL); in decompose()
1283 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1304 rowLo, rowUp, in decompose()
1314 delete[] rowUp; in decompose()
1685 double *rowUp = new double[numberRows]; in decompose() local
1740 delete[] rowUp; in decompose()
1823 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1835 rowLo, rowUp, in decompose()
[all …]
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/src/
H A DCoinStructuredModel.cpp1158 double *rowUp = new double[numberRows]; in decompose() local
1211 delete[] rowUp; in decompose()
1254 rowLo, rowUp, NULL, NULL, NULL); in decompose()
1283 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1304 rowLo, rowUp, in decompose()
1314 delete[] rowUp; in decompose()
1685 double *rowUp = new double[numberRows]; in decompose() local
1740 delete[] rowUp; in decompose()
1823 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1835 rowLo, rowUp, in decompose()
[all …]
/dports/math/clp/Clp-1.17.3/CoinUtils/src/
H A DCoinStructuredModel.cpp1158 double *rowUp = new double[numberRows]; in decompose() local
1211 delete[] rowUp; in decompose()
1254 rowLo, rowUp, NULL, NULL, NULL); in decompose()
1283 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1304 rowLo, rowUp, in decompose()
1314 delete[] rowUp; in decompose()
1685 double *rowUp = new double[numberRows]; in decompose() local
1740 delete[] rowUp; in decompose()
1823 rowUp[numberRow2] = rowUpper[iRow]; in decompose()
1835 rowLo, rowUp, in decompose()
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/arith/
H A Dlinear_equality.cpp550 void LinearEqualityModule::propagateRow(ConstraintCPVec& into, RowIndex ridx, bool rowUp, Constrain… in propagateRow() argument
562 << ridx << ", " << rowUp << ", " << v << ") start" << endl; in propagateRow()
564 const Rational& multiple = rowUp ? d_one : d_negOne; in propagateRow()
575 bool selectUb = rowUp ? (sgn > 0) : (sgn < 0); in propagateRow()
578 ( rowUp && a_ij.sgn() > 0 && c->isLowerBound()) || in propagateRow()
579 ( rowUp && a_ij.sgn() < 0 && c->isUpperBound()) || in propagateRow()
580 (!rowUp && a_ij.sgn() > 0 && c->isUpperBound()) || in propagateRow()
581 (!rowUp && a_ij.sgn() < 0 && c->isLowerBound()) in propagateRow()
587 << rowUp << " " in propagateRow()
623 << ridx << ", " << rowUp << ", " << v << ") done" << endl; in propagateRow()
H A Dtheory_arith_private.h581 bool attemptSingleton(RowIndex ridx, bool rowUp);
583 bool attemptFull(RowIndex ridx, bool rowUp);
584 bool tryToPropagate(RowIndex ridx, bool rowUp, ArithVar v, bool vUp, const DeltaRational& bound);
585 bool rowImplicationCanBeApplied(RowIndex ridx, bool rowUp, ConstraintP bestImplied);
H A Dtheory_arith_private.cpp4711 ep = d_linEq.rowLacksBound(ridx, rowUp, ARITHVAR_SENTINEL); in attemptSingleton()
4726 bool vUp = (rowUp == ( coeff.sgn() < 0)); in attemptSingleton()
4732 DeltaRational dr = d_linEq.computeRowBound(ridx, rowUp, v); in attemptSingleton()
4734 return tryToPropagate(ridx, rowUp, v, vUp, bound); in attemptSingleton()
4739 bool TheoryArithPrivate::attemptFull(RowIndex ridx, bool rowUp){ in attemptFull() argument
4748 bool vUp = (rowUp == (c.sgn() < 0)); in attemptFull()
4756 d_linEq.computeRowBound(ridx, rowUp, ARITHVAR_SENTINEL); in attemptFull()
4765 bool activeUp = (rowUp == (c.sgn() > 0)); in attemptFull()
4766 bool vUb = (rowUp == (c.sgn() < 0)); in attemptFull()
4791 return rowImplicationCanBeApplied(ridx, rowUp, implied); in tryToPropagate()
[all …]
H A Dlinear_equality.h434 , bool rowUp
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/interfaces/
H A DCouenneMINLPInterface.cpp2162 double * rowUp = NULL;
2184 rowUp = new double[m];
2215 rowUp[i] = (rowUpper[i] - g[i]) + 1e-07;
2217 rowUp[i] = infty;
2225 rowUp[i] = infty;
2237 rowUp[i] = (rowUpper[i] - g[i]);
2240 rowUp[i] = infty;
2255 rowUp[jRow_[i]], tiny_, veryTiny_)) {
2257 rowUp[jRow_[i]] += jValues_[i] *x[jCol_[i]];
2263 rowUp[jRow_[i]] += value;
[all …]
/dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/Interfaces/
H A DBonOsiTMINLPInterface.cpp2406 vector<double> rowUp(m); in extractLinearRelaxation() local
2437 rowUp[i] = (rowUpper[i] - g[i]) + 1e-07; in extractLinearRelaxation()
2439 rowUp[i] = infty; in extractLinearRelaxation()
2447 rowUp[i] = infty; in extractLinearRelaxation()
2457 rowUp[i] = (rowUpper[i]); in extractLinearRelaxation()
2460 rowUp[i] = infty; in extractLinearRelaxation()
2475 rowUp[jRow_[i]], tiny_, veryTiny_, infty_)) { in extractLinearRelaxation()
2478 if(rowUp[jRow_[i]] < infty) in extractLinearRelaxation()
2479 rowUp[jRow_[i]] += jValues_[i] *x[jCol_[i]]; in extractLinearRelaxation()
2508 if(rowUp[i] < infty) rowUp[i] += rhsRelax_*std::max(fabs(rowUp[i]), 1.); in extractLinearRelaxation()
[all …]
/dports/audio/fasttracker2/ft2-clone-1.49/src/
H A Dft2_pattern_ed.h92 void rowUp(uint16_t amount);
H A Dft2_pattern_ed.c983 void rowUp(uint16_t amount) in rowUp() function
/dports/editors/libreoffice/libreoffice-7.2.6.2/wizards/com/sun/star/wizards/agenda/
H A DAgendaWizardDialogImpl.py282 def rowUp(self): member in AgendaWizardDialogImpl
283 self.topicsControl.rowUp()
H A DTopicsControl.py491 def rowUp(self, guiRow=None, control=None): member in TopicsControl
837 self.topicsControl.rowUp(self.offset, event.Source)
/dports/editors/libreoffice6/libreoffice-6.4.7.2/wizards/com/sun/star/wizards/agenda/
H A DAgendaWizardDialogImpl.py282 def rowUp(self): member in AgendaWizardDialogImpl
283 self.topicsControl.rowUp()
H A DTopicsControl.py491 def rowUp(self, guiRow=None, control=None): member in TopicsControl
837 self.topicsControl.rowUp(self.offset, event.Source)
/dports/graphics/yacreader/yacreader-9.8.2/YACReaderLibrary/
H A Dimages.qrc11 <file>../images/comic_vine/rowUp.png</file>
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglProbing/
H A DCglProbing.cpp3659 double rowUp = rowUpper[irow]; in probe() local
3663 if (rowUp<1.0e10) { in probe()
3666 rowUp2 = rowUp-minR[irow]; in probe()
3823 rowUp2 = rowUp-minR[irow]; in probe()
3892 rowUp2 = rowUp-minR[irow]; in probe()
4008 rowUp2 = rowUp-minR[irow]; in probe()
4124 rowUp2 = rowUp-minR[irow]; in probe()
4269 rowUp2 = rowUp-minR[irow]; in probe()
4340 rowUp2 = rowUp-minR[irow]; in probe()
4456 rowUp2 = rowUp-minR[irow]; in probe()
[all …]