To find the minimum value of \( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} \), given \( x + y + z = 6 \), use the AM-HM inequality:
["Optimize Performance with Inequalities: Minimizing ( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} ) Given ( x + y + z = 6 )", "When solving optimization problems under a constraint, mathematical inequalities such as the Arithmetic Mean–Harmonic Mean (AM-HM) Inequality provide powerful tools to find minimum or maximum values efficiently. In this article, we explore how to minimize the expression ( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} ) under the condition ( x + y + z = 6 ), with ( x, y, z > 0 ), using AM-HM.", "---", "### Understanding the Problem", "We aim to minimize:", "[\nS = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\n]", "subject to the constraint:", "[\nx + y + z = 6, \quad x > 0, ; y > 0, ; z > 0.\n]", "Note that the function ( f(t) = \frac{1}{t} ) is convex on ( (0, \infty) ). For convex functions, Jensen’s Inequality and symmetry often guide us toward symmetric solutions to minimize sums of reciprocals.", "---", "### Introducing the AM-HM Inequality", "The AM-HM inequality states that for positive real numbers ( x, y, z ):", "[\n\frac{x + y + z}{3} \geq \frac{3}{\frac{1}{x} + \frac{1}{y} + \frac{1}{z}}\n]", "Rewriting this:", "[\nS = \frac{1}{x} + \frac{1}{y} + \frac{1}{z} \geq \frac{9}{x + y + z}\n]", "Since ( x + y + z = 6 ), substitute:", "[\nS \geq \frac{9}{6} = \frac{3}{2}\n]", "Thus, the minimum value of ( S ) is ( \boxed{\frac{3}{2}} ), achieved when equality holds in AM-HM — that is, when ( x = y = z ).", "---", "### Finding the Values That Minimize the Expression", "Set ( x = y = z ). Then from the constraint:", "[\nx + y + z = 3x = 6 \Rightarrow x = 2\n]", "So:", "[\nx = y = z = 2\n]", "Compute ( S ):", "[\n\frac{1}{2} + \frac{1}{2} + \frac{1}{2} = \frac{3}{2}\n]", "This confirms the theoretical minimum.", "---", "### Why Does Symmetry Minimize the Sum of Reciprocals?", "Because ( \frac{1}{t} ) grows rapidly as ( t ) approaches zero, concentrating values leads to larger reciprocals. The symmetric choice ( x = y = z = 2 ) balances the terms, avoiding extreme values that would drastically increase the sum of reciprocals.", "---", "### Verifying Optimality via Convexity", "Since ( f(t) = \frac{1}{t} ) is strictly convex on ( (0, \infty) ), by Jensen’s Inequality:", "[\n\frac{1}{3} \left( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} \right) \geq \frac{1}{\frac{x+y+z}{3}} = \frac{1}{2}\n]", "Multiply both sides by 3:", "[\n\frac{1}{x} + \frac{1}{y} + \frac{1}{z} \geq \frac{3}{2}\n]", "Equality holds if and only if ( x = y = z ), confirming that ( x = y = z = 2 ) is indeed optimal.", "---", "### Practical Implications and Use Cases", "This optimization model appears in resource allocation and efficiency analysis. For example, when distributing workload hours among three tasks with fixed total time (6 hours), minimizing the sum of inverse work rates (reciprocals of time) leads to balanced, efficient scheduling.", "---", "### Conclusion", "By applying the AM-HM inequality and leveraging convexity properties, we efficiently determine that:", "[\n\frac{1}{x} + \frac{1}{y} + \frac{1}{z} \geq \frac{3}{2}\n]", "with equality if and only if ( x = y = z = 2 ). This elegant solution demonstrates how fundamental inequalities yield powerful insights into optimization under constraints.", "---", "Key Takeaways:", "- AM-HM links arithmetic and harmonic means, enabling concise lower bounds.\n- For positive variables with fixed sum, minimizing sum of reciprocals favors equal values.\n- Convexity and Jensen’s Inequality reinforce the optimality of equality.\n- Real-world applications span engineering, economics, and operations research.", "---", "Keywords: minimize ( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} ), AM-HM inequality, ( x + y + z = 6 ), convex function, inequality optimization, symmetry in optimization, equal distribution minimizes reciprocal sum."]
