31 is fixed.<br><br><br><div class="gmail_quote">On Sat, Sep 25, 2010 at 9:58 AM, Matthew Galati <span dir="ltr"><<a href="mailto:magh@lehigh.edu">magh@lehigh.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi Kipp. I'll try to get this done soon.<br>
<div><div></div><div class="h5"><br>
On 9/25/10, Kipp Martin <<a href="mailto:kmartin@chicagobooth.edu">kmartin@chicagobooth.edu</a>> wrote:<br>
> Hi:<br>
><br>
> I am teaching a large scale lp/ip class and I would love to be able to<br>
> just solve a linear program with Dip. I would like to take various<br>
> models and show students the effects of treating different sets of<br>
> constraints as the core/relaxed constraints. This would be much easier<br>
> if I could just solve an LP or always be able to get the bound at node<br>
> 0. Would it be possible to fix tickets 31 and 43 so I can do this? It<br>
> seems like these might be relatively easy.<br>
><br>
> Thanks<br>
><br>
><br>
> --<br>
> Kipp Martin<br>
> Professor of Operations Research<br>
> and Computing Technology<br>
> Booth School of Business<br>
> University of Chicago<br>
> 5807 South Woodlawn Avenue<br>
> Chicago, IL 60637<br>
> 773-702-7456<br>
> <a href="mailto:kmartin@chicagobooth.edu">kmartin@chicagobooth.edu</a><br>
> <a href="http://www.chicagobooth.edu/faculty/bio.aspx?person_id=12825325568" target="_blank">http://www.chicagobooth.edu/faculty/bio.aspx?person_id=12825325568</a><br>
> <a href="http://projects.coin-or.org/OS" target="_blank">http://projects.coin-or.org/OS</a><br>
><br>
> _______________________________________________<br>
> Dip mailing list<br>
> <a href="mailto:Dip@list.coin-or.org">Dip@list.coin-or.org</a><br>
> <a href="http://list.coin-or.org/mailman/listinfo/dip" target="_blank">http://list.coin-or.org/mailman/listinfo/dip</a><br>
><br>
<br>
</div></div><div><div></div><div class="h5">--<br>
Sent from my mobile device<br>
</div></div></blockquote></div><br>