Scribd
Upload
25 views8 pages

Key Concepts in Operations Research

Uploaded by

Saranya A
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views8 pages

Key Concepts in Operations Research

Uploaded by

Saranya A
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1

ELEMENTS OF OPERATIONS RESEARCH 10. Mention the areas of application of an assignment


II [Link] – GENERAL problem.
NAME: 11. What are the various types of Games?
REG NO: 12. What do you mean by Saddle Point?
UNIT I: APRIL 2019 – CDZ4A
Introduction Operations Research- Meaning-Definition - 1. What is OR?
Origin and History- Characteristic Features – Need- 2. State any two limitations of OR.
Scope –Steps- Techniques- Application- Limitations 3. Write the general form of an L.P.P.
UNIT II: 4. When a solution is called Optimum?
Linear Programming Problem Lpp Meaning- 5. Who developed L.P.P?
Requirements- Assumptions- Applications- Formulating 6. How many variables can be solved in Graphical
Lpp –Advantages Limitations Formulating LP Model method of LPP?
(Simple Problems Only) 7. What do you mean by ‘No Solution’?
UNIT III: 8. Mention any two methods for determination of an
Methods of Lpp Obtaining Optimal Solution for Linear Initial Basic Feasible solution.
Programming Problem (LPP)-Graphical Method - 9. What is meant by Balanced Transportation Problem?
Problems --Simplex Method for Type of LPP and for 10. What is an Assignment Problem?
Slack Variable Case -Maximization Function - 11. Name the different types of Games.
Minimization Function (Simple Problem Only) 12. What is meant by Zero-Sum Game?
UNIT IV: NOVEMBER 2019 – CDZ4A
Transportation Problems Meaning –(Initial Basic 1. Define the term ‘Operations Research’.
Feasible Solution )Assumptions -Degenerate Solution - 2. State any two techniques of OR.
North -West Corner Method- Least Cost Method - 3. What is a LPP?
Vogel’s Approximation Method -Assignment Problems 4. Mention the types of Linear Programming Problem.
Features -Transportation Problem Vs Assignment 5. What is a solution of LPP?
Problem -Hungarian Method (Simple Problems Only) 6. What is a Solution Space?
UNIT V: 7. Write the meaning of Unique Solution.
Game Theory Meaning- Types of Games- Basic 8. What do you understand by Unbalanced
Assumptions- Finding Value of Game for Pure Strategy - Transportation Problem?
Mixed Strategy -Indeterminate Matrix and Average 9. What is an Assignment Problem?
Method -Graphical Method -Pure Strategy- Saddle Point 10. Define the term ‘Basic Feasible Solution’.
Payoff Matrix Value of Game (Simple Problems Only) 11. What do you mean by Non-Zero Sum Game?
12. State the use of Game Theory.
ELEMENTS OF OPERATIONS RESEARCH APRIL 2021 – CDZ4A
PREVIOUS YEAR QUESTION PAPERS 1. State any two applications of operations research.
II [Link] (G) – 4TH SEMESTER 2. Define L.P.P.
SUBJECT CODE: CDZ4A / CZ34A 3. What are the characteristics of LPP?
2 MARKS 4. Define slack variable.
APRIL 2018 – CDZ4A 5. What are the two forms of LPP?
1. Operation Research – Define. 6. Write any two limitations of LPP.
2. Mention any two techniques of OR. 7. Define feasible solution.
3. What do you mean by linear programming? 8. State the necessary and sufficient conditions for
4. What is basic solution? transportation problem have a feasible solution.
5. State the meaning of unboundedness. 9. Define transportation problem.
6. What is slack variable? 10. What is the objective of an assignment problem?
7. Expand the terms VAM and NWCM. 11. Define two person zero sum game.
8. Give the meaning of un-balanced transportation 12. What are the classification of strategy?
problem. NOVEMBER 2020 – CDZ4A
9. What is strategy? 1. What are the three phases of scientific procedure in
10. Write the meaning of mixed strategy. OR?
11. What is Traffic Intensity? 2. Write any two characteristics of O.R?
12. State the meaning of assignment problem. 3. What are the various types of models in O.R?
NOVEMBER 2018 – CDZ4A 4. Define objective function.
1. Define Operations Research. 5. What are the three components of a LPP?
2. Mention any two features of OR. 6. What do you mean by the standard form of LPP?
3. What is a Linear Programming Problem? 7. Define degenerate solution.
4. Name the methods of solving L.P.P. 8. What is the name of the method used in getting the
5. What is a Feasible Solution? optimum assignment?
6. What do you mean by Unbounded Solution? 9. What is the difference between transportation and
7. State the meaning of Solution Space. assignment problem?
8. What is Degenerate Solution? 10. Define unbalanced assignment problem.
9. What is a Transportation Problem? 11. Define game.
2

