Question

In: Statistics and Probability

Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤...

Consider the following linear programming problem:

Maximize 16X + 14Y
Subject to: 3X + 4Y ≤ 520
3X + 2Y ≤ 320
all variable ≥ 0

The maximum possible value for the objective function is

Solutions

Expert Solution


Related Solutions

Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   Answer ≤ C1/C2  ≤  Answer b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   .......... ≤ C1/C2  ≤  ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1...
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1 + X2 ≤ 8 Constraint A X1 + X2 ≤ 5 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct Z -X1 - 2 X2 =...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to 4x1 + 3x2 > =12 -4x1 - 6x2 =< 12 x2 > =3 x1, x2 > 0 The above linear programming problem: exhibits unboundedness Question 2 Consider the following linear programming Minimize 6x1 + 4x2 Subject to 5x1 + 3x2 =< 15 6x1 + 8x2 > =48 x2 > =6 x1, x2 > 0 The above linear programming problem: exhibits infeasibility
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 13 x ≥ 0, y ≥ 0   The maximum is P = ? at (x, y) = ( ? ),
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A...
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A + 2B ≤ 600, 2A + 4B ≤ 600, 1A + 3B ≤ 420, and A,B ≥ 0. Using Lingo software determine the optimal product mix for this problem? (include Lingo output) Please use excel! Thanks!
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y subject to 3x + 4y ≤ 33 x + y ≤ 9 2x + y ≤ 13 x ≥ 0, y ≥ 0   The maximum is P =  at (x, y)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT