How to find feasible points without optimization

Find a feasible points from the following set of inequalities by using dual simplex method: $$2x_1+3x_2 \le12$$ $$-3x_1+2x_2\le- 4$$ $$3x_1 -5x_2\le2$$ $$x_1 ~~\text{is in }~\mathbb R,~ x_2\ge0$$

I've never faced this kind of problem where there is no $$~max~Z~$$ or $$~min~Z~$$.

I've searched wiki and stack and books also but cant get any help from those.

• Hint: objective function can be $0$. – Robert Israel Sep 4 '19 at 17:56