minimum of all iterations

A=[1  0  0  1  0  1  1
0  1  1  1  0  0  1
1  0  0  1  1  0  0
1  0  0  0  1  0  1
1  1  0  0  0  1  0
0  1  0  0  0  1  1];
demand=[600;550;620;500;590;600]
for k=1:100
    B=randi([0,1],7,3)
    C=A*B
    C(C>=1)=1
    D=sum(C,2)
    D1=sum(bsxfun(@times,D,demand))
 end

I want to get the minimum value of D1 from all iterations

Answer 1

[David Barry]

A=[1  0  0  1  0  1  1
    0  1  1  1  0  0  1
    1  0  0  1  1  0  0
    1  0  0  0  1  0  1
    1  1  0  0  0  1  0
    0  1  0  0  0  1  1];
demand=[600;550;620;500;590;600];
numIterations = 100;
D1 = zeros(numIterations, 1);
for k=1:numIterations
    B=randi([0,1],7,3);
    C=A*B;
    C(C>=1)=1;
    D=sum(C,2);
    D1(k)=sum(bsxfun(@times,D,demand));
end
minVal = min(D1);

Answer 2

[Walter Roberson]

      D1(k)=sum(bsxfun(@times,D,demand));

and after the loop, min(D1)