The study is about developing a class of line search exchange algorithm for solving linear programming problem using an experimental design procedure. The new algorithm, namely, minimum exchange algorithm has been developed and a first necessary condition for the existence of an optimizer of a linear programming problem has been obtained. This algorithm has been shown to converge. Numerical illustration and comparison show that the algorithm compares favourably with the simplex method for solving linear programming problems.