Answer:
1). t ≥ -
2). k ≥
3). y < -
4). b >
5). w ≤ 0
Step-by-step explanation:
1).
t ≥ -
2). 15k + 11 ≤ 18k - 5
15k - 18k ≤ -5 - 11
-3k ≤ - 16
3k ≥ 16
k ≥
3). 44y > 11 + 88y - 22y
44y > 11 + 66y
44y - 66y > 11
-22y > 11
22y < -11
y <
4).
(b - 27) >
b >
b >
5). 11w - 8w ≥ 14w
3w - 14w ≥ 0
-11w ≥ 0
w ≤ 0
Answer:
(x,y)=(0,7.333)
Step-by-step explanation:
We are required to:
Maximize p = x + 2y subject to
The graph of the lines are plotted and attached below.
From the graph, the vertices of the feasible region are:
At (0,7.333), p=0+2(7.333)=14.666
At (4,6), p=4+2(6)=4+12=16
At (0,0), p=0
At (7,0), p=7+2(0)=7
Since 14.666 is the highest, the maximum point of the feasible region is (0,7.333).
At x=0 and y=7.333, the function p is maximized.
