Jia, Wei; Yong, Longquan; Li, Na Initial point selection in primal-dual interior point method for linear programming based on evolutionary algorithm. (Chinese. English summary) Zbl 1463.90147 J. Nanjing Univ. Aeronaut. Astronaut. 52, No. 2, 334-340 (2020). Summary: 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 realized 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. MSC: 90C05 Linear programming 90C51 Interior-point methods Keywords:linear programming; primal-dual interior point method; initial point selection; evolutionary computation; harmony search PDFBibTeX XMLCite \textit{W. Jia} et al., J. Nanjing Univ. Aeronaut. Astronaut. 52, No. 2, 334--340 (2020; Zbl 1463.90147) Full Text: DOI