I want to pack equal-sized circles into a rectangle with width $w$, and height $h$. The total area of all of the circles should be maximised.
the radius of each circle can vary, but is contrained; $r\in[a,b]$
How do I go about solving this?
Would be great if I can get help with that general case. If not, the following specific case would also be good.
$w=11.2$ $h=2.8$ $a=0.45$ $b=0.9$
Thank you!
edit:
I also want the circles to be packed like this
tell me if I'm wrong, but so far I've done the following;
Suppose there are $x$ circles across the bottom width. Then the total length of all the circles is $2rx$.
Suppose the stack is $y$ "layers" of circles high. Then the hight of the stack is $r(\sqrt{3}(y-1)+2)$
So we have
$2rx=w$
$r(\sqrt{3}(y-1)+2)\leq{h}$
or
$2rx\leq{w}$
$r(\sqrt{3}(y-1)+2)=h$

This can be solved by means of integer programming regarded the size of the input is not too large.
Details, problem formulations and numerical experiments can be found here.