Question

Given the following LP problem formulation and output data, perform the analysis below. Max.    100X1 +...

Given the following LP problem formulation and output data, perform the analysis below.

Max.    100X1 + 120X2 + 150X3 + 125X4

s.t        X1 + 2X2 + 2X3 + 2X4 < 108            (C1)

           

            3X1 + 5X2 + X4 < 120                       (C2)

            X1 + X3 < 25                                      (C3)

X2 + X3 + X4 > 50                             (C4)

OPTIMAL SOLUTION:

Objective Function Value = 7475.000

Variable

Value

Reduced Costs

X1

8.000

0.500

X2

0.000

5.000

X3

17.000

0.000

X4

*A

0.000

Constraint

Slack / Surplus

Dual Prices

1

0.000

*B

2

63.000

0.000

3

*C

25.000

4

0.000

-25.000

            Objective Co-efficient Ranges

Variable

Lower Limit

Current Value

Upper Limit

X1

87.500

100.000

No Upper Limit

X2

No lower limit

120.000

125.000

X3

125.000

150.000

162.500

X4

120.000

125.000

150.000

            Right Hand Side Ranges

Constraint

Lower Limit

Current Value

Upper Limit

1

100.000

108.000

123.750

2

57.000

120.000

No Upper Limit

3

8.000

25.000

58.000

4

41.000

50.000

54.000

  1. Find *A
  1. How much of constraint C2 is used?
  1. In each of the following, calculate the resulting change in the objective function, if possible and show you calculations. If not possible, explain why not.

  1. The obj.func.co-eff of X4 increases from 125 to 135.
  1. The level of C4 decreases from 50 to 42.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Question – a:

The objective function is: 100X1 + 120*X2 + 150*X3 + 125*X4

Here,

X1 = 8

X2 = 0

X3 = 17

X4 = *A

Objective function value = 7475

Putting values in equation:

100*8 + 120*0 + 150*17 + 125*(*A) = 7475

800 + 2550 + 125*(*A) = 7475

125*(*A) + 3350 = 7475

125*(*A) = 7475 – 3350 = 4125

(*A) = 4125/125 = 33

Answer is: *A = 33

Question – b:

Constraint 2 is: 3X1 + 5x2 + X4

Putting values in equation:

3*8 + 0 + 33 = 24 + 33 = 57

Hence, 57 units of Constraint 2 have been used.

Question – c:

1. As the objective coefficient upper limit is 150, increasing it from 125 to 135 wont affect the optimal solution. The current solution will remain optimal.

Objective function will be: 100X1 + 120X2 + 150X3 + 135X4

X1 = 8, X2 = 0, X3 = 17, X4 = 33

Objective function value = 100*8 + 120*0 + 150*17 + 135*33 = 7805

2. The current solution will remain optimal by decreasing the C4 from 50 to 42 as the lower limit is 41. But we wont be able to calculate the objective function value as the shadow price has not been provided.

********

IF YOU HAVE ANY DOUBT, KINDLY COMMENT. I WOULD LOVE TO HELP YOU!!!

IF YOU LIKE THE ANSWER, PLEASE GIVE AN UP-VOTE OR THUMB UP. THIS WILL ENCOURAGE ME TO ANSWER MORE!!

