When solving mixed integer programs with some binary variables, it is often desirable to use logical Boolean operators like OR, AND, NOT, XOR (and also a few more complex ones).
These can all be expressed as MILP constrains, as shown e.g. here. These are simple transformations but are amenable to errors, and using operator overloading or named functions for them would simplify and clarified user code.
I think cvxpy would benefit from such an addition.
When solving mixed integer programs with some binary variables, it is often desirable to use logical Boolean operators like OR, AND, NOT, XOR (and also a few more complex ones).
These can all be expressed as MILP constrains, as shown e.g. here. These are simple transformations but are amenable to errors, and using operator overloading or named functions for them would simplify and clarified user code.
I think cvxpy would benefit from such an addition.