I am trying to build a model to solve a problem. In the problem, one product set consists of different product items, for example, product set 1 consists of Pencil A + Pen D + Eraser B + Scissor C, and product set 2 consists of Pencil C + Pen D + Eraser C. Some products are necessary in the set, some aren't.
And try to maximize the total of product set with the constraint of the quantity of different products. For example, can only have 5 pencils, 2 pens, 4 erasers.
Since the actual product set consists of eight products, there will be a long list for just the notation, for example, parameter ???=1, if Pencil i is included in Product Set k, parameter ?? for the quantity constraint, and decision variable ??=1, if Pencil i is in stock.
I am thinking of creating a product index which includes all the products, for example, ???=1, if the ith one in Product p is in stock. However, since the number of each product type is different, I am not sure how to index it.
And try to maximize the total of product set with the constraint of the quantity of different products. For example, can only have 5 pencils, 2 pens, 4 erasers.
Since the actual product set consists of eight products, there will be a long list for just the notation, for example, parameter ???=1, if Pencil i is included in Product Set k, parameter ?? for the quantity constraint, and decision variable ??=1, if Pencil i is in stock.
I am thinking of creating a product index which includes all the products, for example, ???=1, if the ith one in Product p is in stock. However, since the number of each product type is different, I am not sure how to index it.