Question

In: Operations Management

Solve the following problem using both graphical method and Simplex tableau Maximize f(x,y)=5x+4y subject to 3x+5y<=180...

Solve the following problem using both graphical method and Simplex tableau

Maximize f(x,y)=5x+4y subject to 3x+5y<=180 where 28 => x => 0 and 30=> y=>0

Solutions

Expert Solution

Graphical method

Graphical representation of constraints and objective function is following:

Feasible region is the shaded region, bounded by corner points as highlighted on the graph

Corner points are: (28,0), (28,19.2), (10,30), (0,30)

Determine objective function value f(x,y) at each of the corner points:

x y f(x,y)
28 0 140
28 19.2 216.8
10 30 170
0 30 120

Maximum objective function value is 216.8 at corner point (28,19.2)

Therefore, optimal solution is:

x = 28

y = 19.2

Objective function value = 5*28+4*19.2

= 216.8

------------------------------------------------------------------------------------------------

Simplex tableau


Related Solutions

Maximize / minimize f(x,y) = 3x+4y subject to x^2 + y^2 = 25
Maximize / minimize f(x,y) = 3x+4y subject to x^2 + y^2 = 25
Maximize objective function P=3x+4y subject to: x + y ≤ 7 x ≥ 0 x+4y ≤...
Maximize objective function P=3x+4y subject to: x + y ≤ 7 x ≥ 0 x+4y ≤ 16 y ≥ 0
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)
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)
solve using method of undetermined coefficients. y''-5y'-4y=cos2x
solve using method of undetermined coefficients. y''-5y'-4y=cos2x
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
Solve the following initial value problem. y(4) − 5y′′′ + 4y′′  =  x,    y(0)  =  0, y′(0)  ...
Solve the following initial value problem. y(4) − 5y′′′ + 4y′′  =  x,    y(0)  =  0, y′(0)  =  0, y′′(0)  =  0, y′′′(0)  =  0.
Solve the minimum problem using the duality principle. Minimize subject to z = 3x + 4y...
Solve the minimum problem using the duality principle. Minimize subject to z = 3x + 4y x + y ≥ 3 2x + y ≥ 4 x ≥ 0, y ≥ 0
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 21 3x + 2y + 4z ≤ 36 2x + 5y − 2z ≤ 15 x ≥ 0, y ≥ 0, z ≥ 0
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 56 3x + 2y + 4z ≤ 96 2x + 5y − 2z ≤ 40 x ≥ 0, y ≥ 0, z ≥ 0   The maximum is P =  at (x, y, z) =
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT