In Sec. 12.8, at the end of the subsection on tightening constraints, we indicated that the constraint 4x1 – 3x2 + x3 + 2x4 ≤ 5 can be tightened to 2x1 – 3x2 + x3 + 2x4 ≤ 3 and then to 2x1 – 2x2 + x3 + 2x4 ≤ 3. Apply the procedure for tightening constraints to confirm these results.
Answer to relevant QuestionsApply the procedure for tightening constraints to the following constraint for a pure BIP problem: 3x1 – 2x2 + x3 ≤ 3. Generate as many cutting planes as possible from the following constraint for a pure BIP problem: 3x1 + 5x2 + 4x3 + 8x4 ≤ 10. Consider the Job Shop Co. example introduced in Sec. 9.3. Table 9.25 shows its formulation as an assignment problem. Use global constraints to formulate a compact constraint programming model for this assignment problem. Poor inventory management at the local warehouse for Furniture City has led to overstocking of many items and frequent shortages of some others. To begin to rectify this situation, the 20 most popular kitchen sets in ...Consider the variation of the Wyndor Glass Co. problem represented in Fig. 13.6, where the original objective function (see Sec. 3.1) has been replaced by Z = 126x1 – 9x12 + 182x2 – 13x22. Demonstrate that (x1, x2) = ...
Post your question