Solving linear equations under constraints

Given a matrix equation, \(AX=Y\)

$\begin{bmatrix} a_{11}&a_{12}&\dots&a_{1n} \\ a_{21}&a_{22}&\dots&a_{2n} \\ \vdots&\vdots&\ddots&\vdots\\ a_{m1}&a_{m2}&\dots&a_{mn} \\ \end{bmatrix}\times \begin{bmatrix} x_1\\ x_2\\ \vdots\\ x_n\\ \end{bmatrix}= \begin{bmatrix} y_1\\ y_2\\ \vdots\\ y_m\\ \end{bmatrix}$

with known $A$ and $Y$, and $m\ne n$, give a general method to solve for $X$, such that $0<x_1,x_2,\dots,x_n<1$. Given that for the given equation(s) there is at least one solution under the given constraints. For multiple solutions any one will work (or maybe the one with least square after dealing with the constraints).

Additional constraints: Also consider the case of $m=n$, and that $A$ can be singular. Also assume, if necessary, $m<n$ and/or $m=1$ (ie. a single linear equation with multiple variables).

My approach: I already know about pseudoinverse and how to use them, but the problem with them is that they returns values outside the range. Consider with $A=\begin{bmatrix} 1&2&3 \end{bmatrix}$ and $X=\begin{bmatrix} 0.8\\ 0.9\\ 0.8 \end{bmatrix}$

What would be a good approach?