Question

In: Statistics and Probability

Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...

Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem.

Max Z = 20X1 + 30X2 + 25X3 + 32X4

s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40

X1 + X2 ≥ 3

(X1 + X2) ≤ (X3 + X4)

x1/x2 ≥ 3/2

X1 = __________X2 = ___________X3 = ___________X4 = ___________Z = ____________

Solutions

Expert Solution

x1 = 3, x2 = 0, x3 = 0, x4 = 4.6667

Profit z = 209.3333


Related Solutions

Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem. Max Z = 20X1 + 30X2 + 25X3 + 32X4 s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40 X1 + X2 ≥ 3 (X1 + X2) ≤ (X3 + X4) ?1 ?2 ≥ 3 2 X1 = __________ X2 = ___________ X3 = ___________ X4 = ___________ Z = ____________
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...
Problem:  Using Solver, solve the linear program to find the optimal number of batches to make of...
Problem:  Using Solver, solve the linear program to find the optimal number of batches to make of each of the three cookies. Price per chocolate chip cookie $                      1.50 Price per sugar cookie $                      1.00 Price per snickerdoodle cookie $                      1.00 Recipes for one batch Number of cookies/batch 20 20 30 Ingredient Chocolate chip cookie recipe Sugar cookie recipe Snickdoodle recipe Butter (sticks) 2 2 2 Sugar (cups) 1 2 1 Eggs 2 3 1 Chocolate chips (cups) 1 0 0...
Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve...
Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve the following LPP graphically: Y=q1+4q2 Subject to 2q1+6q2<=36 2q1+2q2<=16 4q1+2q2<=28 q1,q2>=0
Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2...
Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2 + 5 x3 subject to x1 + x2 + x3 <= 25 2 x1 + x2 + x3 <= 40 x1 + x2          <= 25                    x3 <= 6 x1, x2, x3 >= 0 (non-negativity conditions)
For the following linear programming problem, determine the optimal solution by the graphical solution method Max...
For the following linear programming problem, determine the optimal solution by the graphical solution method Max -x + 2y s.t. 6x - 2y <= 3 -2x + 3y <= 6     x +   y <= 3         x, y >= 0
The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max s.t. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12 1x1 +2x2 ≤6 x1 , x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? Over what range can the coefficient of x2 vary before the current solution is no...
Use the graphical method for linear programming to find the optimal solution for the following problem....
Use the graphical method for linear programming to find the optimal solution for the following problem. Maximize P = 4x + 5 y subject to 2x + 4y ≤ 12                 5x + 2y ≤ 10 and      x ≥ 0, y ≥ 0. graph the feasible region
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...
SOLVE THE FOLLOWING 2 LINEAR PROGRAMMING PROBLEMS USING EXCEL AND THE SOLVER ADD-IN. PLEASE SHOW ME...
SOLVE THE FOLLOWING 2 LINEAR PROGRAMMING PROBLEMS USING EXCEL AND THE SOLVER ADD-IN. PLEASE SHOW ME ALL THE EXCEL STEPS. PROBLEM #1:   Maximize Z = $60X + $90Y                             Subject to:   60X + 30Y >= 1,500                                                     100X + 100Y <= 6,000                                                                              Y >= 30                                                                           X, Y >= 0 PROBLEM #2: Minimize Z = $3,000X + $1,000Y                              Subject to:   60X + 20Y >= 1,200                                                         10X + 10Y >= 400                                                     ...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT