HP50G SIMPLEX Version14b Max Min Pivot Algorithm, multiple/unbounded, unfeasible sol

[Gil]

Version 11

To find a minimum is a special case of the Max problem.
Simple in theory, as you transform the Min problem into a Max, reversing at the end the signs of the found values.
In practical, not that straightforward to implement without error.
Up to versions 9d, and even in version 19d, you might get sometimes a wrong answer for the Min problem, as many parameters had to be very carefully checked and changed accordingly in the different programs.
Just think, for instance, about the convention rule in SIMPLEX :
x <= 10 (in a dictionary Matrix)
does not mean that -infinity < x <= 10,
but rather 0 <= x <= 10,

versus x>= -8,
that means instead, -8 <= x < infinity.

Now the "bugs" are apparently fixed up.

Regards,
Gil