Answer:
<h2>-8 < x < 2</h2>
Step-by-step explanation:

Answer:For all the corner points, the maximum is at point (1, 3)
From the graph of the constraints, the corner points of the feasibility region are (0, 0), (0, 10/3), (1, 3), (2, 0)
For (0, 0): p = 0 + 2(0) = 0
For (0, 10/3): p = 0 + 2(10/3) = 20/3 = 6.67
For (1, 3): p = 1 + 2(3) = 1 + 6 = 7
For (2, 0): p = 2 + 2(0) = 2
Therefore, solution = (1, 3)
The line equation is Y= - 1/2x +4
Answer:
-2
Step-by-step explanation:
Hope you do well on your assignment!
The sample space is:
(1, 1); (1, 2) - sum of 3; (1, 3); (1, 4); (1, 5) - sum of 6; (1, 6);
(2, 1) - sum of 3; (2, 2); (2, 3); (2, 4) - sum of 6; (2, 5); (2, 6);
(3, 1); (3, 2); (3, 3) - sum of 6; (3, 4); (3, 5); (3, 6) - sum of 9;
(4, 1); (4, 2) - sum of 6; (4, 3); (4, 4); (4, 5) - sum of 9; (4, 6);
(5, 1) - sum of 6; (5, 2); (5, 3); (5, 4) - sum of 9; (5, 5); (5, 6);
(6, 1): (6, 2); (6, 3) - sum of 9; (6, 4); (6, 5); (6, 6)