Journal of Data Processing Vassil Guliashki, Leoneed Kirilov 11 2 2021 https://doi.org/10.6025/jdp/2021/11/2/41-48 https://www.dline.info/jdp/fulltext/v11n2/jdpv11n2_2.pdf To solve multiple objective convex integer optimization problems, we proposed an interactive population based method in this paper. It is important to increase the speed of the search process for which we have used a heuristic procedure. It helped to detect the non-dominated solutions. We have documented the properties of this method.