The Artificial Basis Method, also known as the Big M Method, is an extension of the Simplex Method used in linear programming to find optimal solutions to linear optimization problems. It introduces artificial variables to address constraints where no obvious initial feasible solution exists