Hi, I am trying to solve some linear programs in sage. >From the tutorial it seems that the right way to do this is nowadays the MixedIntegerLinearProgram() class. However, using the default glpk solver I can't find a way to distinguish between unbounded and unfeasible programs. That is p = MixedIntegerLinearProgram() t = p.new_variable() p.add_constraint(t[0]<=-1) p.set_objective(t[0]) p.solve()
(no solution) gives the same answer as p = MixedIntegerLinearProgram() t = p.new_variable() p.set_objective(t[0]) p.solve() (unbounded problem). Is there some official way how to distinguish these two cases? I suppose I could use cvxopt, but I fear it would be too slow for the real program I want to use it for. Thanks in advance, Robert Samal -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to sage-support@googlegroups.com. To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en.
