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 control algorithm is commonly used for path planning in autonomous systems?

  1. Fuzzy logic control

  2. Neural network control

  3. PID control

  4. A* (A-star) algorithm
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The A* (A-star) algorithm is a widely used control algorithm for path planning in autonomous systems. It efficiently finds the shortest path between two points in a complex environment, considering obstacles and constraints.

Multiple choice

Which control algorithm is commonly used for trajectory tracking in robotic systems?

  1. Fuzzy logic control

  2. Neural network control

  3. PID control

  4. Genetic algorithm control
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

PID (Proportional-Integral-Derivative) control is a widely used control algorithm in robotics for trajectory tracking. It offers simplicity, robustness, and effectiveness in regulating system behavior.

Multiple choice

What is the objective of the transportation problem?

  1. To minimize the total cost of transportation

  2. To maximize the total profit from transportation

  3. To minimize the total time of transportation

  4. To maximize the total distance of transportation
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The objective of the transportation problem is to minimize the total cost of transportation. This is done by finding the optimal routes for transporting goods from sources to destinations.

Multiple choice

Which of the following is a constraint in the transportation problem?

  1. The total supply of goods must be equal to the total demand for goods

  2. The cost of transportation between each source and destination must be the same

  3. The quantity of goods transported between each source and destination must be non-negative

  4. The total distance of transportation must be less than a certain value
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

One of the constraints in the transportation problem is that the total supply of goods must be equal to the total demand for goods. This ensures that all of the goods are transported to their destinations.

Multiple choice

Which of the following is a method for solving the transportation problem?

  1. The simplex method

  2. The Vogel's approximation method

  3. The north-west corner method

  4. The least cost method
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The simplex method is a method for solving the transportation problem. It is a general-purpose method that can be used to solve a variety of linear programming problems.

Multiple choice

What is the Vogel's approximation method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  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
A Correct answer
Explanation

The Vogel's approximation method is a method for finding an initial feasible solution to the transportation problem. It is a heuristic method that is not guaranteed to find the optimal solution, but it can often find a good solution quickly.

Multiple choice

What is the north-west corner method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  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
A Correct answer
Explanation

The north-west corner method is a method for finding an initial feasible solution to the transportation problem. It is a simple method that is easy to apply, but it does not always find the optimal solution.

Multiple choice

What is the least cost method?

  1. A method for finding an initial feasible solution to the transportation problem

  2. A method for finding the optimal solution to the transportation problem

  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 the transportation problem. It is a systematic method that guarantees to find the optimal solution, but it can be computationally expensive.

Multiple choice

What is the objective of VRP?

  1. To minimize the total cost of transportation

  2. To minimize the total time of transportation

  3. To minimize the total distance of transportation

  4. To maximize the total profit from transportation
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The objective of VRP is to minimize the total cost of transportation.

Multiple choice

Which of the following is a method for solving VRP?

  1. The simplex method

  2. The Vogel's approximation method

  3. The north-west corner method

  4. The least cost method
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The simplex method is a method for solving VRP. It is a general-purpose method that can be used to solve a variety of linear programming problems.

Multiple choice

What is the Vogel's approximation 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
A Correct answer
Explanation

The Vogel's approximation method is a method for finding an initial feasible solution to VRP. It is a heuristic method that is not guaranteed to find the optimal solution, but it can often find a good solution quickly.

Multiple choice

What is the north-west corner 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
A Correct answer
Explanation

The north-west corner method is a method for finding an initial feasible solution to VRP. It is a simple method that is easy to apply, but it does not always find the optimal solution.

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

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.