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

[Albert Chan]

(11-17-2023 10:45 PM)ftneek Wrote:  I understand that for that problem you are saying there are 4 terms to the 'complete' solution. But I still don't understand where the last 2 terms are coming from, what they represent, or how they contribute to the solution.

Simplex algorithm solve A * S ≤ B
General   solution  solve A * X = 0
Complete solution:  A * (S+X) ≤ B