As far as I can see, you'd use that for systems of linear equalities, but for systems of linear inequalities with a linear objective function, it's not suitable. I may be wrong though :)

On Tue, Feb 16, 2010 at 3:37 PM, Felipe Lessa <felipe.lessa@gmail.com> wrote:
On Tue, Feb 16, 2010 at 03:12:53PM -0500, Daniel Peebles wrote:
> How would you use hmatrix? By linear programming I assume he means systems
> of linear inequalities, as typically solved by the simplex algorithm. I too
> am interested in this question (and the more general one of nonlinear
> optimization)!

I have never used this part of hmatrix, but does
Numeric.LinearAlgebra satisfy your needs?  In particular, see
linearSolve[1] and linearSolveR[2].

[1] http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-Algorithms.html#v%3AlinearSolve
[2] http://hackage.haskell.org/packages/archive/hmatrix/0.8.3.1/doc/html/Numeric-LinearAlgebra-LAPACK.html#v%3AlinearSolveR

HTH,

--
Felipe.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe