A new algorithm for solving linear programming problems

linear programming (lp) is one of the most widely-applied techniques in operations research. many methods have been developed and several others are being proposed for solving lp problems, including the famous simplex method and interior point algorithms. this study was aimed at introducing a new method for solving lp problems. the proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.