I have the following constraints in an optimization problem if you can please help me on how to write them with disciplined convex programming rule to use in CVX
Here, x_1, x_2, x_3, x_4, x_5, a, b, c, d >0.
Based on some readings in this forum and suggestion by Mark. Stone, I can divide the constraint B into two constraints as follows:
Here, the last constraint I can write as follows:
Is this the correct way to handle the constraint B?
Also, how should I handle constraint A, I can do the following:
But, I am not sure what to do next.