Consider the following linear programming problem.
Maximize p = 5x + 7y subject to the constraints
3x + 8y ≤ 1
4x - 5y ≤ 4
2x + 7y ≤ 6
x ≥ 0, y ≥ 0
Write the initial simplex tableau.
1. -18 points TanFin11 4.1.002. Consider the following linear programming problem. Maximize P 4x + 7y subject to the constraints -2x -3y 2-18 (a) Write the linear programming problem as a standard maximization problem. MaximizeP subject to s 12 s 18 (b) Write the initial simplex tableau Constant 12 18 0 Submit Answer Save Progress
Solve the linear programming problem by the simplex method. Maximize P = 5x + 4y subject to 3x + 5y 78 4x + y 36 x 0, y 0 x = y = P =
Please answer both 4. 0-2 points TanFin1 14.1.022 Solve the linear programming problem by the simplex method. Maximize P 12x + 9y subject to x+ys 12 3x ys 30 10x + 7y 70 x 20, y 20 The maximum is P at (x, y)- Submit Answer Save Progress 5. -12 points TanFin11 4.1.028. Solve the linear programming problem by the simplex method. Maximize P2z subject to 2x y + zs 12 4x +2y 3z s 24 2x + 5y 5z...
28.If a linear program is in standard maximum form, which of the following can be a constraint? 3x+5ys-5 x+y-4 7x+12y 2 0 2x-4ys9 4x-8y 2 1 ONone of the above. 29.A certain number of steps of the simplex method results in the following simplex tableau. 0 3 20 0 1 0 0 0 2 7 0 1 0 13 4 0 0 5 8 0 0 20 0 0 1 2 3 0 1 93 What is the next step...
-/2 POINTS MY NOTES ASK YOUR TEACHER Solve the following linear programming problem. Restrict x 20 and y 2 0. Maximize f = 3x + 4y subject to x + y s 9 2x + y s 14 y s6. (x, y) = ( ) -/2 POINTS MY NOTES ASK YOUR TEACHER Solve the following linear programming problem. Restrict x 2 0 and y 2 0. Minimize g = 6x + 8y subject to the following. 5x + 2y >...
(9 pts) 3. Solve the linear programming problem graphically. Minimize c = 2x - 5y, subject to (x + y 510 3x - y 26. x20,20 (3x + y 55 (9 pts) 4. Use the simplex method to maximize p= 2x+y, subject to <x+2y52. x 20, y20
Solve the following linear programming problem graphically: Maximize Z=4X₁+4X₂, Subject to: 3X₁ + 5X₂ ≤ 150 X₁ - 2X₂ ≤ 10 5X₁ + 3X₂ ≤ 150 X₁, X₂ ≥ 0 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints. 2) Using the point drawing tool, plot the five corner points which define the feasible region. The optimal solution is X₁ = _______ and X₂ = _______ (round your responses to two decimal places). Maximum profit is $_______
Graphical Method of Linear Programming 3. Find the minimum value of the objective function z = 5x + 7y, where x = 0 and y 0, subject to the constraints a. 2x + 3y 26 b. -x + y S4 c. 3x-y = 15 d. 2x + 5y = 27.
both questions require different ways of solving. Solve the linear programming problem graphically. Minimize c= 2x–5y, subject to (x+ y = 10 {3x – y 26 (x20, y20 (3x + y = 5 Use the simplex method to maximize p = 2x + y, subject to {x+2y 2 . x>0, y20
The final simplex tableau for the linear programming problem is below. Give the solution to the problem and to its dual. Maximize 6x+ 3y subject to the constraints 5x+ ys 60 3x+ 2y s 50 x20, y20 x 1 0 4 0 10 0 10 1 90 For the primal problem the maximum value of M 11 which is attained for xD yL For the dual problem the minimum value of M is , which is attained for u-L Enter...