Andrew's right of course. I wonder if adding additional constraints of
s.t. condition3{f in FOO, b in BAR, a in BAZ} :
x[f,b,a] <= u[f,b,a] * z;
would help in developing an integer solution faster?
-----Original Message-----
From: Andrew Makhorin [mailto:[EMAIL PROTECTED]
Sent: Saturday, March 22, 2008 1:05 PM
To: Meketon, Marc
Cc: JohannesJ; [email protected]
Subject: Re: [Help-glpk] "0 or greater than" condition
> Probably correct formulation should be the following:
>
> s.t. condition1{f in FOO, b in BAR}:
> sum{a in BAZ} x[f,b,a] >= 5 * z;
>
> s.t. condition2{f in FOO, b in BAR}:
> sum{a in BAZ} x[f,b,a] <= u[f,b,a] * z;
>
> where u[f,b,a] is an upper bound of x[f,b,a].
The second constraint should be the following:
s.t. condition2{f in FOO, b in BAR}:
sum{a in BAZ} x[f,b,a] <= u[f,b] * z;
where u[f,b] is an upper bound of sum{a in BAZ} x[f,b,a].
----------------------------------------------------------------------------
This e-mail and any attachments may be confidential or legally privileged. If
you received this message in error or are not the intended recipient, you
should destroy the e-mail message and any attachments or copies, and you are
prohibited from retaining, distributing, disclosing or using any information
contained herein. Please inform us of the erroneous delivery by return e-mail.
Thank you for your cooperation.
----------------------------------------------------------------------------
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
