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

[Albert Chan]

(11-05-2023 02:47 PM)Anthony The Koala Wrote:  Using the HP Prime to solve for x and y for all pairwise solving of f1, f2, f3 using
col(RREF([[2 4 22],[3 2 20]]),3) = (9/2, 13/4) , Cost = 173/4 = 43.25
col(RREF([[2 4 22],[4 5 40]]),3) = (25/3, 4/3), Cost = 170/3 = 57.667
col(RREF([[3 2 43.2520],[5 5 40]]),3) = (20/7,40/7) , Cost = 320/7 = 45.71

Since x and y require +ve amounts, therefore the min cost 43.25 when x= 9/2 and y=13/4.

Wrong. min(Cost) is not enough, it need to satisfy *all* constraints.

L3: 4x + 5y >= 40

Point (9/2, 13/4), LHS = 34.25, failed constraint.

Brute force way is going to generate \(\binom{n}{2}\) intersections, most of them not vertices.