We have developed a DNA Memory called NPMM with over 10 million (16.8M) addresses. The data embedded into a unique address was correctly extracted through addressing processes based on the nested PCR. In this paper, the addressing process of NPMM was modeled by using the combinatorial optimization problem in order to discuss the limitation of the scaling-up problem of NPMM.