For the given LP formulation, find the optimal solution using
excel solver.
Max(Z) = 5X1 + 8X2
Constraints :
2X1 + 4X2 <= 40
6X1 + 3X2 <= 42
X1 >= 3
X1,X2 >= 0
(a) Insert below a screenshot of the excel solver with final answers
in it.
(b) Write clearly which constraints are binding and which are non binding.
(c) How much change can we make in the first constraint without changing the optimal solution for Z.
(d) (2 points) Can we increase the right hand side value of the
constraint (X1 >= 3) to 5 to obtain the same optimal value of Z?
Give reason for your answer?
a)

Formula used
Solver window input

Sensitivity report

b)
Following constraints are binding :
6X1 + 3X2 <= 42
X1 >= 3
Non-binding constraints :
2X1 + 4X2 <= 40
c)
We can decrease RHS of 2X1 + 4X2 <= 40 by 2 and increase upto infinity without changing the optimal solution for Z. because there is a slack of 2 unit in the constraint
d)
No optimal value of Z will change as constraint (X1 >= 3) is binding and has shadow price of -11 which is again valid till increase of RHS upto 7. Hence increasing right hand side value to 5 will decrease Z to 79+2*(-11) = 57
For the given LP formulation, find the optimal solution using excel solver. Max(Z) = 5X1 +...
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.
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)...
Use the two-phase method to find the optimal solution to the following LP: Min z = 3x1 + 2x2 s.t.: 3x1 + x2 ≥ 3 4x1 + 3x2 ≥ 6 x1 + 2x2 ≤ 3 x1, x2 ≥ 0 Answer: z = 4.2, x1 = 0.6, x2 = 1.2.
2. Use the simplex algorithm to find an optimal solution to the following LP: max z 5x1 + 3x2 + x3 5x +3x2 +6x s 15
Figure 1 provides the Excel Sensitivity output for the following LP model. 10x1 + 8x2 Max Z= subject to: 31 +2x2 < 24 2x1 + 4x2 = 12 -2x1 + 2 x2 56 X1, X2 > 0 Variable Cells Cell Name $B$13 Solution x1 $C$13 Solution x2 Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 6 0 10 1E+30 0 -12 8 12 1E+30 6 Constraints Cell $D$6 $D$7 $D$8 Name C1 Totals C2 Totals C3 Totals Final...
Problem A: Consider the following LP problem to answer Questions 4 and 5. Maximise z = 5x1 + 4x2 Subject to 6X1 + 4x2 < 24 X1 + 2x2 5 6 -X1 + x2 <1 X2 < 2 X1, X2 > 0 Question 4 Refer to Problem A: Which of the following statements is correct? (1) The optimal value of x1 is in the interval [10, 15). (2) The optimal valu X2 is in the rval [0, 5). (3) The...
Find solution using Simplex method (BigM method) MAX Z = 5x1 + 3x2 + 2x3 + 4x4 subject to 5x1 + x2 + x3 + 8x4 = 10 2x1 + 4x2 + 3x3 + 2x4 = 10 X j > 0, j=1,2,3,4 a) make the necessary row reductions to have the tableau ready for iteration 0. On this tableau identify the corresponding initial (artificial) basic feasible solution. b) Following the result obtained in (a) solve by the Simplex method, using...
Given the following all-integer linear program: (COMPLETE YOUR SOLUTION IN EXCEL USING SOLVER AND UPLOAD YOUR FILE. BE SURE THAT EACH WORKSHEET IN THE EXCEL FILE CORRESPONDS TO EACH QUESTION BELOW ) Max 15x1 + 2x2 s. t. 7x1 + x2 <= 23 3x1 - x2 <= 5 x1, x2 >= 0 and integer a. Solve the problem (using SOLVER) as an LP, ignoring the integer constraints. What solution is obtained by rounding up fractions greater than or...
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.
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...