Tag Info

I think this can be approached using a constraint generation technique (variant of Benders decomposition), although I have no idea if it would efficient. By reordering the rows of $A$, we can assume that $$b(z)=\left[\begin{array}{c} \hat{b}\\ c+e-z \end{array}\right]$$where $\hat{b}\in\mathbb{R}^{d-m}$, $c\in \mathbb{R}^m$, $e=(1,\dots,1)^\prime \in \mathbb{... 4 By Farkas lemma, infeasibility of$Ax\leq b$is equivalent to feasibility of$A^Ty = 0, y^Tb < 0, y\geq 0$, or more practically useful$A^Ty=0, y^Tb \leq -1, y\geq 0$. Unfortunately, this will lead to a bilinear model when you parameterize$b(z)\$. It is fairly similar to an application I worked on a decade ago Oops! I cannot do it again: Testing for ...