Introduction to Management Science, 11e (Taylor)

Module C: Integer Programming: The Branch and Bound Method

1) The branch and bound method is a solution approach that partitions the feasible solution space into
smaller subsets of solutions.
Answer: TRUE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: branch and bound method

2) The branch and bound method is a solution approach that partitions the infeasible solution space into
smaller subsets of solutions.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

3) The branch and bound method is a solution technique specifically limited to integer programming
problems.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

4) When the branch and bound approach is applied to an integer programming problem, it is used in
conjunction with the normal non-integer solution approach.
Answer: TRUE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method, integer programming problem

5) A linear programming model solution with no integer restrictions is called a relaxed solution.
Answer: TRUE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: relaxed solution

6) A linear programming model solution with integer restrictions is called a relaxed solution.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: relaxed solution

7) The branch and bound method of solving linear integer programming problems is an enumeration
method.
Answer: TRUE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method
1
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
8) The branch and bound solution method cannot be applied to 0-1 integer programming problems.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound solution method, 0-1 integer programming probs

9) Rounding non-integer solution values up to the nearest integer value can result in an infeasible
solution.
Answer: TRUE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming, branch and bound method

10) A feasible solution is ensured by rounding down non-integer solution values.

Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming problems, integer feasible solution

11) A feasible solution is ensured by rounding down integer solution values.

Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming problems, integer feasible solution

12) A rounded-down integer solution can result in a less than optimal solution.
Answer: TRUE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming problems, integer feasible solution

13) An infeasible solution is ensured by rounding down non-integer solution values.

Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming problems, integer feasible solution

14) If an integer programming problem has no feasible solution, then its LP relaxation (relaxed solution)
must also have no feasible solution.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: relaxed solution

2
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
15) When using branch and bound for a maximization integer programming problem, the lower bound at
the initial node can always be determined by rounding down the LP relaxation solution values regardless
of the types of constraints in the problem.
Answer: FALSE
Diff: 3
Section Heading: Branch and Bound Method
Keywords: branch and bound method, lower bound

16) The number of nodes considered in a branch and bound tree for maximization integer programming
problems is always minimized by going to the node with the largest upper bound.
Answer: TRUE
Diff: 3
Section Heading: Branch and Bound Method
Keywords: branch and bound method

17) If an integer linear programming problem has no feasible solution, then its relaxed solution (LP
relaxation) must also have no feasible solution
Answer: FALSE
Diff: 3
Section Heading: Branch and Bound Method
Keywords: relaxed solution, branch and bound method

18) In solving a maximization problem, the optimal profit associated with the relaxed solution (LP-
relaxation) is always less than or equal to the value of the optimal profit associated with the integer
solution.
Answer: FALSE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: relaxed solution, branch and bound method

19) In using the branch and bound method, if a branch gives an infeasible solution to the associated
linear programming problem, then the particular branch is fathomed and is not considered any further.
Answer: TRUE
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

20) In implicit enumeration the feasible integer solutions closest to the optimal non-integer solution are
evaluated to see which is best.
Answer: FALSE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: implicit enumeration, integer programming

21) In implicit enumeration, all feasible solutions are evaluated to see which is best.
Answer: TRUE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: implicit enumeration, integer programming

3
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
22) Branch and bound cannot be used to solve mixed integer programs.
Answer: FALSE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: branch and bound, mixed integer programs

23) The branch and bound method uses a tree diagram of nodes and branches to organize the solution
partitioning.
Answer: TRUE
Diff: 1
Section Heading: Branch and Bound Method
Keywords: branch and bound

24) The ________ method is a solution approach that partitions the feasible solution space into smaller
subsets of solutions.
Answer: branch and bound
Diff: 2
Keywords: branch and bound method

25) The ________ integer solution will always be between the upper bound of the relaxed solution and a
lower bound of the rounded-down solution.
Answer: optimal
Diff: 2
Keywords: optimal integer solution, branch and bound method

