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

[Anthony The Koala]

Dear all,
This is a learning experience.

To jte thank you for alerting me to "The HP Prime doesn't currently have a built-in app for handling constrained optimization"

To Albert Chan,
Since the HP Prime does not do constrained optimisation, I work out the minimum cost by the following.using the info:
Cost 6x + 5y
(1) 2x + 4y = 22
(2) 3x + 2y = 20
(3) 4x + 5y = 40
x >= 0, y >= 0
Work out the corner points for (1), (2 ) and (3) and when x = 0, y = 0
When x = 0. f(1)(0,y) = 22/4.ie (0,22/4), Cost = 22
f(2)(0,y) = 10 ie (0,10), Cost = 20
f(3)(0,y) = 8 ie (0, 8), Cost = 40
y = 0 f(1)(x,0) = 11 ie (11,0), Cost = 66
f(2) (x,0)= 6.6666, Cost = 40
f(3)(x,0) = 10, Cost = 60
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.

I stand to be corrected on this.

Thank you
Anthony, Sydney