<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<channel>
<title><![CDATA[Individual Plug-in - EuroSymphony Solver]]></title>
<link>http://www-03.ibm.com/software/lotus/symphony/plugin.nsf</link>
<description>Individual Plugin</description>
<lastBuildDate></lastBuildDate>
<item><title><![CDATA[EuroSymphony Solver]]></title><link>http://www-03.ibm.com/software/lotus/symphony/plugin.nsf/web_DisPlayPlugin?open&amp;unid=9119B6D85A58B5DC85257A2C00784149&amp;form=home</link><description><![CDATA[EuroSymphony Solver provides various fast algorithms to solve optimization problems in Lotus Symphony Spreadsheet.]]>&lt;br&gt;<![CDATA[EuroSymphony Solver Professional includes 4 different algorithms:]]>&lt;br&gt;<![CDATA[- The tried and true simplex algorithm performs well on practically occuring cases of linear optimization. All kinds of linear inequalities (&amp;lt;=, &amp;gt;= and =) are supported.]]>&lt;br&gt;<![CDATA[- The quadratic solver can find the minima and maxima of functions such as f(x,y)=x2+0.7y2+x-0.5y-1 while observing linear inequalities.]]>&lt;br&gt;<![CDATA[- The non-linear solver can be used to find the extreme value of any function you can describe in a Lotus Symphony Spreadsheet formula and it can still observe the constraints given in linear inequalities!]]>&lt;br&gt;<![CDATA[- The Hungarian algorithm solves a completely different class of optimization problems: assignment problems. Useful for deciding on logistics, splitting up work and splitting up cookies!]]>&lt;br&gt;</description><pubDate>Friday, June 29, 2012 5:53:30 PM</pubDate></item>
</channel>
</rss>
