New answers tagged

2 votes

Need help with integer programming exercise

As the problem only contains four variables let's define $f$ as the feasible solution space of the problem. Then $f$ contains $12$ feasible solutions: $\{(1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1), (1,...
A.Omidi's user avatar
  • 8,450
1 vote

Need help with integer programming exercise

Given the system you presented $X = \{ x \in \{0, 1\}^4 : 97 x_1 + 32 x_2 + 25 x_3 + 20 x_4 \leqslant 139 \}$ (1) We have that, if $x_1 = 1$, then $x_2 + x_3 + x_4 \leqslant 1$, since any solution ...
Matheus Diógenes Andrade's user avatar
2 votes

What is the best way to constrain a binary matrix so that at most one row has positive values?

Adding to the solution provided by @EhsanK. By introducing a binary variable $z$, which is 1 only if all $x_{i,j}$ are equal to 0, and adding a constraint, potential symmetries in the branch-and-bound ...
gmn's user avatar
  • 622
4 votes

What is the best way to constrain a binary matrix so that at most one row has positive values?

Introduce a binary variable $y_{i}$ and then define these constraints: $x_{i,j} \le y_{i} \quad \forall i, j \tag{1}$ $\sum_{i} y_i \le 1 \tag{2}$ So, at most one of the $y_i$ can be 1 and in that ...
EhsanK's user avatar
  • 5,864

Top 50 recent answers are included