Abstract
We have analytically solved the problem how to split a given triangle’s two sides by a line such that a total area of inscribed two circles embedded in each side of the line reaches the maximum. We also show that Malfatti’s problem for n = 2 is a particular case of our problem.
Access provided by CONRICYT-eBooks. Download chapter PDF
Similar content being viewed by others
Keywords
1 Introduction
1.1 Problem Definition
We have analytically solved the problem how to split a given triangle’s two sides by a line such that a total area of inscribed two circles embedded in each side of the line reaches the maximum. We also show that Malfatti’s problem for n = 2 is a particular case of our problem.
As in Figure 1, the cutting line l splits the △ABC into two areas. There are two embedded circles O 1 and O 2, respectively, in both areas. The cutting line l has to go through both AB and AC. We denote the radius of circle O 1 as r 1 and the radius of circle O 2 as r 2.
The global optimization problem is defined to maximize \(r_1^2 + r_2^2\) subject to all positions of line l.
We call the problem as Enkhbat problem named after the last author, because the split line acts as an auxiliary line to collect the maximum points and leads to simple objective function with regard to the original Malfatti’s problem for n = 2. We will discuss the maximization \(r_1^n + r_2^n (n \geq 1)\), subject to all positions of line l in the next article.
1.1.1 The Problem of Malfatti
In [5], the authors describe the Malfatti’s problem: Given a triangle, to find three non-overlapping circles inside it with total maximum area. This problem is also referred to as Malfatti’s marble problem in [5]. They mentioned Malfatti’s construction problem as well. Malfatti’s construction problem is to construct Malfatti’s arrangement using ruler and compass. Malfatti’s arrangement is that three mutually tangent circles such that each of them is also tangent to two edges of the triangle. In [1], the authors geometrically solved the Malfatti’s problem with two circles. In [6], the authors solved Malfatti’s problem by the greedy algorithm. Also, in [7,8,9], Malfatti’s problem as well as high dimensional Malfatti’s problems were solved by use of global optimization theory and algorithms.
1.1.2 The Special Case of Malfatii’s Problem
In [4] and Appendix, R. Enkhbat formulates the following problem: the cutting line l which goes through A and across BC divides the △ABC into two areas. There are two embedded circles I 1 and I 2, respectively, in both areas. We also denote the radius of circle I 1 as r 1 and the radius of circle I 2 as r 2. The global optimization problem is defined to maximize \(r_1^2 + r_2^2\) . This problem is a special case of our problem which is discussed in this article. Luvsanbyamba Buyankhuu gave an analytic solution of the problem in Appendix using Lagrange multiplier method with an equality constraint.
1.1.3 Optimization Problem of the Inscribed Ball in Polyhedral Set
In [2], R. Enkhbat and B. Barsbold considered the problem for optimal inscribing of two balls into bounded polyhedral set, so that sum of their radii is maximized. The authors formulate this problem as a bilevel programming problem. The gradient based method for solving it has been proposed. In [3], R. Enkhbat and A. Bayarbaatar considered a problem of finding the maximum radius of inscribed ball and minimum radius of circumscribed ball defined over a polyhedral set and proposed some optimization algorithms to solve them. They formulate linear programming model for maximum radius of inscribed ball (from Page 24 of [3] ):
This is a linear programming solution of Chebyshev center of polyhedral set.
2 Problem Formulation
Let us start to formulate the problem.
As shown in Figure 2a, for maximization purpose, the circle O 1 and circle O 2 both should be inscribed (two dashed circles which are all tangent to sides and the lines). Especially inscribed circle O 2 means it is the biggest one and tangent to PT, PB, and BC assuming T is vertically below P.
We denote the inradius of △ABC as R, so r 1 ≤ R and r 2 ≤ R are held geometrically.
In Figure 2b, we have the cutting line PT, Point P on AB, and Point T on AC. We build PQʺRT ʺBC to have line QR, Point Q on AC, and Point R on AB.
The cutting line has two types:
-
1.
Line PT: for any fixed P, T moves from Q to C, T is always below the P in the vertical direction.
-
2.
Line QR: for any fixed Q, R moves from P to B, R is always below the Q in the vertical direction.
First, we consider only type 1 PT case. Then we will get the result of type 2 QR case in Section 5.
As shown in Figure 3, we can imagine that the circle O 2 is from vertex B to grow away to the end to become the inscribed circle of the △ABC, so r PTCB is from 0 to R (inradius of △ABC). For any fixed r PTCB, tangent line PT of circle O 2 goes around from P 1 T 1 to P 2 T 2.
3 Solution
3.1 Some Notations
R is inradius of △ABC, r 1 is radius of inscribed circle of △APT and r 2 is radius of inscribed circle of quadrilateral BPTC, \(p = \frac {1}{2}(a+b+c)\) is semiperimeter of the triangle.
without loss of generality, we assume AC ≤ AB ≤ BC.
3.2 A Few Preliminary Results
The following results come from basic rules of a triangle such as law of sines, Heron’s formula, and feature of half angle of the triangle. We will often use them implicitly or explicitly by reference number later.
3.3 Expression of r 1 via r 2
From Figure 4, we have the following results geometrically
Let x = r 2 and \( y = \cot \theta \), then we have
Now we can build the objective function of the problem. For further purpose to show the convexity of the objective function, we also need to calculate the partial differentiation of the objective function.
The range of x is known as [0, R]. we show the range of y now.
θ changes continuously when PT goes around circle O2. If PT is parallel to BC , θ = β, so \(y=\cot \theta = \cot \beta \). If T coincides with C as shown in Figure 5:
In △PBC
x ∈ [0, R]
\((2) \implies \cot \beta > \tan \alpha \), so \(y=\cot \theta \in [\tan \alpha ,\cot \beta ]\). Figure 6 shows domain of (x, y).
3.4 Existence of Global Maximum of \(r_1^2 + r_2^2\)
Theorem 1
Domain of (x, y) showed in Figure 6 is convex and compact.
Proof
For any points (x 1, y 1) and (x 2, y 2) of domain of (x, y)
According to Weierstrass extreme value theorem and continuity of the objective function \(f(x,y)=r_1^2 + r_2^2\), we have
Theorem 2
\(r_1^2 + r_2^2\) reach its global maximum in domain of (x,y), showed in Figure 6.
3.5 Green Candidate and Red Candidate
According to (3), f(x, y) is convex about x, it reaches its maximum at the edge of x. In Figure 6, we can observe, for any fixed y, \(T_1^{\prime }\) and \(T_2^{\prime }\) are the edge points of x, so f(x, y) will reach its maximum on green line and red line.
In Section 4, we will show that one point on green line and another point on red line together make the global maximum point set of f(x, y). We call the two points as green candidate (or GC) and red candidate (or RC) of the global maximum point set of f(x, y). Before we calculate the GC and RC in Section 4, we use the following theorem to show that the GC and RC are both in the domain of f(x, y), because the middle results are useful in Section 4.
Also because we are considering the type 1 PT case , we use GCPT and RCPT notations.
Theorem 3
GC PT: \((R\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1}, \sqrt {\frac {\cot \beta }{\cot \alpha }})\) ,RC PT: \((R,\tan \alpha + \sec \alpha )\) are both in domain of (x,y) showed in Figure 6.
Proof
First we prove \((R\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1}, \sqrt {\frac {\cot \beta }{\cot \alpha }})\) in domain of (x,y)
Figure 6 showed, \(x = R \implies y\in [\tan \alpha ,\cot \alpha ]\), so we just need to prove \(\tan \alpha + \sec \alpha \in [\tan \alpha ,\cot \alpha ]\)
4 Maximum of \(r_1^2 + r_2^2\) Type 1 PT Case
We denote \(t=\frac {x}{R}\) and show that r 1 and r 2 are functions of variables t and y.
Because \(r_1^2 + r_2^2 = R^2 Q(t,y)\), we have objective function as Q(t, y)
\(\frac {\partial ^2 Q}{\partial t^2} > 0 \) means Q(t,y) is convex about parameter t, so for every fixed y,\( Max Q(t,y) = Max \{Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y), Q(1,y)\}\). When y goes through \([\tan \alpha ,\cot \beta ],\) we also have \(Max Q(t,y) = Max \{Max\ Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y), Max\ Q\) (1, y)}.
Geometrically \(Max\ Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y)\) will be searched on the green line of the domain and Max Q(1, y)} will be searched on the red line of the domain.
4.1 \(Max\ Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y)\): Searching on the Green Line of the Domain
We denote \(T(y) = Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y) \)
\(y \in [\tan \alpha , \cot \beta ] \implies Max\ T(y) = Max\{T(\tan \alpha ), T(\cot \beta ), T(\frac {d T}{d y} =0)\}\)
\( \frac {1}{y^3} > 0 \\ \cot \beta - y^2\cot \alpha = 0\) or \(y\cot \beta \cot \alpha - \cot \beta - y^2\cot \alpha = 0\)
4.2 Max Q(1, y): Searching on the Red Line of the Domain
We denote S(y) = Q(1, y)
\(y \in [\tan \alpha , \cot \beta ] \implies Max\ S(y) = Max\{S(\tan \alpha ), S(\cot \beta ), S(\frac {d S}{d y} =0)\}\)
\(y\cot \alpha -1 =0 \implies y = \tan \alpha \) is already calculated Let us calculate \(-y^2\cot \alpha +2y+\cot \alpha = 0\)
S(y) does not increase in \( [\tan \alpha + \sec \alpha ,\cot \beta ] \implies S(\cot \beta ) \leq S(\tan \alpha + \sec \alpha )\)
\(Max\ S(y) = S(\tan \alpha + \sec \alpha ) \)
\( \\ Max\ Q(1,\tan \alpha + \sec \alpha ) = S(\tan \alpha + \sec \alpha )\)
4.3 \(Max(r_1^2 + r_2^2)\) in Type 1 PT Case
We can combine the above two results as
\(\\Max Q(t,y) = Max \{Max\ Q(\frac {\cot \beta - y}{\cot \beta - \tan \alpha },y), Max\ Q(1,y)\} \)
\(= Max \{1,2(\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1})^2, Q(1,\tan \alpha + \sec \alpha )\}\)
Because \(Q(1,\tan \alpha + \sec \alpha )\} = S(\tan \alpha + \sec \alpha ) \geq S(\cot \beta ) \geq S(\tan \alpha )=1\)
Therefore \(Max Q(t,y) = Max \{2(\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1\}\)
And so, \(Max(r_1^2 + r_2^2) = Max \{2(\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1\}R^2 \)
5 Maximum of \(r_1^2 + r_2^2\) Type 2 QR Case
We just need to exchange b and c , exchange γ and β in all formula in Section 4, for example,
Because the relation c ≥ b is not symmetrical , we have
\(\tan \alpha + \sec \alpha \) beyond \([\tan \alpha ,\cot \gamma ]\), so RCQR become \((R,\cot \gamma )\), we have the following theorem in type 2 QR case.
Theorem 4
GC QR: \((R\frac {\cot \gamma \cot \alpha - \sqrt {\cot \gamma \cot \alpha }}{\cot \gamma \cot \alpha - 1}, \sqrt {\frac {\cot \gamma }{\cot \alpha }})\) ,RC QR: \((R,\cot \gamma )\) are both in the domain of (x,y)
6 Maximum of \(r_1^2 + r_2^2\)
The candidate point set are {GCPT,RCPT,GCQR,RCQR}.
\(r_1^2 + r_2^2\) is geometrically the same at RCQR: \((R,\cot \gamma )\) point and at \((R,\cot \beta ))\) of type 1 PT case, so less than \(r_1^2 + r_2^2\) at RCPT: \((R,\tan \alpha + \sec \alpha ).\)
The candidate point set becomes {GCPT,RCPT,GCQR}.
The candidate point set becomes {GCPT,RCPT}.
\(Max(r_1^2 + r_2^2) = Max \{2(\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1\}R^2 \)
we have the following theorem about Max(\(r_1^2 + r_2^2\))
Theorem 5
When the cutting line goes through AB, AC sides the \(r_1^2 + r_2^2\) reach its maximum at \((R\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1}, \sqrt {\frac {\cot \beta }{\cot \alpha }})\) or \((R,\tan \alpha + \sec \alpha )\) , the maximum value is \(2(\frac {\cot \beta \cot \alpha - \sqrt {\cot \beta \cot \alpha }}{\cot \beta \cot \alpha - 1})^2R^2\) or \([(\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2+1]R^2\) , respectively.
7 Proof of Malfatti’s Problem for n = 2
7.1 The Cutting Line Goes Through All Three Sides of the Triangle
If the cutting line goes through AB, AC, andBC, according to Theorem 5 and (5) we have
\( Max(r_1^2 + r_2^2) = Max \{2(\frac {1}{1+\sqrt {\tan \beta \tan \alpha }})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1, 2(\frac {1}{1+\sqrt {\tan \beta \tan \gamma }})^2,\) \((\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2 + 1,2(\frac {1}{1+\sqrt {\tan \beta \tan \gamma }})^2, (\frac {\sec \gamma - \tan \gamma }{\sec \gamma + \tan \gamma })^2 + 1\}R^2 \)
BC is the long one, the \(2(\frac {1}{1+\sqrt {\tan \beta \tan \gamma }})^2\) duplicate we have
\( Max(r_1^2 + r_2^2) = Max \{2(\frac {1}{1+\sqrt {\tan \beta \tan \alpha }})^2, 2(\frac {1}{1+\sqrt {\tan \beta \tan \gamma }})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1, (\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2 + 1, (\frac {\sec \gamma - \tan \gamma }{\sec \gamma + \tan \gamma })^2 + 1\}R^2\)
and α ≥ γ, we get
\( Max(r_1^2 + r_2^2) = Max \{2(\frac {1}{1+\sqrt {\tan \beta \tan \gamma }})^2, (\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1, (\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2 + 1, (\frac {\sec \gamma - \tan \gamma }{\sec \gamma + \tan \gamma })^2 + 1\}R^2\)
if \(\beta \leq \gamma \implies \tan \beta \leq \sqrt {\tan \beta \tan \gamma } \)
And if \(\beta > \gamma \implies \tan \gamma < \sqrt {\tan \beta \tan \gamma } \)
\( Max(r_1^2 + r_2^2) = Max \{(\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2 + 1, (\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2 + 1, (\frac {\sec \gamma - \tan \gamma }{\sec \gamma + \tan \gamma })^2 + 1\}R^2\)
From (8) and (9), we have
Theorem 6
When the cutting line goes through AB, AC, and BC sides, the \(r_1^2 + r_2^2\) reach its maximum at \((R,\tan \alpha + \sec \alpha )\) or \((R,\tan \beta + \sec \beta )\) or \((R,\tan \gamma + \sec \gamma )\) , the maximum value is \([(\frac {\sec \alpha - \tan \alpha }{\sec \alpha + \tan \alpha })^2+1]R^2\) or \([(\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2+1]R^2\) or \([(\frac {\sec \gamma - \tan \gamma }{\sec \gamma + \tan \gamma })^2+1]R^2\) , respectively.
We have assumed α ≥ γ ≥ β , so
\( [\tan {}(\frac {\pi }{4}-\frac {\alpha }{2})]^4 +1 \leq [\tan {}(\frac {\pi }{4}-\frac {\gamma }{2})]^4 +1 \leq [\tan {}(\frac {\pi }{4}-\frac {\beta }{2})]^4 +1 \)
and we have \( Max(r_1^2 + r_2^2) = (\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2R^2\)
Finally, we have
Theorem 7
When the cutting line goes through AB, AC, and BC sides, if β is smallest half angle of △ABC , the \(r_1^2 + r_2^2\) reach its maximum at \((R,\tan \beta + \sec \beta )\) , the maximum value is \([(\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2+1]R^2\).
7.2 Malfatti n = 2 Problem as Corollary
Theorem 8
At \((R,\tan \alpha + \sec \alpha )\) point, r 1 and r 2 go to tangent position.
Proof
we just need to proof |O 1 O 2| = r 1 + r 2
The following theorem also holds symmetrically.
Theorem 9
At \((R,\tan \beta + \sec \beta )\) point, r 1 and r 2 go to tangent position.
According to Theorem 9, the following theorem is the solution of Malffati two circle problem as corollary of Theorem 7. It is also the greedy arrangement of the two circles in the triangles.
Corollary 10
For all tangent circle O 1 and circle O 2 inside △ABC, if β is the smallest half angle of △ABC , the \(r_1^2 + r_2^2\) reach its maximum value \([(\frac {\sec \beta - \tan \beta }{\sec \beta + \tan \beta })^2+1]R^2\).
References
Andreescu, T., Mushkarov, O., Stoyanov, L.: Geometric Problems on Maxima and Minima. Malfatti’s Problems 2.3, 80 pp. Birkhäuser, Boston (2005)
Enkhbat, R., Barsbold, B.: Optimal inscribing of two balls into polyhedral set. In: Optimization, Simulation, and Control. Springer Optimization and Its Applications, vol. 76, pp. 35–47. Springer, Berlin (2013)
Enkhbat, R., Bayarbaatar, A.: On the maximum and minimum radius problems over a polyhedral set. Mongolian Math. J. 11, 23–33 (2007)
Enkhbat, R., Buyankhuu, L.: T2-2 find a point M on the side BC, for which sum of the areas of the inscribed circles of ABD and ACD reaches maximum value. Mongolian Mathematical Olympiad Series – No. 36 (2012)
Marco, A., Bezdek, A., Boroński, J.P.: The problem of Malfatti: two centuries of debate. Math. Intell. 33(1), 72–76 (2011)
Zalgaller, V.A., Los’, G.A.: The solution of Malfatti’s problem. J. Math. Sci. 72(4), 3163–3177 (1994)
Enkhbat, R., Barkova, M., Strekalovsky, A.S.: Solving Malfatti’s high dimensional problem by global optimization. Numer. Algebra Control Optim. 6(2), 153–160 (2016)
Enkhbat, R., Barkova, M.: Global search method for solving Malfatti’s four-circle problem. J. Irkutsk State Univ. (Ser. Math.) 15, 38–49 (2016). http://isu.ru/izvestia
Enkhbat, R.: Global optimization approach to Malfatti’s problem. J. Global Optim. 65, 33–39 (2016)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Appendix
Appendix
Find a point M on the side BC, for which sum of the areas of the inscribed circles of ABM and ACM reaches maximum value. (R. Enkhbat)
Solution is given by Luvsanbyamba [4]: Let us denote inscribed circles of ABC,ABM,AMC as ω = C(I, r), ω 1 = C(I 1, r 1), ω 2 = C(I 2, r 2), respectively, and the area of triangle ABC by S, the height from the vertex A by h.
Lemma
pr 2 + ar 1 r 2 = pr(r 1 + r 2).
Proof
BC ∩ ω 1 = X, BC ∩ ω 2 = Y , AM ∩ ω 1 = U, AM ∩ ω 2 = V . Without loss of generality b > c.
Let us denote BX = m, CY = n. Then UV = b − c + m − n, \(\tan {\frac {\angle B}{2}}=\frac {r}{p-b}=\frac {r_1}{m}\),\(\tan {\frac {\angle C}{2}}=\frac {r}{p-c}=\frac {r_2}{n}\),XY = a − m − n.
\(UV^2 + (r_1+r_2)^2 = I_1I2^2 = XY^2 +(r_2-r_1)^2 \implies UV^2 + 4r_1r_2 = XY^2 \iff [(b-c) + (m-n)]^2 + 4r_1r_2 = [a-(m+n)]^2 \iff 2a(m+n) + 2(b-c)(m-n) + 4r_1r_2 = a^2 -(b-c)^2 + 4mn \implies (p-c)m +(p-b)n + r_1r_2 = (p-b)(p-c) +mn \implies (p-c)\frac {(p-b)r_1}{r} + (p-b)\frac {(p-c)r_2}{r}+r_1r_2 = (p-b)(p-c)+\frac {(p-b)r_1}{r}\frac {(p-c)r_2}{r} \implies (p-b)(p-c)(r-r_1)(r-r_2)=r^2r_1r_2; (p-a)(p-b)(p-c)=pr^2 \implies p(r-r_1)(r-r_2)=(p-a)r_1r_2 \implies pr^2 + ar_1r_2 = pr(r_1+r_2)\). Q.E.D.
\(F(r_1,r_2) = r_1^2 + r_2^2\), using lemma, \(G(r_1,r_2) = r_1 + r_2 - \frac {2r_1r_2}{h} = r =const.\)
Let us consider H(r 1, r 2) = F(r 1, r 2) − λG(r 1, r 2)
\(\iff \frac {r_1}{r_2} = \frac {h-2r_1}{h-2r_2} \iff h(r_1-r_2) = 2(r_1^2 - r_2^2) \iff r_1 = r_2 \) or 2(r 1 + r 2) = h
If r = r 1, r 2 = 0, then \(F_0 = F(r_1,r_2) = r_1^2 + r_2^2 = r^2\).
If 2(r 1 + r 2) = h, then the lemma implies \(\frac {h^2}{2} - 2r_1r_2 = rh\) and \(F_2= F(r_1,r_2) = r_1^2 + r_2^2 = (r_1+r_2)^2 - 2r_1r_2 = \frac {h^2}{4} - (\frac {h^2}{2} -rh) = rh - \frac {h^2}{4}\).
\(F_0 > F_2 \iff r_2 > rh- \frac {h^2}{4} \iff (r-\frac {h}{2})^2 > 0 \)
If r 1 = r 2, by the lemma we have \(2r_1 - \frac {2r_1^2}{h} = rr_1 = \frac {h-\sqrt {h^2 -2rh}}{2}\). \(F_1 = F(r_1,r_2) = 2r_1^2 = 2r_1h -rh = h^2 -h\sqrt {h^2-rh} -rh\).
\(F_0 <F_2 \iff r^2 < h^2 -h\sqrt {h^2-rh} -rh \iff h\sqrt {h^2-rh} < h^2 -r^2-rh \iff 0 < r^2(r^2 + 2rh -h^2) \iff 0 < \frac {s^2}{p^2} + \frac {4s^2}{pa} - \frac {4s^2}{a^2} \iff (b+c)^2 <(a\sqrt {2})^2 \iff b+c < a\sqrt {2}\)
Thus, in case of \(b+c < a\sqrt {2}\) , \(r_1^2 + r_2^2\), our sum gets its maximum value iff r 1 = r 2, and in other case it gets the maximum value iff r 1 = 0 or r 2 = 0.
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Munkhdalai, D., Enkhbat, R. (2018). A Circle Packing Problem and Its Connection to Malfatti’s Problem. In: Pardalos, P., Migdalas, A. (eds) Open Problems in Optimization and Data Analysis. Springer Optimization and Its Applications, vol 141. Springer, Cham. https://doi.org/10.1007/978-3-319-99142-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-99142-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99141-2
Online ISBN: 978-3-319-99142-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)