Back
0

Operations Research

Description: Operations Research Quiz
Number of Questions: 15
Created by:
Tags: operations research linear programming integer programming network optimization
Start the Quiz
Attempted 0/15 Correct 0 Score 0
‹
›

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

  1. Integer Programming

  2. Dynamic Programming

  3. Mixed Integer Programming

  4. Nonlinear Programming

Show answer
Correct Option: C
Explanation:

Mixed Integer Programming is a type of linear programming problem where some of the decision variables are restricted to be integers.

What is the objective function in a linear programming problem?

  1. The function that is minimized

  2. The function that is maximized

  3. The function that is constrained

  4. The function that is optimized

Show answer
Correct Option: B
Explanation:

The objective function in a linear programming problem is the function that is maximized or minimized.

Which of the following is a type of integer programming problem?

  1. Binary Integer Programming

  2. Mixed Integer Programming

  3. Dynamic Programming

  4. Nonlinear Programming

Show answer
Correct Option: A
Explanation:

Binary Integer Programming is a type of integer programming problem where all of the decision variables are restricted to be either 0 or 1.

What is the simplex method?

  1. An algorithm for solving linear programming problems

  2. An algorithm for solving integer programming problems

  3. An algorithm for solving dynamic programming problems

  4. An algorithm for solving nonlinear programming problems

Show answer
Correct Option: A
Explanation:

The simplex method is an algorithm for solving linear programming problems.

Which of the following is a type of network optimization problem?

  1. Shortest Path Problem

  2. Maximum Flow Problem

  3. Minimum Cost Flow Problem

  4. Traveling Salesman Problem

Show answer
Correct Option: D
Explanation:

The Traveling Salesman Problem is a type of network optimization problem where a salesman must find the shortest route that visits all of the cities in a given set.

What is the objective function in a network optimization problem?

  1. The function that is minimized

  2. The function that is maximized

  3. The function that is constrained

  4. The function that is optimized

Show answer
Correct Option: A
Explanation:

The objective function in a network optimization problem is the function that is minimized.

Which of the following is a type of dynamic programming problem?

  1. Knapsack Problem

  2. Longest Common Subsequence Problem

  3. Traveling Salesman Problem

  4. Shortest Path Problem

Show answer
Correct Option: A
Explanation:

The Knapsack Problem is a type of dynamic programming problem where a thief must decide which items to steal from a house in order to maximize the total value of the stolen items.

What is the principle of optimality in dynamic programming?

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

  2. The optimal solution to a problem can be found by considering all possible solutions.

  3. The optimal solution to a problem can be found by using a greedy algorithm.

  4. The optimal solution to a problem can be found by using a heuristic algorithm.

Show answer
Correct Option: A
Explanation:

The principle of optimality in dynamic programming states that the optimal solution to a problem can be found by breaking it down into smaller subproblems.

Which of the following is a type of nonlinear programming problem?

  1. Quadratic Programming

  2. Geometric Programming

  3. Integer Programming

  4. Linear Programming

Show answer
Correct Option: A
Explanation:

Quadratic Programming is a type of nonlinear programming problem where the objective function and/or the constraints are quadratic functions.

What is the Karush-Kuhn-Tucker (KKT) conditions?

  1. A set of necessary and sufficient conditions for a point to be a local minimum of a nonlinear programming problem.

  2. A set of necessary and sufficient conditions for a point to be a global minimum of a nonlinear programming problem.

  3. A set of necessary conditions for a point to be a local minimum of a nonlinear programming problem.

  4. A set of necessary conditions for a point to be a global minimum of a nonlinear programming problem.

Show answer
Correct Option: A
Explanation:

The Karush-Kuhn-Tucker (KKT) conditions are a set of necessary and sufficient conditions for a point to be a local minimum of a nonlinear programming problem.

Which of the following is a type of heuristic algorithm?

  1. Greedy Algorithm

  2. Simulated Annealing

  3. Tabu Search

  4. Genetic Algorithm

Show answer
Correct Option: A
Explanation:

A greedy algorithm is a type of heuristic algorithm that makes the locally optimal choice at each step in order to find a global optimum.

What is the difference between a heuristic algorithm and an exact algorithm?

  1. A heuristic algorithm is guaranteed to find the optimal solution, while an exact algorithm is not.

  2. A heuristic algorithm is not guaranteed to find the optimal solution, while an exact algorithm is.

  3. A heuristic algorithm is faster than an exact algorithm.

  4. A heuristic algorithm is more accurate than an exact algorithm.

Show answer
Correct Option: B
Explanation:

A heuristic algorithm is not guaranteed to find the optimal solution, while an exact algorithm is.

Which of the following is a type of metaheuristic algorithm?

  1. Simulated Annealing

  2. Tabu Search

  3. Genetic Algorithm

  4. Ant Colony Optimization

Show answer
Correct Option: A
Explanation:

Simulated Annealing is a type of metaheuristic algorithm that is inspired by the process of annealing in metallurgy.

What is the difference between a metaheuristic algorithm and a heuristic algorithm?

  1. A metaheuristic algorithm is a higher-level heuristic algorithm.

  2. A metaheuristic algorithm is a lower-level heuristic algorithm.

  3. A metaheuristic algorithm is a more general heuristic algorithm.

  4. A metaheuristic algorithm is a more specific heuristic algorithm.

Show answer
Correct Option: A
Explanation:

A metaheuristic algorithm is a higher-level heuristic algorithm that is used to design and control heuristic algorithms.

Which of the following is a type of multi-objective optimization problem?

  1. Linear Programming

  2. Integer Programming

  3. Nonlinear Programming

  4. Vector Optimization

Show answer
Correct Option: D
Explanation:

Vector Optimization is a type of multi-objective optimization problem where the objective function is a vector of multiple objectives.

- Hide questions
ADVERTISEMENT

Find more quizzes from top tags

general knowledge
3615 Quizzes
119858 Questions
 technology
307 Quizzes
36705 Questions
 sports
963 Quizzes
19148 Questions
 history
1187 Quizzes
13475 Questions
 physics
598 Quizzes
13441 Questions
 biology
1160 Quizzes
12174 Questions
 science & technology
551 Quizzes
11015 Questions
 chemistry
490 Quizzes
9892 Questions
 maths
518 Quizzes
9324 Questions
 softskills
0 Quizzes
7131 Questions