optimal arrangement of rectangles in a rectangle

I have a base rectangle with the size bx * by  and several rectangles which have all the same size ax*ay but can be arranged horizontally or vertically (ay*ax).

Is there a way to calculate the best arrangement?

 

packing problem

By optimal do you mean the arrangement that fits the most rectangles into the larger rectangle?  Is there a restriction that requires the sides of the smaller rectangles to parallel the sides of the container? There is no general solution for this packing problem, though specific cases have been solved.  See Packing problem.

alec's picture

Global Optimization problem

I don't think that that can be solved in Maple, except few obvious cases.

Alec

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.
}