The way you describe the system, it is always solvable, and one solution is given by:
$$x_1=0\\
x_{k+1} = \begin{cases}x_k & \text{ if } \rho_{k} = "="\\
x_k+1 & \text{ if } \rho_{k} = "<"\\
x_k-1 & \text{ if } \rho_{k} = ">"\end{cases}$$
You can also see that you could take any tuple $(a_1,a_2\dots a_{n-1})$ of $n-1$ positive numbers, where $a_k=0$ if $\rho_{k-1}="="$, and define
$$x_1=a_1\\
x_{k+1} = \begin{cases}x_k & \text{ if } \rho_{k} = "="\\
x_k+a_{k+1} & \text{ if } \rho_{k} = "<"\\
x_k-a_{k+1} & \text{ if } \rho_{k} = ">"\end{cases}$$
to get an infinite set of possible solutions.