-
Notifications
You must be signed in to change notification settings - Fork 54
Open
Labels
Description
With the following minibex file
Variables
y1,y2,y3 in [0,1];
Minimize y1+y2+y3;
Constraints
y1<=1;y2<=1;y3<=1;
end
the output is meaning less:
possibly unbounded objective (f*=-oo)
f* in [-inf,-1.79769313486e+308]
(best bound)
x* = (-1.79769313486e+308 ; -3262036970 ; 0)
(best feasible point)
relative precision on f*: nan
absolute precision on f*: inf
cpu time used: 0.0708890000001s
number of cells: 2266
If we add constraints in addition to lower bounds
Constraints
y1>=0;y2>=0;y3>=0;
y1<=1;y2<=1;y3<=1;
end
then the out put is correct
optimization successful!
f* in [0,1.48219693753e-323]
(best bound)
x* = (4.94065645842e-324 ; 4.94065645842e-324 ; 4.94065645842e-324)
(best feasible point)
relative precision on f*: inf
absolute precision on f*: 1.48219693753e-323 [passed]
cpu time used: 0.775439000001s
number of cells: 6472
However, I expected this linear problem is solved in one iteration, while 6472 cells are generated.
Reactions are currently unavailable