How to solve a potentially unbounded linear programming problem

I have this LP

I have no idea how to do the linprog when there are variables on the RHS of the constraints.

Is this unbounded?

Is there a way to solve this with matlab?

Answer 1

[Matt J]

Yes, it is solvable. Hint:

a*x+b*y <= c*z

is equivalent to

a*x+b*y -c*z <= 0