Question: Solve the following problems using Branch and Bound method: max z = -3x1 - 2x2 + 10, subject to: X1 - 2x2+ X3 = 5/2,

Solve the following problems using Branch and Bound method: max z = -3x1 - 2x2 + 10, subject to: X1 - 2x2+ X3 = 5/2, 2x1+ X2 + X4 = 3/2, x 20 (j = 1, 2, 3, 4), X2 and x3 integer

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 Mathematics Questions!

Solve the following IP problem-using branch and bound technique. max z = ?3x1 ? 2x2 + 10 st. x1 ?2x2 +x3 =5/2 2x1 ?2x2 +x4 =3/2 x1, x2, x3, x4 >= 0 and x2, x3 integer

Solve the following LPs using the Simplex Method 1. max xy + 3x2 2xz subject to x1 + 5x2 + x3 = 10 2x1 - x2 - 2x3 S 15 2x2 + 3x3

answer the q QUESTION 3: [15 Mark! Max Z = 3X1 + 2X2 Subject to: X1 + 2X2 i: 6 2X1 + X2 6.: 8 -X1 + X2 st: 1 {1X1 + X2 {= 2 X1, X2 25:0 a) Find the optimal solution of the duality using the Big M...

(b) Solve the following Linear Program using the Simplex Method. max z = 3.X + 2x2 + 4x3 +5X4 st. 3x1 + 2x2 + x3 + 2x4 = 15 x1 + x2 + 3x3 + 2xy = 25 X1 + 3x2 + 2x3 + X4 = 21 X1, X2, X3, X4

Minimize Z = 3x1 + 2x2 + 7x3, subject to -x1 + x2 = 10, 2x1 - x2 + x3 >= 10 and x1 >= 0, x2 >= 0, x3 >= 0. Using the Big M method, work through the simplex method step by step to solve the problem.

Consider the following problem. minimize z = 3x1 + 2x2 + 7x3 subject to x1 + x2 = 10 2x1 x2 +x3 10 x1 0, x2 0, x3 0 (a) Write the dual of this problem. (b) Solve the dual problem. (c) Using duality...

Solve the following LPs by the revised simplex method: (a) Maximize z = 6x1 - 2x2 + 3x3 subject to 2x1 - x2 + 2x3 2 x1 + 4x3 4 x1, x2, x3 0 (b) Maximize z = 2x1 + x2 + 2x3 subject to 4x1 + 3x2 +...

INTEGER LINEAR PROGRAMMING BV X1 X2 S2 RHS Z 100 0 300 600 $1 1 20 40 X2 1 1 1 2 52 100 1 -400 200 Z 600 40 X2 2 52 200 NOTE: AS YOU CAN SEE THE RHS INTEGER VALUE, THEREFORE YOU MAY GET THE FINAL...

43 Consider the following linear programming formulation: Max Z = 3X1 + 2X2 - 3X3 Subject to 2X1 +3X2 + 4X3 12 X, 2X2 X3 22 X1 +5X2 - 3X3 = 20 X1, X2, X20 The optimal solution is OBJECTIVE FUNCTION...

IEOPER1 HW#9 1. Consider the problem Max Z = 3x1 + 5x2 + 2x3 5.1. - 2xy + 2x2 + x3 35 3x1 + x2 - X3 510 *,X2, X3 20 You are given the fact that the basic variables in the optimal solution are x1 and...

The following information is for the Heart's Delight Gift Store: Sales: Each unit sells for $5. Sales are 75% cash and 25% credit. 50% of the credit sales are collected in the month of sale and the...

For the system function draw the flow graphs of all possible realizations for this system as cascades of first-ordersystem. 1 + 22- +2-2 H(2) 1-- +-

The Michner Corporation is trying to choore between the following two mutually exclusive design projects: \ table [ [ rear , Cash Flow ( 1 ) , Cenk Flat PTYY ] , [ ! , - 5 3 3 , 2 6 0 , - $ 4 1 , 0 0...

On 1 March 2007 DB Limited issued R560 000 15% debentures at R98. The debentures were to be redeemed at par in four equal annual payments starting 28 February 2010. Required: Journalise the above...