I have some LP problem and I'm willing to solve it (this is an exercise from some optimization-related book).
Now, Mathematica tells me that the problem is unbounded and I want to make a generic proof of that.
What would be the easiest way to prove that the selected linear optimization problem is unbounded (and obviously, doesn't have an exact solution?).
LinearProgramming[ {1, 2, 1, -1, 0}, {{0, 10, 1, 2, 3}, {-1, 5, 1, 1, 1}, {2, -1, 1, -3, 0}}, {{25, 0}, {10, 0}, {6, -1}}, {{-Infinity, Infinity}, {0, Infinity}, {0, Infinity}, {-Infinity, Infinity}, {-Infinity, Infinity}}, Method -> "RevisedSimplex"]