Question

Consider the following linear programming problem Manimize $2Y + $5X Subject To 5Y + 10X ≥...

Consider the following linear programming problem

Manimize $2Y + $5X
Subject To 5Y + 10X ≥ 90

Constraint A
3Y + 9X ≥ 48

Constraint B

X, Y ≥ 0

Constraint C

if A and B are the two binding constraints.

a) What is the range of optimality of the objective function?

  Answer ≤ C1/C2  ≤  Answer

b) Suppose that the unit revenues for Y and X are changed to $20 and $45, respectively. Will the current optimum remain the same?

AnswerYesNO that because the new C1/C2 is Answer which is Answerinnot in the range of optimality

c) Suppose that the unit revenue of Y is fixed at c2 = $6. What is the associated range for c1, the unit revenue for x that will keep the optimum unchanged?

   Answer  ≤ C1 ≤  Answer

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to:...
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to: 4X + 4Y ≤ 48 (constraint #1) 2X + 3Y ≤ 50 (constraint #2) 1X + 2Y ≤ 20 (constraint #3) Y ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints) (a) Which of the constraints is redundant? Constraint #____. Justify using the data from the above LP model: ________________________________________________________________________ ________________________________________________________________________ ________________________________________________________________________ (b) Is solution point (10,5) a feasible solution? _____. Explain using...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0 y>=0 (a) Draw the feasible region for the model, but DO NOT draw the objective function. Without graphing the objective function, find the optimal solution(s) and the optimal value. Justify your method and why the solution(s) you obtain is (are) optimal. (4 points) (b) Add the constraint “x+5y>=15” to the Linear Programming model. Is the optimal solution the same as the one in (a)?...
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75...
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75 10X + 6Y ≤ 60 X + Y ≤ 8 X, Y ≥ 0 The optimal value of the objective function is ________. A)59 B)61 C)58 D)60
Solve the following linear programming problem by answering parts give below Max 5x+74 S.T. x≤ 6...
Solve the following linear programming problem by answering parts give below Max 5x+74 S.T. x≤ 6 2x+3y ≤19 x+y ≤ 8 x,y≥0 Y Your solution must include: the coordinates of each extreme point, the optimum solution and the optimum objective function value (10 Marks Question)
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided (same constraints found in problem #3) to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on...
1. Consider the following integer programming problem. Z = 5x + y Subject to: (1) -x...
1. Consider the following integer programming problem. Z = 5x + y Subject to: (1) -x +2y ? 4 (2) x – y ? 1 (3) 4x + y ? 12 a) Solve this problem in Excel b) Solve this problem graphically. Label your optimal point and objective on your plot.
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤ 50 2x + 3y ≤ 120 x ≥ 10 x, y ≥ 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject...
Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject to   3x + 5y ≤ 214 4x + y ≤ 172 x ≥ 0, y ≥ 0    The maximum is P = at (x, y) = .
Consider the following linear programming problem. Maximize P = 4x + 6y + 9z subject to...
Consider the following linear programming problem. Maximize P = 4x + 6y + 9z subject to the constraints    2x + 3y + z ≤ 900 3x + y + z ≤ 350 4x + 2y + z ≤ 400  x ≥ 0, y ≥  0, z ≥  0 Write the initial simplex tableau. x y z s1 s2 s3 P Constant 900 350 400 0
Question 5 options: Consider the following integer linear programming problem: Max Z =       3x +...
Question 5 options: Consider the following integer linear programming problem: Max Z =       3x + 2y Subject to:    3x + 5y ≤ 30 5x + 2y ≤ 28                     x ≤ 8                     x, y ≥ 0 and integer The solution to the linear programming formulation is: x = 4.21, y = 3.47. What is the optimal solution to the integer linear programming problem? State the optimal values of decision variables. x = , y =
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT