Question

Consider the following linear program Max 3xl +2x2 S.t 1x1 + 1x2 〈 10 3x1 1x2 〈 24 1xl t 2x2< 16 And xl, x2> 0. a) Use Excel Solver to find the optimal solution to this problem. State the optimal values of xl, x2, and Z. b) Assume that the objective function coefficient for xl changes from 3 to 5. Does the optimal solution change? c) Assume that the objective function coefficient for x1 remains 3, but the objective function coefficient for x2 changes from 2 to 4. Does the optimal solution change? d) What are the shadow prices for these constraints? e) What conclusions can you draw about changes to the right hand side of constraint 2? f) Identify the binding and non-binding constraints in this problem and explain

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
Consider the following linear program Max 3xl +2x2 S.t 1x1 + 1x2 〈 10 3x1 1x2...
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
  • MAX X Z = 3X1 + 4x2 s.t 2x1 + 2x2 ≤ 8 1x1 + 2x2...

    MAX X Z = 3X1 + 4x2 s.t 2x1 + 2x2 ≤ 8 1x1 + 2x2 ≤ 6 2x2 ≥ 1 please graph with the optimal solution. Then dual price for the first constraint by adding one. Then dual price for the third constraint adding one. Please also graph these with the same graph showing the new optimal solutions Also please show the iso-z lines for the initial problem.

  • Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤...

    Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤ 5 x1,x2 ≥0 (a) Find the dual (or shadow) prices of the binding constraints (b) Find the dual (or shadow) prices of the binding “dual” constraints.

  • Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...

    Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 A) What is the optimal solution of this LP? Give an explanation. (4,0) (2,3) (0,8) (0,4) (0,6) (3,2) (12,0) B)Which of the following statements are correct for a linear programming which is feasible and not unbounded? 1)All of the above. 2)Only extreme points may be optimal....

  • Max 3x1+2x2 s.t. 6x1+3x2 <=42 3x1+4x2<=36 x1,x2>=0 a) write the dual problem of the above primal...

    Max 3x1+2x2 s.t. 6x1+3x2 <=42 3x1+4x2<=36 x1,x2>=0 a) write the dual problem of the above primal problem and define the physical meaning of the dual objective function and the dual constraints

  • Use the following Management Scientist output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 31X1+35X2+32X3 S.T....

    Use the following Management Scientist output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 31X1+35X2+32X3 S.T. 3X1+5X2+2X3>90 6X1+7X2+8X3<150 5X1+3X2+3X3<120 OPTIMAL SOLUTION Objective Function Value = 763.333 Variable Value Reduced Cost X1 13.333 0.000 X2 10.000 0.000 X3 0.000 10.889 Constraint Slack/Surplus Dual Price 1 0.000 0.778 2 0.000 5.556 3 23.333 0.000 OBJECTIVE COEFFICIENT RANGES Variable Lower Limit Current Value Upper Limit X1 30.000 31.000 No Upper Limit X2 No Lower Limit 35.000 36.167 X3 No Lower Limit 32.000 42.889...

  • Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y...

    Consider the following linear program: Max 2X + 3Y s.t. 5X +5Y ≤ 400 -1X+ 1Y ≥ 10 1X + 3Y ≥ 90 X, Y ≥ 0 a. Use the graphical solution procedure to find the optimal solution. b. Conduct a sensitivity analysis to determine the range of optimality for the objective function coefficients X & Y. c. What are the binding constraints?   d. If the right-hand-side of the binding constraints are marginally increased, what will be the Dual Value?

  • Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3...

    Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c)) are listed below. (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) (c) x Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution. 25

  • Problem 8-02 (Algorithmic) Consider the problem Min 2x2 18X2XY - 18Y58 X 4Y 8 s.t. a....

    Problem 8-02 (Algorithmic) Consider the problem Min 2x2 18X2XY - 18Y58 X 4Y 8 s.t. a. Find the minimum solution to this problem. If required, round your answers to two decimal places. for an optimal solution value of Optimal solution is X Y b. If the right-hand side of the constraint is increased from 8 to 9, how much do you expect the objective function to change? If required, round your answer to two decimal places c. Resolve the problem...

  • Given the following all-integer linear program: (COMPLETE YOUR SOLUTION IN EXCEL USING SOLVER AND UPLOAD YOUR...

    Given the following all-integer linear program: (COMPLETE YOUR SOLUTION IN EXCEL USING SOLVER AND UPLOAD YOUR FILE. BE SURE THAT EACH WORKSHEET IN THE EXCEL FILE CORRESPONDS TO EACH QUESTION BELOW ) ​ Max 15x1 + 2x2​ s. t. 7x1 + x2 <= 23 3x1 - x2 <= 5 x1, x2 >= 0 and integer ​ a. Solve the problem (using SOLVER) as an LP, ignoring the integer constraints. What solution is obtained by rounding up fractions greater than or...

  • Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c...

    Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c)) are listed below. (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) (c) x Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution. 25 Problem 1 (20 pts) Consider...

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