In my geometric programming optimization problem, I have two decision variables, namely $\epsilon \le X\le 1$ and $\epsilon \le Y \le 1$. I need an XOR-like condition to impose that if one of them has $\epsilon$ value, the other one should also be $\epsilon$. Further, if one has a value greater than $\epsilon$, the other one should have a value greater than $\epsilon$. How can I show this constraint as the standard geometric programming constraint?
Asked
Active
Viewed 14 times
0
-
In GP all variables are strictly positive or you have some nasty unattainmnent issues. – Michal Adamaszek Dec 14 '22 at 14:00
-
Yes, I know, I have considered a default epsilon value for all of the variables. – Math Dec 14 '22 at 14:48