eng International Academy of Ecology and Environmental Sciences Computational Ecology and Software 2220-721X 2026-12-1 16 4 273 286 1 article Muhammad Tlas 1 2 Scientific Services Department, Atomic Energy Commission, P. O. Box 6091, Damascus, Syria An interior point algorithm to solve single objective linear programming problems has been proposed in this paper. The method uses the projection operation of the gradient of the objective function onto the null space of the feasible region in order to generate, at each iterate, an interior search direction. It can be taken an interior step from the current iterate to the next one along this feasible direction. During the execution of the algorithm, a sequence of interior points will be generated. It has been proved that this sequence converges to an e-optimal solution, where e is a predetermined error tolerance known a priori. Numerical single objective linear optimization problems of different kinds, feasible, infeasible and unbounded are illustrated using this algorithm. http://www.iaees.org/publications/journals/ces/articles/2026-16(4)/projective-scaling-method.pdf linear programming linear optimization projection operation Interior point method scaling algorithm