c) Consider the following knapsack problem:Maximize z = 10x₁ + 7x2 + 25x3 + 24x4subject to2x₁ + x2 +6x3 + 5x4 ≤7xi, binary integer. i=1,2,...,4Apply the B&B algorithm and draw the trees of sub-problems to find the integer optimal solution.

Max ZA=49 (x1=0,x2=7,x3=0,x4=0) and ZL=49 (x1=0,x2=7,x3=0,x4=0) obtainted by the rounded off…

Answered: c) Consider the following knapsack…

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

See similar textbooks

Similar questions

4. Solve the following LP problem using the simplex algorithm for maximum tableaus: Maximize: f(x1, x2, 3) = 1 + 2x2 + 2x3 subject to ₁+ 2x2 + 2x3 ≤ -4 2x1 + 3x3 ≤ 5 2x1x2 + x3-4 X1, X2, X3 20
Use the simplex algorithm to solve the following linear optimisation problem: maximisef(x1,x2,x3)=3x1+x2+2x3 subjectto: 3x1 +2x2 +x3 ≤8 x1 +2x2 +2x3 ≤4, x1,x2,x3 ≥0. You must address each of the 5 steps of the algorithm as presented in the course notes and videos in your answer.
Use Simplex Algorithm to determine the optimal solution of this LP problem. Maximize z = 2x1 − x2 + 2x3subject to:2x1 + x2 ≤ 10x1 + 2x2 − 2x3 ≤ 20x2 + 2x3 ≤ 5x1, x2, x3 ≥ 0
Solve the following problem using the tableau implementation of the simplex algorithm. minimize - 6x - 4x2 + 2x3 subject to x, + x2 + 4x3 < 20 - 5x2 + 5x3 < 100 X1 + 3x2 + x3 s 400 *1 20 *3 20
4. Consider the following LP: max z = 6x1 + x2 X1 + x2 5 5 2x, + x2 < 6 st. X1,x2 2 0 (a) Solve this problem using the Simplex Algorithm and obtain the optimal tableau for this problem. (b) If we add a new variable x3 such that: max z = 6x1 + x2 + x3 X1 + x2 + ax3 S 5 2x, + x2 + bx356 X1, X2, X3 20 where a and b are scalar values, define the conditions under which the current basis stay st. optimal.
. Use the simplex algorithm to solve the following linear optimisation problem: maximise f(x1, x2, x3) = 3x1 + x2+ 2x3 subject to: Зх1 + 2л2 + з 0.
2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro- gramme giving the initial tableau and each further tableau produced. Give the starting tableau for the second phase if there is one. maximize 2x1 x23x3 subject to X2 - x3 ≤ 2, x13x2+2x3 ≥ 3, 2x12x2 x3 = 4, x1, x2, x3 0.
Use the simplex algorithm to solve the following linear optimisation problem: maximise f(x1, x2, x3) = 3x1+ x2 + 2x3 subject to: 3x1 + 2x2 + x3 0. You must address each of the 5 steps of the algorithm as presented in the course notes and videos in your answer.
Consider the linear program max 10x – y s.t. -5x + 3y < 15 Зх — 5у <8 х, у 2 0 Use the simplex method to show that the problem is unbounded. (Show each iteration of the algorithm in the solution.)
Solve the following linear programs (LPs) using the simplex algorithm. • For each tableau you obtain, write the associated BFS and its objective value. • For each LP, find the complete optimal solution set and write it using appropriate mathematical notation. Use only the information in the tableaux to justify your answer. minimize z(x1, x2) subject to -x1 X2 + x2 0
First 3 parts are solved. 5-28 Consider the linear programmax x1 + x2s.t. x1 + x2 ≤ 9-2x1 + x2 ≤ 0x1 - 2x2 ≤ 0x1, x2 ≥ 0(a) Solve the problem graphically.(b) Add slacks x3,c, x5 to place the modelin standard form.(c) Apply rudimentary simplex Algorithm 5Ato compute an optimal solution to yourstandard form starting with all slacks basic.(d) Plot your progress in part (c) on thegraph of part (a).(e) How can the algorithm be making progress when l = 0 if some moves of part(c) left the solution unchanged? Explain.5-29 Do Exercise 5-28 for the LPmax x1s.t. 6x1 + 3x2 ≤ 1812x1 - 3x2 ≤ 0x1, x2 ≥ 0
Please do not give solution in image format thanku QUESTION: Find the optimal integer solution of the integer programming problem given below with the 'cut plane algorithm' and draw the tree diagram. Max.z = 3x1 + 5x2 şkg 3x1 + 4x2 ≤ 25 x1 + 4x2 ≤ 16 x1 + x2 ≤ 8 x1 , x2 ≥ 0 and integer

SEE MORE QUESTIONS

Recommended textbooks for you

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

Algebra & Trigonometry with Analytic Geometry

Algebra

ISBN:

9781133382119

Author:

Swokowski

Publisher:

Cengage

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

Algebra & Trigonometry with Analytic Geometry

Algebra

ISBN:

9781133382119

Author:

Swokowski

Publisher:

Cengage

SEE MORE TEXTBOOKS

c) Consider the following knapsack problem: Maximize z = 10x₁ + 7x2 + 25x3 +24x4 subject to 2x₁ + x₂ + 6x3 + 5x4 ≤7 x₁, binary integer. i=1,2,...,4 Apply the B&B algorithm and draw the trees of sub-problems to find the integer optimal solution.