Ba7206 QB

FRANCIS XAVIER ENGINEERING COLLEGE,
TIRUNELVELI
DEPARTMENT OF MANAGEMENT STUDIES
QUESTION BANK
SUBJECT
: APPLIED OPERATIONS RESEARCH
CODE
: BA7206
ACADEMIC YEAR: 2014-2015
YEAR/SEM
: I/ I
PREPARED BY
Mrs. A. JASMINE SUGIL
AP/MCA
www.francisxavier.ac.in
BA7206 APPLIED OPERATIONS RESEARCH
LT P C
3104
UNIT I
INTRODUCTION TO LINEAR PROGRAMMING (LP) 12
Introduction to applications of operations research in functional areas of management. Linear
Programming-formulation, solution by graphical and simplex methods (Primal - Penalty,
TwoPhase), Special cases. Dual simplex method. Principles of Duality. Sensitivity Analysis.
UNIT II
LINEAR PROGRAMMING EXTENSIONS 12
Transportation Models (Minimising and Maximising Problems) Balanced and unbalanced
Problems Initial Basic feasible solution by N-W Corner Rule, Least cost and Vogels
approximation methods. Check for optimality. Solution by MODI / Stepping Stone method.
Case ofDegeneracy. Transhipment Models. Assignment Models (Minimising and
Maximising Problems) Balanced and Unbalanced Problems. Solution by Hungarian and
Branch and Bound Algorithms.Travelling Salesman problem. Crew Assignment Models.
UNIT III
INTEGER PROGRAMMING AND GAME THEORY 12
Solution to pure and mixed integer programming problem by Branch and Bound and cutting
plane algorithms. Game Theory-Two person Zero sum games-Saddle point, Dominance Rule,
Convex mLinear Combination (Averages), methods of matrices, graphical and LP solutions.
UNIT IV
INVENTORY MODELS, SIMULATION AND DECISION THEORY 12
Inventory Models EOQ and EBQ Models (With and without shortages), Quantity Discount
Models. Decision making under risk Decision trees Decision making under uncertainty.
Monte-carlo simulation.
UNIT V
QUEUING THEORY AND REPLACEMENT MODELS 12
Queuing Theory - single and Multi-channel models infinite number of customers and
infinite calling source. Replacement Models-Individuals replacement Models (With and
without time value of money) Group Replacement Models.
TOTAL: 60 PERIODS
QUESTION BANK
SUBJECT: APPLIED OPERATIONS RESEARCH
BRANCH: I M.B.A
CODE BA7206
SEM
PART-A
UNIT I
: II
(2 MARKS)
1. Define a feasible solution.

2. Define optimal solution.
3. What is the difference between basic solution and basic feasible solution?
4. Define unbounded solution.
5. What are slack and surplus variables?
6. What is meant by optimality test in a LPP?
7. What are the methods used to solve an LPP involving artificial variables?
8. Define artificial variable
9. When does an LPP posses a pseudo-optimal solution?
10. What is degeneracy?
11. How to resolve degeneracy in a LPP?
12. Define dual of LPP.
13. State the characteristics of canonical form.
14. State the characteristics of standard form.
15. Define basic feasible solution
16. Define non-degenerate solution
17. Define degenerate solution
18. Write the general mathematical model of LPP in matrix form.
19. Define basic solution:
20. What do you understand by transportation problem?
21. Define feasible solution of a transportation problem.
22. Define basic feasible solution of a transportation problem.
23. Define degenerate basic feasible solution of a transportation problem.
24. Define the optimal solution to a T.P?
25. What is the purpose of MODI method?
26. What do you mean by degeneracy in a T.P?
27. Explain how degeneracy in a T.P may be resolved?
28. What do you mean by an unbalanced T.P?
29. What is an assignment problem? Give two applications?
30. What do you mean by an unbalanced assignment problem?
31. What is the objective of the travelling salesman problem?
32. How do you convert the maximization assignment problem in to a minimization one?
33. Give some applications of IPP?
34. Why not round off the optimum values instead of resorting to Integer Programming?
Explain.
35. Write the mathematical formulation for transportation problem?
36. Write the mathematical formulation for assignment problem?
37. Write the mathematical formulation for travelling salesman problem?
38. What is the optimality test used while solving an Assignment Problem using Hungarian
method?
39. How do you solve an A.P if the profit is to be maximized?
40. What do you mean by integer programming problem?
41. Define a pure integer programming problem?
42. Define a mixed integer programming problem?
43. Explain the need for integer programming.

44. What are the methods used in solving IPP?
47. Give some applications of IPP.
48. Why not round off the optimum values instead of resorting to integer programming?
Explain.
49. Differentiate between pure and mixed IPP.
50. What is the other name for Gomorys constraint?
51. State the general integer programming problem?
52. Define a game.
53. Define a saddle point.
54. Define two-person zero sum game?
55. Define payoff.
56. Define value of the game.
57. What is meant by Maximin and Minimax?
58. When do you say a game is stable?
59. Define simulation. Why is it used?
60. Define random number.
61. Define pseudo-random number.
62. What are the advantages of simulation?
63. What are the limitations of simulation?
64. What are the uses of simulation?
65. What are the two types of decisions?
66. What are the different types of decision making situations?
67. What is Expected Monetary Value (EMV)
68. What is Expected Opportunity Loss (EOL)?
69. What is Expected Value of Perfect Information (EVPI)
70. What are the methods, which are useful for decision making under uncertainty.
71. What are the two types of strategies?
APPLIED OPERATIONS RESEARCH BA7206
Part-A Questions and Answers

UNIT-I
1. What is operations research?
Operations research is a study of optimization techniques. It is applied decision
theory. OR is the application of scientific methods, techniques and tools to problems
involving the operations of systems so as to provide these in control of operations
with optimum solutions to the problem.
2. List some applications of OR.
Optimal assignment of various jobs to different machines and different

operators.
To find the waiting time and number of customers waiting in the queue and
system in queuing model
To find the mimimum transportation cost after allocating goods from different
origins to various destinations in transportation model
Decision theory problems in marketing,finance and production planning and

control.
3. What are the various types of models in OR?
Models by function
i) Descriptive model
ii) Predictive model iii) Normative model
Models by structure
i) Iconic model ii) Analogue model iii) Mathematical model
Models by nature of environment

i) Deterministic model ii) Probabilistic model
4. What are main characteristics of OR?
Examination of functional relationship from a system overview.

Utilization of planned approach
Adaptation of planned approach
Uncovering of new problems for study
5. Name some characteristics of good model.
The number of assumptions made should be as few as possible

It should be easy as possible to solve the problem
The number of variables used should be as few as possible.
It should be more flexible to update the changes over a period of time without
change in its framework.
6. What are the different phases of OR?
Formulation of the problem

Construction of mathematical modeling
Deriving the solution from the model
Validity of the model
Establishing the control over the solution
Implementation of the final solution.
7. List out the advantages of OR?
Optimum use of managers production factors

Improved quality of decision
Preparation of future managers by improving their knowledge and skill
Modification of mathematical solution before its use.
8. What are the limitations of OR?

Mathematical model do not take into account the intangible factors such as
human relations etc. can not be quantified.
Mathematical models are applicable to only specific categories of problems.
Requires huge calculations. All these calculations cannot be handled manually
and require computers which bear heavy cost.
9. What is linear programming?

Linear programming is a technique used for determining optimum utilization of
limited resources to meet out the given objectives. The objective is to maximize the
profit or minimize the resources (men, machine, materials and money)
10. Write the general mathematical formulation of LPP.
1. Objective function
Max or Min Z = C1x1 + C2x2+ ..+ Cnxn
2. Subject to the constraints
a11x1+a12x2++ a1nxn (=)b1
a21x1+a22x2++ a2nxn (=)b2
..
..
am1x1+am2x2++ amnxn (=)bm

