Answer:
The answer is -2
Step-by-step explanation:
Hope it helps :)
Answer:
So I (3,0) becomes I' (1,3)
H (5,2) H' (1,1)
G (2,4) G' (2,1)
Step-by-step explanation:
So let's start with I, just count how many times you move to the left then how many times you move up.
UR WELCOME BABEEEE~ <3
Answer:
(x,y)=(0,7.333)
Step-by-step explanation:
We are required to:
Maximize p = x + 2y subject to
- x + 3y ≤ 22
- 2x + y ≤ 14
- x ≥ 0, y ≥ 0.
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.