a new method for solving linear programming problems

Anew method which does not depend on the simplex method for solving the linear programming (LP) problems is given. The proposed method is based mainly upon solving this problem algebraically using the concept of duality .The important of this method is that we are not based our work on vertex information which may have difficulties as the problem size increases. A simple example is given to clarify the developed theory of this proposed method