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

[Gil]

Version 9
- Bugs corrected for linear dependencies.
- Loop added in case of wrong "choice" in column/row
when supplementary step executed for zero value in last, final Matrix row relative to the objective fonction.
- Output improved.


Note
- When solutions are not a linear combination of the variables xi,
& if the given solution SOL (at first menu page)
is of the kind Sum (lambda i × solution i),
with 0<=lambda<=1 & sum (lambda i) = 1,
then it will present a minimum of two particular solutions : main solution 1
& main solution 2, but not always all the possible other solutions (such as lambda 3 × solution 3, lambda 4 × solution 4, etc.).
- For linear combination of the variables xi, when corresponding option is selected,
the given solution under S.LIN & d.LIN (both at 1st menu page) are always exhaustive.