includes different exercises to test the simplex algorithm against
searches for the least positive coefficient in the objective function
searches for the smallest ratio of the right-hand side of the constraints and the column of the entering variable
starts pivoting and row operations using row & column from the pivot element found in entering & departing
prints solution to command window and outputs all variables and the optimum value as a 1xN vector
performs simplex algorithm by calling external functions as function handles:
- entering
- departing
- pivot
- findOptimalSolution