void TestCtcExist::test01() {
Variable x,y;
Function f(x,y,1.5*sqr(x)+1.5*sqr(y)-x*y-0.2);
double prec=1e-05;
NumConstraint c(f,LEQ);
CtcExist exist_y(c,y,IntervalVector(1,Interval(-10,10)),prec);
CtcExist exist_x(c,x,IntervalVector(1,Interval(-10,10)),prec);
IntervalVector box(1,Interval(-10,10));
RoundRobin rr(1e-03);
CellStack stack;
vector<IntervalVector> sols;
double right_bound=+0.3872983346072957;
Solver sx(exist_y,rr,stack);
sx.start(box);
sx.next(sols);
// note: we use the fact that the solver always explores the right
// branch first
TEST_ASSERT(sols.back()[0].contains(right_bound));
sols.clear();
Solver sy(exist_x,rr,stack);
sy.start(box);
sy.next(sols);
// note: we use the fact that the constraint is symmetric in x/y
TEST_ASSERT(sols.back()[0].contains(right_bound));
}
void TestCtcExist::test01() {
Variable x,y;
Function f(x,y,1.5*sqr(x)+1.5*sqr(y)-x*y-0.2);
double prec=1e-05;
NumConstraint c(f,LEQ);
CtcExist exist_y(c,y,IntervalVector(1,Interval(-10,10)),prec);
CtcExist exist_x(c,x,IntervalVector(1,Interval(-10,10)),prec);
IntervalVector box(1,Interval(-10,10));
double right_bound=+0.3872983346072957;
stack<IntervalVector> stack;
stack.push(box);
IntervalVector sol=box;
while (!stack.empty() && sol.max_diam()>1e-03) {
sol=stack.top();
stack.pop();
exist_y.contract(sol);
if (!sol.is_empty()) {
pair<IntervalVector,IntervalVector> p=sol.bisect(0);
stack.push(p.first);
stack.push(p.second);
}
}
// note: we use the fact that the solver always explores the right
// branch first
CPPUNIT_ASSERT(sol[0].contains(right_bound));
while (!stack.empty()) stack.pop();
stack.push(box);
sol=box;
while (!stack.empty() && sol.max_diam()>1e-03) {
sol=stack.top();
stack.pop();
exist_x.contract(sol);
if (!sol.is_empty()) {
pair<IntervalVector,IntervalVector> p=sol.bisect(0);
stack.push(p.first);
stack.push(p.second);
}
}
// note: we use the fact that the constraint is symmetric in x/y
CPPUNIT_ASSERT(sol[0].contains(right_bound));
}