Add a comment
Know the answer?
Add Answer to:
Given the following LP problem formulation and output data, perform the analysis below. Max.    100X1 +...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry...

    The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry store should stock. The objective function measures profit; it is assumed that every piece stocked will be sold.Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions. using excel solver: To what value can the profit on ring increases before the solution would change? LINEAR PROGRAMMING PROBLEM MAX 100X1+120X2+150X3+125X4...

  • Given the following output, what would happen if the coefficient of X2 increased by 1 LINEAR...

    Given the following output, what would happen if the coefficient of X2 increased by 1 LINEAR PROGRAMMING PROBLEM MAX 31X1+35X2+32X3 S.T 1) 3X1+5X2+2X3>90 2) 6X1 7X2+8X3<150 3) 5x1+3X2+3X3120 OPTIMAL SOLUTION Objective Function Value 763.333 Variable Value Reduced 13.333 0,000 10.000 0.000 0.000 10.889 X1 X2 X3 Constraint Slack/Surplus Dual Price 0.000 0.000 23.333 0.778 5.556 0.000 OBJECTIVE COEFFICIENT RANGES Lower Current Upper Limit Value Limit No X1 30.000 31000 Upper Limit No X2 Lower 35.000 36.167 Limit No Limit X3...

  • Interpreting an LP output after solving the problem using the software.                The following linear programming problem has been solved using the software. Use the output to answer the questi...

    Interpreting an LP output after solving the problem using the software.                The following linear programming problem has been solved using the software. Use the output to answer the questions below. LINEAR PROGRAMMING PROBLEM: MAX 25X1+30X2+15X3 S.T.   1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION: Objective Function Value =         4700.000   Variable Value Reduced Costs X1 140.000 0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint Slack/Surplus Dual Prices 1 0.000 1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES: Variable Lower Limit Current Value Upper Limit...

  • Use this output to answer these questions please, I need to understand. Interpreting an LP output after solving the problem using the software. The following linear programming problem has been so...

    Use this output to answer these questions please, I need to understand. Interpreting an LP output after solving the problem using the software. The following linear programming problem has been solved using the software. Use the output to answer the questions below LINEAR PROGRAMMING PROBLEM MAX 25x1+30x2+15x3 ST. 1) 4X1+5X2+8X3<1200 2) 9x1+15X2+3X3c1500 OPTIMAL SOLUTION: Objective Function Value- 4700.000 Variable Value 140.000 duced Costs 0.000 10.000 0.000 x1 x2 X3 0.000 80.000 Slack/Surplus 0.000 0.000 1.000 2.333 2 OBJECTIVE COEFFICIENT RANGES:...

  • I post this question but C, G, and H was not answered...can I have an answer for them please as soon as possible. Interpreting an LP output after solving the problem using the software. The follow...

    I post this question but C, G, and H was not answered...can I have an answer for them please as soon as possible. Interpreting an LP output after solving the problem using the software. The following linear programming problem has been solved using the software. Use the output to answer the questions below LINEAR PROGRAMMING PROBLEM: MAX 25X1+30X2+15X3 1) 4X1+5X2+8X3<1200 2) 9x1+15X2+3X3<1500 OPTIMAL SOLUTION: Objective Function Value- 4700.000 ariabl X1 x2 X3 0s 0.000 10.000 0.000 140.000 0.000 80.000 Less...

  • Sensitivity solution for Problems

    Here is the sensitivity solution for the problem:OBJECTIVE FUNCTION VALUE6850.0000VARIABLEVALUEREDUCED COSTX1100.000000  0.000000X2    0.00000013.000000X3175.000000  0.000000X4    0.000000  2.000000ROWSLACK OR SURPLUSDUAL PRICE2)125.000000    0.0000003)    0.000000    8.0000004)    0.000000−10.000000RANGES IN WHICH THE BASIS IS UNCHANGED:OBJ. COEFFICIENT RANGESVARIABLECURRENTCOEFFICIENTALLOWABLEINCREASEALLOWABLEDECREASEX130.000000INFINITY   2.500000X225.000000 13.000000INFINITYX322.000000   2.000000   2.000000X420.000000   2.000000INFINITYRIGHTHAND SIDE RANGESROWCURRENTRHSALLOWABLEINCREASEALLOWABLEDECREASE2   500.000000INFINITY125.0000003 1200.000000125.000000100.0000004   275.000000  25.000000  35.000000 Based on the Sensitivity report provided, match the best response to the following questions:1. What is the range of optimality for variable x3?2. What is the upper limit of the feasibility region to the RHS of row 3 constraint...

  • 8.) Hungry Birds, Inc. manufactures birdseed.  One variety consists of wheat.  They are trying to determine the optimal...

    8.) Hungry Birds, Inc. manufactures birdseed.  One variety consists of wheat.  They are trying to determine the optimal mix of buckwheat (X1), sunflower (X2), and poppy (X3) (each in lbs.).  Relevant information is provided in the following table. In addition, the final mix is required to contain at least 500 lbs. of poppy.  Also, the total weight of the buckwheat may not exceed the total weight of the sunflower in the final mix. Nutritional Item                        Proportional Content                              Total Requirement                                      Buckwheat     Sunflower       Poppy   Fat                               0.04                0.06                 0.05                       480 Protein                         0.12                0.10                0.10                       1200 Roughage                    0.10                0.15                0.07                       1500 Cost/lb.                       $0.18              $0.10              $0.11      The...

  • The following linear programming problem has been solved by LINDO. Use the output to answer the...

    The following linear programming problem has been solved by LINDO. Use the output to answer the questions. (Scroll down to see all). LINEAR PROGRAMMING PROBLEM MAX 41X1+52X2+21X3 S.T. C.1) 5X1 + 5X2 + 9X3 < 1200 C.2) 11X1 + 14X2 + 5X3 < 1500 END LP OPTIMUM FOUND AT STEP      1         OBJECTIVE FUNCTION VALUE         1)      5795.049 VARIABLE        VALUE          REDUCED COST         X1 0.000 0.217822         X2         74.247 0.000000         X3 92.079 0.000000        ROW   SLACK OR SURPLUS     DUAL...

  • Figure 1 provides the Excel Sensitivity output for the following LP model. 10x1 + 8x2 Max...

    Figure 1 provides the Excel Sensitivity output for the following LP model. 10x1 + 8x2 Max Z= subject to: 31 +2x2 < 24 2x1 + 4x2 = 12 -2x1 + 2 x2 56 X1, X2 > 0 Variable Cells Cell Name $B$13 Solution x1 $C$13 Solution x2 Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 6 0 10 1E+30 0 -12 8 12 1E+30 6 Constraints Cell $D$6 $D$7 $D$8 Name C1 Totals C2 Totals C3 Totals Final...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT