On Tue, 26 Jun 2012, Daniele Micarelli wrote:
I have to solve a linear programming problem with the language and I'm
planning mathprog
I have difficulty writing the following constraint: ΣΣ r (i) * x (i, t) <= R
where the first summation is true for all belonging to the W and the second
summation has as its lower end t-d(i) and upper bound as t-1
You've not made it clear what is a variable and what is not.
If r and x are both variables, you are done.
*Linear* programming does not involve products of variables.
--
Michael [email protected]
"On Monday, I'm gonna have to tell my kindergarten class,
whom I teach not to run with scissors,
that my fiance ran me through with a broadsword." -- Lily
_______________________________________________
Help-glpk mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/help-glpk
