Mathematics · Economics

Optimization and Mathematical Programming

1,802 Questions

Mathematical programming involves selecting the best element from a set of alternatives based on specific criteria. These concepts are tested in various competitive exams, especially those focusing on decision making and resource allocation. The collection includes problems on linear programming, structural optimization, and computational complexity.

Linear programmingDynamic programmingConvex optimizationInteger programmingStructural optimization methodsMathematical modeling

Optimization and Mathematical Programming Questions

Multiple choice

Which of the following is NOT a strategy used in backtracking algorithms to improve efficiency?

  1. Pruning

  2. Memoization

  3. Branch and bound

  4. Randomization
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Pruning, memoization, and branch and bound are common strategies used in backtracking to reduce the number of states that need to be explored, whereas randomization is not typically used in backtracking algorithms.

Multiple choice

The N-Queens problem, where the goal is to place N queens on an NxN chessboard such that no two queens threaten each other, can be solved using:

  1. Backtracking

  2. Dynamic programming

  3. Greedy algorithm

  4. Divide and conquer
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The N-Queens problem is commonly solved using backtracking, as it involves systematically exploring all possible placements of queens on the chessboard and backtracking when a dead end is reached.

Multiple choice

Which of the following is NOT a common backtracking algorithm used for solving constraint satisfaction problems?

  1. Backtrack search

  2. Forward checking

  3. Arc consistency

  4. Simulated annealing
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Simulated annealing is a probabilistic technique used for optimization problems, whereas backtrack search, forward checking, and arc consistency are common backtracking algorithms used for solving constraint satisfaction problems.

Multiple choice

Which of the following is NOT a strategy used in backtracking algorithms to improve efficiency?

  1. Pruning

  2. Memoization

  3. Branch and bound

  4. Randomization
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Pruning, memoization, and branch and bound are common strategies used in backtracking to reduce the number of states that need to be explored, whereas randomization is not typically used in backtracking algorithms.

Multiple choice

The N-Queens problem, where the goal is to place N queens on an NxN chessboard such that no two queens threaten each other, can be solved using:

  1. Backtracking

  2. Dynamic programming

  3. Greedy algorithm

  4. Divide and conquer
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The N-Queens problem is commonly solved using backtracking, as it involves systematically exploring all possible placements of queens on the chessboard and backtracking when a dead end is reached.

Multiple choice

Which of the following is NOT a common backtracking algorithm used for solving constraint satisfaction problems?

  1. Backtrack search

  2. Forward checking

  3. Arc consistency

  4. Simulated annealing
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Simulated annealing is a probabilistic technique used for optimization problems, whereas backtrack search, forward checking, and arc consistency are common backtracking algorithms used for solving constraint satisfaction problems.

Multiple choice

Which technique is commonly used to enforce constraints in Soft Body Dynamics simulations?

  1. Lagrange Multipliers

  2. Penalty Method

  3. Projection Method

  4. Impulse-Based Method
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The Projection Method is widely used for enforcing constraints in Soft Body Dynamics simulations due to its simplicity and effectiveness.

Multiple choice

Which method is commonly used to handle self-collisions in Soft Body Dynamics simulations?

  1. Penalty Method

  2. Impulse-Based Method

  3. Position-Based Dynamics

  4. Constraint-Based Method
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Position-Based Dynamics is often used for self-collision handling in Soft Body Dynamics simulations due to its ability to prevent interpenetration.

Multiple choice

Which approximation is commonly used to reduce the computational cost of Configuration Interaction Theory?

  1. The Hartree-Fock approximation.

  2. The Møller-Plesset perturbation theory.

  3. The Configuration Interaction singles method.

  4. The Configuration Interaction doubles method.
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The Configuration Interaction singles method (CIS) is a common approximation used to reduce the computational cost of Configuration Interaction Theory by including only single excitations from the Hartree-Fock reference configuration.

Multiple choice

Which of the following is a best practice for optimizing a network?

  1. Use a network performance monitoring tool.

  2. Use a traffic shaping tool.

  3. Use a load balancing tool.

  4. Use a combination of optimization tools.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Using a combination of optimization tools provides the best results when optimizing a network.

Multiple choice

Which of the following is NOT a common method of campaign optimization?

  1. A/B testing

  2. Multivariate testing

  3. Microtargeting

  4. Data-driven decision-making
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Microtargeting is not a common method of campaign optimization because it is expensive and time-consuming.

Multiple choice

Which of the following is NOT a widely recognized set of heuristics for Heuristic Evaluation?

  1. Nielsen's Heuristics

  2. Shneiderman's Eight Golden Rules

  3. Dix, Finlay, Abowd, and Beale's Heuristic Evaluation Checklist

  4. Carroll's Minimalist Heuristics
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Carroll's Minimalist Heuristics is not a widely recognized set of heuristics for Heuristic Evaluation. Nielsen's Heuristics, Shneiderman's Eight Golden Rules, and Dix, Finlay, Abowd, and Beale's Heuristic Evaluation Checklist are commonly used.

Multiple choice

What are some of the alternatives to the Kaldor-Hicks Efficiency Approach?

  1. The Pareto Efficiency Approach.

  2. The Rawlsian Approach.

  3. The Sen Approach.

  4. All of the above.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

There are a number of alternatives to the Kaldor-Hicks Efficiency Approach. These include the Pareto Efficiency Approach, the Rawlsian Approach, and the Sen Approach.

Multiple choice

Which of the following is a necessary condition for a local minimum of a nonlinear programming problem?

  1. The gradient of the objective function is zero.

  2. The Hessian matrix of the objective function is positive definite.

  3. The Lagrangian function is minimized.

  4. The Karush-Kuhn-Tucker conditions are satisfied.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The Karush-Kuhn-Tucker conditions are a set of necessary conditions that must be satisfied at a local minimum of a nonlinear programming problem.

Multiple choice

Which of the following is a common method for solving nonlinear programming problems?

  1. Linear programming

  2. Integer programming

  3. Dynamic programming

  4. Sequential quadratic programming
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Sequential quadratic programming is a common method for solving nonlinear programming problems. It is an iterative method that solves a series of quadratic programming subproblems.