I have a general question: In the branch and bound method for solving integer programming problems, you can have more than one optimal solution right?

E.g I had as possible optimal solutions: $\displaystyle (x_{1}, x_{2}) = (5,1) $ where $\displaystyle z = 6 $ and $\displaystyle (x_{1}, x_{2}) = (6,1) $ where $\displaystyle z = 6 $. These are both leaf nodes. This is for a maximization problem.