Question: 2. Consider the following linear programming (LP) problem Minimize z = 40 x + 50 X2 Subjected to the following constraints: 2 xi +3 x2

2. Consider the following linear programming (LP) problem Minimize z = 40 x + 50 X2 Subjected to the following constraints: 2 xi +3 x2 2 30 X1 + x2 > 12 2 x1 + x2 2 20 Non-negativity constraints xi 20, x2 > 0 A. Use the graphical method to find the optimal solution. B. How would the optimal solution change if the objective function is changed to

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!

Consider the following linear programming (LP) problem: Maximize z = 2x 1 + 3x 2 Subject to the following constraints: Constraint 1: 4x 1 + 7x 2

1. Write down the dual of the following primal Linear programming (LP) problem: Minimize z = x; + 2x2 Subject to 2x: + 4x2 5 160 *z - x2 = 30 X, 2 10 x1,x220 2. Find the optimal solution of the...

1. Consider the following linear programming (LP) problem: Maximize z = 5x + 2x2 Subject to 4x1-2x, S 40 X; - 2x2 2-5 x1,x2 0. Use the Simplex method to determine the optimal solution. Make note of...

Consider the following Linear Programming (LIP ) Problem: Maximize Z= 3x1+2x2 Subject to: 2 x1 = -5 3 x1+ 2 x2= 0, x2 >= 0 a) Solve this problem graphically (7 marks) b) Solve the problem by Simplex...

Consider the following linear programming (LP) problem. Maximize Z=-5X1 + 5 x2 + 13 X3 subject to: -1 X1 + 1 x2 + 3x3 s 20 12 X1 + 4 x2 + 10 X3 s 90 X120, X220, X32 0. a. Construct the augmented form...

Consider the following linear programming (LP) problem. Maximize Z=-5 X1 + 5 x2 + 13 X3 subject to: -1 X1 + 1 x2 + 3x3 s 20 12 xy + 4 X2 + 10 X3 s 90 X120, X2 > 0, X32 0. a. Construct the augmented...

Consider the following Linear Programming (LIP ) Problem: Maximize Z= 2x1-2x2 Subject to: 2 x1 = -5 3 x1+2 x = 0, X2 >= 0 b) Solve the problem by Simplex algorithm in tabular form. (8 marks)...

1. Consider the following linear programming (LP) problem: MAX 2 X1 + 5 X2 ST 6 X1 +5 X2 560 2 X1 + 3 X2 s 24 3 X1 + 6 X2 3 48 X1, X220 a. By putting X, on the horizontal axis and X, on the vertical...

(4) (7 points) Each type i store must be given a "finishing allowance" of Li dollars per square foot, in such a way that the total of all finishing allowances does not exceed a fixed budget equal to...

b) Consider the following mixed constrained LP problem. Minimize z = 4x + x2 Subject to 3x1 + x2 = 3 4x1 + 3x2 2 6 *+ 2x2 3 4 X1, X2 20 For the following questions, use the Big-M method: a) Give the...

Problem 2. Solve the following recurrence relations by providing asymptotically tight bounds. You only need to provide the bound, intermediate derivations are not required. If no boundary case is...

Consider the following inventory information: The company uses a periodic inventory system. The year-end inventor}' count indicated 2,500 units in inventory. Required: Using the first-in, first-out...

The Ellie Trust, a calendar year entity, wants to make a gift to a charity that is deductible on its year 1 Form 1 0 4 1 . The gift must be made by Ellie: a . On or before September 3 0 , year 2 . b...

What is an example of constructive feedback? provide reference