26) A linear programming model solution with no integer restrictions is called a ________ solution.
Answer: relaxed
Diff: 2
Keywords: relaxed solution

27) In using the branch and bound method, we always branch from the node with the ________ upper
bound.
Answer: maximum
Diff: 1
Keywords: branching rule

28) An ________ solution is reached when a feasible integer solution is reached at a node that has an
upper bound equal to lower bound.
Answer: optimal integer
Diff: 2
Keywords: optimal integer solution

29) The branch and bound method can be used for ________ integer problems except only variables
with integer restrictions are rounded down to achieve an initial lower bound and only integer variables
are branched on.
Answer: mixed
Diff: 2
Keywords: mixed integer linear programming problems

4
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
30) The branch and bound method can be used for 0-1 integer programming problems by adding a
________ 1 constraint for each 0-1 variable.
Answer: less-than-or-equal-to
Diff: 2
Keywords: 0-1 integer programming, branch and bound method

31) We begin the branch and bound method by first solving the problem as a regular ________ model
without integer restrictions.
Answer: linear programming
Diff: 2
Keywords: relaxed solution, branch and bound method

32) The branch and bound method uses a tree diagram of ________ and ________ to organize the
solution partitioning.
Answer: branches, nodes
Diff: 1
Keywords: branch and bound

33) The ________ method evaluates all feasible and infeasible solutions to determine the optimal
solution.
Answer: complete enumeration
Diff: 2
Keywords: complete enumeration

34) The ________ method evaluates all feasible solutions to determine the optimal solution.
Answer: implicit enumeration
Diff: 2
Keywords: implicit enumeration

35) A ________ solution is not guaranteed by rounding down non-integer solution values.
Answer: feasible
Diff: 1
Keywords: integer feasible solution

5
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
36) The production manager for the Rusty soft drink company is considering the production of two
kinds of soft drinks: regular and diet. Two of her resources are constraint production time (8 hours = 480
minutes per day) and syrup (1 of the ingredients), limited to 675 gallons per day. To produce a regular
case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup.
Profits for regular soft drink are $3 per case and profits for diet soft drink are $2 per case. What are
optimal daily profits?
Answer: $420
Diff: 3
Section Heading: Branch and Bound Method
Keywords: branch and bound method

37) The production manager for Beer etc. produces two kinds of beer: light and dark. Two of his
resources are constrained: malt, of which he can get at most 4800 oz per week; and wheat, of which he
can get at most 3200 oz per week. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat,
while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle,
and profits for dark beer are $1 per bottle. What are the optimal weekly profits?
Answer: $800
Diff: 1
Section Heading: Branch and Bound Method
Keywords: branch and bound method

38) Consider a capital budgeting example with five projects from which to select. Let xi = 1 if project a
is selected, 0 if not, for i = 1, 2, 3, 4, 5. Write the appropriate constraint(s) for the following condition: If
project 3 is chosen, project 4 must be chosen.
Answer: x3 - x4 ≤ 0
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer programming formulation

39) Consider a capital budgeting example with five projects from which to select. Let xi = 1 if project a
is selected, 0 if not, for i = 1, 2, 3, 4, 5. Write the appropriate constraint(s) for the following condition: If
project 1 is chosen, project 5 must not be chosen.
Answer: x1 + x5 ≤ 1
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer programming formulation

6
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
40) The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has
four different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same and not all four
machines have to be used to produce all of the garden hoses.

This problem requires two different kinds of decision variables. Clearly define each kind.
Answer:
Xi = the number of hoses produced on machine a
Yi = 1 if machine i is used, 0 if not
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer programming formulation

41) The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has
four different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same and not all four
machines have to be used to produce all of the garden hoses.

Give the constraints for the problem.

Answer:
X1 ≤ 6000 y1
X2 ≤ 7500 y2
X3 ≤ 4000 y3
X4 ≤ 5000 y4

≥ 10,000
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer programming formulation, constraint formulation

