--mipgap 100000 actually speeds up the program by a factor 2 or more. But I found out now which calculations need much time: All constraints which consider several timesteps at once, for example definitions of ramp-down-time of production, minimum up- and down time etc. If I leave out these constraints, the program takes about 15 seconds instead of several minutes which is comparable with the --nomip option.
Wolfgang Linder Approvisionnement et Trading Gestion Court Terme Groupe E SA Bd de Pérolles 25 1701 Fribourg T +41 26 352 71 47 F +41 26 352 71 49 <mailto:[email protected]> www.groupe-e.ch -----Message d'origine----- De : Andrew Makhorin [mailto:[email protected]] Envoyé : vendredi, 4. septembre 2009 14:47 À : Linder Wolfgang Cc : [email protected] Objet : Re: [Help-glpk] binary decision variables, --nomip > Which is the option that finds the first feasible solution? Try '--mipgap 1000000' . _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
