Mining erasable patterns from a database are for applying resources to maximize production with limited funds. Since the concept of erasable pattern mining was proposed, a manager can use it to optimize the production plan effectively. However, real applications have critical factors, such as costs or quantities of material, which traditional methods can not handle. This paper thus considers mining erasable itemsets from a product database with quantitative components. We propose an erasable itemset mining algorithm with the bit-vector manipulation method for quantitative component databases. It extracts raw materials with lower profits by analyzing the relationships between products and materials. In numerical experiments, the real-world and synthetic datasets were used to evaluate the performance in the execution time with different thresholds. Experimental results show that the proposed algorithm performs better than previous work.