24x1 + 2x2 + 20x3+4x4 s.t. 8x1 + x2 + 5x3+4x4≤ 9 x>0 x integer elaxation has an optimal objective value of zip = 36, with opti 0. branch and write down the LPs of the two (left and right) subproblem max z = := x

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section: Chapter Questions
Problem 53P
icon
Related questions
Question
6
Consider the following integer program:
max
24x1 + 2x2 + 20x3 + 4x4
x
8x1 + x2 + 5x3+4x4 ≤ 9
x > 0
x integer
=
36, with optimal solution **
=
The LP relaxation has an optimal objective value of zip
(0, 0, 1.8, 0).
Propose a branch and write down the LPs of the two (left and right) subproblems from this branch.
s.t.
Transcribed Image Text:6 Consider the following integer program: max 24x1 + 2x2 + 20x3 + 4x4 x 8x1 + x2 + 5x3+4x4 ≤ 9 x > 0 x integer = 36, with optimal solution ** = The LP relaxation has an optimal objective value of zip (0, 0, 1.8, 0). Propose a branch and write down the LPs of the two (left and right) subproblems from this branch. s.t.
Expert Solution
steps

Step by step

Solved in 5 steps with 2 images

Blurred answer