Consider the following IP. The optimal tableau for this IPs linear programming relaxation is also given in the table below. Use the cutting plane algorithm to find the optimal solution. Z 1 OC 0 X₁ 0 1 0 max z = 2x₁ - 4x2 s.t. 2x1 + x₂ = 5 -4x₁ + 4x₂ ≤ 5 X1, X₂ = 0; x1, x₂ integer X₂ 0 0 $₁ د بن سدان است $2 6 12 rhs MAINTE 15

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.2: Direct Methods For Solving Linear Systems
Problem 2CEXP
icon
Related questions
Question
Consider the following IP. The optimal tableau for this IPs linear programming
relaxation is also given in the table below. Use the cutting plane algorithm to find the
optimal solution.
max z = 2x1 – 4x2
s.t.
2x1 + x2 < 5
-4x1 + 4x2 s 5
X1, X2 2 0; x1, x2 integer
S1
rhs
1
15
6
1
12
1
N
Transcribed Image Text:Consider the following IP. The optimal tableau for this IPs linear programming relaxation is also given in the table below. Use the cutting plane algorithm to find the optimal solution. max z = 2x1 – 4x2 s.t. 2x1 + x2 < 5 -4x1 + 4x2 s 5 X1, X2 2 0; x1, x2 integer S1 rhs 1 15 6 1 12 1 N
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning