For questions related to geometric programming, which considers problems that optimize a polynomial subject to polynomial and monomial constraints.
Questions tagged [geometric-programming]
26 questions
0
votes
0 answers
Converting an XOR like condition to GP form
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…
Math
- 11