Here is the scenario:
There are n boxes with $C_{a}$ of capacity at the beginning of each box before assigning.
I want to fit x parcels into the boxes, letting the capacity left for each boxes are as even as possible.
The solution I have thought of is: $$ Minimize(\sum_{a=1}^{n}(C_{a}-D_{a})^2) $$ where $D_{a}$ represents the amount of parcels assigned to $Box_{n}$
Is there a way to turn this into a linear problem?