Hi! Thank you for your answer! Is it possible to run it with glpk api?
Thanks again, Dirso 2010/10/13 glpk xypron <[email protected]> > Hello Dirso, > > your problem description can be formulated in GMPL as: > > # year, measure, res > set A, dimen 3; > > param d{A}; > > var a; > var b; > var c; > > minimize obj : > sum{(year, measure, res) in A} res - c - b * measure - a * year; > > Your problem is unbounded. > > For appropriate a, b, c in {-infinity, +infinity} > sum{d[i]} = -infinity. > > Best regards > > Xypron > > -------- Original-Nachricht -------- > > Datum: Wed, 13 Oct 2010 11:36:59 -0300 > > Betreff: [Help-glpk] Minimizing an array sum > > > Hi, > > I'm using GLPK C API and I'm having problems to express my objective. > > > > I have about 40 conditions: a*year[i] + b*measure[i] + c + d[i] = res[i] > > I have to find the tuple {a,b,c}, where sum{d[i]} in minimum > > Data I have: arrays year[], measurem[], res[]. This is NOT LPI > > > > Any ideas? > > > > Thanks, > > Dirso > > -- > GMX DSL Doppel-Flat ab 19,99 €/mtl.! Jetzt auch mit > gratis Notebook-Flat! http://portal.gmx.net/de/go/dsl >
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
