or 2 marks
or 2 marks
Operation Research (OR) is a discipline that deals with the application of advanced analytical
methods to help make better decisions. It involves the use of mathematical and analytical
techniques to optimize decision-making processes in complex systems. OR is used to identify and
solve problems in a wide range of fields, including management, economics, engineering, and more.
OR is widely used in agriculture to optimize crop yields, reduce costs, and improve resource
allocation. Some examples of OR applications in agriculture include:
Crop planning: OR is used to determine the optimal crop mix, planting schedule, and harvesting
strategy to maximize yields and profits.
Resource allocation: OR is used to allocate resources such as water, fertilizers, and labor to optimize
crop growth and reduce waste.
Supply chain management: OR is used to optimize the transportation and storage of agricultural
products to reduce costs and improve efficiency.
Workforce planning: OR is used to determine the optimal staffing levels, skills, and training
requirements to meet organizational goals.
Scheduling: OR is used to optimize employee schedules to minimize labor costs, reduce overtime,
and improve productivity.
The Traveling Salesman Problem (TSP): This is a classic OR problem that involves finding the shortest
possible tour that visits a set of cities and returns to the starting point.
The Knapsack Problem: This is a problem that involves finding the optimal way to pack a set of items
of different weights and values into a knapsack of limited capacity.
Resource allocation: LP is used to allocate resources such as labor, materials, and equipment to
optimize production and minimize costs.
Production planning: LP is used to determine the optimal production levels, inventory levels, and
supply chain management to meet customer demand.
Financial planning: LP is used to optimize investment portfolios, manage cash flow, and minimize
financial risks.
An objective function is a mathematical function that represents the goal or objective of a decision-
making problem. It is a function that is to be maximized or minimized, subject to a set of constraints.
Constraints are limitations or restrictions that are imposed on a decision-making problem. They are
mathematical expressions that must be satisfied in order to obtain a feasible solution.
For example, in a production planning problem, the objective function might be to maximize profits,
subject to constraints on the availability of raw materials, labor, and equipment.
In linear programming, degeneracy occurs when a basic feasible solution has at least one basic
variable with a value of zero. This means that the solution is not unique, and there may be multiple
optimal solutions.
In the transportation problem, a non-degenerate basic feasible solution is a solution that has a
unique set of values for the decision variables, and all the basic variables have non-zero values.
An unbalanced assignment problem is a type of assignment problem where the number of sources
(e.g. workers) is not equal to the number of destinations (e.g. tasks). This means that some sources
may be assigned to multiple destinations, or some destinations may not be assigned to any sources.
A saddle point is a point in a function that is a local maximum in one direction and a local minimum
in another direction. In game theory, a saddle point is a point where the maximum of the minimum
payoff is equal to the minimum of the maximum payoff.
A two-person zero-sum game is a game played between two players, where one player's gain is
equal to the other player's loss. The total payoff of the game is zero, and the game is played in a way
that one player tries to maximize their payoff
Operation Research (OR) is a scientific approach to decision-making that involves the use of
mathematical and analytical techniques to optimize decision-making processes.
14. Briefly describe some application of operation research in functional areas of management.
OR has applications in various functional areas of management, including production and operations
management, financial management, marketing management, and human resource management.
16. What you mean by analogue model model.? Give any 2 examples.
An analogue model is a physical representation of a system or problem. Two examples are a wind
tunnel used to test the aerodynamics of an aircraft and a scale model of a building used to test its
structural integrity.
A linear programming problem (LPP) is a mathematical optimization problem that involves finding
the best outcome in a situation where there are multiple constraints.
The solution to an LPP is infeasible when there is no set of values for the variables that satisfies all
the constraints.
A feasible solution is a set of values for the variables that satisfies all the constraints, while a basic
feasible solution is a feasible solution that is obtained by setting some of the variables to zero.
A loop in a transportation problem is a sequence of shipments that forms a cycle, where the last
shipment returns to the starting point.
An unbalanced transportation problem occurs when the total supply is not equal to the total
demand.
A game is a situation where multiple players make decisions that affect the outcome, and the goal is
to maximize one's own payoff or utility.
OR is used in agriculture to optimize crop yields, reduce costs, and improve resource allocation.
25. Describe any 2 limitations of OR.
A physical model is a tangible representation of a system or problem. Two examples are a scale
model of a building and a prototype of a product.
The basic assumptions of LPPs are linearity, finiteness, non-negativity, and optimality.
Slack variables are used to represent the amount of unused resources, while surplus variables are
used to represent the amount of excess resources.
The BigM method is called the method of penalties because it involves adding a large penalty term
to the objective function to discourage the selection of certain variables.
30. List any two methods to find intial BFS of a transportation problem.
Two methods to find the initial BFS of a transportation problem are the Northwest Corner Rule and
the Least Cost Method.
The penalty in Vogel's approximation method is found by calculating the difference between the
maximum and minimum costs in each row and column.
The general effective matrix of an assignment problem is a matrix that represents the costs of
assigning each worker to each task.
The principle of dominance in game theory states that a player should choose the strategy that
dominates all other strategies.
A zero-sum game is a game where the total payoff is zero, and one player's gain is equal to the other
player's loss.
Operation Research (OR) is a scientific approach to decision-making that involves the use of
mathematical and analytical techniques to optimize decision-making processes.
38. Briefly describe some application of operation research in functional areas of management.
OR has applications in various functional areas of management, including production and operations
management, financial management, marketing management, and human resource management.
A linear programming problem (LPP) is a mathematical optimization problem that involves finding
the best outcome in a situation where there are multiple constraints.
An unbounded solution is a solution to an LPP where the objective function can be made arbitrarily
large or small without violating any of the constraints.
41. What are artifical varables and why are they introduced?
Artificial variables are variables that are introduced into an LPP to help solve the problem. They are
used to convert an inequality constraint into an equality constraint.
44. What are the main characteristic that a good model for operation research?
A feasible solution is a set of values for the variables that satisfies all the constraints, while an
optimal solution is a feasible solution that maximizes or minimizes the objective function.
Degeneracy in LPP occurs when a basic feasible solution has at least one variable with a value of
zero.
An unbounded solution is a solution to an LPP where the objective function can be made arbitrarily
large or small without violating any of the constraints.
The transportation problem can be formulated as an LPP as follows: Minimize: ∑∑cijxij Subject to:
∑xij = ai (supply constraint) ∑xij = bj (demand constraint) xij ≥ 0 (non-negativity constraint)
49. What is the role of loops in transportation problem?
Loops in a transportation problem represent a sequence of shipments that forms a cycle, where the
last shipment returns to the starting point.
50. Is every assignment problem is a special case of transportation problem? Comment on your
answer.
Yes, every assignment problem is a special case of a transportation problem, where the supply and
demand are equal and the cost of transportation is zero.
The value of the game is the maximum payoff that a player can guarantee regardless of the
opponent's strategy.
A two-person zero-sum game is a game where two players make decisions that affect the outcome,
and the total payoff is zero, with one player's gain equal to the other player's loss.
Operation Research (OR) is a scientific approach to decision-making that involves the use of
mathematical and analytical techniques to optimize decision-making processes.
Interdisciplinary approach
Analytical approach
Problem-solving approach
Decision-making approach
OR is used in agriculture to optimize crop yields, reduce costs, and improve resource allocation. It is
used to solve problems such as:
Irrigation management
56. State three operation research models which have wide commercial applications
Three OR models with wide commercial applications are: Linear Programming (LP)
The solution to an LPP is infeasible when there is no set of values for the variables that satisfies all
the constraints.
59. What are artifical varables and Why are they introduced?
Artificial variables are variables that are introduced into an LPP to help solve the problem. They are
used to convert an inequality constraint into an equality constraint.
60. List any two methods to find intial BFS of a transportation problem
Two methods to find the initial Basic Feasible Solution (BFS) of a transportation problem are:
The penalty in Vogel's approximation method is found by calculating the difference between the
maximum and minimum costs in each row and column.
An unbalanced assignment problem is a problem where the number of workers is not equal to the
number of tasks, or the total capacity of the workers is not equal to the total requirement of the
tasks.