This can be a right triangle
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)
Answer:
Jack traveled 5 miles in 1 hour
Step-by-step explanation:
Answer:
Condition 1: y>0
Condition 2: x+y>-2
Step-by-step explanation:
We are told that we have a set of points in the Cartesian system (i.e. x-y coordinate), so we can define our point as:

We are given two conditions and we want to create a system of inequalities. Now, generally speaking, inequalities are expressions relating mathematical expressions through 'comparison' (i.e. less than, greater than, or less/greater and equal to) usually recognized by
,
,
and
, respectively.
So in our case let set up our inequalities.
Condition 1: the y-coordinate is positive
This can be mathematically translated as
(i.e.
is greater than 0, therefore positive)
Condition 2: the sum of the coordinates is more than -2
This can be mathematically translated as

(i.e. the summation of the two coordinates is greater than -2 but not equal to).
The system of inequalities described by the two conditions is:

6(2x + 5y)
6[2(3) + 5(4)]
6[6 + 20]
6(26)
156
The answer is 156
Hope this helps :)