nerdexam
CompTIA

DY0-001 · Question #12

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

The correct answer is B. The traveling salesman. The traveling-salesman problem seeks the shortest possible route that visits each city exactly once and returns to the start, making it a textbook example of optimization under explicit

Mathematics and Statistics

Question

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

Options

  • AThe cold start problem
  • BThe traveling salesman
  • CCalculating local maximum
  • DCalculating gradient descent

How the community answered

(27 responses)
  • A
    4% (1)
  • B
    93% (25)
  • D
    4% (1)

Explanation

The traveling-salesman problem seeks the shortest possible route that visits each city exactly once and returns to the start, making it a textbook example of optimization under explicit

Topics

#traveling salesman#constrained optimization#combinatorial optimization

Community Discussion

No community discussion yet for this question.

Full DY0-001 Practice