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

[ftneek]

(11-11-2023 12:39 PM)Albert Chan Wrote:  There is no reason to assume constraints have positive coefficients.
Instead of (3x+2y+z ≤ 10), we do (-3x-2y-z ≤ -10), it does not work.

> simplex([[-3,-2,-1,1,0,-10],[2,5,3,0,1,15],[-2,-3,-4,0,0,0],[0,0,0,1,1,0]])

["No Solution: empty feasible region (w ≠ 0)",[], ...]

If you multiply the constraint by -1, you should flip the inequality. Thus you should use (-3x-2y-z >= -10)