1.

Optimal Strategy:-depends on the specific context and goals, requiring a thorough analysis of available
information and potential outcomes to make informed decisions.
2.System Length:-The request for "System Length" is unclear. Please provide more context or clarify the
question so that I can offer a relevant response.
3.Expected Monetary Value (EMV):-is a statistical concept used in risk management to quantify the
average financial outcome of a decision by multiplying the probability of each possible outcome by its
associated monetary value and summing the results.
4.Feasible Solution:-is a viable and practical resolution to a problem that can be implemented successfully
within given constraints and resources.
5.Minimum Spanning Tree:-is a subset of the edges of a connected, undirected graph that connects all the
vertices with the minimum possible total edge weight, forming a tree without any cycles.
6.Feasible Region:-In optimization and linear programming, a feasible region is the set of all possible points
that satisfy a given set of constraints.
7.Degeneracy:-refers to the redundancy or multiplicity of solutions in a mathematical model or system,
often resulting in more than one optimal solution.
8.Unbalanced Transportation Problem vs. Unbalanced Assignment Problem:-The Unbalanced
Transportation Problem involves unequal supplies and demands in a network, while the Unbalanced
Assignment Problem deals with varying numbers of tasks and agents for assignment, creating an uneven
distribution challenge.
9.Utilization Factor (UF):-is a measure used to indicate the extent to which a system or resource is being
used compared to its full potential or capacity.
10.Two-person Zero-sum Game:-is a type of game in game theory where two players compete directly
against each other, and the gain (or loss) of one player is exactly balanced by the loss (or gain) of the other
player.
11.Length of Queue:-is the number of entities currently waiting in line. It represents the count of
individuals or items queued up for a service or process.
12.Degeneracy in transportation problem:-is occurs when the number of allocated cells equals the sum of
the number of rows and columns minus one.
13.Payoff Matrix:-is a decision-making tool that displays the outcomes of different choices made by two or
more parties in a concise table, indicating the payoffs or gains associated with each combination of
decisions.
14.Unbounded solution:-occurs when a linear programming problem has no feasible solution and the
objective function can be improved indefinitely.
15.Saddle point:-in mathematics refers to a point on the surface of a function where the slopes along
different directions are zero, but it is neither a local minimum nor a local maximum.
16.Traffic Intensity or Utilization Factor in Queuing:-In queuing theory, traffic intensity, also known as the
utilization factor (often denoted as ρ), is a crucial metric used to describe the load on a queuing system. It
measures the extent to which the server(s) are busy handling arrivals compared to being idle.
17.Hurwich's Criterion in Decision Theory:-The Hurwicz criterion can be viewed as a weighted average of
the best and the worst uncertainty realizations. Hence, it generalizes the most optimistic Maximax
criterion and the most pessimistic Maximin criterion both are popular alternative rules for decision-making
under uncertainty in a unified manner.
18.Dominance Principle in Game Theory:-The principle of dominance states that if one strategy of a player
dominates over the other strategy in all conditions then the later strategy can be ignored.
19.Unbalanced assignment problem:-involves assigning tasks to resources where the number of tasks and
resources is unequal, leading to difficulties in finding an optimal solution.
20.Minimum spanning Tree:-is a tree that spans all the vertices in a connected graph with the minimum
possible sum of edge weights.
21.List down characteristics of Queuing system:-Queuing systems exhibit characteristics such as arrival
rate, service rate, queue discipline, and system capacity, influencing the overall efficiency and performance
of the system.
22.Expected Value of Perfect Information (EVPI):-represents the maximum amount a decision-maker
should be willing to pay for perfect information before making a decision.
23.Linear programming:-is a mathematical optimization technique for maximizing or minimizing a linear
objective function, subject to linear equality and inequality constraints.

