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

What is the purpose of a branch-and-cut algorithm in Integer Programming?

  1. To generate a linear programming relaxation of the problem

  2. To identify all feasible solutions to the problem

  3. To strengthen the linear programming relaxation and generate cutting planes

  4. To reduce the number of variables in the problem
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A branch-and-cut algorithm is a type of branch-and-bound algorithm that incorporates cutting planes to strengthen the linear programming relaxation of an Integer Programming problem. By adding cutting planes, the algorithm tightens the relaxation and improves the lower bound on the optimal objective value.

Multiple choice

Which of the following is a valid formulation for a binary integer programming problem?

  1. Minimize z = 2x + 3y subject to x, y ≥ 0

  2. Maximize z = 2x + 3y subject to x, y ∈ Z

  3. Maximize z = 2x + 3y subject to x, y ∈ {0, 1}

  4. Minimize z = 2x + 3y subject to x ∈ R, y ∈ Z
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A binary integer programming problem is a type of Integer Programming problem where the decision variables are restricted to binary values (0 or 1). The valid formulation for a binary integer programming problem includes constraints that specify that the variables can only take on binary values.

Multiple choice

What is the purpose of a Lagrangian relaxation in Integer Programming?

  1. To generate a linear programming relaxation of the problem

  2. To identify all feasible solutions to the problem

  3. To strengthen the linear programming relaxation and generate cutting planes

  4. To decompose the problem into smaller subproblems
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Lagrangian relaxation is a technique used in Integer Programming to decompose the problem into smaller subproblems. This is done by introducing a Lagrangian function that relaxes the integer constraints and allows the decision variables to take on continuous values. The subproblems are then solved independently, and the solutions are combined to obtain a solution to the original Integer Programming problem.

Multiple choice

Consider the following Integer Programming problem: Minimize z = 2x + 3y subject to x + y ≥ 5, x, y ≥ 0, x, y ∈ Z. What is the optimal solution to this problem?

  1. x = 2, y = 3

  2. x = 3, y = 2

  3. x = 4, y = 1

  4. x = 5, y = 0
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

To solve this problem, you can use a branch-and-bound algorithm or a dynamic programming approach. The optimal solution is x = 2, y = 3, which gives an objective value of z = 12.

Multiple choice

Which of the following is a valid formulation for a set partitioning problem?

  1. Minimize z = 2x + 3y subject to x, y ≥ 0

  2. Maximize z = 2x + 3y subject to x, y ∈ Z

  3. Maximize z = 2x + 3y subject to x, y ∈ {0, 1}

  4. Minimize z = 2x + 3y subject to ∑x_i = 1, x_i ∈ {0, 1}
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

A set partitioning problem is a type of Integer Programming problem where the objective is to partition a set of elements into disjoint subsets, subject to certain constraints. The valid formulation for a set partitioning problem includes a constraint that ensures that each element is assigned to exactly one subset.

Multiple choice

Which modeling approach is commonly used to represent complex water quality processes?

  1. Lumped parameter models

  2. Distributed parameter models

  3. Deterministic models

  4. Stochastic models
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Distributed parameter models are often used to represent complex water quality processes because they can account for spatial variations in water quality.

Multiple choice

Which of the following is NOT a major area of research at the Centre for Operations Research (COR)?

  1. Linear Programming

  2. Integer Programming

  3. Dynamic Programming

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

Fuzzy Logic is not a major area of research at the Centre for Operations Research (COR).

Multiple choice

Which of the following is a key principle in Dynamic Optimization?

  1. Bellman's Principle

  2. Principle of Least Action

  3. Fermat's Principle

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

Bellman's Principle states that an optimal policy can be decomposed into a sequence of optimal sub-policies.

Multiple choice

The Calculus of Variations is used to find extrema of functionals, which are functions of functions. What is the independent variable in the Calculus of Variations?

  1. Time

  2. Space

  3. State

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

In the Calculus of Variations, the independent variable is typically time, and the functional is a function of a function of time.

Multiple choice

In Optimal Control, the goal is to find a control function that minimizes a cost functional. What is the typical form of the cost functional?

  1. Integral of a function of state and control

  2. Sum of a function of state and control

  3. Product of a function of state and control

  4. Quotient of a function of state and control
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

In Optimal Control, the cost functional is typically an integral of a function of the state and control variables.

Multiple choice

The Maximum Principle is a necessary condition for optimality in Optimal Control. What does the Maximum Principle state?

  1. The optimal control function maximizes the Hamiltonian

  2. The optimal control function minimizes the Hamiltonian

  3. The optimal control function is equal to the Hamiltonian

  4. The optimal control function is independent of the Hamiltonian
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The Maximum Principle states that the optimal control function maximizes the Hamiltonian, which is a function of the state, control, and co-state variables.

Multiple choice

Dynamic Programming is a technique for solving Dynamic Optimization problems. What is the key idea behind Dynamic Programming?

  1. Decompose the problem into a sequence of sub-problems

  2. Solve the sub-problems in reverse order

  3. Use a recursive algorithm to solve the sub-problems

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

Dynamic Programming involves decomposing the problem into a sequence of sub-problems, solving the sub-problems in reverse order, and using a recursive algorithm to solve the sub-problems.

Multiple choice

In Dynamic Optimization, the state of a system is typically represented by a vector of variables. What is the dimension of the state vector?

  1. Equal to the number of control variables

  2. Equal to the number of state variables

  3. Equal to the number of state and control variables

  4. Equal to the number of state, control, and co-state variables
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The dimension of the state vector is equal to the number of state variables.

Multiple choice

The co-state variables in Optimal Control are also known as:

  1. Adjoint variables

  2. Lagrange multipliers

  3. Shadow prices

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

The co-state variables in Optimal Control are also known as adjoint variables, Lagrange multipliers, and shadow prices.

Multiple choice

In Dynamic Optimization, the optimal control function is typically a function of:

  1. State variables only

  2. Control variables only

  3. State and control variables

  4. State, control, and co-state variables
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The optimal control function is typically a function of both the state and control variables.