Consider the following node of a branch-and-bound tree for a minimization problem in which a and b are binary...

Transcribed Image Text:

Consider the following node of a branch-and-bound tree for a minimization problem in which a and b are binary variables, c and d are integer variables, and e and fare continuous variables. a = 5 d = 3.7 b=1e=12 c=2.4f=3.5 Value = 25.2 a) Suppose your current best integer solution (found elsewhere in the tree) has value of 34. List all of the possible choices of what you chould do next. b) Suppose your current best integer solution (found elsewhere in the tree) has value of 22. List all of the possible choices of what you could do next. c) Suppose your current best integer solution (found elsewhere in the tree) has value of 26. List all of the possible choices of what you could do next.

Answer rating: 100% (QA)

a Given the current best integer solution with a value of 34 the possible choices for what to do nex View the full answer