Question 1

1 pts

A heuristic is a relatively simple solution method that often provides good but not necessarily optimal solutions.

Group of answer choices

True

False

Flag question: Question 2

Question 2

1 pts

Mixed integer linear programming solver is a heuristic algorithm.

Group of answer choices

True

False

Flag question: Question 3

Question 3

1 pts

A heuristic method can always return optimal solutions to large-scale optimization problems for which standard solution methods are either nonexistent or computationally expensive.

Group of answer choices

True

False

Flag question: Question 4

Question 4

1 pts

Which of the following statements about the Greedy Algorithm is correct:

Group of answer choices

At each phase of a greedy algorithm for an optimization problem, it makes the choice that looks the best at the moment (locally optimal choice) and adds it to the current subsolution, without regard for future consequences.

A greedy algorithm always returns an optimal solution.

A greedy algorithm returns an optimal solution for the Knapsack problem.

A greedy algorithm always returns a suboptimal solution.

Flag question: Question 5

Question 5

1 pts

Genetic Algorithm is appropriate to solve constrained optimization problems.

Group of answer choices

True

False

Flag question: Question 6

Question 6

1 pts

For which of the following problems would we use the Evolutionary solving method in the Excel Solve?

Group of answer choices

Shortest Path Problem

Traveling Salesman Problem

Transportation Problem

Mean-Variance Portfolio Optimization