[37] | 1 | %test for mpmiqp with media workload |
---|
| 2 | %4 proc,12 tasks,25 subtasks,n=4,m=12,nu=12,nx=4 |
---|
| 3 | %allocation matrix,n*m |
---|
| 4 | |
---|
| 5 | %matrix initialization |
---|
| 6 | |
---|
| 7 | n=3; |
---|
| 8 | m=6; |
---|
| 9 | allo_m = [0.1167 0 0.1625 0.05833 0 0.2 0 0.09 0.09 0 0 0; |
---|
| 10 | 0.1833 0.09 0 0.0417 0.075 0.1375 0 0.15 0 0.075 0 0; |
---|
| 11 | 0.1833 0 0.1125 0 0.065 0 0.175 0 0 0 0.1125 0; |
---|
| 12 | 0.15 0.11 0 0.075 0.115 0 0.1083 0 0 0 0 0.0692]; |
---|
| 13 | allo_m = allo_m(1:n,1:m); |
---|
| 14 | tp=pascal(n); |
---|
| 15 | |
---|
| 16 | z = sdpvar(m,1); |
---|
| 17 | x = sdpvar(n,1); |
---|
| 18 | |
---|
| 19 | obj = (allo_m*z - x)'*(allo_m*z - x) |
---|
| 20 | |
---|
| 21 | F = set(binary(z)) + set(allo_m*z <= x) + set(x <= 2*tp(:,1)); |
---|
| 22 | |
---|
| 23 | solvemp(F,obj,[],x) |
---|
| 24 | |
---|
| 25 | |
---|
| 26 | n=4; |
---|
| 27 | m=12; |
---|
| 28 | allo_m = [0.1167 0 0.1625 0.05833 0 0.2 0 0.09 0.09 0 0 0; |
---|
| 29 | 0.1833 0.09 0 0.0417 0.075 0.1375 0 0.15 0 0.075 0 0; |
---|
| 30 | 0.1833 0 0.1125 0 0.065 0 0.175 0 0 0 0.1125 0; |
---|
| 31 | 0.15 0.11 0 0.075 0.115 0 0.1083 0 0 0 0 0.0692]; |
---|
| 32 | %F=-2*allo_m |
---|
| 33 | Matrices.F = -2*allo_m; |
---|
| 34 | %Y=I,n*n |
---|
| 35 | Matrices.Y = eye(n); |
---|
| 36 | %G=allo_m |
---|
| 37 | Matrices.G = allo_m; |
---|
| 38 | %H=2*allo_m'*allo_m |
---|
| 39 | Matrices.H = 2*(Matrices.G)'*Matrices.G; |
---|
| 40 | %W=0,n*1 |
---|
| 41 | Matrices.W = 0*eye(n,1); |
---|
| 42 | %E=I,n*n |
---|
| 43 | Matrices.E = eye(n); |
---|
| 44 | %Cf=Q2,assume zero here,1*m |
---|
| 45 | Matrices.Cf = 0*eye(1,m); |
---|
| 46 | %Cx=0,1*n |
---|
| 47 | Matrices.Cx = 0*eye(1,n); |
---|
| 48 | %Cc=0,1*1 |
---|
| 49 | Matrices.Cc = [0]; |
---|
| 50 | %bndA=I,n*n |
---|
| 51 | Matrices.bndA = eye(n); |
---|
| 52 | %bndb=2*[1;1;1...] |
---|
| 53 | tp=pascal(n); |
---|
| 54 | Matrices.bndb = 2*tp(:,1); |
---|
| 55 | |
---|
| 56 | for i=1:m, |
---|
| 57 | Matrices.vartype(i)='B'; |
---|
| 58 | end |
---|
| 59 | |
---|
| 60 | %call solver |
---|
| 61 | Options.verbose = 1; |
---|
| 62 | sol = mpt_mpmiqp(Matrices,Options); |
---|
| 63 | |
---|
| 64 | %test |
---|
| 65 | Pn=sol.Pn; |
---|
| 66 | D0=[0.8;0.6;0.7;0.8]; |
---|
| 67 | reg=0; |
---|
| 68 | mincost=inf; |
---|
| 69 | count=0; |
---|
| 70 | for i=1:length(Pn), |
---|
| 71 | [H{i},K{i}]=double(Pn(i)); |
---|
| 72 | if H{i}*D0-K{i}<0 |
---|
| 73 | count=count+1; |
---|
| 74 | cost=D0'*sol.Ai{i}*D0 + sol.Bi{i}*D0 + sol.Ci{i}; |
---|
| 75 | if cost<mincost |
---|
| 76 | mincost = cost; |
---|
| 77 | reg = i; |
---|
| 78 | end |
---|
| 79 | end |
---|
| 80 | end |
---|
| 81 | u = sol.Fi{reg}*D0+sol.Gi{reg}; |
---|
| 82 | |
---|