CompTIA DataX (DY0-001) — Question 38

Which of the following is a classic example of a constrained optimization problem?

Answer options

• A. The cold start problem
• B. The traveling salesman
• C. Calculating local maximum
• D. Calculating gradient descent

Correct answer: B

Explanation

The traveling salesman problem involves finding the shortest possible route that visits a set of locations and returns to the origin, making it a classic constrained optimization problem. The other options, while related to optimization, do not represent constrained scenarios in the same way. For instance, the cold start problem deals with initial data challenges rather than route optimization.