Simplex Optima app analytics for January 8

The general form of an optimization problem comprises a linear function of variables, also called "objective function" and a number of constraint inequalities. The app can facilitate a maximisation as well as minimisation problem bearing up to 7 variables and up to 6 contraint inequalities. The solution algorithm is implemented by constructing and manipulating the Simplex tableau before calculating the parameters for which the maximum value of the objective function is obtained.