Operations Research

1. is the process of finding the minimum or maximum of an objective function

without any constraints.
A. Constrained optimization
B. Unconstrained optimization
C. Linear programming
D. A and C
Answer: B
2. is the process of finding the minimum or maximum of an objective function
subject to one or more constraints.
A. One-variable unconstrained optimization
B. Multi-variable unconstrained optimization
C. Constrained optimization
D. Linear programming
Answer: C
3. A company produces two products, X and Y, and has a limited amount of raw materials
and labour hours. The following data has been collected:
Resource Product X Product Y Availability
Raw materials 5 4 200
Labour hours 3 5 180
Profit per unit $10 $12

What is the objective function for this problem?

A. Maximize Z: 10X + 12Y
B. Maximize Z: 5X + 4Y
C. Maximize Z: 3X + 5Y
D. Maximize Z: 200X + 180Y
Answer: A

1
4. A company produces three products, A, B, and C. The company has a limited amount of
raw materials, labour hours, and machine time, and wants to maximize its profits. The
following data has been collected:

Resource Product A Product B Product C Availability

Raw materials 2 3 4 240
Labour hours 4 3 2 320
Machine time 6 8 5 480
Profit per unit $10 $15 $12

What is the constraint for raw materials?

A. 2A + 3B + 4C <= 240
B. 4A + 3B + 2C <= 320
C. 6A + 8B + 5C <= 480
D. 10A + 15B + 12C <= 240
Answer: A
5. What is the primary goal of linear programming when resolving conflicts of interest
within an organization?
A. Optimizing a given objective function
B. Avoiding any potential conflicts of interest
C. Focusing on the interests of one party over the other
D. Ignoring the conflict and hoping it will go away
Answer: A
6. Which of the following is an example of using linear programming to resolve a conflict
of interest in an organization?
A. Allocating resources among competing departments based on their individual needs
B. Ignoring the input of certain employees in decision-making processes
C. Focusing solely on the profitability of the organization, without regard for other factors
D. Splitting the difference between conflicting parties involved in a dispute
Answer: A

2
7. In what way does linear programming contribute to resolving conflicts of interest within
an organization?
A. By providing a mathematical framework to identify and solve complex problems
B. By promoting one-sided solutions that ignore the needs of some parties involved
C. By excluding certain departments or employees from decision-making processes
D. By ignoring the root causes of conflicts and focusing solely on finding a solution
Answer: A
8. Which of the following is NOT a requirement for a linear programming problem?
A. Objective function
B. Constraints
C. Non-linearity
D. Decision variables
Answer: C
9. What is the objective of linear programming?
A. To maximize or minimize a linear function
B. To solve non-linear equations
C. To find the optimal solution to a quadratic equation
D. To find the optimal solution to a differential equation
Answer: A
10. In a linear programming problem, what is a constraint?
A. A requirement that must be satisfied by the solution
B. A variable that can take on any value
C. A function that is linear
D. An equation that cannot be solved
Answer: A
11. What is the graphical method of solving a linear programming problem?
A. Plotting the constraints and objective function on a graph and finding the intersection
point
B. Solving the problem using calculus
C. Solving the problem using linear algebra

3
 D. Using a computer algorithm to find the solution
Answer: A
12. What is the simplex method of solving a linear programming problem?
A. An algorithm that systematically searches for the optimal solution
B. A method of solving non-linear equations
C. A method of solving differential equations
D. A method of solving quadratic equations
Answer: A
13. What is the role of optimization techniques in agricultural economics?
A. To help farmers maximize profits while minimizing costs
B. To simplify complex equations related to agriculture
C. To graph agricultural production functions
D. To find the worst solution to agricultural problems
Answer: A
14. Which of the following is NOT a technique of optimization in operations research?
A. Linear programming
B. Nonlinear programming
C. Risk programming
D. Regression analysis
Answer: D
15. What is linear programming?
A. A technique of optimization used to maximize or minimize a linear function, subject to
a set of linear constraints.
B. A technique of optimization used to maximize or minimize a nonlinear function,
subject to a set of nonlinear constraints.
C. A technique of optimization used to model stochastic systems.
D. A technique of optimization used to model dynamic systems.
Answer: A

4
5
 16. In linear programming, the objective function is used to:
A. Define the decision variables
B. Specify problem constraints
C. Maximize or minimize the quantity of interest
D. Determine the feasible region
Answer: C
17. Which of the following is NOT a linear programming assumption?
A. Proportionality
B. Divisibility
C. Convexity
D. Additivity
Answer: C
18. The graphical method of solving linear programming problems is applicable when:
A. There are only two decision variables
B. The objective and constraints are piecewise linear
C. The problem is unconstrained
D. The problem involves multiple objectives
Answer: A
19. In linear programming, the feasible region is defined as:
A. The set of all possible solutions
B. The region inside the constraint boundaries
C. The region outside the constraint boundaries
D. The optimal solution point
Answer: B
20. The basic feasible solution in linear programming refers to:
A. The solution with the highest objective function value
B. The solution that satisfies all the constraints with equality
C. The solution that satisfies all the constraints with inequality
D. The solution obtained by the simplex method
Answer: B

21. The simplex method in linear programming is an iterative procedure that:

A. Solves the problem in one step
B. Solves the problem using graph theory
C. Moves from one feasible solution to another
6 improving the objective function value
D. Only works for maximization problems
Answer: C
22. In the simplex method, the initial feasible solution is obtained by: