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 of the following is a common technique for optimizing warehouse locations?

  1. Center-of-gravity method

  2. Median method

  3. P-median method

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

The center-of-gravity method, median method, and P-median method are all common techniques used to determine optimal locations for warehouses, considering factors such as customer demand, transportation costs, and facility capacities.

Multiple choice

Which of the following is a common method for solving vehicle routing problems?

  1. Branch-and-bound

  2. Dynamic programming

  3. Genetic algorithms

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

Branch-and-bound, dynamic programming, and genetic algorithms are all common methods used to solve vehicle routing problems, which aim to find efficient routes for vehicles to deliver goods or services.

Multiple choice

What is a common approach for optimizing inventory levels in a logistics network?

  1. Economic order quantity (EOQ) model

  2. Safety stock model

  3. Reorder point model

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

The economic order quantity (EOQ) model, safety stock model, and reorder point model are all commonly used approaches for determining optimal inventory levels in a logistics network, considering factors such as demand, lead time, and holding costs.

Multiple choice

Which of the following is a common technique used for risk assessment in engineering design?

  1. Fault tree analysis

  2. Event tree analysis

  3. Risk matrix

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

Fault tree analysis is a deductive technique used to identify and analyze the root causes of potential failures or undesired events in a system.

Multiple choice

In optimal control theory, what is the objective of a controller?

  1. To minimize a cost function

  2. To maximize a performance index

  3. To maintain a desired output

  4. To reduce the system's error
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

In optimal control theory, the objective of a controller is to minimize a cost function that represents the desired behavior of the system.

Multiple choice

Which of the following is a common technique used in optimal control theory?

  1. Dynamic programming

  2. Pontryagin's minimum principle

  3. Linear quadratic regulator (LQR)

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

Dynamic programming, Pontryagin's minimum principle, and linear quadratic regulator (LQR) are all common techniques used in optimal control theory.

Multiple choice

Which of the following is a common application of control theory?

  1. Robotics

  2. Automotive systems

  3. Chemical process control

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

Control theory finds applications in various fields, including robotics, automotive systems, chemical process control, and many more.

Multiple choice

In linear programming, the objective function is always:

  1. Linear

  2. Quadratic

  3. Exponential

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

In linear programming, the objective function is always linear, meaning it is a linear combination of decision variables.

Multiple choice

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

  1. Simplex method

  2. Interior-point method

  3. Branch-and-bound method

  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.

Multiple choice

In nonlinear programming, the objective function or constraints are:

  1. Linear

  2. Quadratic

  3. Exponential

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

In nonlinear programming, the objective function or constraints are nonlinear, meaning they are not linear combinations of decision variables.

Multiple choice

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

  1. Gradient descent

  2. Newton's method

  3. Conjugate gradient method

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

Gradient descent is a widely used algorithm for solving nonlinear programming problems.

Multiple choice

Integer programming deals with problems where:

  1. All decision variables are continuous

  2. All decision variables are integers

  3. Some decision variables are continuous and some are integers

  4. None of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Integer programming deals with problems where all decision variables are required to be integers.

Multiple choice

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

  1. Branch-and-bound method

  2. Cutting-plane method

  3. Lagrangian relaxation

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

The branch-and-bound method is a widely used algorithm for solving integer programming problems.

Multiple choice

Dynamic programming is an optimization technique used to solve problems with:

  1. Overlapping subproblems

  2. Independent subproblems

  3. Convex objective functions

  4. Linear constraints
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Dynamic programming is used to solve problems with overlapping subproblems, meaning that optimal solutions to subproblems can be reused to solve larger problems.

Multiple choice

In dynamic programming, the principle of optimality states that:

  1. The optimal solution to a problem can be found by breaking it down into smaller subproblems

  2. The optimal solution to a subproblem is independent of the solutions to other subproblems

  3. The optimal solution to a problem is always unique

  4. The optimal solution to a problem can be found by trying all possible combinations of decisions
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The principle of optimality in dynamic programming states that the optimal solution to a subproblem is independent of the solutions to other subproblems.