3. Non-negative constraints
x1,x2,.xm 0
11. What are the characteristic of LPP?
There must be a well defined objective function.

There must be alternative course of action to choose.
Both the objective functions and the constraints must be linear equation or
inequalities.
12. What are the characteristic of standard form of LPP?
The objective function is of maximization type.

All the constraint equation must be of equal type by adding slack or surplus
variables
RHS of the constraint equation must be positive type
All the decision variables are of positive type
13. What are the characteristics of canonical form of LPP?

In canonical form, if the objective function is of maximization type, then all

constraints are of type. Similarly if the objective function is of minimization type,
then all constraints are of type. But non-negative constraints are type for both
cases.
14. A firm manufactures two types of products A and B and sells them at profit
of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines
M1 and M2.Type A requires 1 minute of processing time on M1 and 2 minutes
on M2 Type B requires 1 minute of processing time on M1 and 1 minute on M2.
Machine M1 is available for not more than 6 hours 40 minutes while machine M2
is available for 10 hours during any working day. Formulate the problem as a
LPP so as to maximize the profit.
Maximize z =2x1 +3x2
Subject tot the constraints:
x1 + x2 400
2x1 + x2 600
x1 ,x2 0
15. A company sells two different products A and B , making a profit of Rs.40
and Rs. 30 per unit on them,respectively.They are produced in a common
production process and are sold in two different markets, the production process
has a total capacity of 30,000 man-hours. It takes three hours to produce a unit of
A and one hour to produce a unit of B. The market has been surveyed and
company official feel that the maximum number of units of A that can be sold is
8,000 units and that of B is 12,000 units. Subject to these limitations, products
can be sold in any combination. Formulate the problem as a LPP so as to
maximize the profit
Maximize z =40x1 +30x2
Subject tot the constraints:
3x1 + x2 30,000
x1 8000
x2 12000
x1 ,x2 0
16. What is feasibility region?
Collections of all feasible solutions are called a feasible set or region of an

optimization model. Or A region in which all the constraints are satisfied is called
feasible region.
17. What is feasibility region in an LP problem? Is ti necessary that it should
always be a convex set?
A region in which all the constraints are satisfied is called feasible region. The
feasible region of an LPP is always convex set.
18. Define solution
A set of variables x1,x2.xn which satisfies the constraints of LPP is called a
solution.
19. Define feasible solution?
Any solution to a LPP which satisfies the non negativity restrictions of LPPs called
the feasible solution
20. Define optimal solution of LPP.
Any feasible solution which optimizes the objective function of the LPPs
called the optimal solution
21. State the applications of linear programming
Work scheduling
Production planning & production process
Capital budgeting
Financial planning
Blending
Farm planning
Distribution
Multi-period decision problem
Inventory model
Financial model
Work scheduling
22. State the Limitations of LP.
LP treats all functional relations as linear

LP does not take into account the effect of time and uncertainty
No guarantee for integer solution. Rounding off may not feasible or optimal
solution.
Deals with single objective, while in real life the situation may be difficult.
23. What do you understand by redundant constraints?

In a given LPP any constraint does not affect the feasible region or solution
space then the constraint is said to be a redundant constraint.
24. Define Unbounded solution?
If the feasible solution region does not have a bounded area the maximum
value of Z occurs at infinity. Hence the LPP is said to have unbounded solution.
25. Define Multiple Optimal solution?
A LPP having more than one optimal solution is said to have alternative or
multiple optimal solutions.
26. What is slack variable?
If the constraint as general LPP be <= type then a non negative variable is
introduced to convert the inequalities into equalities are called slack variables. The
values of these variables are interpretedas the amount of unused resources.
27. What are surplus variables?
If the constraint as general LPP be >= type then a non negative
is introduced to convert the inequalities into equalities are called the surplus
variables.
28. Define Basic solution?
Given a system of m linear equations with n variables(m<n).The solution
obtained by setting (n-m) variables equal to zero and solving for the remaining m
variables is called a basic solution.
29. Define non Degenerate Basic feasible solution?
The basic solution is said to be a non degenerate basic solution if None of the
basic variables is zero.
30. Define degenerate basic solution?
A basic solution is said to be a degenerate basic solution if one or more of the
basic variables are zero.
31. What is the function of minimum ratio?
To determine the basic variable to leave

To determine the maximum increase in basic variable
To maintain the feasibility of following solution
32. From the optimum simplex table how do you identify that LPP has
unbounded solution?
To find the leaving variables the ratio is computed. The ratio is <=0
there is an unbounded solution to the given LPP.
then
33. From the optimum simplex table how do you identify that the LPP has no
solution?
If atleast one artificial variable appears in the basis at zero level with a +ve
value in the Xb column and the optimality condition is satisfied
then the original problem has no feasible solution.
34. How do you identify that LPP has no solution in a two phase method?
If all Zj Cj 0 & then atleast one artificial variable appears in the optimum
basis at non zero level the LPP does not possess any solution.
35. What do you understand by degeneracy?
The concept of obtaining a degenerate basic feasible solution in LPP is known
as degeneracy. This may occur in the initial stage when atleast one basic variable is
zero in the initial basic feasible solution.
36. Write the standard form of LPP in the matrix notation?
In matrix notation the canonical form of LPP can be expressed as
Maximize Z = CX(obj fn.)
Sub to AX <= b(constraints) and X >= 0 (non negative restrictions)
Where C = (C1,C2,..Cn),
A=
a11 a12 .. a1n

a21 a22.. a2n
X = x1
,
x2
b = b1
,
b2
am1 am2. amn
xn
bn
37. Define basic variable and non-basic variable in linear programming.
A basic solution to the set of constraints is a solution obtained by setting any n

variables equal to zero and solving for remaining m variables not equal to zero. Such
m variables are called basic variables and remaining n zero variables are called nonbasic variables.
38.Solve the following LP problem by graphical method.
Maximize z =6x1 +4x2 Subject tot the constraints:
x1 + x2 5
x2 8
x1 ,x2 0
39. Define unrestricted variable and artificial variable.
Unrestricted Variable :A variable is unrestricted if it is allowed to take on

positive, negative or zero values
Artificial variable :One type of variable introduced in a linear program model
in order to find an initial basic feasible solution; an artificial variable is used for
equality constraints and for greater-than or equal inequality constraints
PART B
UNIT I
16 MARKS
1. A firm has available 240,370 and 180 Kgs of wood, plastic and steel respectively.
The firm produces two products A and B. Each until of A require 1, 3 and 3 kg of
wood, plastic and steel respectively. The corresponding requirement for each unit of B
are 3,4,1respectively. If A sells for Rs. 4 and B for Rs. 6. Determine how many units
of A and B are should be produced in order to obtain the maximum gross income. Use
the simplex method.
2. A firm plans to purchase atleast 200 quindals of scrap containing high quality metal
X and low quality metal Y. It decides that the scrap to be purchased must contain
atleast 100 quintals of X metal and has no more than 35 quintals of Y metal. The firm
can purchase the scrap from two suppliers ( A and B) in unlimited quantities. The
percentage of x and Y metals interms of weight in the scrap supplied by A and B is
given below:
Metals Supplier A Supplier B
X
25%
75%
10%
20%
The price of As scrap is Rs. 200 per quintal and that of Bs Rs. 400 per quintal.
Determine the quantities that it should buy from the two suppliers so that total
cost is
minimized. (Use graphical method)
3. Use graphical method to Maximize Z = 6x1 + 4x2 Subject to
-2x1 + x2 2
x1 x2 2
3x1 + 2x2 9
x1, x2 0
4. Using Artificial variable technique to solve the following LP problems.
(i) Min Z = 2x13x2+6 x3
subject to 3x1 4x2 - 6x3 2
2 x1 + x2 + 2x3 11
x1 + 3 x2 - 2x3 5
x1, x2, x3 0
(ii) Max Z = x1 + 2x2 + 3x3 x4
subject to x1 + 2x2 + 3x3 = 15
2x1 + x2 + 5x3 = 20
x1 + 2x2 + x3 + x4 = 10
x1, x2, x3, x4 0
5. Solve the following linear programming problems (i) using the simplex method (ii)
Using Graphical method
Maximize z = 5x1 + 7x2 subject to
4x1 + 7x2 240
4x1 + 6x2 300
2x1 +3x2 0
x1, x2 0
6. Show that the following LPP has a feasible solution but no finite optimal solution
of Maximizes z = 3x1 + 3x2 subject to
x1 - x2 1
x1 + x2 3
x1, x2 0
7. Use simplex method to solve the LPP Maximizes z = 4 x1 + 10x2 subject to
2x1 + x2 50
2x1 + 5x2 100
2x1 + 3x2 90
x1, x2 0
8. Find the non-negative values of x1, x2 and x3 which maximize z = 3 x1+2 x2+5x3
subject to
x1 + 4x2 420
3x1 + 2x2 460
x1 + 2x2 + x3 430
x1, x2, x3 0
9. Solve the following Maximize 15x1 + 6x2 + 9x3 + 2x4 subject to
2x1 + x2 + 5x3 + 6x4 20
3x1 + x2+ 3x3 + 25x4 24
7x3 + x4 70
x1, x2, x3, x4 0
10. Use simplex method to Min Z = x2 3x3 + 2x3 subject to
3x2 x3 + 2x5 7
-2x2 + 4x3 12
-4x2 +3x3 + 8x5 10
and x2, x3, x5 0

11. (i) State and explain the general linear programming problem and define
(a) feasible solution and (b) basic feasible solution
(ii) Describe simplex method of solving linear programming problem
UNIT-II
1. Define transportation problem.
It is a special type of linear programming model in which the goods are
shipped from various origins to different destinations. The objective is to find the best
possible allocation of goods from various origins to different destinations such that the
total transportation cost is minimum.
2. Define the following: Feasible solution
A set of non-negative decision values xij (i=1,2,.m; j=1,2n) satisfies the
constraint equations is called a feasible solution.
3. Define the following: basic feasible solution
A basic feasible solution is said to be basic if the number of positive
allocations are m+n-1.( m-origin and n-destination).If the number of allocations are
less than (m+n-1) it is called degenerate basic feasible solution.
4. Define optimal solution in transportation problem
A feasible solution is said to be optimal, if it minimizes the total transportation
cost.
5. What are the methods used in transportation problem to obtain the initial
basic feasible solution.
North-west corner rule

Lowest cost entry method or matrix minima method
Vogels approximation method
6. Write down the basic steps involved in solving a transportation problem.
To find the initial basic feasible solution

To find an optimal solution by making successive improvements from the
initial basic feasible solution.
7. What do you understand by degeneracy in a transportation problem?

If the number of occupied cells in a m x n transportation problem is less than
( m+n-1) then the problem is said to be degenerate.

8. What is balanced transportation problem& unbalanced transportation
problem?
When the sum of supply is equal to demands, then the problem is said to be
balanced transportation problem.
A transportation problem is said to be unbalanced if the total supply is not
equal to the total demand.
9. How do you convert an unbalanced transportation problem into a balanced
one?
The unbalanced transportation problem is converted into a balanced one by
adding a dummy row (source) or dummy column (destination) whichever is necessary.
The unit transportation cost of the dummy row/ column elements are assigned to zero.
Then the problem is solved by the usual procedure.
10. Explain how the profit maximization transportation problem can be
converted to an equivalent cost minimization transportation problem.
If the objective is to maximize the profit or maximize the expected sales we
have to convert these problems by multiplying all cell entries by -1.Now the
maximization problem becomes a minimization and it can be solved by the usual
algorithm
11. Determine basic feasible solution to the following transportation problem
using least cost method.
A
SUPPLY
50
20
Demand
20
40
30
10
30
12. Define transshipment problems?

A problem in which available commodity frequently moves from one source to
another source or destination before reaching its actual destination is called
transshipment problems.
13 What is the difference between Transportation problem & Transshipment
Problem?
In a transportation problem there are no intermediate shipping points while in

transshipment problem there are intermediate shipping points
14. What is assignment problem?
An assignment problem is a particular case of a transportation problem in
which a number of operations are assigned to an equal number of operators where
each operator performs only one operation, the overall objective is to maximize the
total profit or minimize the overall cost of the given assignment.
15. Explain the difference between transportation and assignment problems?
Transportation problems
1)
supply at any source may be a
Supply at any source will
any positive quantity.

2)
be 1.
Demand at any destination may

be a positive quantity.
3)
Assignment problems
Demand at any destination

will be 1.
One or more source to any number
One source one destination.
of destination.
16. Define unbounded assignment problem and describe the steps involved in
solving it?
If the no. of rows is not equal to the no. of column in the given cost matrix the
problem is said to be unbalanced. It is converted to a balanced one by adding dummy
row or dummy column with zero cost.
17. Explain how a maximization problem is solved using assignment model?
The maximization problems are converted to a minimization one of the
following method.
(i)
(ii)
Since max z = min(-z)

Subtract all the cost elements all of the cost matrix from
theHighest cost element in that cost matrix.
18. What do you understand by restricted assignment? Explain how you should
overcome it?
The assignment technique, it may not be possible to assign a particular task to a
particular facility due to technical difficulties or other restrictions. This can be
overcome by assigning a very high processing time or cost (it can be ) to the
corresponding cell.
19. How do you identify alternative solution in assignment problem?

Sometimes a final cost matrix contains more than required number of zeroes at
the independent position. This implies that there is more than one optimal solution
with some optimum assignment cost.
20. What is a travelling salesman problem?
A salesman normally must visit a number of cities starting from his head
quarters. The distance between every pair of cities are assumed to be known. The
problem of finding the shortest distance if the salesman starts from his head quarters
and passes through each city exactly once and returns to the headquarters is called
Traveling Salesman problem.
21. Define route condition?
The salesman starts from his headquarters and passes through each city exactly
once.
22. Give the areas of operations of assignment problems?
Assigning jobs to machines.
Allocating men to jobs/machines.
Route scheduling for a traveling salesman.
23. How do you convert the unbalanced assignment problem into a balanced
one?
Since the assignment is one to one basis , the problem have a square matrix. If
the given problem is not square matrix add a dummy row or dummy column and then
convert it into a balanced one (square matrix). Assign zero cost values for any dummy
row/column and solve it by usual assignment method.
UNIT II
IMPORTANT 16 MARK QUESTIONS
1. A company has three plants A, B, C and three warehouse X,Y,Z. The number if
units available at the plants is 60, 70, 80 and the demand at X, Y, Z are 50, 80, 80
respectively. The unit cost of transportation is given by the following table
X
8
3
Y
7
8
Z
3
9
11
B
C
2. Solve the transportation problems with transportation cost in rupees,
requirements and availability as given below.
Distribution centre
D1 D2 D3 D4
F1
10 15 12 12
200
F2
8 10 13 10
150
F3
11 12 13 10
120
140 120 80
220
3. A product is manufactured by four factories A, B, C and D. The unit

production costs in them are Rs. 2, Rs. 3, Rs. 1 and Rs. 5 respectively. Their
production capacities are 50, 70, 30 and 50 units respectively. These factories
supply the product to four stores, demands of which are 25, 35, 105 and 20 units
respectively. Unit transportation cost in rupees from each factory to each store in
given in the table below:
Stores
Factories
-
3 4
10
7 5
13
11
12
3
Determine the extent of deliveries from each of the factories to each of the stores so
that the total production and transportation cost in minimum.
4. Solve the assignment problem for maximizes for the profit matrix
PQRS
A
51 53 54
50
47 50 48 50
49 50 60 61
63 64 60 60
5. Solve the following assignment problem

