I've no idea about the GLPK system.<br><br>But, isn't it the case that you can transform any linear inequality into a linear equality and a slack (or excess) variable? That's actually what you *need to do* to turn the problem into the canonical form, so that simplex can handle it.<br>
<br><br><div class="gmail_quote">2010/2/17 Daniel Peebles <span dir="ltr"><<a href="mailto:pumpkingod@gmail.com">pumpkingod@gmail.com</a>></span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Interesting. Do you have any details on this? It seems like it would be hard to express system of linear inequalities as a finite system of linear equations.<br><br><div>Thanks,</div><div>Dan</div><div><br><div class="gmail_quote">
2010/2/17 Matthias Görgens <span dir="ltr"><<a href="mailto:matthias.goergens@googlemail.com" target="_blank">matthias.goergens@googlemail.com</a>></span><div class="im"><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div>> As far as I can see, you'd use that for systems of linear equalities, but<br>
> for systems of linear inequalities with a linear objective function, it's<br>
> not suitable. I may be wrong though :)<br>
<br>
</div>There's a linear [1] reduction from one problem to the other and vice versa.<br>
<br>
[1] The transformation itself is a linear function, and it takes O(n) time, too.<br>
</blockquote></div></div><br></div>
<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>
<br></blockquote></div><br><br clear="all"><br>-- <br>Ozgur Akgun<br>