minimize
subjected to
plot on graph
corner points are
(30,0)......2x+5y......=60
(12,6)......2x+5y......=54.......minimum
(5,20)......2x+5y......=110
(0,40)......2x+5y......=200
at point (12,6) function is minimum
minimum cost is 54
2. Minimize: C-2x+5) Subject to: 4x+y 240 2? + ? 230 x+3y 2 30 x20,y20 )...
Quiz: Quiz 2 This Question: 1 pt Minimize the objective function 3x+3y subject to the constraints 2xty 2 13 x+2y 2 14 x20, y20 The minimum value of the function is Simplify your answer.) The value of x is Simplify your answer.) The value of y is Simplify your answer.) Quiz: Quiz 2 This Question: 1 pt Minimize the objective function 3x+3y subject to the constraints 2xty 2 13 x+2y 2 14 x20, y20 The minimum value of the function...
#5. Random variables X and Y have joint PDF 6exp[-(2x+3y)] ,x20, y 20 0 , otherwise x20,y20 (a) Find P[X>Y] and P[X +Y s 1 (b) Find P[ min(x.Y)1] (o) Find P| max(x.y)s1 #5. Random variables X and Y have joint PDF 6exp[-(2x+3y)] ,x20, y 20 0 , otherwise x20,y20 (a) Find P[X>Y] and P[X +Y s 1 (b) Find P[ min(x.Y)1] (o) Find P| max(x.y)s1
Maximize P = 4x + 5y subject to 2x + y < 50 2 + 3y < 75 2 > 0 y > 0 Identify the feasible region as bounded or unbounded: List the corner points of the feasible region, separated by a comma and a space. If the region is unbounded, create appropriate ghost points and list those as well. For each corner point, list the value of the objective function at that point. The format should be (x1,y1)...
II. UU. Solve the linear programming problem by the method of corners. Minimize C = 2x + 3y subject to 4x + y 2 38 2x + y 2 30 x + 3y = 30 * 20, y = 0 The minimum is C = s at (x, y) = Need Help? Watch It Talk to a Tutor
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
30 Minimize 2 = 3α + 4y 3y + 5Σ 6y + 4αΣ Subject to y + Ε ΔΙ ΔΙ ΛΙ ΔΙ ΛΙ 40 8 2 O y O Minimum is at τ = 9-
Minimize f(x,y) = x² + y2 subject to - 4x + 8y = 120. X= y = The value off at the minimum is
Consider the problem of maximizing the function f(x,y)=2x+3y subject to vx +Jy=5 What should be verified first in order to determine if f has a minimum or maximum 8) Consider the problem of maximizing the function f(x,y)=2x+3y subject to vx +Jy=5 What should be verified first in order to determine if f has a minimum or maximum 8)
(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
Maximize and minimize p = 2x − y subject to x + y ≥ 1 x − y ≤ 1 x − y ≥ −1 x ≤ 7, y ≤ 7. Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT (See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Maximize and minimize p = 2x - y subject...