-------- Forwarded Message -------- From: Shambhavi Srinivasa <[email protected]> To: [email protected] Subject: Re: Help regarding solving binary integer linear programs in GLPSOL Date: Wed, 30 Nov 2011 17:08:55 -0700
Hi again, I had another question: 1) What are the advantages of solving a problem in CPLEX format? If there is any additional information that I need to know regarding the working of glpsol, please let me know. :) Thank you very much in advance, Sham On Wed, Nov 30, 2011 at 5:03 PM, Shambhavi Srinivasa <[email protected]> wrote: Hi, My name is Sham and I am a final year Masters student. I have used Glpsol to solve a binary integer linear program. I have my thesis defence next week and I had the following questions: 1) How does Glpsol solve binary integer linear programs? Does it use branch-and-bound? Can you give me precise steps as to how it goes about solving? 2) Why is Glpsol preferred to other LP solvers? 3) What is the problem size that Glpsol can handle in terms of binary linear programs? How does this depend upon : (a) The number of constraints (b) The number of variables (c) processor speed/ memory? I would be very thankful if you could answer these questions for me as soon as possible. Thank you, Sham _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
