Hi everyone and Alberto,<br><br>Numeric.LinearProgramming[1] provides a very nice interface for solving LP optimisation problems, and the well-known simplex algorithm itself. I must say I quite liked the interface it provides, simple yet sufficient.<br>
<br>But, to my understanding, there is a confusion in the constructor name (symbols actually) for constraints. In LP, one needs to write constraints in the form of ==, &lt;=, or &gt;= only. You <i>cannot </i>write a constraint using strict inequalities. The algorithm has nothing wrong, but I guess it would be better to have constructor symbols right. See [2]<br>
<br>If this is a design choice, I think it should explicitly be stated.<br><br>Regards,<br><br>[1] <a href="http://hackage.haskell.org/package/hmatrix-glpk">http://hackage.haskell.org/package/hmatrix-glpk</a><br>[2] <a href="http://hackage.haskell.org/packages/archive/hmatrix-glpk/0.1.0/doc/html/Numeric-LinearProgramming.html#t%3ABound">http://hackage.haskell.org/packages/archive/hmatrix-glpk/0.1.0/doc/html/Numeric-LinearProgramming.html#t%3ABound</a>
 <br><br>-- <br>Ozgur Akgun<br>