# Question

Consider the following problem:

Maximize Z = 3x1 + 2x2 + 4x3 + x4,

Subject to

x1 ∈ {1, 3}, x2 ∈ {1, 2}, x3 ∈ {2, 3}, x4 ∈ {1, 2, 3, 4},

all these variables must have different values,

x1 + x2 + x3 + x4 ≤ 10.

Maximize Z = 3x1 + 2x2 + 4x3 + x4,

Subject to

x1 ∈ {1, 3}, x2 ∈ {1, 2}, x3 ∈ {2, 3}, x4 ∈ {1, 2, 3, 4},

all these variables must have different values,

x1 + x2 + x3 + x4 ≤ 10.

## Answer to relevant Questions

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. 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 ...The Research and Development Division of the Progressive Company has been developing four possible new product lines. Management must now make a decision as to which of these four products actually will be produced and at ...Consider the following constrained optimization problem: Maximize f(x) = –6x + 3x2 – 2x3, Subject to x ≥ 0. Consider the following problem: Maximize f(x) = x3 + 30x – x6 – 2x4 – 3x2. (a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.07 and find appropriate initial bounds by ...Post your question

0