Wedding seating set partition example question

[diogofernandesc]

Hi guys,

So I was looking at the use case examples in the docs and had a question about the wedding seating allocation - set partitioning problem.

I have adapted it for a different context, it works well but it seems that it optimises for the minimisation of number of tables, which makes sense for the given context however,

How would I go about configuring it to not care about number of tables as such, e.g. a table has a minimum and maximum number of people e.g. 3 min and 4 max, and we want to allocate to minimise the amount of people per table (3 people).
So we could have most tables be made of 3 people but depending on total size there may have to be a few tables of 4 people.
For context, currently, it will allocate most people into tables of 4 and a few tables of 3, but like I said, I want it to be the opposite, so that most tables are of 3 people and a few of 4.

FYI: I added a minimise size by adding a check on the tuple size after generating the combinations via pulp.allcombinations.

I see that the max group size isn't expressed as a direct constraint of the model so I'm a bit stuck.

Thanks in advance!