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

What is the fundamental theorem of Linear Programming?

  1. If a linear programming problem has a feasible solution, then it also has an optimal solution.

  2. If a linear programming problem has an optimal solution, then it also has a feasible solution.

  3. The optimal solution to a linear programming problem is always at a vertex of the feasible region.

  4. The optimal solution to a linear programming problem is always unique.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The fundamental theorem of Linear Programming states that if a linear programming problem has a feasible solution, then it also has an optimal solution, either a maximum or a minimum.

Multiple choice

Which method is commonly used to solve linear programming problems graphically?

  1. Simplex method

  2. Graphical method

  3. Interior-point method

  4. Branch-and-bound method
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The graphical method is a visual approach used to solve linear programming problems with a small number of variables (typically two). It involves plotting the feasible region and identifying the optimal solution graphically.

Multiple choice

What is the dual problem of a linear programming problem?

  1. A linear programming problem with the same objective function and constraints

  2. A linear programming problem with the same objective function but different constraints

  3. A linear programming problem with the same constraints but a different objective function

  4. A linear programming problem with both the objective function and constraints different
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The dual problem of a linear programming problem is another linear programming problem that has the same constraints as the original problem but a different objective function.

Multiple choice

What is the purpose of the slack variable in Linear Programming?

  1. To convert inequality constraints into equality constraints

  2. To introduce artificial variables into the problem

  3. To minimize the objective function

  4. To maximize the feasible region
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The slack variable is a non-negative variable introduced into a linear programming problem to convert inequality constraints into equality constraints, making it easier to solve the problem using the simplex method.

Multiple choice

Which of the following is not a valid method for solving linear programming problems?

  1. Simplex method

  2. Graphical method

  3. Interior-point method

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

Dynamic programming is a technique used to solve optimization problems with a recursive structure. It is not a method specifically designed for solving linear programming problems.

Multiple choice

What is the purpose of the artificial variable in Linear Programming?

  1. To convert inequality constraints into equality constraints

  2. To introduce slack variables into the problem

  3. To create an initial feasible solution

  4. To maximize the objective function
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The artificial variable is a non-negative variable introduced into a linear programming problem to create an initial feasible solution when the problem does not have an obvious feasible solution.

Multiple choice

What is the purpose of the reduced cost in Linear Programming?

  1. To determine the direction of movement in the simplex method

  2. To calculate the optimal solution

  3. To identify the binding constraints

  4. To minimize the objective function
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The reduced cost is used in the simplex method to determine the direction of movement from one basic feasible solution to another. It helps identify which variable should enter or leave the basis.

Multiple choice

Which of the following is not a valid termination criterion for the simplex method?

  1. All reduced costs are non-negative

  2. All variables have non-negative values

  3. The objective function is minimized

  4. The feasible region is empty
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The feasible region being empty is not a valid termination criterion for the simplex method. The simplex method terminates when all reduced costs are non-negative, all variables have non-negative values, or the objective function is unbounded.

Multiple choice

What is the purpose of the big M method in Linear Programming?

  1. To convert inequality constraints into equality constraints

  2. To introduce artificial variables into the problem

  3. To create an initial feasible solution

  4. To minimize the objective function
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The big M method is a technique used in Linear Programming to create an initial feasible solution by introducing artificial variables and assigning them a very large positive cost (M). This helps to ensure that the artificial variables are driven out of the solution as the simplex method progresses.

Multiple choice

Which of the following is not a valid type of linear programming problem?

  1. Minimization problem

  2. Maximization problem

  3. Mixed-integer programming problem

  4. Nonlinear programming problem
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Nonlinear programming problems are not valid types of linear programming problems. Linear programming deals with linear objective functions and linear constraints, while nonlinear programming problems involve nonlinear functions.

Multiple choice

What is the primary goal of using randomized algorithms?

  1. To guarantee the optimal solution.

  2. To reduce the worst-case time complexity.

  3. To improve the average-case performance.

  4. To eliminate the need for deterministic algorithms.
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Randomized algorithms aim to improve the average-case performance of an algorithm by introducing randomness, often leading to better efficiency on average.

Multiple choice

What is the main idea behind the Monte Carlo method?

  1. Using random sampling to approximate solutions.

  2. Generating random numbers to solve deterministic problems.

  3. Using probability distributions to model real-world phenomena.

  4. Applying randomized techniques to optimize algorithms.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Monte Carlo method is a technique that uses random sampling to obtain approximate solutions to problems that are too complex to be solved exactly.

Multiple choice

Which of the following is NOT a property of randomized algorithms?

  1. They always produce the optimal solution.

  2. They have a constant worst-case time complexity.

  3. Their average-case performance is often better than deterministic algorithms.

  4. They can be used to solve problems that are difficult for deterministic algorithms.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Randomized algorithms do not always produce the optimal solution, but they often provide good approximate solutions.

Multiple choice

What is the name of the technique that uses random sampling to estimate the value of a function?

  1. Monte Carlo integration.

  2. Monte Carlo simulation.

  3. Monte Carlo optimization.

  4. Monte Carlo decision making.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Monte Carlo integration is a technique that uses random sampling to estimate the value of a definite integral.

Multiple choice

Which of the following is a common method used in Oceanographic Data Assimilation?

  1. Variational Data Assimilation

  2. Ensemble Kalman Filter

  3. Particle Filter

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

Variational Data Assimilation, Ensemble Kalman Filter, and Particle Filter are widely used methods in Oceanographic Data Assimilation. Each method has its own strengths and weaknesses, and the choice of method depends on factors such as the available data, the computational resources, and the desired accuracy.