New answers tagged knapsack
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,...
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 ...
Top 50 recent answers are included
Related Tags
knapsack × 50optimization × 15
combinatorial-optimization × 10
linear-programming × 8
integer-programming × 7
mixed-integer-programming × 6
python × 6
modeling × 5
dynamic-programming × 5
linearization × 4
reference-request × 2
nonlinear-programming × 2
pyomo × 2
or-tools × 2
binary-variable × 2
algorithms × 2
computational-complexity × 2
heuristics × 2
assignment-problem × 2
bounds × 2
cutting-planes × 2
valid-inequalities × 2
solver × 1
scheduling × 1
constraint-programming × 1