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).
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.
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.
Global Optimization problem
I don't think that that can be solved in Maple, except few obvious cases.
Alec