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 for this problem.
Answer to relevant QuestionsOne 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 ...As introduced in Case 4.3 and revisited in Case 7.3, the Springfield School Board needs to assign the middle school students in the city’s six residential areas to the three remaining middle schools. The new complication ...Consider the variation of the Wyndor Glass Co. example represented in Fig. 13.5, where the second and third functional constraints of the original problem (see Sec. 3.1) have been replaced by 9x12 + 5x22 ≤ 216. Demonstrate ...Consider the following problem: Maximize f(x) = x3 + 2x – 2x2 – 0.25x4. (a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.04 and initial bounds x = 0, x-bar = 2.4. (b) ...Starting from the initial trial solution (x1, x2) = (0, 0), interactively apply the gradient search procedure with ϵ = 0.3 to obtain an approximate solution for the following problem, and then apply the automatic routine ...
Post your question