Evolutionary programming for IP/MIP problems with linear constraints

In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed and accuracy in IP/MIP problems.