1. BruteSolver This class implements brute-force exhaustive search (try all possible bases) to solve LPs. This method solves the std form LP min (c.T * x) s.t. Ax = b, x >= 0 using brute-force exhaustive search (try all possible bases). That is, try all possible basis matrices (i.e. all m-combinations of basic indices) and take best. Parameters: c, A, b (np arrays): specify the LP in standard form Returns: -1 if LP is infeasible or optimal is (±) infinity, else x (np array): solution to the LP class BruteSolver: def solve(self, c, A, b): c,A,b=check(c,A,b) m = A.shape[0] # rank of A indices =