12. Define value of the game. NOVEMBER 2018 – CDZ4A


APRIL 2022 – CZ34A 1. Explain the various phases of OR
1. Define Operations Research? 2. Mention the limitations of OR
2. What is model in operations research? 3. Write the general of form LPP
3. What is decision variables? 4. List out the steps in Formulation of LPP
4. What is linear programming? 5. Solve graphically
5. Define simplex method? Maximize Z = 3𝑥1 + 4𝑥2
6. What is unbounded solution? Subject to
7. What is feasible solution? 2𝑥1 + 5𝑥2 ≤ 120
8. Define Degenerate solution? 4𝑥1 + 2𝑥2 ≤ 80
9. What is occupied cells in transportation problem? 𝑥1 , 𝑥2 ≥ 0
10. What is dual problem? 6. Determine an initial basic feasible solution to the
11. Who is Player? following Transportation Problem using North
12. Define payoff matrix? West Corner Rule.
APRIL 2023 – CZ34A Demand
Supply
1. Define Operations Research? D1 D2 D3
2. Mention any two features of Operations Research? O1 2 7 4 5
3. What is linear programming? Origin O2 3 3 1 8
4. Define Optimum Solution? O3 5 4 7 7
5. What is slack variables? O4 1 6 2 14
6. What is feasible solution? Required 7 9 18 34
7. Define Transportation Problem? 7. Determine the Optimal Minimax Strategies for
8. What is VAM? each player in the following game.
9. What is Assignment Problem? −5 2 0 7
10. Who are Players? [5 6 4 8]
11. What is pure strategy? 4 0 2 −3
12. What is Saddle point? APRIL 2019 – CDZ4A
5 MARKS 1. Explain the scope of OR
APRIL 2018 – CDZ4A 2. Bring out the need and significance of OR
1. What are the features of operation research? 3. What are the steps involved in formulation of
2. Solve LPP graphic method LPP?
Max Z = 4x1 + 4x2 4. Mention the advantages of LPP?
Subject to 5. Solve graphically
𝑥1 + 2𝑥2 ≤ 10 Minimize Z = 3𝑥1 + 5𝑥2
6𝑥1 + 6𝑥2 ≤ 36 Subject to
𝑥1 ≤ 4 𝑥1 + 𝑥2 ≥ 200
𝑥1 , 𝑥2 ≥ 0 𝑥1 ≤ 80
3. What are the basic assumptions of the 𝑥2 ≥ 60
transportation model? 𝑥1 , 𝑥2 ≥ 0
4. Consider the problem of assigning 5 jobs to 5 6. Determine an initial basic feasible solution to the
persons. The costs are given as below following transportation problem using NWCR
Jobs Origin D1 D2 D3 D4 Supply
1 2 3 4 5
A 8 4 2 6 1 O1 6 4 1 5 14
B 0 9 5 5 4 O2 8 9 2 7 16
PERSONS
C 3 8 9 2 6 O3 4 3 6 2 5
D 4 3 1 0 3 Requirement 6 10 15 4 35
E 9 5 8 9 5 7. For a game with the following pay-off matrix
Find out minimum cost. Player A
5. Determine an initial basic feasible solution to the Player B −1 2 −2
following transportation problem using Least [ ]
6 4 −6
cost entry method NOVEMBER 2019 – CDZ4A
Destination
Availability 1. Explain the methodology of OR
D1 D2 D3 D4 2. Present the application of OR in the practice of
O1 1 2 1 4 20 management
Origin O2 3 3 2 1 40
3. Write the steps involved in formulation of LPP
O3 4 2 5 9 20
O4 5 3 6 10 20 4. State the various limitations of LPP
5. Solve by graphical method
Requirement 20 40 30 10 Maximize Z = 𝑥1 + 𝑥2
6. Explain the principles of Hungarian method Subject to
7. Solve the following game by odds method 𝑥1 + 2𝑥2 ≤ 2000
1 5 𝑥1 + 𝑥2 ≤ 1500
4 2 𝑥2 ≤ 600
3