7
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
42) The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has
four different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same and not all four
machines have to be used to produce all of the garden hoses.

Write a constraint to ensure that if machine 4 is used, machine 1 will not be used.
Answer: y1 + y4 ≤ 1
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming formulation, constraint formulation

43) Consider the following integer programming problem. Solve it using the branch and bound method.
What are the optimal values of x1, x2 and Z?

Maximize Z = 2x1 + x2
Subject to: 2x1 + 2x2 ≤ 7
4x1 + x2 ≤ 11
x1 and x2 ≥ 0
Answer: x1 = 2, x2 = 1, Z = 5
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

8
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
44) Solve the following integer linear program using implicit enumeration.

MAX Z = x2
subject to: - x1 + x2 ≤ 0.5
x1 + x2 ≤ 3.5
x2 , x2 ≥ 0 and integer
Answer:
- x1 + x1 ≤ 5 ? x1 + x1 ≤ 3.5 ? Z
0 0 0 0 0
1 0 -1 1 0
2 0 -1 2 0
3 0 -3 3 0
1 1 0 2 1
2 1 -1 3 1

Optimal: x1 = 2, and x2 = 1, and Z = 1

Diff: 2
Section Heading: Branch and Bound Method
Keywords: implicit enumeration, integer programming solution

45) Solve the following integer LP using branch and bound:

MAX Z = x1 + 5x2
subject to: x1 + 10x2 ≤ 20
x1 ≤ 2
x1 , x2 ≥ 0 and integer
Answer: x1 = 0, and x2 = 2, and Z = 10

Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method, integer programming solution
9
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
46) Solve the following integer linear program:

MAX x1 + x2
subject to: 4x1 + 6x2 ≤ 22
x1 + 5x2 ≤ 15
2x1 + x2 ≤ 9
x1 , x ≥ 0, integer
Answer: x1 = 4, x2 = 1, Z = 5
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming solution

47) Solve the following integer linear program:

MAX x1 + 2x2 + x3
subject to: 7x1 + 4x2 + 3x3 ≤ 28
x1 , x2 , x3 ≥ 0
x1 , x2 integer
Answer: x1 = 0, x2 = 2, x3 = 6.67, Z = 10.67
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming solution

48) The branch and bound method is a solution approach that partitions the ________ solution space
into smaller subsets of solutions.
A) infeasible
B) feasible
C) optimal
D) all of the above
Answer: B
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

49) In using rounding of a linear programming model to obtain an integer solution, the solution is
A) always optimal and feasible.
B) sometimes optimal and feasible.
C) always optimal.
D) always feasible.
Answer: B
Diff: 3
Section Heading: Branch and Bound Method
Keywords: branch and bound method, rounded solution

10
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
50) The branch and bound method of solving linear integer programming problems is
A) a nonlinear method.
B) a relaxation method.
C) a graphical solution.
D) an enumeration method.
Answer: D
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method, integer programming problem

51) Rounding large values of decision variables to the nearest integer value causes ________ problems
than rounding small values.
A) more
B) fewer
C) none of the above
Answer: B
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer programming solution

52) A linear programming model solution with no integer restrictions is called a(n) ________ solution.
A) optimal
B) feasible
C) relaxed
D) all of the above
Answer: C
Diff: 2
Section Heading: Branch and Bound Method
Keywords: relaxed solution

53) The branch and bound method uses a tree diagram of ________ to organize the solution partitioning.
A) branches
B) nodes
C) nodes and branches
D) none of the above
Answer: C
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound

54) The optimal integer solution will always be between the ________ bound of the relaxed solution and
a lower bound of the rounded-down integer solution.
A) lower
B) optimal
C) upper
D) all of the above
Answer: C
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method, upper bound
11
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
55) The Wiethoff Company has a contract to produce 10,000 garden hoses for a customer. Wiethoff has
four different machines that can produce this kind of hose. Because these machines are from different
manufacturers and use differing technologies, their specifications are not the same and not all four
machines have to be used to produce all of the garden hoses.

