I would like to solve the inequality, $$Ax≥b⟺Ax=b+z,z≥0⟺x=A^{−1}b+A^{−1}z,z≥0$$
$$ z_i = (Ax)_i - b_i, \, \forall i $$, here $A$ is a matrix and $x$ and $b$ are vectors.
Here is a minimal problem that I would like to solve -
$\begin{pmatrix} 2 & 0 \\ 0 & -3 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} \geq \begin{pmatrix} 4 \\ 6 \end{pmatrix}$
Please let me know if something is unclear in my question.
Regarding my prerequisite knowledge, I have a Master's in Engineering. During that time, I did touch on some linear programming concepts like Simplex. Unfortunately, I don't remember much about it.
Yes, I understand that comparing components will lead to scalar equations. Would there be a problem doing that? Can't these scalar equations once again be placed back in Matrix form?
– desert_ranger May 22 '24 at 14:43