<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="http://vmath.ru/vf5/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://vmath.ru/vf5/feed.php">
        <title>VMath matricese:optimize:distancee:torri_e</title>
        <description></description>
        <link>http://vmath.ru/vf5/</link>
        <image rdf:resource="http://vmath.ru/vf5/lib/tpl/vf5/images/favicon.ico" />
       <dc:date>2026-10-13T04:36:47+0300</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/inverse?rev=1689364770&amp;do=diff"/>
                <rdf:li rdf:resource="http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/pres020714?rev=1583924422&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://vmath.ru/vf5/lib/tpl/vf5/images/favicon.ico">
        <title>VMath</title>
        <link>http://vmath.ru/vf5/</link>
        <url>http://vmath.ru/vf5/lib/tpl/vf5/images/favicon.ico</url>
    </image>
    <item rdf:about="http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/inverse?rev=1689364770&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2023-07-14T22:59:30+0300</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Inverse problem for the  Fermat-Torricelli problem</title>
        <link>http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/inverse?rev=1689364770&amp;do=diff</link>
        <description>Author --- Русская версия

----------
Fermat-Torricelli problem and its development
----------

Inverse problem for the  Fermat-Torricelli problem



Problem.   Find the values for the
weights $ \{m_j\}_{j=1}^{K} $
with the aim for the corresponding objective function $ \sum_{j=1}^{K} m_j |PP_j| $  to posses a minimum point precisely at $ P_{\ast} \not\in \{P_j\}_{j=1}^K $.

Planar case
TheoremLet the vertices of the triangle$ P_{1}P_{2}P_3 $$$
m_1^{\ast} = |P_{\ast}P_1| \cdot \left|
\begin{arra…</description>
    </item>
    <item rdf:about="http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/pres020714?rev=1583924422&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-03-11T14:00:22+0300</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Problem</title>
        <link>http://vmath.ru/vf5/matricese/optimize/distancee/torri_e/pres020714?rev=1583924422&amp;do=diff</link>
        <description>----------

























----------



Problem


$$
F(P)=\frac{m_1}{|PP_1|}+\dots+ \frac{m_K}{|PP_K|}
$$





$$ \{P_1,\dots,P_K\} \subset \mathbb R^n,\ \{m_1,\dots,m_K\} \subset \mathbb R $$

$$ | \cdot |  - \mbox{ Euclidean metrics } $$





















$ \le (K-1)^2 $. 


Difficulties

: $ n=2,\ K= 3 $;  



$$ F(P)=\frac{m_1}{|PP_1|}+\frac{m_2}{|PP_2|}+\frac{m_3}{|PP_3|} $$







 
$$
\frac{D\, F}{D\, P} = \mathbb O 
$$







 
$$
\begin{array}{c}
\left\{\begin{array}{l}
\di…</description>
    </item>
</rdf:RDF>
