Attempting to solve a linear program using Maxima, but problem unbounded.

Question

As the title says, I'm attempting to use Maxima's minimize_lp(objective,conditions,nonegative=true) to solve a linear program, where the function $z(x_1,x_2,x_3) = 10x_1 + 4x_2 + 5x_3$ is to be minimized with the conditions \begin{align} 5x_1 - 7x_2 + 3x_3 &\geq 50,\\ x_1,x_2,x_3 &\geq 0\,. \end{align} However, I'm getting the Problem not bounded! error as a result, and wondering what the cause of this is. Surely the problem is not unbounded? If it is, is it possible to see it right from the start? I'm really rusty on matrix algebra and have't actually taken a course in optimization methods, so I have no idea what to look for here.

Answer 1

The 'code' for Maxima is

It confirms what I´ve calculated with the Simplex method and wolfram alpha.