A Simplex Implementation
This was my project in Lori Ziegelmeier’s Computational Geometry class (Math 437) with Caleb Williams.
Together, we implemented the Simplex Method in Python to solve Linear Programs. The implementation can handle conditions with different types of equality (≤, =, ≥). Once we finished our implementation, we used it to analyze a handful of optimization problems, including the Traveling Salesman Problem and a workplace scheduling problem.