Question – a:
As unit of resource 1 has an allowable increase of infinite, the current solution will remain optimal solution no matter how much the rhs increase.
Answer is:
X1 = 6
X2 = 0
***
Question – b:
X2 has an allowable increase of 12, till the profit is (8 + 12 =) 20, this solution will remain optimal.
Objective function value will be: Z = 10*6 + 16*0 = 60
Answer is: 60
***
Question – c:
x1 profit has an allowable decrease of 6. If profit from x1 reduces from 10 to 3 (a decrease of 7), the current solution wont be optimal anymore.
Answer is: The optimal solution will change. But, it is not possible to determine the value of objective function value only from the sensitivity report.
(***Extra answer – If we solve the program then the optimal profit will be 24)
***
Question – d:
Resource 2 has an allowable increase of infinity. So if we increase it from 6 to 12, this solution will remain optimal.
The solution wont change. X1 = 6, X2 = 0
********
IF YOU HAVE ANY DOUBT, KINDLY COMMENT. I WOULD LOVE TO HELP YOU!!!
IF YOU LIKE THE ANSWER, PLEASE GIVE AN UP-VOTE OR THUMB UP. THIS WILL ENCOURAGE ME TO ANSWER MORE!!
Figure 1 provides the Excel Sensitivity output for the following LP model. 10x1 + 8x2 Max...
Consider the following LP problem. MAX: 9X1-8X2 Subject to: x1+x2≤6 -x1+x2≤3 3x1-6x2≤4 x1,x2≥0 Sketch the feasible region for this model. What is the optimal solution? What is the optimal solution if the objective function changes to Max.-9x1+8x2?
5 pts Question 19 Hock Use the Excel Solver output for a Maximization LP problem to determine by how much the objective function value will increase by if the RHS of the Space Constraint increases by 5 units. Objective Function Value = 26.40 Variable Cells Final Reduced Objective Allowable Allowable Name ValueCost CoefficientIncrease Decrease Variable 1 2.4 0 Variable2 24 0 6 1.5 2.67 Constraints Name Constraint Allowable Allowable R.H. Side Increase Decrease Final Shadow ValuePrice 12 0.6 6.4 0...
1. Use the Big M method to find the optimal solution to the following LP: Max z = 5x1 − x2 s.t.: 2x1 + x2 = 6 x1 + x2 ≤ 4 x1 + 2x2 ≤ 5 x1, x2 ≥ 0 Answer: z = 15, x1 = 3, x2 = 0.
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...
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.
Q4. (Sensitivity Analysis: Adding a new constraint) (3 marks) Consider the following LP max z= 6x1+x2 s.t.xi + x2 S5 2x1 + x2 s6 with the following final optimal Simplex tableau basis x1 r2 S2 rhs 0 0 18 0.5 0.5 0.5 0.5 x1 where sı and s2 are the slack variables in the first and second constraints, respectively (a) Please find the optimal solution if we add the new constraint 3x1 + x2 S 10 into the LP (b)...
(b) A LP model and its solution outputs and sensitivity report are as below. LP Model: Maximise R 7X+5Y+10 Z Subjective to: CI: 2X +Y+32 <= 50 C3: X 3 C6: X, Y, Z)so Outputs & Sensitivity Report: Objective Cell Name Valu 101.33 SC$8 Max Variable Cells Final Value ReducedObjective Allowable Allowable Coefficient Increase Cell Name Cost Decrease 7.333333333 SC$3 X 0 E+30 SC$4 Y 0 5 4.333333333 E+30 SC$5 2 4 0 10 1.666666667 E+30 Constraints Final Value Shadow...
QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2 20 How many extreme points exist in the feasible region for this problem? We cannot tell from the information that is provided The feasible e region is unbounded QUESTION 2 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2228 t is the optimal solution? (2, 6) (0, 12) (5,4.5) None of the...
1. Solve the following LP by the simplex method. Min z = 2x2 – Xı – X3 Subject to *1 + 2x2 + x3 = 12 2x1 + x2 – x3 = 6 -X1 + 3x2 = 9 X1, X2, X3 > 0
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...