Abstract

Our objective is to find the optimal non-overlapping packing of a collection of general (non-identical) ellipses, with respect to a container circle that has minimal radius. Following the review of selected topical literature, we introduce a model development approach based on using embedded Lagrange multipliers. Our optimization model has been implemented using the computing system Mathematica. We present illustrative numerical results using the LGO nonlinear (global and local) optimization software package linked to Mathematica. Our study shows that the Lagrangian modeling approach combined with nonlinear optimization tools can effectively handle challenging ellipse packing problems with hundreds of decision variables and non-convex constraints.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.