Simplex Method Implementation

This project implements the simplex method algorithm for solving linear programming problems. The application takes user input for objective function coefficients, constraint coefficients, and right-hand side values, then performs the simplex iterations to find the optimal solution. It displays the initial tableau and shows each step of the pivot operations leading to the optimal solution.