𝑥1 , 𝑥2 ≥ 0
5 1
6. Solve the following minimal assignment Player A ( )
problem by Hungarian method 3 4
Operators Determine the best strategies as well as the value
1 2 3 4 5 of the game for player A and B.
A 30 25 33 35 36
B 23 29 38 23 26 APRIL 2022 – CZ34A
Machines 1. What are the natures of operations research?
C 30 27 22 22 22
D 25 31 29 27 32 2. What are the advantages of models?
E 27 29 30 24 32 3. A company produces the product P,Q and R.
7. Explain the different types of Games? From three raw materials A,B and C. One unit of
APRIL 2021 – CDZ4A product P requires 2 units of A and 3 units of B.
1. Explain the limitations of OR A unit of product P requires 2 units of B and
2. Explain scientific method in operations research? 5units of C and one unit of product R requires 3
3. What are the applications of OR units of A 2 units of B and 4 units of C. The
4. Explain the basic assumptions of LPP company has 8 units of material A, 10 units of B
5. Solve Graphically and 15 units of C available to it. Profits/unit of
Minimum z = 3𝑥1 + 2𝑥2 products P, Q and R and Rs. 3, Rs 5 and Rs 4
Subject to respectively. Formulate the problem
5𝑥1 + 𝑥2 ≥ 10 mathematically.
𝑥1 + 𝑥2 ≥ 6 4. Find all the basic feasible solution of equations
𝑥1 + 4𝑥2 ≥ 12 2𝑥1 + 6𝑥2 + 2𝑥3 + 𝑥4 = 3
𝑥1 , 𝑥2 ≥ 0 6𝑥1 + 4𝑥2 + 4𝑥3 + 6𝑥4 = 2
6. Determine an initial basic feasible solution to the 5. Solve the following transportation problems
following transportation problem using NWCR. Distributions Monthly
D E F G Available W X Y Z Availability
A 20 25 50 10 45000
A 11 13 17 14 250 Factories
B 45 50 15 40 50000
B 16 18 14 10 300
C 22 10 45 35 55000
C 21 24 13 10 400 Monthly
Requirement 200 225 275 250 950 50000 40000 30000 30000
Demand
7. For a game with the following pay off matrix 6. Solve the following assignment problem?
Player B Workers
W X Y Z
2 5
Player A ( ) A 80 70 90 100
7 3 Jobs B 70 90 90 80
C 100 80 70 110
Determine the best strategies as well as the value
D 100 60 80 70
of the game for player A and B.
7. Solve the following problem graphically
NOVEMBER 2020 – CDZ4A
1. Enumerate the general LPP 3 −3 4
2. Explain graphical solution method of LPP 𝑃𝐿𝐴𝑌𝐸𝑅 𝐴 ( )
−1 1 −3
3. Explain the features of OR APRIL 2023 – CZ34A
4. Explain the following terms 1. What are the advantages of Models?
a) Optimality 2. Use Simplex method to solve
b) Slack variable Minimize Z = 𝑥1 + 2𝑥2 + 3𝑥3
c) Feasibility Subject to constraints
5. Solve graphically 𝑥1 + 2𝑥2 + 3𝑥3 ≤ 10
Minimize Z = 5𝑥1 + 4𝑥2 𝑥1 + 𝑥2 ≤ 5
Subject to 𝑥1 + 𝑥2 + 𝑥3 ≥ 0
4𝑥1 + 𝑥2 ≥ 40
2𝑥1 + 3𝑥2 ≥ 90
𝑥1 , 𝑥2 ≥ 0
6. Determine an initial basic feasible solution to the
following transportation problem using NWCR.
D1 D2 D3 Supply
O1 2 7 4 5
O2 3 3 1 8
O3 5 4 7 7
O4 1 6 2 14
Demand 7 9 18 34
7. For a game with the following pay off matrix

Player B
4

UNIT IV
Transportation Problems Meaning –(Initial Basic
Feasible Solution ) Assumptions -Degenerate Solution -
North -West Corner Method- Least Cost Method -
Vogel’s Approximation Method -Assignment Problems
features -Transportation Problem Vs Assignment
Problem -Hungarian Method (Simple Problems Only)

TRANSPORTATION
METHODS FOR FINDING INITIAL BASIC
FEASIBLE SOLUTION
There Are Five Methods
(i). North West Corner Rule (Nwc)
(ii). Least Cost Method (Lcm),
Matrix Minima Method (Mmm),
Lowest Cost Method (Lcw)
(iii). Row Minima Method (Rmm)
(iv).Column Minima Method (Cmm)
(v). Vogel’s Approximation Method (Vam)
Penalty Method
Regret Method

North West Corner Rule (Nwc)


PROBLEMS
1. Find the Transportation Using North West
Corner Rule

10 MARKS
APRIL 2018
APRIL 2018 – CDZ4A
NOVEMBER 2018 – CDZ4A
APRIL 2019 – CDZ4A THEORY QUESTION AND ANSWERS
NOVEMBER 2019 – CDZ4A
APRIL 2021 – CDZ4A 5 MARK
NOVEMBER 2020 – CDZ4A
APRIL 2022 – CZ34A 1. What are the features of operation research?
APRIL 2023 – CZ34A

2. What are the basic assumptions of the


transportation model?

3. Explain the principles of Hungarian method


TRANSPORTATION AND ASSIGNMENT
PROBLEMS
5

4. Explain the various phases of OR

5 Mention the limitations of OR (2)


6

6 Write the general of form LPP

7 List out the steps in Formulation of LPP


7

8. Explain the scope of OR


8

10. What are the steps involved in formulation of


LPP?

11. Mention the advantages of LPP?

12 Explain the methodology of OR

13 Present the application of OR in the practice of


management

14 Write the steps involved in formulation of LPP

15 State the various limitations of LPP

16 Explain the different types of Games?

17 Explain scientific method in operations research?

18 What are the applications of OR

19 Explain the basic assumptions of LPP

20 Enumerate the general LPP

21 Explain graphical solution method of LPP

22 Explain the features of OR

23 Explain the following terms


d) Optimality
e) Slack variable
f) Feasibility

9. Bring out the need and significance of OR

Common questions

Powered by AI

The characteristics of a linear programming problem, such as linearity, constraint-based solutions, and finite variable interactions, ensure the effectiveness of solution approaches like the graphical method only for problems with two variables. The graphical method relies on visual plotting of constraints and objective functions, which is efficient for understanding feasible regions and optima in 2D problems. However, as complexity and dimensions increase, this method becomes impractical, necessitating more scalable algorithms like Simplex for higher-dimensional problems .

Assumptions in the transportation model, such as supply equaling demand, linear costs, and static distributions, significantly impact the feasibility and efficiency of solutions. These assumptions simplify the scenario, facilitating mathematical modeling and computation. However, they can lead to inefficiencies and infeasible solutions if real-world situations deviate from these assumptions, such as having multiple distribution centers or dynamic changes in supply and demand. Ensuring assumptions closely align with reality enhances model applicability and decision-making effectiveness .

Understanding the limitations of Operations Research is crucial for effective management practice as it helps in setting realistic expectations, avoiding over-reliance on quantitative models, and recognizing the role of qualitative factors. Operations Research provides powerful analytical tools for optimizing decision-making processes, but these tools often rely on simplifying assumptions that may not hold true in complex real-world situations. Being aware of these limitations allows managers to complement analytical insights with contextual understanding and adaptive strategies .

Slack variables are added to inequality constraints in Linear Programming to transform them into equality constraints, enabling the use of algebraic solution methods like the Simplex method. For 'less than or equal to' constraints, a slack variable accounts for the difference between the left and right sides, maintaining the constraint’s equation structure without altering the system's balance. This transformation is crucial for converting a non-standard form into a standard form required by many optimization algorithms .

Unbounded solutions occur in Linear Programming when the value of the objective function can increase indefinitely under given constraints, usually indicating a lack of upper bound constraints. Infeasibility, on the other hand, occurs when no solution exists that satisfies all constraints simultaneously. Unboundedness is identified during the simplex process when a pivot column cannot improve the objective function, while infeasibility is detected when there are inconsistent constraints present or when initial feasible solutions cannot be established due to violations .

Scientifically grounding the methodology in Operations Research is essential for its practical application across industries as it ensures rigor, replicability, and reliability of results. Operations Research relies on quantitative techniques and models that require robust theoretical underpinnings to derive valid solutions to complex problems. In industries, failing to base OR techniques on scientific methodology risks decisions based on inaccurate analyses, which could lead to inefficiencies and suboptimal resource utilization. Therefore, a solid foundation in scientific principles is key to achieving the intended outcomes and ensuring long-term strategic benefits .

In game theory, a pure strategy involves a deterministic approach where a player chooses a specific action with certainty, whereas a mixed strategy involves randomizing over possible actions to keep opponents uncertain. The value of a game determined by pure strategies is typically straightforward and relies on the existence of a saddle point in a payoff matrix. In contrast, mixed strategies are often employed when no saddle point exists, requiring calculations of expected payoffs to determine an equilibrium. Mixed strategies can provide a strategic advantage in complex or indeterminate games .

The primary differences between transportation and assignment problems in Operations Research lie in their objectives and formulations. Transportation problems focus on minimizing the cost of distributing a product from several sources to several destinations, considering quantities and demands. In contrast, assignment problems aim to optimally pair tasks with agents at the lowest cost or highest efficiency, typically without the complexity of supply and demand balancing. Additionally, assignment problems are a specific case of transportation problems where supply equals demand and involves binary allocation .

The simplex method is a systematic algorithm that helps solve Linear Programming Problems by moving along the edges of a feasible region to find the optimal vertex, where the highest or lowest value of the objective function is achieved. Its iterative nature efficiently finds the optimum for large-scale problems. However, key limitations include potential computational intensity with very large problem sets and sensitivity to changes in coefficients or constraints, which may result in cycling or require alternative pivoting rules to overcome .

The North West Corner Method differs from the Least Cost Method in transportation problem solving by its approach to determining the initial basic feasible solution. The North West Corner Method starts allocation from the top-left corner of the cost matrix and continues horizontally and vertically regardless of costs, while the Least Cost Method begins by assigning as much as possible to the lowest-cost route, aiming to minimize the initial cost of transportation .

You might also like