### 3.7.136. Linear programming

A constraint for which a reference provides a linear relaxation (see, e.g., the $\mathrm{𝚊𝚕𝚕𝚍𝚒𝚏𝚏𝚎𝚛𝚎𝚗𝚝}$, the $\mathrm{𝚌𝚒𝚛𝚌𝚞𝚒𝚝}$, the $\mathrm{𝚌𝚞𝚖𝚞𝚕𝚊𝚝𝚒𝚟𝚎}$, the $\mathrm{𝚜𝚞𝚖}$, and the $\mathrm{𝚛𝚎𝚐𝚞𝚕𝚊𝚛}$ [CoteGendronRousseau07] constraints) or a constraint for which the flow model was derived by reformulating the constraint as a linear program (see, e.g., the $\mathrm{𝚊𝚖𝚘𝚗𝚐}_\mathrm{𝚜𝚎𝚚}$ and the $\mathrm{𝚜𝚕𝚒𝚍𝚒𝚗𝚐}_\mathrm{𝚜𝚞𝚖}$ constraints), or a constraint that was also proposed within the context of linear programming (see, e.g., the $\mathrm{𝚌𝚒𝚛𝚌𝚞𝚒𝚝}$, and $\mathrm{𝚍𝚘𝚖𝚊𝚒𝚗}_\mathrm{𝚌𝚘𝚗𝚜𝚝𝚛𝚊𝚒𝚗𝚝}$ constraints). In the context of linear programming the book of John N. Hooker [Hooker07book] provides a significant set of relaxations for a number of global constraints.