On Thu, 3 Nov 2011, [email protected] wrote:
With Linear Programming you get fractional answers; UNLESS the coefficient matrix is totally unimodular and the b vector has all integer components.
That is certainly sufficient, but it is not necessary. min y st 2x + 3y >= 5 -2x + 3y >= 1 No total unimodularity here. Also, most leaf nodes are not totally unimodular. -- Michael [email protected] "Pessimist: The glass is half empty. Optimist: The glass is half full. Engineer: The glass is twice as big as it needs to be." _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
