In this study, we introduce a so-called Inverse Malfatti’s problem which is to find a triangle including three non-overlapping circles with the minimum area. This problem will be an inverse version of Malfatti’s problem, which dates back to 200 years ago, proposed by the Italian mathematician Malfatti. The Malfatti’s problem for the first time has been examined from the point of view of global optimization in [1]. The Inverse Malfatti’s problem has also been formulated as the non-convex optimization problem of minimizing a convex function over a non-convex set. Some computational results are provided