Yes. You were right. I installed older version of yalmip in my Unix account.
I installed new version of yalmip and checked CPLEX 12.5.1 is linked.
But, I found a weird thing.
I tested my MIP problem with small number of variables. It is solved in my PC with Cplex 12.5.
But matlab in server simply gives NaN solutions.
I found the same thing occurs in the other problem in yalmip website.
I run this both in my PC and server.
x = sdpvar(5,1);
A = ones(15,5);
b = ones(15,1);
obj = sum(x) + sum((x-3).^4); % 4th order objective
ops = sdpsettings('solver','bnb','bnb.solver','fmincon');
solvesdp([A*x <= b, integer(x)],obj,ops)
My PC gives
* Starting YALMIP integer branch & bound.
* Lower solver : fmincon-standard
* Upper solver : rounder
* Max iterations : 300
Warning : The continuous relaxation may be nonconvex. This means
that the branching process is not guaranteed to find a
globally optimal solution, since the lower bound can be
invalid. Hence, do not trust the bound or the gap...
Node Upper Gap(%) Lower Open
1 : 4.050E+02 13.55 3.083E+02 2 Successfully solved
2 : 4.050E+02 13.55 3.083E+02 3 Successfully solved
3 : 3.410E+02 4.64 3.108E+02 2 Successfully solved
4 : 3.410E+02 4.64 3.108E+02 3 Successfully solved
5 : 3.410E+02 4.01 3.147E+02 2 Successfully solved
6 : 3.410E+02 4.01 3.147E+02 3 Successfully solved
7 : 3.410E+02 2.85 3.221E+02 2 Successfully solved
8 : 3.410E+02 2.85 3.221E+02 1 Successfully solved
9 : 3.410E+02 2.85 3.221E+02 0 Successfully solved
+ 9 Finishing. Cost: 341
ans =
yalmiptime: 0.0440
solvertime: 0.2700
info: 'Successfully solved (BNB)'
problem: 0
>> double(x)
ans =
0
0
0
1
0
But server gives
IBM ILOG CPLEX Optimization Studio Preview Edition good for 86 more days.
* Starting YALMIP integer branch & bound.
* Lower solver : fmincon-standard
* Upper solver : rounder
* Max iterations : 300
Warning : The continuous relaxation may be nonconvex. This means
that the branching process is not guaranteed to find a
globally optimal solution, since the lower bound can be
invalid. Hence, do not trust the bound or the gap...
Node Upper Gap(%) Lower Open
ans =
yalmiptime: NaN
solvertime: NaN
info: [1x135 char]
problem: 9
>> double(x)
ans =
NaN
NaN
NaN
NaN
NaN
Do you have any idea why this happens?
Thanks.
-JS