# Question: One powerful feature of constraint programming is that variables can

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 each of n cities (city 1, 2, . . . ,n) exactly once, starting in city 1 (his home city) and returning to city 1 after completing the tour. Let cij be the distance from city i to city j for i, j = 1, 2, . . . , n (i ≠ j). The objective is to determine which route to follow so as to minimize the total distance of the tour. (As discussed further in Chap. 14, this traveling salesman problem is a famous classic OR problem with many applications that have nothing to do with salesmen.) Letting the decision variable xj (j = 1, 2, . . . ,n, n = 1) denote the jth city visited by the salesman, where x1 = 1 and xn = 1 = 1, constrant programming allows writing the objective as

Using this objective function, formulate a complete constraint programming model for this problem.

Using this objective function, formulate a complete constraint programming model for this problem.

**View Solution:**## Answer to relevant Questions

Bentley Hamilton throws the business section of The New York Times onto the conference room table and watches as his associates jolt upright in their overstuffed chairs. Mr. Hamilton wants to make a point. He throws the ...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 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) = ...Use the bisection method with an error tolerance ϵ = 0.04 and with the following initial bounds to interactively solve (approximately) each of the following problems. (a) Maximize f(x) = 6x – x2, with x = 0, x-bar = ...For the P & T Co. problem described in Sec. 9.1, suppose that there is a 10 percent discount in the shipping cost for all truckloads beyond the first 40 for each combination of cannery and warehouse. Draw figures like Figs. ...Post your question