Question

In: Statistics and Probability

Given the following linear programming model, answer the questions that follow. You are given the result...

  1. Given the following linear programming model, answer the questions that follow. You are given the result of a computer program. The results are

Maximize 9 X1 + 12 X2 + 10 X3

Subject to:

Machine Constraint:   3 X1 + 4 X2 + 3 X3 < 160

Labor Constraint:        6 X1 + 10 X2 + 4 X3 < 288

Materials Constraint: 2 X1 + 2 X2 + 7 X3 < 200

Product 2 Constraint: X1 < 16

OPTIMAL SOLUTION

Objective Function Value =         483.097

      Variable             Value             Reduced Costs  

   --------------     ---------------      ------------------

         X1                    16.000                   0.000

         X2                    10.839                   0.000

         X3                    20.903                   0.000

  

     Constraint        Slack/Surplus           Dual Prices   

   --------------     ---------------      ------------------

         1                      5.935                   0.000

         2                      0.000                   1.032

         3                      0.000                   0.839

         4                      0.000                   1.129

OBJECTIVE COEFFICIENT RANGES

    Variable       Lower Limit       Current Value     Upper Limit

------------   ---------------    --------------- ---------------

      X1                  7.871              9.000   No Upper Limit

      X2                  2.857             12.000           14.059

      X3                  4.800             10.000           18.750

RIGHT HAND SIDE RANGES

  Constraint      Lower Limit       Current Value     Upper Limit

------------   ---------------    --------------- ---------------

       1                154.065            160.000   No Upper Limit

       2                192.000            288.000          304.727

       3                 70.400            200.000          226.286

       4                  0.000             16.000           30.154

  1. What is the optimal solution?
  1. What is the profit?

  1. If the profit of Product 3 was changed to $20 and the profit of Product 1 was changed $20, would that change the solution?   Provide proof.
  1. If the number of minutes of Machine time was decreased to 155 minutes and the amount of materials were decreased to 170 pounds, would this change the solution? Provide proof.
  1. The Dual Price for Constraint 1 (Machine time) is 4.2. In terms of this problem what does that mean?

Solutions

Expert Solution

(Since there are more than 4 parts i will answer first 4)

a.

The optimal solution is X1 = 0.00, X2 = 4.00 and X3 = 48.00

b.

The optimal profit is 528

c.

Given, the profit of products 1 & 3 are changed to 20 $

The lower and upper limit for objective coefficient ranges of variable X1 are (no limit , 22.2)

coefficient (Profit) for X1 is 20$ which lies in the range (no limit, 22.2)

The lower and upper limit for objective coefficient ranges of variable X3 are (13.5, 36.0)

New coefficient (Profit) for X3 is 20 $ which lies in the range (13.5, 36.0)

we see that both new values lie in the objective coefficient range, new values of Profit would not change the optimal solution values for X1 and X2

d.

Given, number of minutes of machines reduced to 155 min and number of materials decreased to 170 pounds

The lower and upper limit for right hand side ranges of minutes of machines (constraint 1) is (150, 177.5)

New value of 155 min lies in the range (150, 177.5)

The lower and upper limit for right hand side ranges of materials (constraint 3) is (160, 213.33)

New value of 170 pounds lies in the range (160, 213.33)

As, both new values lie in the right hand side range, new values would not change the solution.

P.S. (please upvote if you find the answer satisfactory)


Related Solutions

Given the following linear programming model, answer the questions that follow. You are given the result...
Given the following linear programming model, answer the questions that follow. You are given the result of a computer program. The results are Maximize 9 X1 + 12 X2 + 10 X3 Subject to: Machine Constraint:   3 X1 + 4 X2 + 3 X3 < 160 Labor Constraint:        6 X1 + 10 X2 + 4 X3 < 288 Materials Constraint: 2 X1 + 2 X2 + 7 X3 < 200 Product 2 Constraint: X1 < 16 OPTIMAL SOLUTION Objective Function Value...
Given the following frame, answer the questions that follow. No Ethernet header!
Given the following frame, answer the questions that follow. No Ethernet header!
Linear programming. Solve the following two (2) Linear programming problems (#1 and #2) and then answer...
Linear programming. Solve the following two (2) Linear programming problems (#1 and #2) and then answer question 3: 1.. Solve the following LP problem graphically: Maximize profit =            X + 10Y Subject to:                        4X + 3Y < /= 36                                            2X +4Y < / = 40                                            Y > / = 3                                            X, Y > / = 0 2. Considering the following LP problem and answer the questions, Part a and Part b: Maximize profit =            30X1...
Below given is the linear programming model at a manufacturing firm which produces and sells for...
Below given is the linear programming model at a manufacturing firm which produces and sells for different bags: small bags, medium bags, standard bags, and deluxe bags. DECISION VARIABLES: xi- Number of bags for group i to produce, i=1(small bag), 2(medium bag), 3(standard bag), 4(deluxe bag). OBJECTIVE FUNCTION: Maximize profit, z = 6.5x1 + 7.5x 2 +10x3 + 9x4 CONSTRAINTS: 0.55x1 + 0.6x 2 + 0.7x3 + x4 ≤ 630 (Cutting and dyeing) 0.425x1 + 0.45x 2 + 0.5x3 +...
Given the following Hypothetical Example and the base year is 2017, answer the questions that follow...
Given the following Hypothetical Example and the base year is 2017, answer the questions that follow Given the following Hypothetical Example and the base year is 2017, answer the questions that follow Year X Y Z Nominal GDP Real GDP GDP Deflator Real GDP Growth Inflation Rate Q P Q P Q P 2017 2 2 1 4 4 2 2018 3 3 2 5 5 3 2019 4 4 3 6 6 4 Calculate the nominal GDP in the...
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it...
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it using the MS Excel Solver tool. Shipment Costs ($), Supply, and Demand: Destinations Sources 1 2 3 Supply A 6 9 100 130 B 12 3 5 70 C 4 8 11 100 Demand 80 110 60 (4 points) Volume Shipped from Source A __________ (4 points) Volume Shipped from Source B __________ (4 points) Volume Shipped from Source C __________ (3 points) Minimum...
QUESTION 1: Solve the linear programming model given below using the simplex method. Write the primal...
QUESTION 1: Solve the linear programming model given below using the simplex method. Write the primal and dual results from the optimal table you obtained. MAX Z = 10?1 + 20?2 + 5?3 6?1 + 7?2 + 12?3 ≥ 560 5?1 − 3?2 +   x3 ≤ 100 2000?1 + 1000?2 + 1000?3 ≤ 62298 ?1,?2,?3 ≥ 0 IMPORTANT REMINDER ABOUT THE QUESTION SOLUTION: NEW ORDER CALCULATIONS SHOULD BE WRITTEN DETAILED WHEN CREATING THE SYMPLEX TABLES. WHEN THE CALCULATIONS ARE SHOWED AND...
LECTURE OF THE OPERATIONS RESEARCH I You will randomly generate a linear programming model. • Objective...
LECTURE OF THE OPERATIONS RESEARCH I You will randomly generate a linear programming model. • Objective function should be a maximization problem. • Model must have exactly three decision variables. • Model must have two less-than equality (≤) constraints. Please answer the following parts: a) Take the dual of the primal problem you have on hand. b) Solve the dual problem by using Graphical Solution Procedure. If the dual problem does not have a single optimal solution (or if the...
Given the following linear optimization model, transform this model into the required form and solve using...
Given the following linear optimization model, transform this model into the required form and solve using Solver. Objective function: 8.2? + 7.0? + 6.5? + 9.0? = ??????? ???? Constraints: 6? + 2? + 5? + 7? ≥ 820 ?/? + ? + ? + ? ≥ 0.3 ? + ? ? + ? ≥ 0.2 ? ≥ ? + D Please Use Excel
Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to...
Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to X1 + X2 < 7 // Resource 1 –X1 + 3X2 < 3 // Resource 2 X1, X2 > 0 X1, X2 are integer i. Consider using the Branch and Bound (B & B) technique to solve the ILP model. With the help of Tora software, draw the B & B tree. Always give priority for X1 in branching over X2. Clearly label the...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT