a) Consider the following binary integer programing (BIP) problem: Minimize z = 5x₁ + 6x₂ + 7x3 + 8x4 +9x5 subject to 3x₁x2 + x3 + x₁-2x522 x₁ + 3x2-x3-2x4+xs 20 -x₁-x₂ + 3x3 + x + xs ≥ 1 X1, X2, X3, X4, X5 = 0 or 1, Use the BIP branch and bound (B&B) algorithm and draw the trees of sub-problems used in finding the solution.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter7: Nonlinear Optimization Models
Section: Chapter Questions
Problem 63P
icon
Related questions
Question
a) Consider the following binary integer programing (BIP) problem:
Minimize z = 5x₁ + 6x₂ + 7x3 + 8x4 + 9x5
subject to
3x₁x2 + x3 + x4-2x522
x₁ + 3x2-x3-2x4+x5 20
-x₁x₂ + 3x3 + x4 + X5 2 1
X₁, X2, X3, X4, X5 = 0 or 1,
Use the BIP branch and bound (B&B) algorithm and draw the trees of sub-problems used in finding the
solution.
Transcribed Image Text:a) Consider the following binary integer programing (BIP) problem: Minimize z = 5x₁ + 6x₂ + 7x3 + 8x4 + 9x5 subject to 3x₁x2 + x3 + x4-2x522 x₁ + 3x2-x3-2x4+x5 20 -x₁x₂ + 3x3 + x4 + X5 2 1 X₁, X2, X3, X4, X5 = 0 or 1, Use the BIP branch and bound (B&B) algorithm and draw the trees of sub-problems used in finding the solution.
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,