Benson's algorithm: Difference between revisions

Revision as of 17:00, 19 May 2012

Revision as of 06:32, 23 August 2012

Line 7:

:<math>\min Px \; \text{ subject to } x \in S</math>

for some <math>P \in \mathbb{R}^{m \times n}</math> and a [[nonempty]] [[polyhedron]] <math>S \subset \mathbb{R}^n</math>, then Benson's algorithm will find the [[extreme point]]s of the set <math>P[S] + \mathbb{R}^m_+</math>.<ref name="Lohne"/>

== Implementations ==

=== Matlab ===

* [http://ito.mathematik.uni-halle.de/~loehne/index_en_dl.php Bensolve]

== References ==