Reputation: 59
I have wrote a code for solving Integer Programming model in CPLEX oplide as follows:
nmbl = 521466;
nbi = 17;
int As[nbi] =...;
int amb[nmbl] = ...;
dvar boolean I[nmbl][nbi];
minimize
sum (a in nmbl, b in nbi, c in nmbl: c>a,d in nbi: d != b) I[a][b]*I[c][d]*10;
subject to
{
cons1:
forall (i in nmbl)
I[i][1] + I[i][2] + I[i][3] + I[i][4]+ I[i][5] + I[i][6] + I[i][7] + I[i][8] + I[i][9] + I[i][10] + I[i][11] + I[i][12] + I[i][13] + I[i][14] + I[i][15] + I[i][16] + I[i][17] == 1;
cons2:
forall (j in nbi)
sum (i in nmbl) I[i][j]*amb[i] <= As[j];
}
It shows an CPLEX Error 1016: Promotional version. Problem size limits exceeded. I will be thankful to you for providing me idea to locate the problem.
Upvotes: 1
Views: 7407
Reputation: 1
nmbl = 521466;
nbi = 17;
int As[1..nbi] =...;
int amb[1..nmbl] = ...;
dvar boolean I[1..nmbl][1..nbi];
minimize
sum (a in 1..nmbl, b in 1..nbi, c in 1..nmbl: c>a,d in nbi: d != b) I[a][b]*I[c][d]*10;
subject to
{
cons1:
forall (i in 1..nmbl)
I[i][1] + I[i][2] + I[i][3] + I[i][4]+ I[i][5] + I[i][6] + I[i][7] + I[i][8] + I[i][9] + I[i][10] + I[i][11] + I[i][12] + I[i][13] + I[i][14] + I[i][15] + I[i][16] + I[i][17] == 1;
cons2:
forall (j in 1..nbi)
sum (i in 1..nmbl) I[i][j]*amb[i] <= As[j];
}
Upvotes: 0
Reputation: 1
The current problem is too large for your version of CPLEX Free. Reduce the size of the problem. And you can to download this version : https://www.ibm.com/developerworks/community/blogs/jfp/entry/CPLEX_Is_Free_For_Students?lang=en
Upvotes: 0