Write a constraint to ensure that if machine 4 is used, machine 1 will not be used.
A) y1 + y4 ≤ 0
B) y1 + y4 ≥ 1
C) y1 + y4 ≤ 1
D) y1 - y4 ≤ 1
E) y1 - y4 ≤ 0
Answer: C
Diff: 3
Section Heading: Branch and Bound Method
Keywords: integer programming formulation, constraint formulation

56) The optimal integer solution will always be between the upper bound of the ________ solution and a
lower bound of the rounded-down ________ solution.
A) relaxed, non-integer
B) integer, relaxed
C) relaxed, integer
D) none of the above
Answer: C
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming problem, branch and bound method

57) The upper bound at the initial node of a branch and bound tree is given by
A) the value of the objective function of the LP relaxation .
B) the value of the objective function after the LP relaxation solution is rounded down to an integer
solution.
C) the value of the objective function corresponding to an integer feasible solution determined on the
basis of trial and error.
D) cannot be determined
Answer: A
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

12
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
58) When using branch and bound to solve an integer programming problem, if the value of X1 = 2.5 at
a given node, then one of the descendant branches would have which one of the additional constraints?
A) X1 ≥ 2
B) X1 ≤ 3
C) X1 = 3
D) X1 ≤ 2
E) X1 = 2
Answer: D
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

59) Consider the following integer programming problem. Solve it using the branch and bound method.
What are the optimal values of x1, x2, and Z?

Maximize Z = 2x1 + x2
Subject to: 2x1 + 2x2 ≤ 7
4x1 + x2 ≤ 11
x1 and x2 ≥ 0
A) x1 = 1, x2 = 2, Z = 4
B) x1 = 2, x2 = 1, Z = 5
C) x1 = 1, x2 = 1, Z = 3
D) x1 = 0, x2 = 3, Z = 3
E) x1 = 2, x2 = 2, Z = 6
Answer: B
Diff: 2
Section Heading: Branch and Bound Method
Keywords: branch and bound method

60) Which of the following can be used to solve integer programs with 2 variables?
I. Graphical techniques
II. Complete enumeration
III. Relaxed LP solutions
IV. Branch and bound
A) I, II, III, and IV
B) I and III
C) I, II, and IV
D) I and IV
E) I, II and III
Answer: C
Diff: 1
Section Heading: Branch and Bound Method
Keywords: integer prog solution methods, graphic, enumeration, branch/bound

13
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
61) Solve the following integer linear program:

MAX Z = 2x1 + x2
subject to: 2 x1 + 2x2 ≤ 7
4 x1 + x2 ≤ 11
x1 and x2 ≥ 0

What are the optimal values of x1 and x2?

A) x1 = 1, x2 = 3
B) x1 = 4, x2 = 1
C) x1 = 0, x2 = 3
D) x1 = 3, x2 = 2
E) x1 = 2, x2 = 2
Answer: B
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming solution

62) Solve the following integer LP using branch and bound:

MAX x1 + 5x2
subject to: x1 + 10x2 ≤ 20
x1 ≤ 2
x1 , x2 ≥ 0 and integer
The optimal value of Z is:
A) 7
B) 6
C) 10
D) 11
E) 12
Answer: C
Diff: 3
Section Heading: Branch and Bound Method
Keywords: integer programming solution

14
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
63) Consider the following integer LP.

MAX x1 + 5x2
subject to: x1 + 10x2 ≤ 20
x1 ≤ 2
x1 , x2 ≥ 0 and integer

Solve for the value of x2 at the first node and identify the constraint below that correctly represents one
of the descendant branches.
A) x2 ≥ 1
B) x2 ≤ 1
C) x2 ≤ 2
D) x2 ≥ 0
Answer: B
Diff: 2
Section Heading: Branch and Bound Method
Keywords: integer programming solution

15
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall