1. Which of the following is the objective of Operations Research?
A. To optimize resource utilization
B. To minimize the cost of operations
C. To analyze systems and improve decision-making
D. All of the above
Answer: D) All of the above
Rationale: The objective of Operations Research is to optimize
resource utilization, minimize costs, and improve decision-making
by using mathematical models and analysis.
2. What is the main focus of Industrial Engineering?
A. Manufacturing efficiency
B. Product quality
C. Cost reduction and process optimization
,D. Customer satisfaction
Answer: C) Cost reduction and process optimization
Rationale: Industrial Engineering focuses on improving processes
to enhance efficiency, reduce costs, and optimize resource
utilization.
3. Linear programming is primarily used for:
A. Solving non-linear equations
B. Optimization problems
C. Simulation analysis
D. Statistical analysis
Answer: B) Optimization problems
Rationale: Linear programming is a mathematical method for
determining a way to achieve the best outcome in a given
mathematical model, commonly used for optimization.
4. In a transportation problem, what is the objective?
,A. Minimize transportation costs
B. Maximize the number of routes
C. Maximize profit
D. Minimize inventory
Answer: A) Minimize transportation costs
Rationale: The transportation problem in Operations Research
aims to minimize the total transportation cost while fulfilling
supply and demand constraints.
5. Which of the following is a feasible solution to a linear
programming problem?
A. A solution that violates some constraints
B. A solution that satisfies all constraints
C. A solution that violates the objective function
D. A solution with a negative objective value
Answer: B) A solution that satisfies all constraints
, Rationale: A feasible solution to a linear programming problem is
one that satisfies all the problem’s constraints, regardless of the
objective value.
6. The Simplex Method is used to solve:
A. Integer programming problems
B. Linear programming problems
C. Non-linear programming problems
D. Dynamic programming problems
Answer: B) Linear programming problems
Rationale: The Simplex Method is an algorithm for solving linear
programming problems by iterating through feasible solutions to
find the optimal solution.
7. What does the term "dual" refer to in linear programming?
A. The secondary problem derived from the primal problem
B. A different objective function
A. To optimize resource utilization
B. To minimize the cost of operations
C. To analyze systems and improve decision-making
D. All of the above
Answer: D) All of the above
Rationale: The objective of Operations Research is to optimize
resource utilization, minimize costs, and improve decision-making
by using mathematical models and analysis.
2. What is the main focus of Industrial Engineering?
A. Manufacturing efficiency
B. Product quality
C. Cost reduction and process optimization
,D. Customer satisfaction
Answer: C) Cost reduction and process optimization
Rationale: Industrial Engineering focuses on improving processes
to enhance efficiency, reduce costs, and optimize resource
utilization.
3. Linear programming is primarily used for:
A. Solving non-linear equations
B. Optimization problems
C. Simulation analysis
D. Statistical analysis
Answer: B) Optimization problems
Rationale: Linear programming is a mathematical method for
determining a way to achieve the best outcome in a given
mathematical model, commonly used for optimization.
4. In a transportation problem, what is the objective?
,A. Minimize transportation costs
B. Maximize the number of routes
C. Maximize profit
D. Minimize inventory
Answer: A) Minimize transportation costs
Rationale: The transportation problem in Operations Research
aims to minimize the total transportation cost while fulfilling
supply and demand constraints.
5. Which of the following is a feasible solution to a linear
programming problem?
A. A solution that violates some constraints
B. A solution that satisfies all constraints
C. A solution that violates the objective function
D. A solution with a negative objective value
Answer: B) A solution that satisfies all constraints
, Rationale: A feasible solution to a linear programming problem is
one that satisfies all the problem’s constraints, regardless of the
objective value.
6. The Simplex Method is used to solve:
A. Integer programming problems
B. Linear programming problems
C. Non-linear programming problems
D. Dynamic programming problems
Answer: B) Linear programming problems
Rationale: The Simplex Method is an algorithm for solving linear
programming problems by iterating through feasible solutions to
find the optimal solution.
7. What does the term "dual" refer to in linear programming?
A. The secondary problem derived from the primal problem
B. A different objective function
