This thesis presents a non edge-following algorithm for solving linear programming problems. Unlike simplex algorithm, this algorithm requires as its initial solution a dual feasible solution which is not necessarily a basic solution. Convergence condition of this algorithm is investigated. Perturbation method as a resolution of cycling is developed. Results of test runs with 25 randomly generated problems are presented.