ABCDE
M1
4 6 10 5 6
M2
7 4 - 5 4
M3
- 6 9 6 2
M4
9 3 7 2 3
6. A city corporation has decided to carry out road repairs on main four arteries of the
city. The government has agreed to make a special grant of Rs. 50 lakh towards the
costwith a condition that the repairs be done at the lowest cost and quickest time. If
the conditions warrant than a supplementary token grant will also be considered
favourably. The corporation has floated tenders and five contractors have sent in their
bids. In order to expedite work. One road will be awarded to only one contractor. Cost
of Repairs (Rs. Lakh)
Contractors/Road
- R1 R2 R3 R4
C1 9 14 19 15
C2 7 17 20 19
C3 9 18 21 18
C4 10 12 18 19
C5 10 15 21 16
(i) Find the best way of assigning the repair work to the contractors and the costs.
(ii) Which if the five contractors will be unsuccessful in his bid?
7. Travelling salesman has to visit 5 cities. He wishes to start from a particular city,
visit each city once and then returns to his starting point. The traveling cost from each
city from a particular point is given below.
ABCDE
A
- 4 6 3 4
4 - 5 3 4
7 6 - 7 5
4 4 5 7 -
3 7 - 7
8. Determine the basic feasible solution to the following transportation problem

Using North West Corner Rule:
Sink
Origin
A B C D E Supply
P
2 11 10 3 7 4
1 4
3 9 4 8 12 9
7 2 1 8
Demand 3 3 4 5 6
9. Solve the transportation problem with unit transportation costs, demands and
supplies
as given below:
Destination
source
D1 D2 D3 D4 Supply
S1 6 1 9
3 70
S2 11 5 2 8 55
S3 10 12 4 7 70
Demand 85 35 50 45
10. Solve the following transportation problem to maximize profit

Profit (Rs) / Unit
Destination
source
A B C D Supply
1
40 25 22 33 100
44 35 30 30 30
38 38 28 30 70
Demand 40 20 60 30
11. Explain the concept of degeneracy in transportation problems. Obtain an optimum
basic feasible solution to the following transportation problem
To
From
A B C Supply
F1
7342
F2
2133
F3
3463
Demand 4 1 3 8
12. An automobile dealer is faced with the problem of determining the minimum cost
policy for supplying dealers with the desired number of automobiles. The relevant
data are given below. Obtain the minimum total cost of transportation
Dealers Plant
Supply
1.2 1.7 1.6 1.8 2.4 300
1.8 1.5 2.2 1.2 1.6
400
1.5 1.4 1.2 1.5 1.0
100
Requirements 100 50 300 150 200 .The cost unit is in 100 rupees.
UNIT-III
1. Define Integer Programming Problem (IPP)?
A linear programming problem in which some or all of the variables in the optimal
solution are restricted to assume non-negative integer values is called an Integer
Programming Problem (IPP) or Integer Linear Programming
2. Explain the importance of Integer programming problem?
In LPP the values for the variables are real in the optimal solution. However in
certain problems this assumption is unrealistic. For example if a problem has a
solution of 81/2 cars to be produced in a manufacturing company is meaningless.
These types of problems require integer values for the decision variables. Therefore
IPP is necessary to round off the fractional values.
3. List out some of the applications of IPP?
IPP occur quite frequently in business and industry.

All transportation, assignment and traveling salesman problems are IPP, since
the decision variables are either Zero or one.
All sequencing and routing decisions are IPP as it requires the integer values of
the decision variables.
Capital budgeting and production scheduling problem are PP. In fact, any
situation involving decisions of the type either to do a job or not to do can be
treated as an IPP.
All allocation problems involving the allocation of goods, men, machines, give
rise to IPP since such commodities can be assigned only integer and not
fractional values.
4. List the various types of integer programming?

Mixed IPP
Pure IPP
5. What is pure IPP?
In a linear programming problem, if all the variables in the optimal solution are
restricted to assume non-negative integer values, then it is called the pure (all) IPP.
6. What is Mixed IPP?
In a linear programming problem, if only some of the variables in the optimal
solution are restricted to assume non-negative integer values, while the remaining
variables are free to take any non-negative values, then it is called A Mixed IPP.
7. What is Zero-one problem?

If all the variables in the optimum solution are allowed to take values either 0
or 1 as in do or not to do type decisions, then the problem is called Zero-one
problem or standard discrete programming problem.
8. What is the difference between Pure integer programming & mixed integer
integer programming.
When an optimization problem, if all the decision variables are restricted to
take integer values, then it is referred as pure integer programming. If some of the
variables are allowed to take integer values, then it is referred as mixed integer integer
programming.
9. Explain the importance of Integer Programming?
In linear programming problem, all the decision variables allowed to take any
non-negative real values, as it is quite possible and appropriate to have fractional
values in many situations. However in many situations, especially in business and
industry, these decision variables make sense only if they have integer values in the
optimal solution. Hence a new procedure has been developed in this direction for the
case of LPP subjected to additional restriction that the decision variables must have
integer values.
10. Why not round off the optimum values in stead of resorting to IP?
There is no guarantee that the integer valued solution (obtained by simplex
method) will satisfy the constraints. i.e. ., it may not satisfy one or more constraints
and as such the new solution may not feasible. So there is a need for developing a
systematic and efficient algorithm for obtaining the exact optimum integer solution to
an IPP.
11. What are methods for IPP? (MAY 08)
Integer programming can be categorized as
(i) Cutting methods
(ii) Search Methods.
12. What is cutting method?
A systematic procedure for solving pure IPP was first developed by
R.E.Gomory in 1958. Later on, he extended the procedure to solve mixed IPP, named
as cutting plane algorithm, the method consists in first solving the IPP as ordinary
LPP.By ignoring the integrity restriction and then introducing additional constraints
one after the other to cut certain part of the solution space until an integral solution is
obtained.
13. What is search method?
It is an enumeration method in which all feasible integer points are enumerated.

The widely used search method is the Branch and Bound Technique. It also starts with
the continuous optimum, but systematically partitions the solution space into sub
problems that eliminate parts that contain no feasible integer solution. It was
originally developed by A.H.Land and A.G.Doig.
14. Explain the concept of Branch and Bound Technique?
The widely used search method is the Branch and Bound Technique. It starts
with the continuous optimum, but systematically partitions the solution space into sub
problems that eliminate parts that contain no feasible integer solution. It was
originally developed by A.H.Land and A.G.Doig.
15. Give the general format of IPP?
The general IPP is given by
Maximize Z = CX
Subject to the constraints
AX b,
X 0
and some or all variables are integer.
16. Write an algorithm for Gomorys Fractional Cut algorithm?

1. Convert the minimization IPP into an equivalent maximization IPP and all the
coefficients and constraints should be integers.
2. Find the optimum solution of the resulting maximization LPP by using simplex
method.
3. Test the integrity of the optimum solution.
4. Rewrite each XBi
5. Express each of the negative fractions if any, in the kth row of the optimum simplex
table as the sum of a negative integer and a non-negative fraction.
6. Find the fractional cut constraint
7. Add the fractional cut constraint at the bottom of optimum simplex table obtained
in
step 2.
8. Go to step 3 and repeat the procedure until an optimum integer solution is obtained.
17. What is the purpose of Fractional cut constraints?
In the cutting plane method, the fractional cut constraints cut the unuseful area
of the feasible region in the graphical solution of the problem. i.e. cut that area which
has no integer-valued feasible solution. Thus these constraints eliminate all the nonintegral solutions without loosing any integer-valued solution.
18.A manufacturer of baby dolls makes two types of dolls, doll X and doll Y.
Processing of these dolls is done on two machines A and B. Doll X requires 2
hours on machine A and 6 hours on Machine B. Doll Y requires 5 hours on

machine A and 5 hours on Machine B. There are 16 hours of time per day
available on machine A and 30 hours on machine B. The profit is gained on both
the dolls is same. Format this as IPP?
Let the manufacturer decide to manufacture x1 the number of doll X and x2
number of doll Y so as to maximize the profit. The complete formulation of the IPP is
given by
Maximize
Z = x1+x2
Subject to
2 x1 + 5 x2 16
6 x1+ 5 x2 30
and 0 and are integers.
19. Explain Gomorys Mixed Integer Method?
The problem is first solved by continuous LPP by ignoring the integrity
condition. If the values of the integer constrained variables are integers, then the
current solution is an optimal solution to the given mixed IPP. Else select the source
row which corresponds to the largest fractional part among these basic variables
which are constrained to be integers. Then construct the Gomarian constraint from the
source row. Add this secondary constraint at the bottom of the optimum simplex table
and use dual simplex method to obtain the new feasible optimal solution. Repeat this
procedure until the values of the integer restricted variables are integers in the
optimum solution obtained.
20. What is the geometrical meaning of portioned or branched the original
problem?
Geometrically it means that the branching process eliminates portion of the
feasible region that contains no feasible-integer solution. Each of the sub-problems
solved separately as a LPP.
21. What is standard discrete programming problem?
If all the variables in the optimum solution are allowed to take values either 0
or 1 as in do or not to do type decisions, then the problem is called standard
discrete programming problem.
22. What is the disadvantage of branched or portioned method?
It requires the optimum solution of each sub problem. In large problems this
could be very tedious job.
23. How can you improve the efficiency of portioned method?
The computational efficiency of portioned method is increased by using the

concept of bounding. By this concept whenever the continuous optimum solution of a
sub problem yields a value of the objective function lower than that of the best
available integer solution it is useless to explore the problem any further
consideration. Thus once a feasible integer solution is obtained, its associative
objective function can be taken as a lower bound to delete inferior sub-problems.
Hence efficiency of a branch and bound method depends upon how soon the
successive sub-problems are fathomed.
UNIT III
16 MARKS
1. Write a Brief Note on Cutting Plane Method
2. Describe Gomorys Entire Integer Programming Problem Method and Its
Algorithm.
3. Describe Any One of the Method of Solving Mixed Integer Programming Problem.
4. Explain The Importance Of Integer Programming Problems And Their
Applications.
5. Explain Branch And Bound Method In Integer Programming Problem.
6. Write Down The Branch And Bound Algorithm For Solving A Mixed Integer
Programming Problem.
7. Using Gomorys Cutting Plane Method Maximize Z = 2x1 + 2x2 Subject To
5x1 +4 x2 8
2 x1 + 4 x2 8
x1, x2 0 and are all Integers.
8. Solve The Following Integer Mixed Integer Programming Problem Maximize
Z = x1 + x2 subject to
2 x1 +5 x2 16
6 x1 + 5 x2 30
x2 0, x1 , non-Negative Integer, and are all Integers.
9. Use Branch and Bound Method to solve the following Maximize Z = x1 + 4x2
subject to
2 x1 +4 x2 7
5 x1 + 3 x2 15
x1, x2 0and are all integers.
10. Solve the following Integer Mixed Integer Programming Problem by
Gomorys
Cutting Plane Method Maximize z = x1 + x2 subject to
3 x1 +2 x2 5
x2 2
x1, x2 0 and x1 an integers.
UNIT-IV
1. What do you mean by project?
A project is defined as a combination on inter related activities with limited
resources namely men, machines materials, money and time all of which must be
executed in a defined order for its completion.
2. What are the three main phases of project?
Planning, Scheduling and Control
3. What are the two basic planning and controlling techniques in a network
analysis?
Critical Path Method (CPM)

Programme Evaluation and Review Technique (PERT)
4. What are the advantages of CPM and PERT techniques?
It encourages a logical discipline in planning, scheduling and control of

projects
It helps to effect considerable reduction of project times and the cost
It helps better utilization of resources like men,machines,materials and money
with reference to time
It measures the effect of delays on the project and procedural changes on the
overall schedule.
5. What is the difference CPM and PERT

CPM
Network is built on the basis of activity

Deterministic nature
One time estimation
PERT
An event oriented network

Probabilistic nature
Three time estimation
6. What is network?
A network is a graphical representation of a projects operation and is
composed of all the events and activities in sequence along with their inter
relationship and inter dependencies.
7. What is Event in a network diagram?
An event is specific instant of time which marks the starts and end of an
activity. It neither consumes time nor resources. It is represented by a circle.
8. Define activity?
A project consists of a number of job operations which are called activities. It
is the element of the project and it may be a process, material handling, procurement
cycle etc.
9. Define Critical Activities?
In a Network diagram critical activities are those whose if consumer more than
estimated time the project will be delayed.
10. Define non critical activities?
Activities which have a provision such that the event if they consume a
specified time over and above the estimated time the project will not be delayed are
termed as non critical activities.
11. Define Dummy Activities?
When two activities start at a same time, the head event are joined by a dotted
arrow known as dummy activity which may be critical or non critical.
12. Define duration?
It is the estimated or the actual time required to complete a trade or an activity.
13. Define total project time?
It is time taken to complete to complete a project and just found from the
sequence of critical activities. In other words it is the duration of the critical path.
14. Define Critical Path?
It is the sequence of activities which decides the total project duration. It is
formed by critical activities and consumes maximum resources and time.
15. Define float or slack?
Slack is with respect to an event and float is with respect to an activity. In other
words, slack is used with PERT and float with CPM. Float or slack means extra time
over and above its duration which a non-critical activity can consume without
delaying the project.
16. Define total float?
The total float for an activity is given by the total time which is available for
performance of the activity, minus the duration of the activity. The total time is
available for execution of the activity is given by the latest finish time of an activity
minus the earliest start time for the activity. Thus
Total float = Latest start time earliest start time.
17. Define free float?
This is that part of the total float which does not affect the subsequent
activities. This is the float which is obtained when all the activities are started at the
earliest.
18. Define Independent float?
If all the preceding activities are completed at their latest, in some cases, no
float available for the subsequent activities which may therefore become critical.
Independent float = free tail slack.
19. Define Interfering float?
Sometimes float of an activity if utilized wholly or in part, may influence the
starting time of the succeeding activities is known as interfering float.
Interfering float = latest event time of the head - earliest event time of
event.
the
20. Define Optimistic?

Optimistic time estimate is the duration of any activity when everything goes
on very well during the project.
21. Define Pessimistic?

Pessimistic time estimate is the duration of any activity when almost
everything goes against our will and a lot of difficulties is faced while doing a project.
22. Define most likely time estimation?
Most likely time estimate is the duration of any activity when sometimes thing
go on very well, sometimes things go on very bad while doing the project.
24. What is a parallel critical path?
When critical activities are crashed and the duration is reduced other paths may
also become critical such critical paths are called parallel critical path.
25. What is standard deviation and variance in PERT network?
The expected time of an activity in actual execution is not completely reliable
and is likely to vary. If the variability is known we can measure the reliability of the
expected time as determined from three estimates. The measure of the variability of
possible activity time is given by standard deviation, their probability distribution
Variance of the activity is the square of the standard deviation
26. Give the difference between direct cost and indirect cost?
Direct cost is directly depending upon the amount of resources involved in the
execution of all activities of the project. Increase in direct cost will decrease in project
duration. Indirect cost is associated with general and administrative expenses,
insurance cost, taxes etc. Increase in indirect cost will increase in project duration.
UNIT IV
16 MARKS
1. A particular item has a demand of 9,000 units / year. The cost of one
procuirement is Rs. 100 and the holding cost per unit is Rs. 2.40 per year. The
replacement is instantaneous and no shortages allowed. Determine
(i) the economic lot size
(ii) the number of orders per year
(iii) the time between orders
(iv) the total cost per year if the cost of one unit Rs. 1
2. A manufacturer has to supply 12,000 units of a product per year to his

customer.
The demand is fixes and known and the shortage cost is assumed to be infinite.
The
inventory holding cost is Rs. 0.20 per unit per month and the setup cost per run
is Rs.
350. Determine
(i) the optimum run size
(ii) optimum scheduling period
(iii) minimum total expected yearly cost.
3. An item is produced at the rate of 50 items per day. The demand occurs at the
rate
of 25 items per day. If a setup cost is assumed to be infinite. The inventory holding
cost is Rs. 0.01 per unit of item per day, find the economic lot size for one run,
assuming that shortages are not permitted. Also find the time of cycle and minimum
total cost for one run.
4. A commodity is to be supplied at the constant rate of 200 units per day supplies of
any amount can be had at any required time but each ordering costs Rs. 50. Cost of
holding the commodity in inventory Rs. 2 per unit per day while the delay in the
supply of the item induces a penalty of Rs.10 per unit per delay of 1 day. Find the
optimal policy (q, t) where t is the reorder cycle period and q is the inventory level
after reorder. What would be the best policy if the penalty cost becomes infinity?
5. The average demand for an item is 120 units / year, the lead time is 1 month and
the demand during lead time follows normal distribution with average of 10 units and
standard deviation of 2 units. If the item is ordered once in 4 months and the policy of
the company is that there should not be more than 1 stock out every two years,
determine the reorder level.
6. A project schedule has the following characteristics:
Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 6-8 7-8 8-10 9-10
Time 4 1 1 1 6 5 4 8 1 2 5 7
Construct PERT networks and find the critical path.
7. Draw the network and determine the critical path for the given data:
Jobs 1-2 1-3 2-4 3-4 3-5 4-5 4-6 5-6

Duration 6 5 10 3 4 6 2 9
Find the total float, Free float and Independent Float of each activity.
8. (i) Explain the three rime estimates used in PERT
(ii) What are the main assumptions under in PERT computations
(iii) Distinguish between PERT and CPM
9. Explain PERT procedure to determine (a) the expected critical path (b) expected
variance of the project length and (c) the probability of completing the project with in a
specified time.
10. Determine the least cost schedule for the following project. Overhead cist is
Rs. 60
per day.
Activity Normal duration Crash duration Cost of crashing / Day
(days) (days) (Rs.)
1-2 5 3 30
2-3 4 2 20
3-4 6 3 40
3-5 4 1 30
4-5 3 2 60
11. A project has the following activities and other characteristics:
Estimated Duration (in weeks)
Activity(i-j) Optimistic Most likely Pessimistic
1-2 1 1 7
1-3 1 4 7
1-4 2 2 8
2-5 1 1 1
3-5 2 5 14
4-6 2 5 8
5-6 3 6 15
(i) What is the expected project length
(ii) What is the probability that the project will be completed no more than 4
weeks later than the expected time?
12. (i) Write the rules of drawing network and define critical activities.
(ii) A project has the following details
Activity 1-2 1-3 2-6 3-4 3-5 3-6 4-5 5-6 5-7 6-7
Expected
Duration
8 6.83 9 4 8.17 13.5 4.17 5.17 9 4.5
Variance 1/9 1/4 1 0 1/4 9/4 1/4 14 4/9 25/26
What should be the scheduled completion time for the probability of completion of
project to be 90%.
13. Listed in the table are the activities and sequencing requirements necessary
for the completion of research report.
Activity: A B C D E F G H I J K L M
Duration(Weeks) 4 2 1 12 14 2 3 2 4 3 4 2 2
Immediate
Predecessors:
E A B K - E F F F I,L C,G,H D I,L
(i) Find the critical path
(ii) Find the total float and the free float for each non-critical activity.
UNIT-V
1. Define Kendals notation for representing queuing models.

A queuing model is specified and represented symbolically in the form
(a/b/c): (d/e)
Where a- inter arrival time
b-service mechanism
c-number of service
d-the capacity of the system
e-the queue discipline
2. In a super market, the average arrival rate of customer is 5 in every 30
minutes following Poisson process. The average time is taken by the cashier to
list and calculate the customers purchase is 4.5 minutes; following exponential
distribution. What is the probability that the queue length exceeds 5?
Arrival rate= 5/30 min
Service rate=2/9min
Probability that the queue length exceeds 5 = () n+2
= (.75) 7=0.133
3. Explain Queue discipline and its various forms.
(i) FIFO or FCFS -
First In First Out or First Come First Served.
(ii) LIFO or LCFS -
Last In First Out or Last Come First Served.
(iii) SIRO
Selection for service in random order.
(iv) PIR
Priority in selection
4. Distinguish between transient and steady state queuing system.

A system is said to be in transient state when its operating characteristics are
dependent on time. A steady state system is one in which the behavior of the system is
independent of time.
5. Define steady state?
A system is said to be in steady state when the behavior of the system independent of
time. Let pn(t) denote the prob that there are n units in the system at time t. then in
t
steady state=> lim pn'( t )=0
6. Write down the little formula?

Ls=Lq+/
Where Ls= the average no. of customers in the system
Lq= the average no. of customers in the queue
7. If traffic intensity of M/M/I system is given to be 0.76, what percent of time the
system would be idle?
Traffic intensity = 0.76 (busy time)
System to be idle = 1-0.76 =0.24
8. What are the basic elements of queuing system?
System consists of the arrival of customers, waiting in queue, pick up for
service according to certain discipline, actual service and departure of customer.
9. What is meant by queue discipline?
The manner in which service is provided or a customer is selected for service is
defined as the queue discipline.
10. What are the classifications of queuing models?
m | m | I |
m | m | I |n
m | m | c|
m | m | c |n
11. What are the characteristic of queuing process?

Arrival pattern of customers, service pattern of servers, queue discipline,
system capacity, no. of service channels, no. of service stage.
12. Define Poisson process?
The Poisson process is a continuous parameter discrete state process (ie) a good
model for many practical situations. if X(t)represents the no. of Occurrences of a
certain in (0, t) then the discrete random process {X (t)} is called the Poisson process.
if it satisfies the following postulates
I.
P[1 occurrence in (t,t+t)] =t + O(t)
II.
P[0 occurrence in (t,t+t)] =1-t + O(t)
III.
P[2 or more occurrence in (t,t+t)] =O(t)
IV.
X(t) is independent of the number of occurrences of the
event in any interval prior (or) after the interval(0,t)
V.
The prob that the event occurs a specified number of times
in (t 0, t 0+t) depends only on t but not on t 0.
13. Given any two examples of Poisson process?
1. The number of incoming telephone calls received in a particular time

2. The arrival of customer at a bank in a day
14. What are the properties of Poisson process?
1.
The Poisson process is a markov process.
2.
Sum of two independent poissen processes is a poisson process.
3.
Difference of two independent poisson processes is not poisson process.
4.
The inter arrival time of a poisson process has an exponential distribution with
mean 1/.
15. Customer arrives at a one-man barber shop according to a Poisson process

with an mean inter arrival time of 12 minutes. Customers spend a average of 10
minutes in the barbers chain.What is the expected no of customers in the
barber shop and in the queue?
Given mean arrival rate 1/ = 12.
Therefore = 1/12 per minute.
Mean service rate 1/ = 10.
Therefore = 1/10 per minute.
Expected number of customers in the system
Ls = /-
= 1/12/1/10-1/12 = 5 customers.
16. Define pure birth process?
If the death rates k = 0 for all k = 1, 2 we have a pure birth process.
17. Write down the postulates of birth and death process?
1) p [1 birth (t, t + t)] = n(t)t + 0(t)
2) p [0 birth in (t, t + t)] = 1 - n(t)t + 0(t).
3) p [1 death in (t, t + t)] = n(t)t + 0(t)
4) p [0 death in (t, t + t)] = 1 - n(t)t + 0(t).
18. What is the formula for the problem for a customer to wait in the queue
under
(m/m/1 N/FCFS)
Ws = Ls/.
19. What is the average number of customers in the system under
/FCFS)?
(m/m/e:
(/)c / (c-1)!(c - )2 + /.
20. What is the difference between probabilistic deterministic and mixed models?
Probabilistic: When there is uncertainty in both arrivals rate and service rate are
assumed to be random variables.
Deterministic: Both arrival rate and service rate are constants.
Mixed: When either the arrival rate or the service rate is exactly known and the other
is not known.
21. What are the assumptions in m/m/1 model?
(i)
(ii)
(iii)
(iv)
Exponential distribution of inter arrival times or poisson distribution

of arrival rate.
Queue discipline is first come, first serve.
Single waiting line with no restriction no length of queue.
Single server with exponential distribution of service times.
22. People arrive at a theatre ticket booth in poisson distributed arrival rate of
25/hour. Service time is constant at 2 minutes. Calculate the mean?
= 25/hr
= ()60 = 30 per hour.
= / = 25/30 = 5/6 = 0.833

Lq = 2 / 1- = (.833)2 / 1 - .833
= 4.15502
Mean waiting time=Lq/ = 4/25 = 4/25 * 60 = 9.6 minutes.

UNIT V
16 MARKS
1. A bank has two tellers working on savings account. The first teller handles
withdrawalonly. The second teller handles deposits only. It has been found the service
time distributions for both deposits and withdrawals are exponential with mean
service time of 3 minutes and 4 seconds per customer. Depositors are found to arrive
in a passion fashion throughput the day with mean arrival rate of 16 per hour.
Withdrawers also arrive in a passion fashion with mean arrival rate of 14 per hour.
What would be the effect on the average waiting time for the customers if each teller
could handle both withdrawals and deposits?
2. In heavy machine shop, the overhead crane is 75% utilized. Time study
observations gave the average slinging time as 10.5 minutes with a standard deviation
of 8.8 minutes.What is the average calling rate for the services of the crane and what
is the average delay is getting service? If the average service time is cut to 8.0
minutes, with a standarddeviation of 6.0 minutes, how much reduction will occur, on
average, in the delay of getting served?
3. Explain the model (M/M/S): ( / FIFO) (i.e) multiple server with infinite capscity.
Derive the average number of customers in the queue (i.e average queue length: L )
4. Automatic car wash facility operates with only one bay. Cars arrive according to a
Possion distribution, with a mean of 4 cars per hour and may in the facilitys parking
lotif the bay is busy. If the service time for all cars is constant and equal to 10 minutes
determine Ls, Lf , Ws and Wf
4. A two-person barber shop has 5 chairs to accommodate waiting customers.
Potential customers who arrive when all chairs are full, leaving without entering
barber shop. Customers arrive at the average rate of 4 per hour and spend an average
of 12 minutes in the barbers chair. Compute 0, 7 and average number of customers
in the queue. 6. In a super market, the average arrival rate of customer is 10 in every
30 minutesfollowing passion process. The average time taken by the cashier to list and
calculate thecustomers purchases is 2.5 minutes, following exponential distribution.
What is theprobability that the queue length exceeds 6? What is the expected time
spent by a customer in the system?
5. People arrive at a Theatre ticket booth in Possion distributed arrival rate of 25 per
hour.Service time is constant at 2 minutes. Calculate
(a) The mean number in the waiting line.
(b) The mean waiting time
(c) The utilization factor
6. A petrol station has two pumps. The service time follows the exponential
distributionwith mean 4 minutes and car arrives for service in a Poisson process at the
rate of ten carsper hour. Find the probability that a customer has to wait for service.
What proportion oftime the pump remains idel?
7. A customer owning a Maruti car right now has got the option to switch over to
maruti. Ambassador or Fiat next time with the probability (0.20 0.5 and 0.30) given
the transition matrix
0.40 0.30 0.30
P = 0.20 0.50 0.30
0.25 0.25 0.50

Find the probabilities with his fourth purchase?
8. State and explain about the Pure Birth Process in detail.
(i) Write the steady-state equations for the model (M/M/C) : (FIFO/ / )
(ii) Obtain the expected waiting time of a customer in the queue of the above model.
(iii) In the above model = 10/ hr, = 3/ hr, C = 4, what is the probability that a
customer has to wait before he gets service.
9. (i) For the steady state queueing model (M/M/1) : (FCFS/), with usual notations
prove that pn = (/)n
po and P(n>=k) = (/)k
(ii) A super market has two girls serving at the counters. The customers arrive in a
Poisson fashion at the rate of 12 per hour. The service time for each customer is
exponential with mean 6 minutes. Find the probability that an arriving customer has to
wait for service.
10. (i) For the queueing model (M/M/S) ; (/FIFO), derive the formula for average
timeof a customer in the system.
(ii) Patients arrive at a clinic according to Poisson distribution at a rate of 60 patients
perhour. The waiting room does not accommodate more than 14 patients.
Investigation timeper patient is exponential with mean rate of 40 per hour.
(a) What is the probability that an arriving patient will not wait?
(b) What is the expected waiting time until a patient is discharged from the clinic?
11. (i) Write the steady state equations for the model (M/M/C)(FIFO//)
(ii) Obtain the expected waiting time of a customer in the queue of the above model.
(iii) In the above model =10/hour, =3/hour C=4, what is the probability that a
customer has to wait before he gets service?
12. Arrivals of a telephone booth are considered to be poisson with an average time of
10minutes between one arrival and the next. The length of phone call is assumed to be
distributed exponentially, with mean 3 minutes.

(i) What is the probability that a person arriving at the booth will have to wait?
(ii) The telephone department will install a second booth when convinced that an
arrival would expect waiting for atleast 3 minutes for a phone call. By how much
should
the flow of arrivals increase in order to justify a second booth?
(iii) What is the average length of the queue that form from time to time?
(iv) What is the probability that it will take him more than 10 minutes altogether to
wait for the phone and complete his call?
IMPORTANT TWO MARKS QUESTIONS AND ANSWERS
1. when does degenaracy happen in transportation problem?
In transportation problem with m orgins and n destinations, if a IBFS has less than
m+n-1 allocations, the problem is said to be a degenerate problem.
2.what is an unbalanced transportation problem?
*If the total availability from all origins is not equal to the total demand of all
destinations, then it is called unbalanced transportation problem. *The transportation
problem is balanced if the total availability is equal to total demand. *An IBFS can be
obtained only for balanced transportation problem.
3.What is an assignment problem?
Given n facilities and n jobs and given the effectiveness of each facility for each job,
the problem is to assign each facility to one and only job so as to optimize the given
measure of effectiveness.
4.What is an unbalanced assignment problem?
An assignment problem is an unbalanced problem if the number of jobs is not equal
to no.of facilities. The Hungarian method of solution requires a square matrix. Hence
fictitious facilities or jobs are added and assigned 0 costs to the corresponding cells of
the matrix. These cells are treated the same way as the real cost cells during the
solution procedure.
5.What is a trvelling salesman problem?
There are a no.of cities a salesman must visit.The distance(or time or cost)between
every pair of cities is known. He starts from his homecity, passes through each city
once and only ones and returns to his homecity. The problem is to find the routes
shortest in distance(or time or cost).
6.Define sequencing problem.
sequencing problem involves the determination of an optimal order or sequence of
performing a series of jobs by a no.of facilities/machines so as to optimize the total
time or cost.
7. What is 'No passing rule' in sequencing?
If each of the n jopbs are to be proceesed through 2 machines A and B in the order A
and B, then this rule means that each job will go to machine A 1st and then to
machine B.
8.What is total elapsed time?

It is the time between starting the 1st job and completing the last one.
9. Define Idle time on a machine in a sequencing problem.
It is the time the machine remains idle i.e. (without work) during the elapsed time is
the idle time.
10.What is network?
A Network is a symbolic representation of the essential characteristics of a
project. Network technique is a tool of project management. PERT and CPM are the
widely applied techniques.
11. Define event float in CPM.
The beginning and end points of an activity are called events or nodes.Event is a point
in time and does not consume any resources.It is represented by a circle.
12.What is meant by network constrution?
The project is split into activities.Start project and finish events of the project are then
decided. After deciding the precedence order, the activities are put in a logical
sequence by using the graphical notations.
13.What is meant by critical path?
The critical path of a network gives the shortest time in which the whole project can
be completed. It is the chain of activities with the longest time duration. Any delay in
any of the activities results in the delay of the completion of the project.
14.What is meant LPP?
Linear programming problem deals with the optimization (maximization or
minimization) of a function of decision variables subject to a set of constraints.

15,Define a slack variables.
Non-negative variables that are added to the left hand side of < = constraints to
convert them to equalities are called as slack variables.
16.Define a surplus variables.
Non-negative variables that are subtracted from the left hand side of > = constraints
to convert them to equalities are called surplus variables.
17.Define Basic feasible solution.
It is a Basic feasible solution that also satisfies the Non-negativity restrictions. All
variables in a Basic solution are > = 0.
18.Define O.R.
Operations Research is the application of scientific methods, techniques and tools to
operations of systems to obtain optimal solution to the problems,it provides a
quantitative technique to the managers for making better decisions for operations
under control.
19. What is an Iconic or physical model in O.R.?
This is a physical
or a pictorial representation of various aspects of a system.
Properties of the real system are represented by the properties themselves with a
change of scale. (e.g). Model of solar system, Scaled up model of a cell in biology.
20.Write applications of O.R.
*Prodution,blending,productmix.
*Inventory control, demand forecast,sale and purchase. *Transportation,repair and
maintanance,scheduling and sequencing.
*Planning,scheduling and controlling of
projects. *Optimal allocation of men,machines,materials,time and money. *Location

and size of warehouses,distributions centres,retail depots,etc. *Cash management so
that
all
sections
are
departments
receive
adequate
supply
of
funds.
21.Define objective function and constraints in LPP?

It is a function of decision variables whose value must be optimized (maximized
or minimized)
It is a set of simultaneous linear equations(or in equalities).
22.Define optimum basic feasible solution?

It is the basic feasible solution that also optimizes the objective function.
23.Define artificial variable?
Non-negative variables that are added to the constraints of(>=) or (=)type.The

purpose of introducing artificial variables is just to obtain an initial basic feasible
solution.
24.Define the term "ACTIVITY"in a network?
It is a physically identifible part of a project which requries time and resources
for execution.An activity is represented by an arrow,the tail of which represents that
start and the head,the finish of the activity.
25. Write down any four rules of network construction?
*Each activity is represented by one and only one arrow.
left to right.
*Time flows from
*Arrows should be straight and not curved.
*Arrows should
not cross each other where crossing cannot be avioded,bridging should be done.
26.What are the three phases in the scientific method of OR?
*Judgement phase,
*Research phase,
*Action phase
27.Write the expansion of PERT and CPM?
PERT:
Project evaluation and research technique.
CPM:
Critical path method.
28.Define a slack variable?how many slack variables would you using a LPP?
Non-negative variables that are added to the left hand side of >= constraints to convert
them to equalities are called as slack variables.
30.What is the relation between assignment and transportation problems?
The transportation problem deals with the transportation of a product manufactured at
different
plants
or
factories(supply
origins)to
number
of
different
warehouses(demand destinations).The objective is to satisfy the destination

requirement within the plant capacity at minimum transportation cost.
Given n facilities and n jobs and given the effectiveness of each facility for each
job,the problem is to assign each facility to one only job so as to optimize the given
measure of effectiveness.
Examples:products to factories
jobs to machines.
31.How do you convert an unbalanced assignment problem into a balanced

assingment problem?
If no.of rows>no.of columns,then add extra one column and set cost as (0),
If no.of columns>no.of rows,then add extra one row and set cost as (0),
then the
unbalanced assignment problem is converted into balanced assingnment problem.

32.State any two methods for finding initial basic feasible solution in a
transportation problem?
*Total demand=Total supply,
*No.of allocations=m+n-1,
these are the
two methods for finding the initial basic solution in a transportation problem.
*******************************BA7206/AOR/QB*****************************

Ba7206 QB

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Ba7206 QB

Enviado por

Direitos autorais:

Formatos disponíveis

FRANCIS XAVIER ENGINEERING COLLEGE,

: APPLIED OPERATIONS RESEARCH

ACADEMIC YEAR: 2014-2015

BA7206 APPLIED OPERATIONS RESEARCH

QUEUING THEORY AND REPLACEMENT MODELS 12

1. Define a feasible solution.

43. Explain the need for integer programming.

Part-A Questions and Answers

Optimal assignment of various jobs to different machines and different

Decision theory problems in marketing,finance and production planning and

3. What are the various types of models in OR?

ii) Predictive model iii) Normative model

Models by nature of environment

4. What are main characteristics of OR?

Examination of functional relationship from a system overview.

5. Name some characteristics of good model.

The number of assumptions made should be as few as possible

6. What are the different phases of OR?

Formulation of the problem

7. List out the advantages of OR?

Optimum use of managers production factors

8. What are the limitations of OR?

9. What is linear programming?

am1x1+am2x2++ amnxn (=)bm

There must be a well defined objective function.

12. What are the characteristic of standard form of LPP?

The objective function is of maximization type.

13. What are the characteristics of canonical form of LPP?

In canonical form, if the objective function is of maximization type, then all

Collections of all feasible solutions are called a feasible set or region of an

22. State the Limitations of LP.

LP treats all functional relations as linear

23. What do you understand by redundant constraints?

To determine the basic variable to leave

a11 a12 .. a1n

am1 am2. amn

37. Define basic variable and non-basic variable in linear programming.

A basic solution to the set of constraints is a solution obtained by setting any n

Unrestricted Variable :A variable is unrestricted if it is allowed to take on

and x2, x3, x5 0

North-west corner rule

6. Write down the basic steps involved in solving a transportation problem.

To find the initial basic feasible solution

7. What do you understand by degeneracy in a transportation problem?

( m+n-1) then the problem is said to be degenerate.

12. Define transshipment problems?

In a transportation problem there are no intermediate shipping points while in

supply at any source may be a

Supply at any source will

any positive quantity.

Demand at any destination may

Demand at any destination

One or more source to any number

One source one destination.

Since max z = min(-z)

19. How do you identify alternative solution in assignment problem?

3. A product is manufactured by four factories A, B, C and D. The unit

5. Solve the following assignment problem

8. Determine the basic feasible solution to the following transportation problem

10. Solve the following transportation problem to maximize profit

1.2 1.7 1.6 1.8 2.4 300

1.8 1.5 2.2 1.2 1.6

1.5 1.4 1.2 1.5 1.0

projects. Optimal allocation of men,machines,materials,time and money. Location