Optimization DY0-001 Practice Questions (Page 1)

Questions 1–5

1. 1expert · hard

   A team is comparing two approaches to solve a problem. Approach 1 uses an unconstrained optimization algorithm on a modified objective function that includes a penalty term for violating a constraint. Approach 2 uses a constrained optimization algorithm that directly handles the constraint. Which statement best describes the trade-off between these two approaches?

   • ABoth approaches are mathematically equivalent and will always produce the exact same solution.
   • BApproach 1 is always more accurate than Approach 2 because it explores a larger solution space.
   • CApproach 2 is always faster than Approach 1 because it does not need to explore infeasible solutions.
   • DApproach 1 is simpler to implement but may be less accurate, while Approach 2 is more complex but can find a more precise solution.
   Reveal Solution Discussion Select an answer first
2. 2foundation · easy

   In which situation would unconstrained optimization be appropriate?

   • AWhen the decision variables must be non-negative integers
   • BWhen the objective function is subject to a budget limit
   • CWhen the solution must lie within a specific range
   • DWhen there are no restrictions on the values of the decision variables
   Reveal Solution Discussion Select an answer first
4. 3foundation · easy

   Which statement accurately contrasts constrained and unconstrained optimization?

   • AConstrained optimization restricts the feasible solution space, while unconstrained optimization does not
   • BUnconstrained optimization is used for linear problems, while constrained optimization is used for nonlinear problems
   • CUnconstrained optimization always finds the global optimum, while constrained optimization only finds local optima
   • DConstrained optimization requires a differentiable objective function, while unconstrained does not
   Reveal Solution Discussion Select an answer first
5. 4foundation · medium

   A data scientist is defining a problem to minimize shipping costs for a delivery fleet. The formulation includes a set of decision variables (routes and truck assignments), an objective function (total fuel and labor cost), and a set of constraints (truck capacity, driver hours, and delivery deadlines). Which statement best describes this formulation?

   • AIt is a multi-objective optimization problem because there are multiple constraints that must be satisfied simultaneously.
   • BIt is a constraint satisfaction problem because the goal is to find any feasible solution that meets all constraints, with no objective to optimize.
   • CIt is an unconstrained optimization problem because the objective function is clearly defined and can be minimized directly.
   • DIt is a constrained optimization problem because the objective function must be minimized subject to specified constraints.
   Reveal Solution Discussion Select an answer first
6. 5application · medium

   A team is comparing two optimization problems. Problem 1 is to find the minimum of a function f(x) = x² + 3x + 5. Problem 2 is to find the minimum of the same function, but with the constraint that x must be an integer between 0 and 10. Which statement accurately compares these two problems?

   • AProblem 1 is unconstrained and can be solved with calculus, while Problem 2 is constrained and may require a different technique like integer programming.
   • BBoth problems are constrained because the function f(x) has a minimum value.
   • CProblem 1 is constrained because x can take any real value, while Problem 2 is unconstrained because the range is limited.
   • DBoth problems are unconstrained because the objective function is the same.
   Reveal Solution Discussion Select an answer first