aboutsummaryrefslogtreecommitdiff
path: root/source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
diff options
context:
space:
mode:
Diffstat (limited to 'source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po')
-rw-r--r--source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po6
1 files changed, 3 insertions, 3 deletions
diff --git a/source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po b/source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
index f260711f397..dd7d4875c69 100644
--- a/source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
+++ b/source/vec/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
@@ -4,7 +4,7 @@ msgstr ""
"Project-Id-Version: PACKAGE VERSION\n"
"Report-Msgid-Bugs-To: https://bugs.libreoffice.org/enter_bug.cgi?product=LibreOffice&bug_status=UNCONFIRMED&component=UI\n"
"POT-Creation-Date: 2015-04-22 23:40+0200\n"
-"PO-Revision-Date: 2016-08-30 19:57+0000\n"
+"PO-Revision-Date: 2016-09-13 12:09+0000\n"
"Last-Translator: Federigo Canpanjoło <federicolovec@gmail.com>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"Language: vec\n"
@@ -14,7 +14,7 @@ msgstr ""
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
"X-Accelerator-Marker: ~\n"
"X-Generator: Pootle 2.7\n"
-"X-POOTLE-MTIME: 1472587064.000000\n"
+"X-POOTLE-MTIME: 1473768565.000000\n"
#: Options.xhp
msgctxt ""
@@ -382,7 +382,7 @@ msgctxt ""
"par_id0603200910430821\n"
"help.text"
msgid "There is also a list of constraints you can use to restrict the possible range of solutions or to penalize certain conditions. However, in case of the evolutionary solvers DEPS and SCO, these constraints are also used to specify bounds on the variables of the problem. Due to the random nature of the algorithms, it is <emph>highly recommended</emph> to do so and give upper (and in case \"Assume Non-Negative Variables\" is turned off also lower) bounds for all variables. They don't have to be near the actual solution (which is probably unknown) but should give a rough indication of the expected size (0 ≤ var ≤ 1 or maybe -1000000 ≤ var ≤ 1000000)."
-msgstr "A ghe ze anca na łista de vìncołi che i se pol doparar par strènzar el intervało posìbiłe de sołusion o par penałizar serte condision. In tuti i modi, inte'l cazo de i resolvidori DEPS e SCO, 'sti vìncołi i ze doparài anca par spesifegar i łìmiti rełativi a łe variàbiłe de'l problema. Considarà ła natura cazuałe de i algoritmi, A ze <emph>grandamente consejà</emph> de farlo e de fornir łìmiti pì alti (e pì basi, se \"Consìdara łe variàbiłe cofà mìa-negative\" l'è stuà) par tute łe variàbiłe. No i ga mìa da èsarghe visini a ła sołusion (fasilmente mìa-conosùa), ma i ga da fornir na idèa vaga de ła dimension che se se speta (sernir par ezenpio tra 0 ≤ var ≤ 1 o -1000000 ≤ var ≤ 1000000)."
+msgstr "A ghe ze anca na łista de vìncołi che i se pol doparar par strènzar el intervało posìbiłe de sołusion o par penałizar serte condision. In tuti i modi, inte'l cazo de i resolvidori DEPS e SCO, 'sti vìncołi i ze doparài anca par spesifegar i łìmiti rełativi a łe variàbiłe de'l problema. Considarà ła natura cazuałe de i algoritmi, A ze <emph>grandamente racomandà</emph> de farlo e de fornir łìmiti pì alti (e pì basi, se \"Consìdara łe variàbiłe cofà mìa-negative\" l'è stuà) par tute łe variàbiłe. No i ga mìa da èsarghe visini a ła sołusion (fasilmente mìa-conosùa), ma i ga da fornir na idèa vaga de ła dimension che se se speta (sernir par ezenpio tra 0 ≤ var ≤ 1 o -1000000 ≤ var ≤ 1000000)."
#: Usage.xhp
msgctxt ""