Question

In: Operations Management

Find the objective function and the constraints, and then solve the problem by using the simplex...

Find the objective function and the constraints, and then solve the problem by using the simplex method. A confectioner has 600 pounds of chocolate, 100 pounds of nuts, and 50 pounds of fruits in inventory with which to make three types of candy: Sweet Tooth, Sugar Dandy, and Dandy Delite. A box of Sweet Tooth uses 3 pounds of chocolate, 1 pound of nuts, and 1 pound of fruit and sells for $8. A box of Sugar Dandy requires 4 pounds of chocolate and 1 2 pound of nuts and sells for $5. A box of Dandy Delite requires 5 pounds of chocolate, 3 4 pounds of nuts, and 1 pound of fruit and sells for $6. How many boxes of each type of candy should be made from the available inventory to maximize revenue?

Solutions

Expert Solution

Solution:

MAX Z = 8x1 + 5x2 + 6x3
subject to
3x1 + 4x2 + 5x3 <= 600 chocolate
x1 + 1/2x2 + 3/4x3 <= 100 nuts
x1 + x3 <= 50 fruit
and x1,x2,x3 >= 0

Given data x1 = number of boxes of sweet tooth
x2 = number of sugar dandy boxes

x3 = number of dandy delight boxes
Solution:
Problem is

Max Z = 8 x1 + 5 x2 + 6 x3
subject to
3 x1 + 4 x2 + 5 x3 600
x1 + 0.5 x2 + 0.75 x3 100
x1 + x3 50
and x1,x2,x3≥0;



The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate

1. As the constraint-1 is of type '≤' we should add slack variable S1

2. As the constraint-2 is of type '≤' we should add slack variable S2

3. As the constraint-3 is of type '≤' we should add slack variable S3

After introducing slack variables

Max Z = 8 x1 + 5 x2 + 6 x3 + 0 S1 + 0 S2 + 0 S3
subject to
3 x1 + 4 x2 + 5 x3 + S1 = 600
x1 + 0.5 x2 + 0.75 x3 + S2 = 100
x1 + x3 + S3 = 50
and x1,x2,x3,S1,S2,S3≥0


Iteration-1 Cj 8 5 6 0 0 0
B CB XB x1 x2 x3 S1 S2 S3 MinRatio
XBx1
S1 0 600 3 4 5 1 0 0 6003=200
S2 0 100 1 0.5 0.75 0 1 0 1001=100
S3 0 50 (1) 0 1 0 0 1 501=50
Z=0 Zj 0 0 0 0 0 0
Zj-Cj -8 -5 -6 0 0 0



Negative minimum Zj-Cj is -8 and its column index is 1. So, the entering variable is x1.

Minimum ratio is 50 and its row index is 3. So, the leaving basis variable is S3.

The pivot element is 1.

Entering =x1, Departing =S3, Key Element =1


Related Solutions

Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 +...
Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 + 2x2 Subject to constraints: 3x1 + 2x2 <=9 x1 + 3x2 <= 5 when x1, x2 >=0
Solve using the graphical method. Choose your variables, identify the objective function and the constraints, graph the constraints, shade the feasibility region, identify all corner points, and determine the solution that optimizes the objective function
Solve using the graphical method. Choose your variables, identify the objective function and the constraints, graph the constraints, shade the feasibility region, identify all corner points, and determine the solution that optimizes the objective function. Use this information to answer the following 8-part question:A city council voted to conduct a study on inner-city community problems using sociologists and research assistants from UMUC. Allocation of time and costs per week are given in the following table:Labor hours - SociologistLabor hours –...
Solve the following problem using the simplex method. If the problem is two dimensional, graph the...
Solve the following problem using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm. Max               Z = 5X1 + 3X2 + 2X3 Subject to    4X1 + 5X2 + 2X3 + X4≤ 20                      3X1 + 4X2 - X3 + X4≤ 30                       X1, X2, X3, X4 ≥ 0   
Find both the maximum and minimum of the objective function y − 8x given these constraints....
Find both the maximum and minimum of the objective function y − 8x given these constraints. (If an answer does not exist, enter DNE.) 5x-2y≤13 y≥-4 y-7x≤31 2x+7y≤13
Use the simplex method to solve the following problem. Find y1 ≥ ​0, y2 ≥ ​0,...
Use the simplex method to solve the following problem. Find y1 ≥ ​0, y2 ≥ ​0, and y3 ≥ 0 such that 2 y1 + 7 y2 + 3 y3 ≤ 11​, 2 y1 + 14 y2 + 8 y3 ≥ 1010​, and w = 12 y1 + 42 y2 + 59 y3 is minimized. The minimum value w = ___ occurs when y1 = ___​, y2 = ___​, and y3 = ___. ​(Simplify your​ answers.)
Convert the follow system of equations to standard form and solve using Simplex method to find...
Convert the follow system of equations to standard form and solve using Simplex method to find optimal solution Maximize 10.75x + 5.3y constraints 0.25x + 0.6y < = 1000 0.50x + 0.1y <= 1000 0.25x + 0.3y <= 1000 x>=250, y>=250
Solve the following linear programming problem using the dual simplex method: max ? = −?1 −...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 − 2?2 s.t. −2?1 + 7?2 ≤ 6 −3?1 + ?2 ≤ −1 9?1 − 4?2 ≤ 6 ?1 − ?2 ≤ 1 7?1 − 3?2 ≤ 6 −5?1 + 2?2 ≤ −3 ?1,?2 ≥ 0
Solve for the following Linear Programming problems. Your solutions should include: Objective Function Constraints Graph complete...
Solve for the following Linear Programming problems. Your solutions should include: Objective Function Constraints Graph complete with labels of points and lines, and shaded feasible region Corner point approach Optimal solution Maximum profit Problem 1: In 1969, the two leading dietary drinks available in the market are Bandade and Firstade. These drinks supply protein and carbohydrates lost during physical activity. Bandade provides 1 unit of protein and 3 units of carbohydrates in each liter. Firstade supplies 2 units of protein...
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...
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...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT