Suppose there exists an algorithm that can solve any system of linear inequalities (n variables and m constraints) in T(n, m) time. Then any LP in standard form with n variables and m constraints can be solved in:
a) in time T(n, nm) using the solver directly.
b) in time T(nm, 2(nm)) using the solver.
c) in time T(nm, 2(nm) + 1) using the solver.
d) None of the above.
