On Tue, 2015-11-17 at 14:31 +0000, GIRAUD Loïc 240112 wrote: > Dear Mister, > > > > I am currently using GLPK for optimization purposes. > > My optimization problem has numerous variables and constraints. > However, most of the constraints contain only a few variables. In this > way, the matrix of my problem contains many zero. To give you an > estimate, there are more than 30 million of cases in my matrix but > only 18000 of them are non-zero values. As a consequence, I run out of > memory when I want to run the optimization problem. > > Is there any GLPK function that can express a matrix as a sparse > matrix?
Sure. Please see the glpk reference manual (glpk.pdf) included in the distribution tarball. See also http://en.wikibooks.org/wiki/GLPK . > Or would you have any other solution to solve this difficulty? > > > > Thank you in advance for your help. > > > > Sincerely, > > > > Description : Description : > cid:[email protected] > > > Loïc GIRAUD > > Doctorant / PhD Student > > Institut National de l’Energie > Solaire / National Institut of the > Solar Energy > > CEA/LITEN – DTBH / LSHT > > Description : Description : > cid:[email protected] > > Commissariat à l’énergie atomique > et aux énergies alternatives > > Bât. PUMA 3, 50 avenue du Lac > Léman| F-73375 Le Bourget-du-Lac > > T. +33 (0)4 79 79 2346 > > [email protected];www.ines-solaire.org > > > > > > > > _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
