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

[HPCarnace]

Hi Anthony.
You can use the program HpPrime TORA like this video (its your example):
Using HP Prime TORA
(sorry for the sound and my English)

Additionally, you can also use the command in HOME:

Quote: funcHPTORA({{"example", 0, 1, 2, 3, 4, 0}, {[[6,5]]}, {{[[2,4]] , 2 , 22}, {[[3,2]], 2, 20}, {[[4,5]], 2, 40}}},3)

But, this is if you have HP Prime TORA installed.
The command has two arguments:
funcHPTORA(Exercise,Method)
Exercise: List with three lists: The first list contains: {ProblemName, IsMaximize?, IsMinimize?, NoVariables, NoConstraints, NoDecimals, ShowFraction?}. The second list contains the objective function as an array. The third list contains the three constraints in list form, where each restriction is of the form: {Array, Sign, Resource}, the sign is 1 for <=, 2 for >= and 3 for =.
Method: 1(all constraints <=), 2(M-method), 3(two-phase method), 4(dual simplex).

The result displays a list with the following elements:

Quote:{"example",6," (optimum)",45.7142857142,"X2","X1","s1",5.71428571429,2.85714285714,6.57142857144}

The first element is the name of the exercise, the second is the number of iterations, the third element shows whether a solution has been found (optimum), no solution was found (not feasible) or when there are multiple solutions. The fourth element is the maximum or minimum value (45.7142857142). The elements that follow are the names of the variables and then the values in the optimal table: X1=2.85714285714, X2=5.71428571429, s1 is "surplus variable" with value 6.57142857144.
I know it's a bit difficult to read the arguments of funcHPTORA, but I was thinking of using that function in new versions of the program for "Integer Linear Programming"