Multi-objective Optimization Approach to Malfatti’s Problem
DOI:
https://doi.org/10.21638/11701/spbu31.2021.07Abstract
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.
Keywords:
circle packing problem, triangle set, k disks, multi-objective optimization problem, upper bound
Downloads
References
Saaty, T. (1973). Integer Optimization Methods and Related Extremal Problems [Russian translation], Moscow
Lob, H. and H. W. Richmond (1930). On the solutions of the Malfatti problem for a triangle. Proc. London Math. Soc., 2(30), 287–301
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.