Problem needs to be done Excel. 1. Solve the following LP problem. Max Z = 3X1...

Question

Question

Problem needs to be done Excel.

1. Solve the following LP problem.

Max Z = 3X1 + 5X2

S.T. 4X1 + 3X2 >= 24

2X1 + 3X2 <= 18

X1, X2 >= 0

a) Solve the Problem

b) Identify the reduced costs and interpret each.

c) Calculate the range of optimality for each objective coefficient.

d) Identify the slacks for the resources and calculate the shadow price for each resource.

business Operations-Management

Answer 1

Answer #1

Decision Variables X1 X2 Objective function Maximize Z 4 Constraints 24 18 10

F9 1 Decision Variables 2X1 X2 4 Objective function 5 Maximize Z C) Constraints 24 C) x: C) 18 10

Solver Parameters Set Objective To: ⓔMax OMin。Value Of: By Changing aiable Cells: SAS3:SBS3 Subject to the Constraints: SAS3:

1 Decision Variables X2 X1 4 4 Objective function 6 29 824 Maximize Z Constraints 24 18 918

6 Variable Cells Final Reduced Objective Allowable Allowable 8 Ce Name Value Cost Coefficient Increase Decrease 1E+30 0.5 3 0

12 Constraints 13 4 Cell Name Value Price 15 ŞA$8 Constraints 24 -0.166666667 6 SA$9 Constraints 18 1.833333333 Fina Shadow C

Answer 2

Similar Homework Help Questions

Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤...

Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤ 5 x1,x2 ≥0 (a) Find the dual (or shadow) prices of the binding constraints (b) Find the dual (or shadow) prices of the binding “dual” constraints.
Question 3: Identify which of LP problems (1)--(4) has (x1,x2) = (20,60) as its optimal solution....

Question 3: Identify which of LP problems (1)--(4) has (x1,x2) = (20,60) as its optimal solution. (1) min z = 50xı + 100X2 s.t. 7x1 + 2x2 > 28 2x1 + 12x2 > 24 X1, X2 > 0 (2) max z = 3x1 + 2x2 s.t. 2x1 + x2 < 100 X1 + x2 < 80 X1 <40 X1, X2 > 0 (3) min z = 3x1 + 5x2 s.t. 3x1 + 2x2 > 36 3x1 + 5x2 > 45...
Problem 01: Solve the LP problem using the graphic method Max Z = 30x1 + 50x2...

Problem 01: Solve the LP problem using the graphic method Max Z = 30x1 + 50x2 St. 10x1 + 15x2 < 150 3x1 + 5x2 < 40 X1 2 3 X2 2 2 X1, X2 0

QUESTION 15 Describe the solution space for the following LP model: Maximize: 2x1 3x2 Subject to:...

QUESTION 15 Describe the solution space for the following LP model: Maximize: 2x1 3x2 Subject to: 1: 2x1 3x2 2 18 2: 4x1 2x2 2 10 x1, x2 20 Multiple optimal solutions O Infeasible None of the above QUESTION 16 Describe the solution for the folowing LP model: Maximize: 2x1 3x2 Subject to: 1:4x1 +5x2 2 20 2: 3x1 2x2 212 x1, x2 20 A single optimal solution O Infeasible Multiple optimal solutions None of the above QUESTION 17 In...
QUESTION 3 Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2...

QUESTION 3 Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2 - x3 subject to 2x1 + x2+ x3 ≤ 8 4x1 +x2 - x3 ≤ 10 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Find the dual for this LP (b) Graphically solve the dual of this LP. And interpret the economic meaning of the optimal solution of the dual. (c) Use complementary slackness property to solve the max problem (the...
Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2 - x3...

Duality Theory : Consider the following LP problem: Maximize Z = 2x1 + x2 - x3 subject to 2x1 + x2+ x3 ≤ 8 4x1 +x2 - x3 ≤ 10 x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Find the dual for this LP (b) Graphically solve the dual of this LP. And interpret the economic meaning of the optimal solution of the dual. (c) Use complementary slackness property to solve the max problem (the primal problem). Clearly...

samplex Problem1: Solve the following problem using simplex method: Max. z = 2 x1 + x2...

samplex Problem1: Solve the following problem using simplex method: Max. z = 2 x1 + x2 – 3x3 + 5x4 S.t. X; + 7x2 + 3x3 + 7x, 46 (1) 3x1 - x2 + x3 + 2x, 38 .(2) 2xy + 3x2 - x3 + x4 S 10 (3) E. Non-neg. x > 0, x2 > 0, X3 > 0,44 20 Problem2: Solve the following problem using big M method: Max. Z = 2x1 + x2 + 3x3 s.t. *+...
(1) Convert the following LPs to standard form: 22 (a) max z 3x1 + 2x2 s.t....

(1) Convert the following LPs to standard form: 22 (a) max z 3x1 + 2x2 s.t. 21 < 40 X1 + x2 < 80 2x1 + x2 < 100 X1, X2 > 0 (b) max z = 2x1 s.t. X1 – X2 <1 2x1 + x2 > 6 X1, X2 > 0 (c) max z = 3x1 + x2 s.t. 1 > 3 X1 + x2 < 4 2x1 – X2 = 3 X1, X2 > 0
Use the simplex algorithm to find all optimal solutions to the following LP. max z=2x1+x2 s.t....

Use the simplex algorithm to find all optimal solutions to the following LP. max z=2x1+x2 s.t. 4x1 + 2x2 ≤ 4 −2x1 + x2 ≤ 2 x1 ≥1 x1,x2 ≥0

2. Solve the following LP problem graphically. Maximize profit = 3x1+ 5x2 Subject to:x2≤6 3x1 +...

2. Solve the following LP problem graphically. Maximize profit = 3x1+ 5x2 Subject to:x2≤6 3x1 + 2x2≤18 x1, x2≥0