Solving linear programming problem with mixed type of constraints
You first need to transform this into normal form. Depending on how you learned it, you need to transform all constraints to the form $a\ge b$, or $a\le b$, where in $a$ you have variables and in $b$ only constants.
Transform $=$ into $\le$ and $\ge$ and from there you can easily transform this into normal form