Solve this linear programming problem using the simplex method. (Suggestion: Use the row operations tool in decimal mode. Your answers probably will not come out as round numbers, but enter all answers accurate to at least 2 decimal places.) Minimize C = 2x + 3y subject to these constraints: 3x + 2y ≥ 12 10x + 10y ≥ 53 2x + 5y ≥ 14 x ≥ 0 , y ≥ 0 The minimum value for C = this occurs when x= and y = If u, v, and w are the names for the slack variables used in the three constraints (u in the first constaint, v in the 2nd constraint, and w in the 3rd), then give the values for u, v, and w corresponding to the optimal corner point which produces the minimum value of C. u= v= w=
Solve this linear programming problem using the simplex method. (Suggestion: Use the row operations tool in decimal mode. Your answers probably will not come out as round numbers, but enter all answers accurate to at least 2 decimal places.)
Minimize C = 2x + 3y subject to these constraints:
3x + 2y ≥ 12
10x + 10y ≥ 53
2x + 5y ≥ 14
x ≥ 0 , y ≥ 0
The minimum value for C =
this occurs when x= and y =
If u, v, and w are the names for the slack variables used in the three constraints (u in the first constaint, v in the 2nd constraint, and w in the 3rd), then give the values for u, v, and w corresponding to the optimal corner point which produces the minimum value of C.
u=
v=
w=
Please answer very soon will give rating surely
Step by step
Solved in 5 steps