Question

In: Operations Management

Using the simplex method, find the optimal solution to the following LP: A company manufactures three...

Using the simplex method, find the optimal solution to the following LP: A company manufactures three products, A,B, and C. The sales volume for A is at least 50% of the total sales of all three products. However, the company cannot sell more than 75 units of A per day. The three products use one raw material, of which the maximum daily availability is 240 pounds. The usage rates of the raw material are 2 lb per unit of A, 4 lb per unit of B and 3 lb per unit of C. The unit prices of A,B, and C are $20, $50, and $35 respectively.

Solutions

Expert Solution

Let no. of product A be x, Product B be y and product C be z

Total Revenue = 20*x + 50*y + 35*z

We have to maximize this cost

Subject to constraints

x >= 50% (x + y + z)............Constraint for at least 50% of Sales volume

x <= 75................................Company cannot sell more than 75 units of A per day

2x + 4y + 3z <= 240.............Maximum Daily availability of raw material

We solve the given problem in excel using Excel Solver as shown below:

The above solution in the form of formulas along with Excel Solver extract is shown below for better understanding and reference:

As seen from above solution:

No. of Product A = 40 nos

No. of Product B = 40 nos

No. of Product C = 0 nos


Related Solutions

Find the optimum solution to the following LP using the Simplex Algorithm. Use Two-Phase method. ???...
Find the optimum solution to the following LP using the Simplex Algorithm. Use Two-Phase method. ??? ?=3?2+2?3 ?? −2?1 + ?2 − ?3 ≤ −3 −?1 + 2?2 + ?3 = 6 ?1,?2,?3 ≥0
Find the optimum solution to the following LP by using the Simplex Algorithm. Min z =...
Find the optimum solution to the following LP by using the Simplex Algorithm. Min z = 3x1 – 2x2+ 3x3 s.t. -x1 + 3x2 ≤ 3 x1 + 2x2 ≤ 6 x1, x2, x3≥ 0 a) Convert the LP into a maximization problem in standard form. b) Construct the initial tableau and find a bfs. c) Apply the Simplex Algorithm.
Identify the type of optimal solution for the following LP problems by the graphical solution method....
Identify the type of optimal solution for the following LP problems by the graphical solution method. Show your work (1)   Min    2X1 + 3X2             S.T.   2X1 - 2X2    <=   2                   -2X1 +   X2    <=   1                   X1 => 0,    X2 => 0 If the objective function of the above formulation is changed from Min 2X1 + 3X2 to Max 2X1 + 3X2, what type of optimal solution does this problem provide? Note that all constraints remain...
For the following LP problem, determine the optimal solution by the graphical solution method. Min Z=...
For the following LP problem, determine the optimal solution by the graphical solution method. Min Z= 3x1+2x2 Subject to 2x1+x2 >10                    -3x1+2x2 < 6                      X1+x2 > 6                      X1,x1 > 0 Graph and shade the feasible region
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the feasible region is empty and UNBOUNDED if the objective function is unbounded.) Minimize c = x + y + z + w subject to x + y ≥ 80 x + z ≥ 60 x + y − w ≤ 50 y + z − w ≤ 50...
Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and...
Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and the minimum cost. (Leave no cells blank - be certain to enter "0" wherever required. Omit the "$" sign in your response.) Minimize 8x11 + 2x12 + 5x13 + 2x21 + x22 + 3x23 + 7x31 + 2x32 + 6x33 Subject to x11 + x12 + x13 = 90 x21 + x22 + x23 = 105 x31 + x32 + x33 = 105 x11...
Use the Simplex method to solve the following LP minimize −2x1 −3x2 + x3 + 12x4...
Use the Simplex method to solve the following LP minimize −2x1 −3x2 + x3 + 12x4 subject to −2x1 −9x2 + x3+ 9x4 + x5 = 0 1/3x1 + x2 −1/3x3 −2x4 + x6 = 0 x1,x2,x3,x4,x5,x6 ≥ 0
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>....
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>. Maximize z = x1 + 2x2 + 3x3 subject to x1 + x2 + x3 ≤ 12 2x1 + x2 + 3x3 ≤ 18 x1, x2, x3 ≥ 0 2>. A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of wheat requires 4 hours of labor and $20 of capital, and each acre of corn...
Find the optimal values of x and y using the graphical solution method: Max x +...
Find the optimal values of x and y using the graphical solution method: Max x + 5y subject to: x + y ≤ 5 2x + y ≤ 8 x + 2y ≤ 8 x ≥ 0, y ≥ 0
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Maximize Z = 2A + 10B Subject to 10A + 4B ≥ 40    A + 6B ≥ 24                A + 2B ≤ 14    A, B  ≥ 0 with soln pls thank you!
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT