The simplex algorithm can be easily performed in TI Nspire CX and also in the TI-84 series. A program is created to provide an intuitive means to construct the initial tableau.

The function prototype takes two arguments, one for a list of expression consisting the constraint inequalities plus the function to maximize (assumed to be the last in the list), and another argument to specify the number of variables. The variables in the inequalities must be named as x[n] where n is a number starting from one.

Example of the usage of this program showing how the inequalities are set up.

The program makes use of some string functions, the expr and polyCoeffs functions and also indirection to extract the coefficients in the inequalities and to build the initial tableau matrix.

Graphical representation of the example above.

### Like this:

Like Loading...

*Related*