Hi, im trying to solve a large binary integer programm with about 50000 variables an 6000 constraints. Moreover im using PyMathProg to solve the program, which makes it possible to use glpk in a python script and formulate a model in the GNU MathProg language. The solution process is relatively fast (~ 17s) but it takes very long until the solution process starts (~ 2 hours). Thus the time to process the objectfunction and the constraints is very long. Is there a possibility to shorten this time or is this normal? Also the coefficients of the binary variables in the object function are very big ( ~ 10^9). Can this be a reason for the long duration?
Best Regards Alex _________________________________________ NEU: Mit WEB.DE DSL über 1000,- ¿ sparen! http://produkte.web.de/go/02/ _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
