Simplex method for solving linear programming problems

Solves a linear optimization problem specified in an extended symmetric form (the objective function can be directed to both the maximum and the minimum; all constraints are specified as inequalities)

Enter the number of variables

Enter the number of restrictions