Question: Consider the following LP Integer Programming Problem: Maximize Z = 40X1 + 90X2 Subject to: 9X1 + 7X2 = 0 AND Integers. Use Branch and

Consider the following LP Integer Programming

Consider the following LP Integer Programming Problem: Maximize Z = 40X1 + 90X2 Subject to: 9X1 + 7X2 = 0 AND Integers. Use Branch and Bound technique to solve the above problem. Show each branch clearly. Do initial branching on X1. Final answer has no marks unless justified by your work. GRAPH PADER POR Q# 2 5 A X2 12 10 8 6 4 2 X1 2 4 6 8 lo 12

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

USE BRANCH AND BOUND TECHNIQUE ONLY PLEASE! Question #2 (6 Marks Consider the following L.P. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 7.20 X2 >=56 7.20 X1+ 19.80 X2 = 0...

Question #2 ( 6 Marks Consider the following L.P. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 - 7.20 X2 >-56 7.20 X1+ 19.80 X2 = 0 and Integers Use Branch and Bound...

Consider the following L.P. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 - 7.20 x2 >=-56 7.20 X1+ 19.80 X2 = 0 and Integers Use Branch and Bound technique to find the...

J Question #2 ( 6 Marks Consider the following L.P. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 7.20 X2 >= 56 7.20 X1+ 19.80 X2 = 0 and Integers Use Branch and Bound...

Question #2 ( 6 Marks Consider the following L.P. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 - 7.20 X2 >-56 7.20 X1+ 19.80 X2 = 0 and Integers Use Branch and Bound...

Consider the following LP. Integer Programming Problem: Maximize 40 X1 + 90 X2 Subject to -8.90 X1 - 7.20 X2 >=-56 7.20 X1+ 19.80 X2 = 0 and Integers Use Branch and Bound technique to find the...

2. (10 points) Consider this integer programming problem. Maximize Z = 51] + 10332 subject to: 33:; + 33:2 5 19 2:1 2:2 5 3 11,12 3 0 2:1 and In integers Solve this problem by the branch and bound...

Hello, From (i) and (ii), I get the liner relaxation value(3, 2.5) and z = 7. However, I have trouble in (iii) and (iv). For (iii), actually, I get two results. The first one is (4,2) and z = 4. The...

Consider the following IP problem: Maximize Z = 3x1 + 5x2, Subject to 5x1 7x2 3 and xj 3 xj 0 xj is integer, for j = 1, 2. (a) Solve this problem graphically. (b) Use the MIP branch-and-bound...

Use the branch and bound algorithm to solve the following integer programming model maximize Z = 3x 1 + 4x 2 Subject to: 2x 1 + x 2 6 2x 1 + 3x 2 9 x1 0, x 2 0 and both are integers

Teresa rents her apartment for $ 650 per month, utilities not included. When she moved in, she paid a $ 700 security deposit using money from her savings account that was paying 3% interest. Her...

A balance sheet of Brown University, issued prior to the effective date of FASB Statement No. 117, is presented below. Recast the fund balance (net asset) section of the balance sheet so that it...

a Copy and complete the table of values for each two-step function machine. b Write each function in part a as an equation. x x 2 +3 x 172 01 3 4 y == 2 -3 8 10 15 19 y

When older adults have difficulty with transportation and communication, or may be reluctant to request needed assistance to which they are entitled, they may be in need of: Group of answer choices...