Consider the problem linear: min cx logic: y1 ∨ y2 y1 → y3 conditional: yk ⇒ Akx ≥ bk , k = 1, 2, 3 where each yk is a Boolean variable. Write the problem without conditional constraints and using as...

Consider the problem

linear: min cx

logic: y1 ∨ y2

y1 → y3

conditional: yk ⇒

Akx ≥ bk

, k = 1, 2, 3

where each yk is a Boolean variable. Write the problem without conditional

constraints and using as many linear disjunctions as possible. Hint: The formula y1 → y3 is equivalent to ¬y1 ∨ y3.