Abstract
In this work, we consider the multi-objective optimization problem based on the circle packing problem, particularly, extended Malfatti's problem (Enkhbat, 2020) with k disks. Malfatti's problem was examined for the first time from a view point of global optimization theory and algorithm in (Enkhbat, 2016). Also, a game theory approach has been applied to Malfatti's problem in (Enkhbat and Battur, 2021). In this paper, we apply the the multi-objective optimization approach to the problem. Using the weighted sum method, we reduce this problem to optimization problem with nonconvex constraints. For solving numerically the weighted sum optimization problem, we apply KKT conditions and find Pareto stationary points. Also, we estimate upper bounds of the global value of the objective function by Lagrange duality. Numerical results are provided.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.