1 files changed, 409 insertions, 0 deletions
diff --git a/translations/source/lt/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po b/translations/source/lt/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
new file mode 100644
index 000000000..967e3e6a4
--- /dev/null
+++ b/translations/source/lt/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
@@ -0,0 +1,409 @@
+#. extracted from nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver
+msgid ""
+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-11-19 18:41+0000\n"
+"Last-Translator: Modestas Rimkus <modestas.rimkus@gmail.com>\n"
+"Language-Team: LANGUAGE <LL@li.org>\n"
+"Language: lt\n"
+"MIME-Version: 1.0\n"
+"Content-Type: text/plain; charset=UTF-8\n"
+"Content-Transfer-Encoding: 8bit\n"
+"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && (n%100<10 || n%100>=20) ? 1 : 2);\n"
+"X-Generator: LibreOffice\n"
+"X-Accelerator-Marker: ~\n"
+"X-POOTLE-MTIME: 1479580880.000000\n"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"tit\n"
+"help.text"
+msgid "Options"
+msgstr "Parinktys"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"bm_id0503200917110375_scalc\n"
+"help.text"
+msgid "<bookmark_value>Solver for Nonlinear Problems;Options</bookmark_value>"
+msgstr "<bookmark_value>Netiesinių uždavinių sprendiklis;parinktys</bookmark_value>"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"hd_id0503200917103593\n"
+"help.text"
+msgid "General Options"
+msgstr "Bendrosios parinktys"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103780\n"
+"help.text"
+msgid "Size of Swarm"
+msgstr "Telkinio dydis"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103723\n"
+"help.text"
+msgid "… defines the number of individuals to participate in the learning process. Each individual finds its own solutions and contributes to the overall knowledge."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103771\n"
+"help.text"
+msgid "Learning Cycles"
+msgstr "Ciklų skaičius"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103720\n"
+"help.text"
+msgid "… defines the number of iterations, the algorithm should take. In each iteration, all individuals make a guess on the best solution and share their knowledge."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103732\n"
+"help.text"
+msgid "Variable Bounds Guessing"
+msgstr "Apskaičiuoti kintamųjų ribas"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id050320091710378\n"
+"help.text"
+msgid "If enabled (default), the algorithm tries to find variable bounds by looking at the starting values."
+msgstr "Jei įgalinta (numatytoji parinktis), algoritmas bandys apskaičiuoti kintamųjų ribas pagal pradines reikšmes."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103794\n"
+"help.text"
+msgid "Variable Bounds Threshold"
+msgstr "Kintamųjų ribų slenkstis"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103710\n"
+"help.text"
+msgid "When guessing variable bounds, this threshold specifies, how the initial values are shifted to build the bounds. For an example how these values are calculated, please refer to the Manual in the Wiki."
+msgstr "Kai apskaičiuojamos kintamųjų ribos, slenksčio reikšmė nurodo, kaip bus keičiamos pradinės reikšmės. Pavyzdžių, kaip šios reikšmės skaičiuojamos, galima rasti vikyje."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103740\n"
+"help.text"
+msgid "Use ACR Comparator"
+msgstr "Naudoti ACR palyginimą"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103766\n"
+"help.text"
+msgid "If <emph>disabled</emph> (default), the BCH Comparator is used. It compares two individuals by first looking at their constraint violations and only if those are equal, it measures their current solution."
+msgstr "Jei <emph>išjungta</emph> (numatytoji parinktis), bus naudojamas BCH palyginimas. Tokiu būdu du elementai pirmiausia lyginami pagal ribojimų pažeidimus, ir tik jei šie vienodi, vertinamas esamas sprendimas."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103744\n"
+"help.text"
+msgid "If <emph>enabled</emph>, the ACR Comparator is used. It compares two individuals dependent on the current iteration and measures their goodness with knowledge about the libraries worst known solutions (in regard to their constraint violations)."
+msgstr "Jei <emph>įgalinta</emph>, naudojamas ACR palyginimas. Du elementai lyginami pagal esamą iteraciją ir vertinamas jų sprendimų tinkamumas, lyginant juos su blogiausiais žinomais sprendimais iš bibliotekos (atsižvelgiant į ribojimų pažeidimus)."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103792\n"
+"help.text"
+msgid "Use Random Starting Point"
+msgstr "Atsitiktinai parinkti pradinį tašką"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103790\n"
+"help.text"
+msgid "If <emph>enabled</emph>, the library is simply filled up with randomly chosen points."
+msgstr "Jei <emph>įjungta</emph>, biblioteka užpildoma atsitiktinai parinktais taškais."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103765\n"
+"help.text"
+msgid "If <emph>disabled</emph>, the currently present values (as given by the user) are inserted in the library as reference point."
+msgstr "Jei <emph>išjungta</emph>, esamos reikšmės (nurodytos naudotojo) įterpiamos į biblioteką kaip pradiniai taškai."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0504200917103794\n"
+"help.text"
+msgid "Stagnation Limit"
+msgstr "Sąstingio limitas"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id050320091710377\n"
+"help.text"
+msgid "If this number of individuals found solutions within a close range, the iteration is stopped and the best of these values is chosen as optimal."
+msgstr "Jei toks skaičius elementų randa vienas kitam artimus sprendimus, iteracija stabdoma ir geriausia iš tų reikšmių laikoma optimalia."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103762\n"
+"help.text"
+msgid "Stagnation Tolerance"
+msgstr "Sąstingio nuokrypis"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103834\n"
+"help.text"
+msgid "Defines in what range solutions are considered “similar”."
+msgstr "Nurodomas rėžis, kuriame esantys sprendimai laikomi „artimais“."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103891\n"
+"help.text"
+msgid "Show Enhanced Solver Status"
+msgstr "Rodyti išsamią sprendiklio būseną"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0503200917103832\n"
+"help.text"
+msgid "If <emph>enabled</emph>, an additional dialog is shown during the solving process which gives information about the current progress, the level of stagnation, the currently best known solution as well as the possibility, to stop or resume the solver."
+msgstr "Jei <emph>įgalinta</emph>, sprendimo metu rodomas papildomas dialogo langas su informacija apie sprendimo eigą, sąstingio lygį, tuo metu geriausią žinomą sprendimą, yra galimybė sustabdyti ar iš naujo paleisti sprendiklį."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"hd_id0603200910392151\n"
+"help.text"
+msgid "DEPS-specific Options"
+msgstr "DEPS parinktys"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394232\n"
+"help.text"
+msgid "Agent Switch Rate"
+msgstr "Agento perjungimo dažnis"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394248\n"
+"help.text"
+msgid "Specifies the probability for an individual to choose the Differential Evolution strategy."
+msgstr "Nurodoma tikimybė elementui pasirinkti prie diferencialinės evoliucijos strategijos."
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394277\n"
+"help.text"
+msgid "DE: Crossover Probability"
+msgstr "DE: sankirtos tikimybė"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394280\n"
+"help.text"
+msgid "… defines the probability of the individual being combined with the globally best point. If crossover is not used, the point is assembled from the own memory of the individual."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394216\n"
+"help.text"
+msgid "DE: Scaling Factor"
+msgstr "Mastelio koeficientas"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id060320091039424\n"
+"help.text"
+msgid "During crossover, the scaling factor decides about the “speed” of movement."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id060320091039421\n"
+"help.text"
+msgid "PS: Constriction Coefficient"
+msgstr "PS: suslėgimo koeficientas"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394225\n"
+"help.text"
+msgid "… defines the speed at which the particles/individuals move towards each other."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394222\n"
+"help.text"
+msgid "PS: Cognitive Constant"
+msgstr "PS: kognityvinė konstanta"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394212\n"
+"help.text"
+msgid "… sets the importance of the own memory (in particular the best reached point so far)."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394292\n"
+"help.text"
+msgid "PS: Social Constant"
+msgstr "PS: socialinė konstanta"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394284\n"
+"help.text"
+msgid "… sets the importance of the global best point between all particles/individuals."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id060320091039425\n"
+"help.text"
+msgid "PS: Mutation Probability"
+msgstr "PS: mutacijos tikimybė"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910394272\n"
+"help.text"
+msgid "… defines the probability, that instead of moving a component of the particle towards the best point, it randomly chooses a new value from the valid range for that variable."
+msgstr ""
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"hd_id0603200910401383\n"
+"help.text"
+msgid "SCO-specific Options"
+msgstr "SCO parinktys"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id0603200910401382\n"
+"help.text"
+msgid "Size of Library"
+msgstr "Bibliotekos dydis"
+
+#: Options.xhp
+msgctxt ""
+"Options.xhp\n"
+"par_id060320091040136\n"
+"help.text"
+msgid "… defines the amount of information to store in the public library. Each individual stores knowledge there and asks for information."
+msgstr "… nurodomas informacijos kiekis, saugotinas viešoje bibliotekoje. Kiekvienas elementas ten informaciją įrašo, taip pat jos ten ieško."
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"tit\n"
+"help.text"
+msgid "Usage"
+msgstr "Naudojimas"
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"bm_id0603200910434044_scalc\n"
+"help.text"
+msgid "<bookmark_value>Solver for Nonlinear Problems;Usage</bookmark_value>"
+msgstr "<bookmark_value>Netiesinių uždavinių sprendiklis;naudojimas</bookmark_value>"
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"hd_id0603200910430882\n"
+"help.text"
+msgid "Usage"
+msgstr "Naudojimas"
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"par_id0603200910430845\n"
+"help.text"
+msgid "Regardless whether you use DEPS or SCO, you start by going to Tools - Solver and set the Cell to be optimized, the direction to go (minimization, maximization) and the cells to be modified to reach the goal. Then you go to the Options and specify the solver to be used and if necessary adjust the according <link href=\"com.sun.star.comp.Calc.NLPSolver/Options.xhp\">parameters</link>."
+msgstr ""
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"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 ""
+
+#: Usage.xhp
+msgctxt ""
+"Usage.xhp\n"
+"par_id0603200910430873\n"
+"help.text"
+msgid "Bounds are specified by selecting one or more variables (as range) on the left side and entering a numerical value (not a cell or a formula) on the right side. That way you can also choose one or more variables to be <emph>Integer</emph> or <emph>Binary</emph> only."
+msgstr ""
+
+#: help.tree
+msgctxt ""
+"help.tree\n"
+"08\n"
+"help_section.text"
+msgid "Solver for Nonlinear Problems"
+msgstr "Netiesinių uždavinių sprendiklis"
+
+#: help.tree
+msgctxt ""
+"help.tree\n"
+"0816\n"
+"node.text"
+msgid "Solver for Nonlinear Problems"
+msgstr "Netiesinių uždavinių sprendiklis"