[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] [Fwd: Binary programming and simplex]
|
From: |
Michael Hennebry |
|
Subject: |
Re: [Help-glpk] [Fwd: Binary programming and simplex] |
|
Date: |
Fri, 4 Nov 2011 14:52:32 -0500 (CDT) |
|
User-agent: |
Alpine 1.00 (DEB 882 2007-12-20) |
On Thu, 3 Nov 2011, address@hidden 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 address@hidden
"Pessimist: The glass is half empty.
Optimist: The glass is half full.
Engineer: The glass is twice as big as it needs to be."