# Question

Consider the following problem:

Maximize

Subject to

x1 ∈ {3, 6, 12}, x2 ∈ {3, 6}, x3 ∈ {3, 6, 9, 12},

x4 ∈ {6, 12}, x5 ∈ {9, 12, 15, 18},

all these variables must have different values,

x1 + x3 + x4 + 25.

Maximize

Subject to

x1 ∈ {3, 6, 12}, x2 ∈ {3, 6}, x3 ∈ {3, 6, 9, 12},

x4 ∈ {6, 12}, x5 ∈ {9, 12, 15, 18},

all these variables must have different values,

x1 + x3 + x4 + 25.

## Answer to relevant Questions

Consider the following problem: Maximize Subject to x1 ∈ {25, 30}, x2 ∈ {20, 25, 30, 35, 40, 50}, x3 ∈ {20, 25, 30}, x4 ∈ {20, 25}, all these variables must have different values, x2 + x3 + 60, x1 + x3 + 50. One powerful feature of constraint programming is that variables can be used as subscripts for the terms in the objective function. For example, consider the following traveling salesman problem. The salesman needs to visit ...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 nonlinear programming problem: Minimize Z = x41 + 2x21 + 2x1 x2 + 4x22, Subject to and x1 ≥ 0, x2 ≥ 0. (a) Of the special types of nonlinear programming problems described in Sec. 13.3, to which ...Consider the following convex programming problem: Minimize Z = x4 + x2 – 4x, Subject to x ≤ 2 and x ≥ 0.Post your question

0