The primal-dual interior point method requires strict initial feasible points in solving linear programming problems. The degree function is given based on the criterion of the initial feasible point in the primal-dual interior point method, and the fitness function in the evolutionary algorithm is designated by the degree function. The initial feasible point selection of the primal-dual interior point method for linear programming based on the evolutionary computation is proposed. It is taken by the harmony search. Numerical experiments show that the algorithm can find an initial feasible point of most given problems, thus validating the effectiveness of the algorithm.