1
我有以下MILP問題,相關的代碼部分:GLPK MathProg - 條件約束
param n, integer, >= 0;
set jobs := 1..n;
param P{i in jobs, j in jobs}, binary;
var s{i in jobs}, integer, >=0;
var e{i in jobs}, integer, >=0;
var Cmax, integer, >=0;
minimize total: Cmax;
s.t. crit_3{i in jobs,j in jobs}: s[i] >= e[j];
我想要的標準crit_3代表公式如下:
基本上,我當矩陣P [i,j] = 1時,希望約束僅對i和j的給定組合激活。我如何實現這一點?