This preview shows pages 1–2. Sign up to view the full content.
Name________________________________
Student Number ____________________
CEE 111 Winter 2010
Quiz 4
Solution
Consider the following binary programming problem:
012345
01
123
234
345
45
0
1
23
Maximize
10
20
30
20
10
10
subject to:
1
1
1
1
1
7.5
10
10.5
5.5
15
5.5
30
,,,,,
0
,
1
Z
xxxxxx
xx
xxx
x
x
The results of the initial stages of a branch and bound procedure used to solve this problem are
summarized in the figure on the following page.
Answer the following questions:
1.
Circle any/all of the following branches in the following list that have/has the possibility of
leading to the optimal solution to this problem.
Branch
A
Branch
B
Branch
C
Branch
D
Branch
E
Branch
F
Branch
G
Branch
H
Existing branch
32
1,
1
leads to a feasible solution with
70.00
Z
.
Branching on
A
,
B
,
C
or
D
can
only lead to a solution with
70.00
Z
which could never be optimal since you already have a feasible
solution with a greater
Z
.
Branch
G
will only repeat the same solution as the current feasible (since the
current feasible already has
1
0
x
.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 03/30/2012 for the course CIVIL ENGI CEE111 taught by Professor Recker during the Winter '12 term at UC Irvine.
 Winter '12
 RECKER

Click to edit the document details