Binary multiplication for MINLP
Posted: Sun Sep 19, 2021 6:02 pm
Hello,
I'm trying to model MINLP by using binary multiplication to choose a specific value from a parameter.
Basically, I have two domains, r /1*6/ and t /1*8/
I want to choose the best variable from X1(t) that fits the following equations in order to optimize 'r'.
The results are Infeasible solutions and the binary variable shows some decimal values. I would inquire how to approach a solution from my code?
I'm trying to model MINLP by using binary multiplication to choose a specific value from a parameter.
Basically, I have two domains, r /1*6/ and t /1*8/
Code: Select all
Parameter X1(t) the valus of p
/1 1.5
2 2
3 2.5
4 3
5 3.5
6 4
7 4.5
8 5/;
Binary variable Ub;
Variables z,tds(r)
Code: Select all
Equations Obj,con1(r),e1(r);
Obj.. z =e= sum(r, ((tds(r) * 0.14) / (vcPower((pf(r) / (sum(t,(X1(t)*Ub(r,t))) * cti(r))),0.02) - 1)));
e1(r).. sum(t,Ub(r,t))=e=1;
con1(r).. ((tds(r) * 0.14) / (vcPower((pf(r) / (sum(t,(X1(t)*Ub(r,t)))* cti(r))),0.02) - 1)) =g= 0.2;
Model SampleProblem1 /all/;
Solve SampleProblem1 maximizing z using minlp;