The number of solutions of a binary integer programming problem

247 Views Asked by At

A 0-1 linear programming problem with three variables can have at most $3! = 6$ acceptable solutions? Is this right or wrong?

1

There are 1 best solutions below

2
On BEST ANSWER

At most 8 solutions. Two values per variable. By rule of independence, we multiply $2^{3} = 8$.