aboutsummaryrefslogtreecommitdiff
path: root/source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
diff options
context:
space:
mode:
Diffstat (limited to 'source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po')
-rw-r--r--source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po10
1 files changed, 5 insertions, 5 deletions
diff --git a/source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po b/source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
index 48117066177..325aa49fe96 100644
--- a/source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
+++ b/source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
@@ -4,16 +4,16 @@ 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: 2016-11-09 14:10+0100\n"
-"PO-Revision-Date: 2016-12-03 20:36+0000\n"
-"Last-Translator: milupo <milupo@sorbzilla.de>\n"
+"PO-Revision-Date: 2019-06-17 09:38+0000\n"
+"Last-Translator: Michael Wolf <milupo@sorbzilla.de>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"Language: hsb\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"X-Accelerator-Marker: ~\n"
-"X-Generator: LibreOffice\n"
-"X-POOTLE-MTIME: 1480797399.000000\n"
+"X-Generator: Pootle 2.8\n"
+"X-POOTLE-MTIME: 1560764297.000000\n"
#: Options.xhp
msgctxt ""
@@ -381,7 +381,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 "Je tež lisćina wobmjezowanjow, kotruž móžeće wužiwać, zo byšće móžny rozsah rozrisanjow wobmjezował abo wěste wuměnjenja wosłabił. Ale w padźe ewolucionarneju solwerow DEPS a SCO so tež tute wobmjezowanja wužiwaja, zo bychu so hranicy za wariable problema podali. Ale připadneho rysa algoritmusow dla, so <emph>z dorazom doporuča</emph>, to činić a hornje (a jeli „Wot njenegatiwnych wariablow wuchadźeć“ je znjemóžnjene, tež delnje) hranicy za wšě wariable podać. Njetrjebaja blisko poprawneho rozrisanja być (kotrež najskerje je njeznate), ale měli hrube podaće wočakowaneje wulkosće być (0 ≤ var ≤ 1 or maybe -1000000 ≤ var ≤ 1000000)."
+msgstr "Je tež lisćina wobmjezowanjow, kotruž móžeće wužiwać, zo byšće móžny rozsah rozrisanjow wobmjezował abo wěste wuměnjenja wosłabił. Ale w padźe ewolucionarneju solwerow DEPS a SCO so tež tute wobmjezowanja wužiwaja, zo bychu so hranicy za wariable problema podali. Ale připadneho rysa algoritmusow dla, so <emph>z dorazom doporuča</emph>, to činić a hornje (a jeli „Wot njenegatiwnych wariablow wuchadźeć“ je znjemóžnjene, tež delnje) hranicy za wšě wariable podać. Njetrjebaja blisko poprawneho rozrisanja być (kotrež najskerje je njeznate), ale měli hrube podaće wočakowaneje wulkosće być (0 ≤ var ≤ 1 abo tež -1000000 ≤ var ≤ 1000000)."
#: Usage.xhp
msgctxt ""