[Dip] Tickets 31 and 43

[Kipp Martin]

Hi:

I am teaching a large scale lp/ip class and I would love to be able to 
just solve a linear program with Dip. I would like to take various 
models and show students the effects of treating different sets of 
constraints as the core/relaxed constraints. This would be much easier 
if I could just solve an LP or always be able to get the bound at node 
0.  Would it be possible to fix tickets 31 and 43 so I can do this? It 
seems like these might be relatively easy.

Thanks


-- 
Kipp Martin
Professor of Operations Research
and Computing Technology
Booth School of Business
University of Chicago
5807 South Woodlawn Avenue
Chicago, IL 60637
773-702-7456
kmartin at chicagobooth.edu
http://www.chicagobooth.edu/faculty/bio.aspx?person_id=12825325568
http://projects.coin-or.org/OS