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

[parisse]

Thanks for the pointer.
Please correct me if I'm wrong:
If b is not positive and c is negative, then I should rewrite Ax<=b as -Ax>=B where B=-b is all positive, rewrite max(c*x) to min(C*x) with C=-c, then solve the dual problem with transpose(-A), B'=C=-c, C'=B=-b ?
In other words, translate the call simplex_reduce(A,b,c) to simplex_reduce(tran(-A),-c,-b)?
Probably with a warning in the terminal about solving the dual problem...