Mathematics ยท Economics

Optimization and Mathematical Programming

1,582 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 decision-making method involves using a matrix to evaluate options based on multiple criteria?

  1. Nominal group technique

  2. Weighted voting

  3. Multi-criteria decision analysis

  4. Condorcet method
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Multi-criteria decision analysis (MCDA) is a decision-making method that involves evaluating options based on multiple criteria. A matrix is used to compare the options against each criterion, and weights are assigned to reflect the relative importance of each criterion. The option with the highest overall score is selected as the winner.

Multiple choice

Which decision-making method involves using a series of pairwise comparisons to determine the most preferred option?

  1. Weighted voting

  2. Condorcet method

  3. Multi-voting

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

Pairwise comparison is a decision-making method where participants compare each option to every other option, one pair at a time. They indicate which option they prefer in each pair, and the option with the most wins is selected as the winner. This method is particularly useful when there are a large number of options and it is difficult to evaluate them all simultaneously.

Multiple choice

Which decision-making method involves using a mathematical formula to calculate the best option?

  1. Multi-criteria decision analysis

  2. Weighted voting

  3. Condorcet method

  4. Simple additive weighting
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Simple additive weighting (SAW) is a decision-making method that involves using a mathematical formula to calculate the best option. Each option is evaluated based on multiple criteria, and a weight is assigned to each criterion to reflect its relative importance. The option with the highest overall score is selected as the winner.

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

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 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.

Multiple choice

What is the purpose of a penalty function in nonlinear programming?

  1. To transform a constrained problem into an unconstrained problem

  2. To improve the convergence of an optimization algorithm

  3. To reduce the number of iterations required to solve a problem

  4. To find a global minimum of a problem
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A penalty function is used to transform a constrained nonlinear programming problem into an unconstrained problem. This can make the problem easier to solve.

Multiple choice

Which of the following is a common type of nonlinear programming problem?

  1. Convex programming

  2. Non-convex programming

  3. Linear programming

  4. Integer programming
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Non-convex programming is a common type of nonlinear programming problem. In a non-convex programming problem, the objective function or the constraints are not convex.

Multiple choice

What is the difference between a local minimum and a global minimum in nonlinear programming?

  1. A local minimum is a point where the objective function is minimized in a neighborhood of the point, while a global minimum is a point where the objective function is minimized over the entire feasible region.

  2. A local minimum is a point where the objective function is minimized in a neighborhood of the point, while a global minimum is a point where the objective function is minimized over the entire feasible region.

  3. A local minimum is a point where the objective function is minimized in a neighborhood of the point, while a global minimum is a point where the objective function is maximized over the entire feasible region.

  4. A local minimum is a point where the objective function is maximized in a neighborhood of the point, while a global minimum is a point where the objective function is minimized over the entire feasible region.
Reveal answer Fill a bubble to check yourself
A,B Correct answer
Explanation

A local minimum is a point where the objective function is minimized in a neighborhood of the point, while a global minimum is a point where the objective function is minimized over the entire feasible region.

Multiple choice

Which of the following is a common method for finding a global minimum of a nonlinear programming problem?

  1. Branch and bound

  2. Cutting planes

  3. Simulated annealing

  4. Genetic algorithms
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Branch and bound is a common method for finding a global minimum of a nonlinear programming problem. It is a systematic method that divides the feasible region into smaller and smaller subregions until the global minimum is found.

Multiple choice

What is the purpose of a barrier function in nonlinear programming?

  1. To transform a constrained problem into an unconstrained problem

  2. To improve the convergence of an optimization algorithm

  3. To reduce the number of iterations required to solve a problem

  4. To find a global minimum of a problem
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A barrier function is used to transform a constrained nonlinear programming problem into an unconstrained problem. This can make the problem easier to solve.