Implementation of the simplex algorithm, a classical algorithm in linear optimization. Able to detect unbounded and infeasible datasets. Able to perform the two-phase simplex algorithm.
Working directory must obtain the following three files:
- A.csv - matrix representing system coefficients
- b.csv - vector representing system constraints
- c.csv - vector representing objective function
- How to use NumPy
- parse a .csv file using NumPy
- perform common vector/matrix operations