help-glpk
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-glpk] [Fwd: Binary programming and simplex]


From: Andrew Makhorin
Subject: [Help-glpk] [Fwd: Binary programming and simplex]
Date: Fri, 04 Nov 2011 01:53:24 +0300

-------- Forwarded Message --------
From: Francesco Arneodo <address@hidden>
To: address@hidden
Subject: Binary programming and simplex
Date: Thu, 3 Nov 2011 16:27:17 +0100

Hello,
I am using GLPK to solve a binary problem with 11,000 variables.
I use the simplex method and it seems to work fine. However, I thought  
that binary problems are best solved with the branch and cut method  
and I have difficulty in understanding how the simplex tackles a  
binary problem.
What GLPK does? I mean, it really uses the simplex method, or seeing  
that it's a binary problem automatically switches to branch and cut?
Thanks,



Francesco Arneodo
INFN - Laboratori Nazionali del Gran Sasso
Assergi 67100 L'Aquila - Italy
tel. +39 0862 437-207 mobile (-825)
fax +39 0862 437570
Skype: frnz65







reply via email to

[Prev in Thread] Current Thread [Next in Thread]