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

[Gil]

Therefore, 1 single Input Arg:
your System MATRIX
as an array [m+1 rows × n+2 columns], with

m Inequations /Equations Rows
(for a total of m+1 rows)
Row i <=Ci, Ci free
or Row i >=Ci, Ci free
or Row i = Ci, Ci free
And Row i "free" when referring to xi free (>=0 or <=0)

& 1 last row for Z-Max/Min,
with eventual Constant C
of the Z-function at column n+1 (not n+2)

n Var xi
(for a total of m+2 columns)

xi <=Ci, Ci free
or xi >=Ci, Ci free
or xi = Ci, Ci free
or xi free: -infinity < xi < infinity

With
signs >= (here 'G', G for Greater), <= (here 'L', L for Less)
= (here 'E', E for Equal) and 'F' (for Free Variable)
to be placed at column n+1

&
Ci values
to be placed at last column n+2

And run —>GO

At 1st question further, reply:
1 for MAX
or 0 for MIN
& press ENTER.

Press, 5 times ENTER (or 1/0 & ENTER) to the next five questions and wait for the results,

Solution
saved under SOL variable (first menu page), appear automatically.
Further results are also saved & to be found at first or 2nd menu page: a) at 1st page, S.1-N, S.LIN & d.LIN (new name instead of previous d.EXT); and, at 2nd page now, old variables of previous versions, ie. transformation of (added) variables, under SLACK.beta,
resulting values /feasibility for the m inequations, under RESULT¦Ci.rows (normally, with the last correction in version 9, the result should always be in order), &
intermediate calculations, under STEPS.