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 least cost method for VRP?

  1. A method for finding an initial feasible solution to VRP

  2. A method for finding the optimal solution to VRP

  3. A method for minimizing the total cost of transportation

  4. A method for maximizing the total profit from transportation
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The least cost method is a method for finding the optimal solution to VRP. It is a systematic method that guarantees to find the optimal solution, but it can be computationally expensive.

Multiple choice

What is the most commonly used method for solving ODEs?

  1. Euler's Method

  2. Runge-Kutta Methods

  3. Finite Difference Methods

  4. Shooting Method
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Runge-Kutta methods are a family of explicit iterative methods for solving ODEs, known for their accuracy and stability.

Multiple choice

Which of the following is a disadvantage of explicit Runge-Kutta methods?

  1. They can be computationally expensive.

  2. They can suffer from stability issues.

  3. They are not suitable for stiff ODEs.

  4. They are not applicable to higher-order ODEs.
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Explicit Runge-Kutta methods can suffer from stability issues, especially for stiff ODEs, where the solution contains rapidly varying components.

Multiple choice

Which of the following is a commonly used implicit Runge-Kutta method?

  1. RK2

  2. RK4

  3. RK6

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

RK6, also known as the Radau IIA method, is a sixth-order implicit Runge-Kutta method commonly used for solving stiff ODEs.

Multiple choice

Which of the following is a disadvantage of implicit Runge-Kutta methods?

  1. They are more accurate.

  2. They are more stable.

  3. They are more computationally expensive.

  4. They are applicable to higher-order ODEs.
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Implicit Runge-Kutta methods are generally more computationally expensive than explicit methods due to the need to solve a system of nonlinear equations at each step.

Multiple choice

Which of the following is a commonly used adaptive step size control algorithm?

  1. Dormand-Prince Method

  2. Runge-Kutta-Fehlberg Method

  3. Bogacki-Shampine Method

  4. Cash-Karp Method
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The Runge-Kutta-Fehlberg method is a commonly used adaptive step size control algorithm that combines a fourth-order RK method with a fifth-order RK method to estimate the local error.

Multiple choice

What is the purpose of a Jacobian matrix in the context of ODE solvers?

  1. It is used to compute the local error estimate.

  2. It is used to determine the stability of the method.

  3. It is used to transform the ODE into a system of first-order ODEs.

  4. It is used to solve the system of nonlinear equations in implicit methods.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

In implicit Runge-Kutta methods, the Jacobian matrix is used to solve the system of nonlinear equations that arise at each step.

Multiple choice

Which of the following is NOT a common type of robot motion planning algorithm?

  1. Dijkstra's algorithm

  2. A* algorithm

  3. Rapidly exploring random tree (RRT)

  4. Fuzzy logic control
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Fuzzy logic control is not a common type of robot motion planning algorithm. It is a type of control algorithm that is used to control the robot's actuators.

Multiple choice

Which of the following is NOT a common type of robot mapping algorithm?

  1. Simultaneous localization and mapping (SLAM)

  2. Occupancy grid mapping

  3. Fuzzy logic control

  4. Voxel grid mapping
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Fuzzy logic control is not a common type of robot mapping algorithm. It is a type of control algorithm that is used to control the robot's actuators.

Multiple choice

Which of the following is NOT a common type of robot obstacle avoidance algorithm?

  1. Potential field method

  2. Fuzzy logic control

  3. A* algorithm

  4. Dijkstra's algorithm
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Fuzzy logic control is not a common type of robot obstacle avoidance algorithm. It is a type of control algorithm that is used to control the robot's actuators.

Multiple choice

Which of the following is a widely used algorithm for solving linear programming problems?

  1. Simplex Method

  2. Interior Point Method

  3. Branch and Bound

  4. Lagrangian Relaxation
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Simplex Method is a widely used algorithm for solving linear programming problems. It starts with a basic feasible solution and iteratively moves to better solutions until an optimal solution is reached.

Multiple choice

What is the main idea behind the Simplex Method?

  1. Moving from one basic feasible solution to another

  2. Finding the optimal solution in one iteration

  3. Using a gradient-based approach

  4. Applying duality theory
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Simplex Method works by moving from one basic feasible solution to another, improving the objective function value at each iteration, until an optimal solution is reached.

Multiple choice

What is the role of the pivot operation in the Simplex Method?

  1. Updating the basic variables

  2. Finding the direction of movement

  3. Determining the optimal solution

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

The pivot operation in the Simplex Method is used to update the basic variables, which are the variables that are currently assigned values in the basic feasible solution.

Multiple choice

How does the Simplex Method determine the direction of movement towards an optimal solution?

  1. Using the gradient of the objective function

  2. Calculating the reduced costs

  3. Applying the duality theorem

  4. Evaluating the Hessian matrix
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The Simplex Method calculates the reduced costs of the non-basic variables to determine the direction of movement towards an optimal solution.

Multiple choice

What is the significance of the dual problem in linear programming?

  1. It provides an alternative way to solve the primal problem

  2. It helps in finding the optimal solution more efficiently

  3. It gives insights into the sensitivity of the solution

  4. It allows for easier interpretation of the results
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The dual problem in linear programming provides an alternative way to solve the primal problem. By solving the dual problem, one can obtain the same optimal solution as that of the primal problem.