After several iterations of the branch and bound algorithm applied to an integer program max cx subject to Ax≤ b, (3) EN² we obtain the diagram in Figure 2. Regarding the notations, N = {0, 1, 2,...}, A E R²x2, 6 € R², CE R2, z is the optimal value for each linear relaxation, and (x1, x2) is a corresponding solution. For Problem 2: of the form x₁≤6 z = 9₁ x₁ = 4.6 x ₁₂ = 3.9 2 Z=94 x₁ = 6₁20/₂=1 x2≤3 2 7=92 x₁ = 6.2,%₂2=3 x₁ = 7 z=as x₁ = 7, x₂ = 2.6 20274 z = 93 x ₂₁ = 5₁ x ₂ = 4 Figure 2: Branch and bound each question below, give values of a1, a2, a3, a4, a5 ER so that the diagram will satisfy the stated condition. If there are multiple values possible, then only one is sufficient. 1. (x1, x2)=(5, 4) is a solution to the integer program.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
After several iterations of the branch and bound algorithm applied to an integer program
max cx subject to
Ax≤ b,
(3)
XEN²
we obtain the diagram in Figure 2. Regarding the notations, N := {0, 1, 2,...}, A ɛ R²×², 6 ɛ R²,
CE R², z is the optimal value for each linear relaxation, and (x₁, x2) is a corresponding solution. For
Problem 2:
of the form
x₁≤6
ал
Z=
x₁ = 4.6 x ₁₂ = 3.9
Z=94
x₁ = 6₁ x ₂ = 1
2
x₂2 ≤3
Z=9₂
x₁₂₁= 6.2₁%₂2=3
x₁ = 7
21
>
z=as
x₁ = 7₁ x ₁₂ = 2.6
2
72274
z = 93
x ₁₂ = 5₁ x ₂₁ = 4
Figure 2: Branch and bound
each question below, give values of a₁, a2, a3, a4, a5 € R so that the diagram will satisfy the stated
condition. If there are multiple values possible, then only one is sufficient.
1. (x1, x2) = (5, 4) is a solution to the integer program.
2. (x₁, x₂) = (6, 1) is a solution to the integer program.
3. (x1, x₂) = (5, 4) could be a solution but (x₁, x2) = (6, 1) is not. In that case, what is the next step
of the branch and bound algorithm?
Transcribed Image Text:After several iterations of the branch and bound algorithm applied to an integer program max cx subject to Ax≤ b, (3) XEN² we obtain the diagram in Figure 2. Regarding the notations, N := {0, 1, 2,...}, A ɛ R²×², 6 ɛ R², CE R², z is the optimal value for each linear relaxation, and (x₁, x2) is a corresponding solution. For Problem 2: of the form x₁≤6 ал Z= x₁ = 4.6 x ₁₂ = 3.9 Z=94 x₁ = 6₁ x ₂ = 1 2 x₂2 ≤3 Z=9₂ x₁₂₁= 6.2₁%₂2=3 x₁ = 7 21 > z=as x₁ = 7₁ x ₁₂ = 2.6 2 72274 z = 93 x ₁₂ = 5₁ x ₂₁ = 4 Figure 2: Branch and bound each question below, give values of a₁, a2, a3, a4, a5 € R so that the diagram will satisfy the stated condition. If there are multiple values possible, then only one is sufficient. 1. (x1, x2) = (5, 4) is a solution to the integer program. 2. (x₁, x₂) = (6, 1) is a solution to the integer program. 3. (x1, x₂) = (5, 4) could be a solution but (x₁, x2) = (6, 1) is not. In that case, what is the next step of the branch and bound algorithm?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,