# Question

Apply the procedure for tightening constraints to each of the following constraints for a pure BIP problem:

(a) x1 + 3x2 – 4x3 ≤ 2.

(b) 3x1 – x2 + 4x3 ≥ 1.

(a) x1 + 3x2 – 4x3 ≤ 2.

(b) 3x1 – x2 + 4x3 ≥ 1.

## Answer to relevant Questions

One of the constraints of a certain pure BIP problem is x1 + 3x2 + 2x3 + 4x4 ≤ 5. Identify all the minimal covers for this constraint, and then give the corresponding cutting planes. Consider the following BIP problem: Maximize Subject to and all xj binary. Problem 11.3-2 describes how the owner of a chain of three grocery stores needs to determine how many crates of fresh strawberries should be allocated to each of the stores. Formulate a compact constraint programming model ...Suppose that a mathematical model fits linear programming except for the restriction that |x1 – x2 | = 0, or 3, or 6. Show how to reformulate this restriction to fit an MIP model. Consider the following geometric programming problem: Minimize f(x) = 2x1–2x2–1 + x2–2, Subject to 4x1x2 + x21x22 ≤ 12 And x1 ≥ 0, x2 ≥ 0. (a) Transform this problem to an equivalent convex programming ...Post your question

0