feasible region

[xD_aQt]

how does it actually work
like how would you decide which region to shade
whether its the top or bottom half 
any help would be appreciated

[Hutchoo]

Maybe this will help :S?

[jasoN-]

Well firstly, you'd need to draw in the missing inequality (y=x/3)
given y>x/3, it must be above this line (and including)
given y<x/2, it must be below this line (and including)
given y<24-x, it must be below this line (and including)
must be above lines x>0 and y>0 (and including)

If you're still not convinced about your answer, sub in a 'test' point that is 'obviously' inside the region
Try (10,4) in each inequality, it will satisfy all inequalities

[xD_aQt]

so if the test point is inside the region, then its part of the feasible region right?

[jasoN-]

yes (this is just a method to test if you were indeed right, it's not working out or anything)

[xD_aQt]

okay