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

[Gil]

When in presence of a free variable, the program transforms it systematically into two variables xia and xib, both >= 0, defining xi = xia - xib (transforming back again, for the final SOL variable at the very end of the program execution, xia - xib —>xi).

Now, for better comprehension of the decision steps, that definition is given at the beginning of the STEPS variable when dealing with free variables xi; for clarity, the same applies to SLACK.BETA variable

Regards