Malfatti’s constrained optimization problem
Keywords:Malfatti’s problem, Nonconvex optimization, circle, triangle
In 1803 Italian mathematician Malfatti posed the following problem how to pack three non-overlapping circles of maximum total area in a given triangle. Malfatti originally assumed that the solution to this problem are three circles inscribed in a triangle such that each circle tangent to other two and touches two sides of the triangle. Now it is well known that Malfatti’s solution is not optimal. The problem for the first time was treated as a global optimization problem in Enkhbat . In this paper, we consider a new formulation of Malfatti’s problem called Malfatti’s constrained optimization problem. The new problem is formulated as a nonconvex optimization problem with nonlinear constraints. Numerical experiments were conducted on Python for the cases.
How to Cite
Copyright (c) 2023 Iderbayar Shiilegbat, Enkhbat Rentsen
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The authors grant the Journal of Institute of Mathemathics and Digital Technology a license to publish the article and identify itself as the original publisher.
Articles in the Journal of Institute of Mathemathics and Digital Technology are Open Access articles published under a Creative Commons Attribution-NonCommercial 4.0 International License - CC BY NC.
This license permits NonComericial use, distribution and reproduction in any medium, provided the original work is properly cited.