On Two Classes of Extremum Problems without Calculus (Q3136709)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 425748
Language Label Description Also known as
default for all languages
No label defined
    English
    On Two Classes of Extremum Problems without Calculus
    scientific article; zbMATH DE number 425748

      Statements

      20 October 1993
      0 references
      Hölder inequality
      0 references
      shortest distance
      0 references
      0 references
      On Two Classes of Extremum Problems without Calculus (English)
      0 references
      Several extremum problems are solved without using calculus methods. The first problem is one that had been solved in two dimensions by C. S. Ogilvy using Lagrange multipliers. A solution is given here by the Hölder inequality for the corresponding \(n\)-dimensional problem, i.e., determine the extreme values of \(x_ 1^ m+x_ 2^ m+\dots+x_ n^ m\) subject to \(a_ 1/x_ 1+a_ 2/x_ 2+\dots+a_ n/x_ n=1\); \(x_ i>0\); the \(a_ i\) are given positive numbers; and \(m\) is any real given number. The second problem is an extension of E. M. Langley's non- calculus solution for the extreme values of \(\{\sin \theta+\sqrt {\sin^ 2\theta+\sin^ 2\alpha}\}\cos\theta\) where \(\alpha\) is fixed and \(\theta\) varies. The solution is obtained by means of an appropriate discriminant and is related to a dynamics problem. The third problem is the known geometric one of finding the shortest distance in \(E^ n\) from a given point \(P(p_ 1,p_ 2,\dots,p_ n)\) to a given line \(\ell\) whose parametric representation is \(x_ i=a_ i+h_ it\), \(i=1,2,\dots,n\). This distance is found by determining the radius \(r\) of a sphere centered at the given point and tangent to the given line and is obtained by setting an appropriate discriminant to zero.
      0 references

      Identifiers