|
From: | Michael Bramley |
Subject: | [Help-glpk] Sizing the problem... |
Date: | Sun, 3 Feb 2013 10:48:21 -0500 |
Hello: We are using Linux glpk v4.48. This may be a school boy question, but I’ll ask and beg indulgence from those on the list. We have a number of LP/MIP problems that range in size. Most are quite manageable in glpk (yeah!!), while a small subset of others test the limits of glpk to either find a solution or run for days without a solution. Indeed, the annoying bit is that some problems just seem to run for days and days, while CPLEX seems to find an answer in minutes. Is there a way to determine this limit in advance, i.e. can we look at the problem and say that generates X conditions (or something else) and thus is not suited for glpk in its current state? Is there a way that we could build this into glpk as a pre-processing option? Looking for any ideas/help, and may even respond to invective. :) MB The contents of this message and any attachments to it are confidential and may be legally privileged. |
[Prev in Thread] | Current Thread | [Next in Thread] |