3.7.136. Linear programming

A constraint for which a reference provides a linear relaxation (see, e.g., the πšŠπš•πš•πšπš’πšπšπšŽπš›πšŽπš—πš, the πšŒπš’πš›πšŒπšžπš’πš, the πšŒπšžπš–πšžπš•πšŠπšπš’πšŸπšŽ, the πšœπšžπš–, and the πš›πšŽπšπšžπš•πšŠπš›Β [CoteGendronRousseau07] constraints) or a constraint for which the flow model was derived by reformulating the constraint as a linear program (see, e.g., the πšŠπš–πš˜πš—πš_𝚜𝚎𝚚 and the πšœπš•πš’πšπš’πš—πš_πšœπšžπš– constraints), or a constraint that was also proposed within the context of linear programming (see, e.g., the πšŒπš’πš›πšŒπšžπš’πš, and πšπš˜πš–πšŠπš’πš—_πšŒπš˜πš—πšœπšπš›πšŠπš’πš—πš 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.