logical constraint in MILP

GAMS
1

how can i formulate below equation in mixed integer linear
programming?

where x,PK are variables and gen(i,LT) is parameter;

if x=0, Pk(t,k,LT)=Pk(t,k,LT)*(1-gen(i,LT))

if x=1, Pk(t,k,LT)=Pk(t,k,LT)*gen(i,LT)

\

2

i want to add x has -1, 0,1 value and Pk is continoue variable 0<PK<1.

Best

\

3

Take a look at:
http://home.ubalt.edu/ntsbarsh/opre640a/partIII.htm#roffoncont

Regards

2011/10/21 Fatemi



i want to add x has -1, 0,1 value and Pk is continoue variable 0<PK<1.

Best

–
To post to this group, send email to gamsworld@googlegroups.com.
To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en.



\

Edson Valle
edsoncv@gmail.com

–
To post to this group, send email to gamsworld@googlegroups.com.
To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en.

4

thanks Edson Cordeiro. but it does not work.

how can i free from below formula in MILP

pk=pk*q

where q is binary variable and Pk is continoue variable 0<PK<1.

\