On Mon, 4 May 2009, Michael Hennebry wrote:
If the numbers are really small:
Z = SUM Bz[j, k]*max(j, k)
j,k
X = SUM Bz[j, k]*j
j,k
Y = SUM Bz[j, k]*k
j,k
I'd forgotten to add
1 = SUM Bz[j, k]
j,k
I think that this is *linearly* equivalent to the preceeding,
but it has a lot more binaries, so I can't recommend it.
Rather obviously (X, Y, Z) is constrained
to the convex hull of its feasible values.
--
Michael [email protected]
"Pessimist: The glass is half empty.
Optimist: The glass is half full.
Engineer: The glass is twice as big as it needs to be."
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
