maximize p = 3x + 2y subject to −1x+y≥15 x+2y≤17 x ≥ 0, y ≥ 0 p=? (x,y)=?
But this solution is not feasible
because the final solution violates the 1st constraint
- x + y ≥ 15.
and the artificial variable A1 appears in the basis with positive
value 13/2.
Maximize the objective function 3x + 5y subject to the constraints. x + 2y = 32 3x + 2y = 36 X58 X20, y20 The maximum value of the function is The value of x is The value of y is
2. Solve: (1x)'-2y-(x-1)y subject to IC: y(0) 1
Solve the linear programming problem by the method of corners. Maximize P = 3x - 2y subject to x + 2y s 50 5x + 4y s 145 2x + y 2 25 y 29, x 20 The maximum is P = at (x,y) =(
p x + y+ 2z Subject to x+ 2y + 2z 60 2x +y + 3z 60 +3y+ 6z s 60 Maximize x, y,z 2 0 p x + y+ 2z Subject to x+ 2y + 2z 60 2x +y + 3z 60 +3y+ 6z s 60 Maximize x, y,z 2 0
Maximize p = 3x + 6y + 3z + 6w + 3v subject to x + y ≤ 3 y + z ≤ 3 z + w ≤ 9 w + v ≤ 12 x ≥ 0, y ≥ 0, z ≥ 0, w ≥ 0, v ≥ 0. p = (x,y,z,w,v)=
(3x + y 55 (9 pts) 4. Use the simplex method to maximize p= 2x + y, subject to <x+2y 52 x 20,y20
Maximize Z = 3X + Y subject to the following constraints: 12X + 14Y ≤ 85, 3X + 2Y ≤ 18, Y ≤ 4. Which of the following extreme points yields the maximum value? Select one: a. X = 2.416, Y = 4 b. X = 6, Y = 0 c. X = 0, Y = 4 d. X = 4.556, Y = 2.1667
L.P. Model: 20- Maximize Subject to: 18- Z= 2X + 8Y 1X + 2Y = 6 5X + 1 Y = 20 X,Y 20 (C1) (C2) 16- 14- On the graph on right, the constraints C, and Cy have been plotted. 12- Using the point drawing tool, plot the four corner points for the feasible area. 10- 8- 6- 4- 2- 0- 0 2 4 6 00- 12 14 16 00 20 10 X
Solve the following linear programming problem. Maximize: z = 6x + 2y subject to: 3x-y s 16 2x + y214 x 24 ys9 The maximum value is (Type an integer or a simplified fraction.) The maximum occurs at the point (Type an ordered pair. Type an integer or a simplified fraction.)
QUESTION 15 3 p The objective of a linear programming problem is to maximize 1.50X + 1.50Y, subject to 3X + 2Y = 600, 2X +4YS 600, and X,Y 2 0. What is the optimal (best) value of the objective function, subject to the constraints and rounded to the nearest whole number? 225 300 338 425 500