/* Find a lower bound of the boolean program:
 *   min  sum(x)
 *   sjt  Ax+b >= 0
 *        x = {-1,1}
 * 
 * This sdpsol source file solves the LP relaxation of the boolean program:
 *   min  sum(x)
 *   sjt  Ax+b >= 0
 *        -1 <= x <= 1
 */

include("boolean.mat");  /* load A,b */
k=cols(A);               /* get the column size of A */
variable x(k,1);

A*x+b .> 0;
    x .< 1;
    x .> -1;

minimize obj = sum(x);
