Simplex method in prime how to use the constrains maximise s.t. constraints.

[Gil]

Another case, with no max
. [[ 2 -3 'L' 4 ]
[ 5 -3 'G' 100 ]
[ 1 1 0 'Max' ]] { :'
Sol
' is 
no 

Max

!
: ŸUnbound.SolŸMax Var†2¦Steps†4 Time†1¦s :


Z-Max
: 52 :x1: 32 :x2: 20 :
as only 
positive
 Val: in.Col¦2¦final.STEPS :
Or not? SIMPLEX 
Sol 
i: [ 32 20 ] } }