A novel approach for solving the DEA linear programming problems using a primal-dual interior-point method is presented. The solution found by this method satisfies the Strong Complementarity Slackness Condition (SCSC) and maximizes the product of the positive components among all SCSC solutions. This first property is critical in the use of DEA and the second one contributes significantly to the reliability of the solution.