1.Differentiate between Feasible Solution & Optimal Solution:-A feasible solution is any valid answer that
meets the given constraints, while an optimal solution is the best feasible solution among all possible
options, maximizing or minimizing the objective function.
2.What is unbalanced Assignment problem:-An unbalanced assignment problem occurs when the number
of agents differs from the number of tasks, creating an unequal distribution that complicates direct
assignment solutions.
3.Differentiate between Maximin and Minimax Principle:-Maximin principle seeks to maximize the
minimum possible outcome, prioritizing risk aversion. Minimax principle aims to minimize the maximum
possible loss, focusing on strategic decision-making in adversarial scenarios, often in game theory.
4. Explain the Laplace principles of decision making:-The Laplace principle suggests that decisions should
be based on the probability of events by assuming equal likelihood when uncertain, aiming for maximum
expected utility in a rational choice.
5.State the different components of LPP:-The components of Linear Programming Problem (LPP) are:
decision variables, objectivefunction, constraints.
6.What is saddle point:-A saddle point in mathematics refers to a point on a surface that is a minimum in
some directions and a maximum in others, exhibiting neither a strict minimum nor maximum across the
entire surface.
7.What is Monte Carlo Simulation:-Monte Carlo Simulation is a computational technique that uses
random sampling to model and analyze complex systems, predicting outcomes through repeated random
sampling.
8. When does degeneracy generate in transportation problem?:-Degeneracy occurs in a transportation
problem when the number of allocated variables doesn't reach the optimum value in the iteration, causing
a loop in the solution process.
9.What is zero sum game?:-A zero-sum game is a situation in which one participant's gain is exactly
balanced by another participant's loss, resulting in a constant total of benefits and losses.
10. Write the relation between primal and dual?:-The primal and dual problems in optimization are
related through the concept of duality, where the optimal solution of one (primal) provides a bound for the
other (dual), and vice versa.
11.State various assumptions of Linear programming problem:-The assumption of linear programming
are: The relation shown by the constraints and the objective function are linear.
12.Block diagram of OR problem solving methodology:-Problem Identification, Objective Definition,
Criteria Establishment, Scope Determination, Stakeholder Identification, Assumption Setting
13.Write the relation between Primal & dual (Any two):-1.The number of constraints in the primal
problem is equal to the number of dual variables, and vice versa. 2.If the primal problem is a maximization
problem, then the dual problem is a minimization problem and vice versa.
14.What is unbounded solution in case of lpp?:-An unbounded solution of a linear programming problem
is a situation where objective function is infinite. A linear programming problem is said to have unbounded
solution if its solution can be made infinitely large without violating any of its constraints in the problem.
15.Differentiate between primal and dual:-The primal problem is used to find the optimal solution to a
given problem, while the dual problem provides additional insights into the structure of the problem and
can be used to check the feasibility of the primal solution.
16.State the limitation of graphical method for solving LPP:-The main drawback of the graphical approach
of solving linear equations is that it cannot be used to solve problems with three or more variables.
17.Differentiate between System length and queue length:-Queue length. This is the number of units
waiting in a queue or present in a system. In the latter case it is sometimes called the system size.
18.What is the Minimum Spanning Tree Technique of Network Models:-A minimum spanning tree (MST)
or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph
that connects all the vertices together, without any cycles and with the minimum possible total edge
weight.
19.Give a brief note on Linear Programming Assumption:-The assumption of linear programming are: The
relation shown by the constraints and the objective function are linear.
20.What is Saddle Point in Game Theory?:-Definition (Saddle point). In a zero-sum matrix game, an
outcome is a saddle point if the outcome is a minimum in its row and maximum in its column.
21.What is an unbalanced transportation problem?:-Unbalanced transportation problem is defined as a
situation in which supply and demand are not equal.
22.Give the General structure of a Queuing System:-A study of a line using queuing theory would break it
down into six elements: the arrival process, the queue or service capacity, the number of servers available,
the size of the client population, the queuing discipline (such as first-in, first-out), and the departure
process.
23.Distinguish between “transportation problem” and “assignment problem”:-The transportation
problem deals with minimizing the cost of transporting goods from multiple sources to multiple
destinations, while the assignment problem focuses on assigning tasks or resources to a set of agents or
activities at minimum cost.
24.What do you understand by Sadle point in game theory ?:-A saddle point in game theory is a situation
where neither player can improve their payoff by changing their strategy, indicating a stable outcome in a
game with a specific strategy combination.
25.Discuss the need and application of linear programming ?:-Linear programming is needed for
optimizing resource allocation in various fields like economics, logistics, and manufacturing by
mathematically modeling constraints and objectives.
26.What is Meant by “Duality“in linear programming ?:-Duality in linear programming refers to the
relationship between primal and dual problems, where solutions in one correspond to bounds or
constraints in the other, maximizing or minimizing the same objective under different conditions.
27.Why operations research is important for Managers ?:-Operations research enables managers to make
data-driven decisions and optimize processes, ultimately enhancing efficiency and resource utilization.
28.Define the term “pay off matrix” in decision theory ?:-A "payoff matrix" in decision theory is a table
that shows the potential outcomes for different choices made by two or more decision-makers,
highlighting the associated gains or losses for each decision combination.
29.Describe simulation model:-A simulation model is a computerized representation of a real-world
system or process, used to imitate, analyze, and predict its behavior or outcomes.
30.What are the assumptions of linear programming ?:-Linear programming assumes proportionality,
additivity, certainty, and the existence of non-negative decision variables.
31.Explain “M/M/1 (∞/FCFS)” in queueing model:-M/M/1 (∞/FCFS) in queueing theory represents a
single-server queue with unlimited capacity where arrivals follow a Poisson process, service times adhere
to an exponential distribution, and customers are served on a first-come, first-served basis.
32.Explain main Assumptions of Game theory:-Game theory assumes rational decision-making by players
and their pursuit of self- interest within strategic interactions.
(Q1).Define Operations Research and discuss its application in managerial decision-making:-1.resource
allocation, 2.optimization, 3.forecasting and planning, 4.decision support system, 5.supply chain
management, 6.project management, 7.quality control

