Question

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 PRICES
      C.1)         0.000 0.336
      C.2)         0.000 3.594
NO. ITERATIONS=       1
RANGES IN WHICH THE BASIS IS UNCHANGED:
                           OBJ COEFFICIENT RANGES
VARIABLE         CURRENT        ALLOWABLE        ALLOWABLE
                   COEF          INCREASE         DECREASE
       X1       41.000000         0.217822 INFINITY
       X2       52.000000   6.800000   0.297299
       X3       21.000000 72.59999 1.466675
                           RIGHTHAND SIDE RANGES
      ROW         CURRENT        ALLOWABLE        ALLOWABLE
                    RHS          INCREASE         DECREASE
      C.1     1200.000000      1500.000000   664.285706
      C.2     1500.000000      1140.000000       833.333313


c. What is the dual price for the first constraint? What interpretation does this have? (5 points)
d. Over what range can the objective function coefficient of X2 vary before a new solution point becomes optimal? (5 points)
e. By how much can the amount of resource constraint 2 decrease before the dual price will change? (5 points)
f. What would happen if the first constraint's right-hand side decreased by 200 and the second's increased by 400? (5 points) Hint: Perform the 100% rule test.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

The information provided has some structural issue. Hence, obtained the output again on Lindo. Based on this we will answer the questions posted.

c.

Dual price for first constraint is 0.336

d.

The optimality range for X2 shows to have an allowable increase of 6.8 and allowable decrease of 0.297299. This means the range is from (52-0.297299) to (52+6.8).

Range: From 51.702701 to 58.8

e.

The feasibility range for constraint 2 has allowable increase of 1140 and allowable decrease of 833.33. This means the range is from (1500-833.33) to (1500+1140).

Range: From 666.67 to 2640

Beyond this, the dual prices will change.

f.

Using 100% rule test we see that

200/664.28 + 400/1140 = 0.65

This means that it is within the 100% range and thus the dual prices of the constraints will impact the objective function value.

Total impact will be -200*0.336 + 400*3.594 = 1307.4

The new objective function value will be 1307.4 + 5795.049 = 7165.449

Add a comment
Know the answer?
Add Answer to:
The following linear programming problem has been solved by LINDO. Use the output to answer the...
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
  • 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...

  • 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...

  • 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:...

  • 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...

  • 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...

  • 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 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...

  • Exercise 2 Linear Programming 1.         The Scrod Manufacturing Co. produces two key items – special-purpose Widgets...

    Exercise 2 Linear Programming 1.         The Scrod Manufacturing Co. produces two key items – special-purpose Widgets (W) and more generally useful Frami (F). Management wishes to determine that mix of W & F which will maximize total Profits (P). Data                                                                      W      F             Unit profit contributions                     $ 30   $ 20             Demand estimates (unit/week)               250      500             Average processing rates – each product requires processing on both machines (units/hour)                                     Machine #1                        2          4                                        Machine #2                ...

  • 3 Gepbab Production Company uses labor and raw material to produce three products. The resource requirements...

    3 Gepbab Production Company uses labor and raw material to produce three products. The resource requirements and sales price for the three products are as shown in Table 10. Currently, 60 units of raw material are available. Up to 90 hours of labor can be purchased at Sl per hour. To maximize Gepbab profits, solve the following LP: max z = 6X1 + 8X2 + 13X3 - L s.t. 3X1 + 4X2 + 6X3 - LS 0 2X1 + 2X2...

  • Consider the following linear programming problem Manimize $45X1 + $10X2 Subject To 15X1 + 5X2 2...

    Consider the following linear programming problem Manimize $45X1 + $10X2 Subject To 15X1 + 5X2 2 1000 Constraint A 20X1 + 4X2 > 1200 Constraint B X1, X2 20 Constraint C if A and B are the two binding constraints. a) What is the range of optimality of the objective function? 3 C1/C2 s 5 b) Suppose that the unit revenues for X1 and X2 are changed to $100 and $15, respectively. Will the current optimum remain the same? NO...

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