linear programming/feasible region - constraints

[dogs danglies]

if the feasible region points are:
y= x + 3
y = 3 - x
y = 4x - 12

what options represent constraints on the problem?

y - 4x (equal or more than) -12
y - 4x (less than or equal to) -12
4x = y (equal or more than) 12
4x = y (less than or equal to) 12
y - x (less than or equal to) 3
y - x (equal or more than) 3
x = y (equal or more than) 3
x = y (less than or equal to) 3

I can`t for the life of me work these out

cheers guyz.

[opus]

What do you really need?

The first 3 define lines, if you plot them you will find they intersect each other to form a triangle. Are you looking for that region?

And for the contstraints, you have to recheck them , what's the meaning of

4x = y (equal or more than) 12

The first two constraints

y - 4x (equal or more than) -12
y - 4x (less than or equal to) -12

are just a variantion of equation 3

y>=4x-12
and
y<=4x-12
If you're looking for the above mentioned triangle, you see that the triangle is above the line of that equation, so only values that fullfil y>=4x-12 are in the triangle.
The contstraints 5and 6

y - x (less than or equal to) 3
y - x (equal or more than) 3

that's
y<=3-x and y>=3-x

The triangle is below that line, so only those values that fullfill y<=3-x are in the triangle.