As far as I can see, you'd use that for systems of linear <i>equalities</i>, but for systems of linear <i>inequalities</i> with a linear objective function, it's not suitable. I may be wrong though :)<br><br><div class="gmail_quote">
On Tue, Feb 16, 2010 at 3:37 PM, Felipe Lessa <span dir="ltr"><<a href="mailto:felipe.lessa@gmail.com">felipe.lessa@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="im">On Tue, Feb 16, 2010 at 03:12:53PM -0500, Daniel Peebles wrote:<br>
> How would you use hmatrix? By linear programming I assume he means systems<br>
> of linear inequalities, as typically solved by the simplex algorithm. I too<br>
> am interested in this question (and the more general one of nonlinear<br>
> optimization)!<br>
<br>
</div>I have never used this part of hmatrix, but does<br>
Numeric.LinearAlgebra satisfy your needs? In particular, see<br>
linearSolve[1] and linearSolveR[2].<br>
<br>
[1] <a href="http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-Algorithms.html#v%3AlinearSolve" target="_blank">http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-Algorithms.html#v%3AlinearSolve</a><br>
[2] <a href="http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-LAPACK.html#v%3AlinearSolveR" target="_blank">http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-LAPACK.html#v%3AlinearSolveR</a><br>
<br>
HTH,<br>
<div><div></div><div class="h5"><br>
--<br>
Felipe.<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br>