# Show that x is primal feasible

I have one exercise asking me to show that $x*=(3/2,1)$ is primal feasible for the linear programming problem: $$max 3x_1 +2x_2$$ $$2x_1+x_2 \leq 4$$ $$2x_1+3x_2 \leq 6$$ I can see that it fulfill the constraints. But is there any other method to show so? And also is it optimal solution?

EDIT:

The question now is: Is $x^*$ optimal?

• Hint: Where there's a primal, there's a dual. – Sean Roberson Apr 19 '17 at 20:05
• yeah I know, the dual feasible is y=(5/4,1/4).. – MZ97 Apr 19 '17 at 20:24
• Also help :)))) – MZ97 Apr 20 '17 at 21:12