Given:

A B >= 0
3 -2 >= 0 >= to the right or above
2 -1 <= 200 <= to the left or below
1 0 <= 150

Find
The feasible region for the set of constraints
Solution:
intercepts A B
0 0
0 0
0 -200
100 0
0 0
150 0

A 3 -2 >= 0
B 1 0 <= 150

A 150 #VALUE!
B 225 #VALUE!

A 3 -2 >= 0
B 2 -1 <= 200

A 400
B 600

A 2 -1 <= 200
B 1 0 <= 150

A 150
B 100

Corner Points (Points that bound the feasible region)

A B
150 225
400 600
150 100