Question

In: Statistics and Probability

Solve the following linear program graphically. (Graph constraints & locate the optimal point. You may use...

Solve the following linear program graphically. (Graph constraints & locate the optimal point. You may use the solver to determine the optimal point. If do show complete work.

b) Determine the optimal point coordinates.

c) Computer the optimal value.

d) Compute the allowable increase and decrease for each of the objective function coefficients.

e) Compute the shadow prices for each of the constraints.

Min

4x + 2y

s.t.

2x + y >= 14

x + 2y  >= 12

  x +   y >= 9

      x, y >= 0

Solutions

Expert Solution

b)  Optimal points co-ordinates are A=(0,14), B=(5,4), C=(6,3), D=(12,0)

c) Optimal value is 28.

C


Related Solutions

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...
For the given transportation problem, formulate a linear program with objective function and constraints. Solve using...
For the given transportation problem, formulate a linear program with objective function and constraints. Solve using the excel sleeve, provide the optimal transport cost. Imagine that we have three bakeries and three stores. the three stores require 23 dozen, 17 dozen, and 20 dozen loaves of bread, respectively, while the three bakeries can supply 18 dozen, 15 dozen, and 22 dozen loaves, respectively. The unit transportation costs are provided in the table below: Store 1 Store 2 Store 3 Bakery...
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...
Graphically solve the following problem. You need not show me the graph. However, you would need...
Graphically solve the following problem. You need not show me the graph. However, you would need to draw one to solve the problem correctly. You would need to indicate all the corner points clearly. Solve mathematically to identify the intersection points. Maximize profit = 8 x1 + 5x2    Subject to    x1 + x2 <=10 x1 <= 6 x1, x2 >= 0 a. What is the optimal solution? (You may utilize QM for Windows to answer b to d)...
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...
1. The optimal solution of the linear programming problem is at the intersection of constraints 1...
1. 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 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12   1x1 +2x2 ≤6 x1 , x2 ≥ 0 A. Over what range can the coefficient of x1 vary before the current solution is no longer optimal? B. Over what range can the coefficient of x2 vary before the current solution is...
(b)Solve the linear program developed in part (a), to determine the optimal production plan. Qty Produced...
(b)Solve the linear program developed in part (a), to determine the optimal production plan. Qty Produced    Phillipines    Mexico PT-100 ________    _______ PT-200 _________ ______ PT-300 _________ ________ Total Cost = $___________ (c)Use sensitivity analysis to determine how much the production and/or shipping cost per unit would have to change to produce additional units of the PT-100 in the Philippines plant.If required, round your answer to two decimal digits. At least $__________ / unit. (d)Use sensitivity analysis to...
Use MATLAB to solve graphically the planar system of linear equations x +4 y = −4...
Use MATLAB to solve graphically the planar system of linear equations x +4 y = −4 4x +3 y =4 to an accuracy of two decimal points. Hint: The MATLAB command zoom on allows us to view the plot in a window whose axes are one-half those of original. Each time you click with the mouse on a point, the axes’ limits are halved and centered at the designated point. Coupling zoom on with grid on allows you to determine...
Solve the following linear programs graphically. Minimize            Z = 4X1 - X2 Subject to            X1 +...
Solve the following linear programs graphically. Minimize            Z = 4X1 - X2 Subject to            X1 + X2 ≤ 6                             X1 - X2 ≥ 3                            -X1 + 2X2 ≥ 2                            X1, X2 ≥ 0
Use a software program or a graphing utility to solve the system of linear equations. (If...
Use a software program or a graphing utility to solve the system of linear equations. (If there is no solution, enter NO SOLUTION. If the system has an infinite number of solutions, set x5 = t and solve for x1, x2, x3, and x4 in terms of t.) x1 − x2 + 2x3 + 2x4 + 6x5 = 16 3x1 − 2x2 + 4x3 + 4x4 + 12x5 = 33 x2 − x3 − x4 − 3x5 = −9 2x1...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT