CDC2016/isContained.m at master · worc4021/CDC2016 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
function retVal = isContained(A1,b1,A2,b2)
% isContained(A1,b1,A2,b2)
% Checks whether A1*x<=b1 is contained in A2*x<=b2.
%
% if and(~isempty(A1),~isempty(A2))
%     V = vertexEnumeration(A1,b1);
%     retVal = 1;
%     for i = 1:size(V,1)
%         retVal = and(retVal,CheckLinCons(V(i,:)',A2,b2));
%     end
% else
%     retVal = 0;
% end

if and(~isempty(A1),~isempty(A2))

    m = length(b2);

    Aeq = sparse(kron(eye(m),A1'));
    beq = reshape(A2',numel(A2),1);
    Aineq = sparse(kron(eye(m),b1'));
    bineq = b2;

% ------------  Gurobi ----------
    model = struct('obj',zeros(size(Aeq,2),1),...
                    'A',[Aeq;Aineq],...
                    'rhs',[beq;bineq],...
                    'sense',[char(ones(size(beq))*'=');char(ones(size(bineq))*'<')],...
                    'lb',zeros(size(Aeq,2),1));
	param = struct('OutputFlag',0);

    res = gurobi(model,param);
    if (strcmp(res.status,'ITERATION_LIMIT'))
            0;
    end

    retVal = ~or(strcmp(res.status,'INFEASIBLE'),strcmp(res.status,'ITERATION_LIMIT'));

% ----------- Own Simplex Phase One --------
%     retVal = phaseI(Aineq,bineq,Aeq,beq);
else
    retVal = 0;
end