(Q2).what is decision theory describe the type of decision making environment:-1.certainly environment,
2.risk environment, 3.uncertainty environment, 4.ambiguity environment

(Q3).what is queueing theory discuss it's major characteristics:-1.arrival process, 2.service process,
3.queue discipline, 4.queue length, 5.utilisation, 6.waiting time and queue length distribution,
7.performance metrics, 8.queuing model, 9.application, 10.trade offs

(Q4).what are the components of an LLP what does the non negativity restrictions mean:-1.objective
function, 2.decision variables, 3.constraints, 4.non negativity restrictions

(Q5).what are advantages and limitations of simulation:- • (Advantage) :-1.realistic modelling,

2.experimentation, 3.flexibility, 4.cost effective, 5.risk free testing • (limitation):- 1.simplification,
2.assumption and accuracy, 3.validation and verification, 4.resource intensive, 5.interpretation and bias

(Q6).write steps of minimum spanning tree:-• (Kruskal algorithm):- 1.initialisation, 2.sort edges,
3.initialize MST, 4.iterate through sorted edges 5.output MST • (prims algorithm):- 1.initialization,
2.initialize MST, 3.choose minimum edge, 4.output MST

(Q7).what are the assumption underlying linear programming:-1.proportionality, 2.additivity, 3.certainly

4.divisibility, 5.non negativity, 6.independence, 7.linearity

(Q8).write a brief note on pure strategy and mixed strategy of game theory :- 1.pure strategy, 2.mixed
strategy

(Q9).what is queueing theory in what type of problem situation can it be applied successfully discuss
giving examples:-1.service system, 2.telecommunication, 3.transportation system, 4.manufacturing and
inventory, 5.healthcare system, 6.computer system

(Q10).Explain the various assumptions of Linear Programming Problems:-1.Proportionality, 2.Additivity,

3.Certainty, 4.Divisibility, 5.Non-Negativity, 6.Independence

(Q11).What are network models? Explain in brief various types of network models with example:-
1.Shortest Path Model, 2.Minimum Spanning Tree (MST) Models, 3.Maximum Flow Models, 4.Assignment
Models, 5.Transportation Models, 6.Network Flow Models

(Q12).Significant Features of Operations Research:-1.Quantitative Approach, 2.Interdisciplinary Nature,

3.Decision Support, 4.Problem Solving, 5.Optimization, 6.Modeling and Simulation, 7.Iterative Process,
8.Strategic Decision Making