From: Complexity and algorithms for copy-number evolution problems
\(a_{i, j, s}\) | \(d_{i, j, s}\) | Additional | |
---|---|---|---|
(a) \(y_{i, s} = 0 \wedge y_{j, s} = 0\) | \(\le e\) | \(\le e\) | |
(b) \(y_{i, s} \ne 0 \wedge y_{j, s} \ne 0\) | \(\le e\) | \(< y_{i, s}\) | \(y_{j,s} + d_{i,j,s} = y_{i,s} + a_{i,j,s}\) |
(c) \(y_{i, s} \ne 0 \wedge y_{j, s} = 0\) | \(\le e\) | \(\ge y_{i, s}\) | |
\(\le e\) | |||
(d) \(y_{i, s} = 0 \wedge y_{j, s} \ne 0\) | Infeasible | Infeasible | Infeasible |