Operations Research (Organizer)

OPERATIONS RESEARCH
Introduction to Operation Research 2

KAUTIANS
Formulation of Linear Programming 10
Graphical Solution of Lpp AKAUTIAN Problem
19
Simplex Method 25
Transportation & Assignment Problem 45
Decision Theory 93
Network Analysis
Queuing Model
Non Linear
Game Theory
K
Programming Problem
112
122
133
136
ARE
Duality Theory
L 140
We
Ne
POPULAR PUBLICATIONS
NTRODUCTION TO OPERATION RESEARCH

Multiple Choice Type Questions
1. Operations Research deals with problems WBUT 2013]
a) scarce resources associater transportation
b) goods under transportation
c) waiting line d) all of these
Answer: (d)
Short Answer Type Questions

1. a) Narrate briefly the history of development of Operations Research
WBUT 2013]
Answer:
Along the history, is frequent to find collaboration among scientists and army oficers
, with the same objective, ruling the optimal decision in battle. In fact that many experts
Consider the start of Operational Research in the III century B.C., during the II Punic
With analysis and solution that Archimedes named for the defense of the city of
Syracuse, besieged for Romans. Enter his inventions would find the catapult, and a
system of mirrors that was setting to fire the enemy boats by focusing them with the
Sun's rays.
Leonardo DaVinci took part, in 1503, like engineer in the war against Prisa due to he
knew techniques to accomplish bombardments, to construct ships, armored vehicles,
cannons, catapults, and another warlike machine.
Another antecedent of use of Operational Research obeys to F. W. Lanchester, who made
a mathematical study about the ballistic potency of opponents
and he developed, from a
system of equations differential, Lanchester's Square Law,
with that can be available to
determine the outcome of a military battle.
Thomas Edison made use of Operational Research, contributing
in the antisubmarine
war, with his greats ideas, like shields against torpedo for
the ships.
From the mathematical point of view mathematical, in
centuries XVII and XVIIL,
Newton, Leibnitz, Bernoulli and Lagrange, worked
in obtaining maximums and
minimums conditioned of certain functions. Mathematical
French Jean Baptiste Joseph
Fourier sketched methods of present-day Linear Programming.
century XVIII, Gaspar Monge laid down the precedents And at late years of the
to his development of Descriptive Geometry.
of the Graphical Method thanks
Janos Von Neumann published his work called
"Theory of Games", that provided the
basics Mathematicians to Linear Programming.
At a later time, in 1947, he viewed the
similitude among them Programming
linear problems and the
developed himself. matrix theory that
In 1939, mathematical Russian L. Kantorovich,
in association with
Dutchman T. Koopmans, developed the mathematical
the mathematical theory called "Linear
programming", thanks to that went rewarded
with the Nobel.
OPRS-2
OPERATIONS RESEARCH
the late
years 30, George
Joseph Stigler presented
al diet optimal or more particular problem known as
a particular
worry of the commonly known prooiime bout
as problem of the diet, which came about
USA army to guarantee
byt equests for his troops to the
st Drice. It was solved with a heuristicsome
lowest
nutritional requests
imes against the solution contributed yearsmethod which solution onlyly differs in some
later
the years 1941 and 1942, Kantorovich by the Simplex Method. independent
ring the
During
Duhe Transport Problem for first time, and Koopmans studied in
knowing this type of problems like proo f
VaopImans-Kantorovich. For his solution, hat are related
they used geometric methods that are related to
Minkowski's theorem of convexity.
believed that Charles Babbage is
t is beli
It the father of the Operational Research due tto his
abou
research out the transportation's costs and sorting of mail realized for the Uniform
research
Penny Post in in England in 1840
tit does not considered than has been born a new science called Operations Researoch
until the II World War, during battle of England, where Deutsche Air Force, that is the
Luftwaffe, was submitting the Britishers to a hard Air raid, since these had an little aerial
Capability, although experimented in the Combat. The British government, looking for
some method to defend his country,
convoked several scientists of various disciplines for
try
to resolve the problem to get the peak of benefit of radars that they had. Thanks to his
work determining the optimal localization of antennas and they got the best distribution
of signals to double the effectiveness of the system of aerial defense.
To notice the range of this new discipline, England created another
groups of the same
United States
nature in order to obtain optimal results in the dispute. Just like
when joined the War in 1942, creating the project
SCOOP (Scientific Computation Of
Optimum Programs), where was working George
Bernard Dantzig, who developed in
1947 the Simplex algorithm.
(URRS), excluded of the Plan Marshall,
During the Cold War, the old Soviet Union Berlin. In
communications, including routes fluvial, from
wanted to control the terrestrial deutsche
and his submission to be a part of the
order to avoid the rendition of the city, by means
States decided supplying the city, or else
communist zone, England and United by means
would be able to give rise to.new confrontations) or
of escorted convoys (that in any event the blockage from Berlin. Second option was
of airlift, breaking or avoiding .June 25, 1948. This went another from the
(airlift) at
chosen, starting the Luftbrücke year, could carry
SCOOP group, in December of that same
problems in which worked the Operations optimized the supplying to get
Research
4500 daily tons, and after studies of This cipher was the same that would have
March of 1949.
to the 8000-9000 daily tons in aeCided to suspend the
blockage
means, for that the Soviet
een transported for terrestrial
(energy,
atMay 12, 1949. United States' resources (USA)
After Second World War,
the order of by. models of
took opportune to accomplish it
supplies)
dmaments, and all kind of
resolved intervening linear progradnmngResearch is being developed, the
nization, doctrinie of
Operations time of
same time, that the developing, thanks them the
the of computation and
computers are also
Tesues decreased.
ution of the problems
OPRS-3
year 1952, when aSEAC

;SEAC comCOm
given at the
The first result of these techniques was
in way to obtain the problem's solutiPute
from was used National Bureau of Standards was immediately used for he
encouraging that
success at the resolution time was so height which should fly the
shouia TIy niaInd
the planes
optimal
of military problems, like determining the
logistics and amo
to
management for
locate the enemy submarines, monetary founds
which should send the charges to reach the ene
including to determine the depth
casualties, that was translated in
submarines in order to cause the biggest number of
increase in five times in Air Force's efficacy and developing of Operational
Operational
During the 50's and 60's decade, grows the interest industry.
commerce and the nuusuy. Take for
Research, due to its application in the space of
optimal transporting plan of sand
CXample, the problem of the calculation of the
Moscow, which had 10 origine
construction to the works of edification of the city of
computer, that took 10 davs
points and 230 destinies. To resolve it, was used and Sterna
in the month of June of 1958, and such solution
contributed a reduction of the 11 %of
the expenses in relation to original costs.
Freviously, this problems were presented in a discipline knew as Kesearch Companies or
Analysis Companies, that did not have so effective methods like the developed
during
of
Second World War (for example the Simplex method). No war applications
Operations Research there are so as you want imagine, with problems like nutrition of
cattle raising, distribution of fields of cultivation in agriculture, goods transportation,
location, personne's distribution, and nets, queue problems, graphs, etc.
b) Give a few live examples of application of OR, with briefillustrations.
WBUT 2013]
Answer:
Production Planning at Harris Corporation - Semiconductor Section: For our first
application [|], we look at an area that is readily appreciated by every industrial engineer
production planning and due date quotation. The semiconductor section of Harris
Corporation was for a number of years a fairly small business catering to a niche market
in the aerospaceand defense industries where the competition was minimal. However, in
1988 a strategic decision was made to acquire General Electric's semiconductor product
lines and manufacturing facilities. This immediately increased the size of Haris
Semiconductor's operations and product lines by roughly three times, and more
importantly, catapulted Harris into commercial market areas such
as automobiles and
telecommunications where the competition was stiff. Given the
new diversity of product
lines and the tremendous increase in the complexity of production
planning, Harris was
having a hard time meeting delivery schedules and in staying
competitive from &
financial perspective, clearly, a better system was reaquired.
In the orientation phase it was determined that the MRP type
systems used by a number
of its competitors would not be a satisfactory answer and a decision
a planning system that would meet Harris' unique needs
was made to develop
the final result was IMPRes>
an automated production planning and delivery quotation
system for the entire production
network. The system is an impressive comolnauon or
heuristics as well as optimiza
based techniques. It works by breaking up the overall
problem into smaller, mor
manageable problems by using a heuristic decomposition
approach. Mathematical mooc
OPRS-4
OPERATIONS RESEARCH
hin the problerlem are solved
wTl requirements
planning. The
using linear programming
ing for forecasting, entire system interfaces alon long with concepts from
all quotation
cities. Harris estimates and order entry, with sophis
histicated databa
on cap materials dynamic
95% with no increase that this system and informa
in inventories, has increased on- on-time deliveries from
million in profits
S40 milli annually, and helped it move from
$75 million in loss
efficiently. allowed it to
plan its capita.
apital investments more
Gas lending
Blen at Texaco: For another
nrocod
in a continuous as opposed application
to discrete production to production planning, but this
se at Texaco |2]. One of the major environment, we look at a sys
hlending petrole
blending at petroleum applications of O.R. is in the area of gasolln
refineries, and virtually
timization models in this area.
optin all major oil companies
panies use sophistica
sophisticated
networked microcomputers.
At Texaco the system is called StarBlend and runs On
As some background,
different products at different distillation of crude petroleum
nroduces a number of the
these may be further refined distillation temperatures. or
through cracking (where complex hydrocarbons areEach
into simpler ones) and recombination. These broken
various output streams are then blended
together to form end-products such as different
grades of gasoline (leaded, unleaded,
super-unleaded etc.), jet fuel, diesel and
heating oil. The planning problem is very
complex, since different grades of crude yield different
concentrations of output streams
and incur different costs, and since different end-products
fetch different revenues and
use different amountS or refinery resources. Considering just one product gasoline - -
there are various properties that constrain the blends produced. These include the octane
number, lead and sulfur content, volatilities and Reid vapor pressure, to name a few. In
addition, regulatory constraints impose certin restrictions as well.
As an initial response to this complex problem, in the early to mid 1980's Texaco
developed a system called OMEGA. At the heart of this was a nonlinear optimization
model which supported an interactive decision support system for optimally blending
gasoline; this system alone was estimated to have saved Texaco about $30 million
annually. StarBlend is an extension of OMEGA to a multi-period planning environment
where optimal decisions could be made over a longer
planning horizon as oppósed to a
Single period. In addition to blend quality
constraints, the optimization model also
each period in the planning
ncorporates, inventory and material balance constraints for
modeling language called GAMS and a
norizon. The optimizer uses an algebraic managing
with a relational database system for
nonlinear solver called MINOS, along
within a user-friendly interface and in additionto
ata. The whole system resides scenarios for
also be used to analyze various what-if"
blend planning it can
ediate
e Tuture and for long-term planning a
third application we look at the use of
For our
FMS
Scheduling at Caterpillar: was applied to derive schedules for a Flexible
model interested reader may refer to
Aation model. This Caterpillar, Inc. [3]. The typically, they are
utacturing System (FMS) atmanufacturing for details about FMSs;automated
on computer integrated together by anan automated material
machines linked question at
at
systems
of gene
general purpose CNC computers. The FMS in question
Che FMS
hand controlled by
lling system and completely
OPRS-5
Caterpillar had seven CNC milling machines, a fixturing station and a tool ol station,
material and tool handling being performed by four automated guided
vehicles With ire
aveling alon a one-way guided wire path. FMSs can provide tremendous increas)
inherent in therm
capacity and ctivity because of the high levels of automation
their notet
their potential O to manufacture a wide variety of parts. On the other hand,
this c nd
a price; these systems are also very complex and the process he planning and scheul
very difficult uing
difficlt one "
production on an FMS and then controlling its operation can be a
erfect on the magnit
ency of the scheduling procedure used can have a profound nitude
of the benefits realized.
was being underutilized and
Caterpillar, a preliminary analysis showed that the FMS m
the
the objective of the project was to define a good production schedule that uld
woulc improve
improv
orientation phase
ualization and free up more time to produce additional parts. In the
was determined that the environment was much too complex to represent it accuratel
urougn a mathematical model, and therefore'simulation was selected as an alternative
span (which is the
modeling approach. It was also determined that minimizing the make
time required to produce all daily requirements) would be the best objective since this
wOuld also maximize as well as balance machine utilization. A detailed simulation model
was then constructed using a specialized language called SLAM. In addition to the
process plans required to specify the actual machining of the various part types, this
model also accounted for a number of factors such as material handling, tool handling
and fixturing. Several alternatives were then simulated to observe how the system would
perform and it was determined that a fairly simple set of heuristic scheduling rules could
yield near optimal schedules for which the machine utilizations were almost 85%
However, what was more interesting was that this study also showed that the stability of
the schedule was strongly dependent on the efficiency with which the cutting tools used
by the machines could be managed. In fact, as tool quality starts to deteriorate the system
starts to get more and more unstable and the schedule starts to fall behind due dates. h
order to avoid this problem, the company had to suspend production over the weekents
and replace worn-out tools or occasionally use overtime to get back on schedule. The key
point to note from this application isthat a simulation model could be used to analyze a
highly complex system for a number of what-if scenarios and to gain a betr
understanding of the dynamics of the system.
Fleet Assignment at Delta Airlines: One of the most challenging as well as rewardng
application areas of O.R. has been the airline industry. We briefly describe here one su
application at Delta Airlines [4. The problem solved is often referred to as the tiee
assignment problem. Delta flies over 2500 domestic flight legs each day and uses ab0u
450 aircraft from 10 different fleets, and the objective was assign aircraft to fiign
to ifa
in such a way that revenues from seats are maximized.
The tradeoff is quite simpi
plane is too small then the airline loses potential revenue from passengers who ca cannottbe
accommodated on board, and if it is too large
who
then the unoccupied seats represent
reprcrate
s
last
revenue (in addition to the fact that larger aircraft
are also more expensive to operalwhen
Thus the objective is to ensure that an aircraft
of the "correct" size be availaoi Is
required and where required. Unfortunately, happen
ensuring that this can nay
OPRS-6
tremendously
a1sly complicated OPERATIONS RESEARCH
since there
bility of aircraft: at different are a number
hlem is modeled times and locations.of logistical issues that
by a
hefion could result in about very large mixed-integer cosra" the
*
ormfor each problem is one 60,000 variables and linear prograr ram a typical
day 40,000 constraints.
hoated
sis repeated each day (CXCeptions
each since the assumption The
Tn planning
repeahiective such as weekend is made that the ssame schedule
of the problem
things as crew is to minimize schedules are handled separatey arately). The
SUch cost, fuel cost the sum of operating
evenues. The bulk of the constraints
and landing ot o
fees) and costs from
costs (including
passeng
ervation of flow o aircrart trom are structural in nature and result fromlost modeling tne
tem at different scheduled arrival the different fleets to different locations
ystem
arounu
verning the assignment of specificand departure times. In addition there are constraints
governing
fleets to specific constrain
also constraints relaung to the availability
are legs in the flight schedule.
schedule. There
1nere
governing
sOverning crew assignments, of aircraft in the different fleets,
estrictions. AS the
Scheduled maintenance reguiauos
reader can imagine, the requirements, and airport
teformation required to task of gathering and maintaining
mathematically specify all the
While building
such a model is difficult but of these is in itself a tremendous task.
antimality was impossible not impossible, the ability to
until the very recent past. However, solve it to
developed to the point computational O.R. has
that it is now feasible to solve
Delta is called Cold start and uses
such complex models; the system at
highly sophisticated implementations
integer programming solvers. The financial benefits
of linear and
from this project were tremendous,
for example, according to Delta
the savings during the period from June 1 to August 31,
1993 were estimated at about
$220,000 per day over the old schedule.
KeyCorp Service Excellence Management System: For
our final application we turn to
the service sector and an industry that employs
many industrial engineers banking. This
-
application [B] demonstrates how operations research as used to enhance

productivity
and quality
of service at KeyCorp, a bank holding company headquartered in Cleveland,
Ohio. Faced with increasing competition from nontraditional sourees and rapid
consolidation within the banking industry, KeyCorp's aim was to provide a suite of
world-class financial products and services as opposed to being a traditional bank. The
key element
in being able to do this effectively is high-quality customer service and a
natural trade-off faced by a manager was in terms of staffing and service - better service
came at a higher
C orm of shorter waiting times required additional staffing whichcomplete decision
with a
USL. The objective
of the project was to provide managers Management System).
pport system which was dubbed SEMS (Service Excellence
system to capture data on
step was the development of a computerized
irst and ending time or all components of
a
nce. The system captured the beginning
ler transactio including host response time, network response time, teller
timedsaction
controlled
ime.
me, and
and branch hardware time. The data gathered could
then
then
Customer controlled time
custome
Queuing theory was used to
be analyz to identify areas for improvement.
detemanalyzed service. This analysis yielded a
prespecified level of
equirelating needs for a was infeasible from a cost standpoint, required and therefore an
to meet
CTease in staffing that processing times that would be
mate in feasible. Using the
etheSeru was ma nade of the reductions staffing levels that were
maximum
Objective with the OPRS-7
strategies
able to identify
performance capture system, KeyCorp was then these involved upgrades in
involved upgrades in technag
technolog
Some of these was a 27% reduction
various components of the service times. and the result
uction in
while others focused on procedural enhancements, stabilized
zed,
operating environment was KeyCorp
transaction processing time. Once the managers imn
SEMS to help branch prove
introduced the two major components of manager with summary
Productivity system, provided the
productivity. The first, a Teller who required
scheduling and identitying tellers
statistics and reports to help with staffing, rmation on on
r
further training. The second, a Customer Wait
of
Time
day
system,
and
provided ntormation
by half-hour
interv
ervals at each
each
customer waiting times by branch, by time and queuing theory to develon
develop
branch. This system used concepts from statistics manager
information. Using SEVIS, a orancn
s tor generating the required improving service. The system
strategies for further
Could thus autonomously decide on branches and the results
were vev
was gradually rolled out to all of KeyCorp's 539%
average, customer processing times were reduced by
pressive. For example, on ony rour percent or customers
customer wait times dropped significantly with
nd resulting savings over a nve
year period were
waiung more than five minutes. The
estimated at $98 million.
Long Answer Type Questions

WBUT 2014
1. a) Briefly describe ABC analysis.
Answer:
management, the ABC analysis (or Selective Inventory Control)
is
In materials
an inventory categorization technique. ABC analysis divides an inventory
into three
categories- "A items" with very tight control and accurate records, "B items" with
less
tightly controlled and good records, and "C items" with the simplest controls possible
and
minimal records.
The ABC analysis provides a mechanism for identifying items that will have a significant
impact on overall inventory cost, while also providing a mechanism for identifying
different categories of stock that will require different management and controls.
The ABC analysis suggests that inventories of an organization are not of equal value.
Thus, the inventory is grouped into three categories (A, B, and C) in order of ther
estimated importance.
'A' items are very important for an organization. Because of the high value of these 'A'
items, frequent value analysis is required. In addition to that, an organization needs to
choose an appropriate order pattern (e.g. Just- in- time') to avoid excess capacity. B
items are important, but of course less important than 'A' items and more important than
'C' items. Therefore 'B items are intergroup iterms. C' items are
marginally important.
b) Write note on Bin Card. WBUT 2014
Answer:
A bin card is a common element in a perpetual inventory
system. "Perpetual" simp
means the inventory is always in flux. A bin card is particularly common etail
in a r
stockroom. The card includes a number of data points
about a particular product, Du
most important function is to show how many units
of a particular product are in stock.
OPRS-8
What are thefunctions of purchase OPERATIONS RESEARCH
Answer: department?
aior companies and even some WBUT 20141
MOment department
procu government
as
pre organizations
that is the backbone part of everyday operations. have a ipurchasing or
sorganizations. Many of many manufacturing, These departme
artments provide
individuals, even retail, military and
at the purchasing department some who work for these industrial
other inuu
tand better what does, why companies,
npanies, are aware
understand it exists or what purpose
the role of the purchasing
performs. oses it serves. To
it
department mctions
is, consider some functions
wnlain the difference
d) Exp between marketing
Answer: and selling.
WBUT 2014]
and sales are both
Marketing and
aimed at increasing
intertwined that
intertv revenue. They
peopie orten don't realize ney are so closely
emall organizations, the difference between
the same people typically the two. Indeea,
Nevertheless, perform both sales and marketing in
Na marketing is different from tasks.
sales and as the organization
and responsibilities become more
specialized grows, the roles
Comparison chart
Marketing
Approach Broader range of activities Sales
to sell makes customer demand match
product/service, client relationship etc.;products the|
determine future needs and has a strategy the company currently offers.
in place to meet those needs for the long

term relationship.
Focus Overall picture to promote, distribute, fulfill sales volume objectives
price products/services; fulfill customer's
wants and needs through products and/or
services thecompany can offer.
Process |Analysis of market, distribution channels, Usually one to one
|competitive products and services; Picing
strategies; Sales tracking and market share
|analysis; Budget
Scope Market research; Advertising; Sales; Once a product has been created for a
Public relations; Customer service and customer need, persuade the customer to
satisfaction. purchase the product to fulfill her needs
Horizon Longer term Short term
Strategy push
Priority Pull to the Selling is the ultimate result of
Marketing shows how to reach
Customers and build long lasting marketing.
relationship
afsales 1S the strategy of meeting needs in
dentity Marketing targets the construction of an opportunistic, individual method,
becomes easily|
brand identity so that it driven by human interaction. There's no
fulfillment.
associated with need premise of brand identity, longevity or
continuity. It's simply the ability to meet
a need at therighttime.
OPRS-9
MMING
FORMULATION OF LINEAR PROGRAMMIN
PROBLEM
guestions
LMultiple Choice Type
1. WBUT
For an LPP 2013
aonly the objective function needs to be linear to be linear
Only the constraints' equation/inequalitytoneed
Conly the non-negativity conditions need be linear
d) all these three must be linear
Answer: (d)
2. Total number of allocations in a basic feasible solution of transportation

problem of mxn size is equal to WBUT 2014
a) mxn b) (m/m)-1 c) m+n-1 d) m-n-1
Answer: (c)
3. Which method is used to solve the LPP, if constrains having Artificial

variables? [WBUT 2015)
a) VAM b) Big M-Method
c) Simplex Method d) Stepping stone Method
Answer: (6)
4. A basic feasible solution is called... .. if the value of at least

one
basic variable is zero.
WBUT 2017]
a) degenerate b) non-degenerate c) optimum d) none of these
Answer: (a)
5. Which of the follo:.ing is not a major requirement

Problem? of a Linear Programming
a) There must be alternative courses of [WBUT2017]
action among which to decide
b) An objective for the firm must exist
c) The problem must be of maximization type
d) Resources must be limited
Answer: ()
6. The number of methods used in solving

Integer programming
problem are
a) 2 b) 3 [MODEL QUESTION
Answer: (a) c)4 d) 1
OPRS-10
What is the method used to OPERATIONS RESEARCH
7.
solve an LPP
involving artificlal
artificial varian
a) Simplex method variables?
ESTIONN
c) VAM b) Charnes-M-methodMODEL QUESTION
Answer: (b) d) None of
these.
8. basic feasible solutions
of the system
t*X =8 of equations
quations [MODEL QUESTION]
3x +2x, = 18 are
a) no basic solution
b)(2,6,0)(6,0,2)
(,7,0) (7,1,0)
d(2,2,0) (6,6,2)
Answer: (b)

1.Formulate the following LPP:
WBUT 2013]
A manufacturer makes 2 products A
& B. 2 resources R, &
R, are required to make
these products. 1 unit of R & 3 units of R, are required to produce one place of
product B. The maximum available resources R & R, are &
5 12 units respectively.
The profits expected to be earned by the manufacturer are Rs. 6 per piece & Rs. 5
per piece for products A & B respectively. The manufacturer wants to have the
best product mix for A & B, so that he can earn the maximum profit.
Answer:
Let the manufacturer be produce x units of product A and y units of product B.
Therefore, according to the given conditions
Maximize z=6x+5y
subject to y5
3ys12
and x, y20
on the mixture of two possible
2.The manager of an oil refinery must decide
output production runs are as follows:
Dlending processes of which the input and
amount available of crude A and B are 250 units and 200 units
he maximum 130
that at least 150 units of gasoline and
X
espectively. Market demand shows profits per production run from Process
produced. The
units of gasoline Y must be LPP for
6.00 respectively. Formulate the 2014]
4.00 and Rs.
and Process 2 are ofRs.the above problem. WBUT
aXimizing the profit Output
Input BGasoline X Gasoline Y
Process Crude A Crude
5
oPRS-11
Answer:
Let x and x, production runs must be undertaken for the processes
1
d 2 respectively
and
so that we are to
Maximize z = 4x, + 6x,
Subject to the constraints:
6x +5x, 250
4x+6x, 200
6x +5x, 2150
9x +5x, 2130
and * 20.
. Four different metals namely Fe, Cu, Zn, Mn are required to produce three
Zn, ka
commodities A, B and C. To produce one unit of A 40 kg Fe, 30 kg Cu, kg Mn4 are
7
Mn are needed. Similarly to produce one unit of B 70 kg Fe, 14 kg Cu, 9 kg
required and for producing one unit of C 50 kg Fe, 18 kg Cu, 8 Kg Zn are required
The total no. quantities of metals are 1 ton Fe, 5 Quintals Cu, 2 Quintals Zn and Mn
each. The profits are Rs 300, Rs 200, and Rs 100 in selling per unit of A,
B and c
respectively. Formulate the Linear programming Problem. [WBUT 2015)

Answer:
Let x,y and z units of A, B and C respectively to be produced.
Therefore, 40x+70y +50z <1000
30x+14y+18z < 500
7x+ 8z 200
4x+9y S 200
where X, y,z20
In which Max z = 300x+200y+100z
4. Show that X = |(x,y)/x* +y' s4 is a convex set. WBUT 2015

Answer:
Given S={ ):*+fs4
Let =(1 V) and =(2 )2) be any two points in S.
Now the convex combination of ž and i, is = Ai +(1-2)F,,
= )+1-X*z,¥,)=(Ax +(l-2)x, Ay 0sasl
+(1-2)y,)
Now, { +(l-2)»,}+{ +1-2)y
s +0-2x +2j +(0-2
=C +i)+0-2*+y)
s+0-4
OPRS-12
OPERATIONS RESEARCH
s4
A +(1-2)x, eS
Hence S is a convex set.
solve the following linear programming

Solve
5.
Minimize Z 200x +300x problem using graphical
graphical approa
approach: n461
subject to 2x, +3x, 21200 WBUT 2016]
+X S 400
2x +1.5x, 2900
X 20
Answer:
X2
500T
IHNLIANLAII
NIIIIIAITIUUTMUMDK
300
100
100 300
2 +3x 21200
tS 400
2x+1.5x,2900
This LPP has no feasible region.
6. Find the maximum value of Z =5x +7*2 WBUT 2016

subject to, S4
3x +8x, s 24
10x +7x, $35
20
OPRS-13
Answer:
X2
70 z
at D(0, 3) 21
XI
3x +8x, s24
+ S4
10x+7x, s35
Therefore, n and=
7. A small ink manufacturer
Rs. 3 per bottle and sells at aproduces a certain type of ink at a total
average cost of
price of Rs. 5 per bottle. The
week-end and is sold during the following ink
is produced over the
weekly demand has never been week. According to past
less than 78 or greater than experience the
Formulate the loss table. 80 bottles in his place.
Answer: WBUT 20161
Demand
78 79 80
Production 78 0 0 0
79 3
0
80
63 0
Loss Table
8. Explainthe purpose of
problem. What is degeneracySlack variables and Artificial
in Linear Programming variables used in LP
Problem? WBUT 20171
OPRS-14
OPERATIONS RESEARCH
Answer
implex algorithm, in a
maximization problem
type
constraints are
converted to equality to convert standard form, less than
ert thestandara
variables. Slack variables
help to form the
iing slack'
type constraints after introduCIng* lack
we could not find initial basis initial basis of simplex algor
lgorithm.
in a
d surplus variables,
and.
and surplus initial
then to form initial
standard
ard form LPP after incorporating S1aack
torm of LPP
in feasible solution,
basicfe basis we var
In a basic if any one of the basichave to introduce artificiallevel he
then the
solution is called degenerate. variables occu
ccurs in zero
Write the LPP in its standard form:

[MODEL QUESTION]
Max(Z)= -37, +5x
subject to
t+2 +X, S7
2 + 22
3x, -*2 +2x =-5
X, 20 and x, is unrestricted.
Answer:
In the 3 constrain RH.S. is -5, multiply by (-1) (on both sides of this equation) such
that R.H.S. should be ve, i.e., -3x +2 +2x =5
The variable x3 is unrestricted, we will replace it as the difference of two (+)ve variables
Xa and xs 1.e, ¥3 *4Xs
The 1 constrain needs a slack variable xs (say) and the constrain needs a surplus
2
variable xy (say). Now, writing the problem in its standard form, we get
Maximize Z=x-3x, + Sx,-Sx, +0x, +0.x,
subject to
+2 +X4-* +s=7
-2+X, -X5 -X, =2
-3x +X +2x, -2x, =5,
20.
z4ks,¥
[MODEL QUESTION]
10.Define convex set.
Answer: x, x, EX, the line
convex set it, for any two points
Convex Set: A set X is said to be a
Segment joining those two points
be also lie in the set.
Questions
Long Answer Type
QUESTION
programming. [MODEL QUESTION]
in Linear
a Explain the major assumptions
assumptions
Answer: optimisation if the following major
T inear programming can be used for
are satisfied
OPRS-15
POPULARPUBLICATIONS
(i) There must well-defined objective

function.
be only one
i) Decie non-negative (20).
Variables ofthe L.P.P. should be
f nConstraint and obiective function should be in linear form. olutions.
iv) Constraints should be such that a feasible region of solu
they can produce
minimization or maximization
(v) Cost or profit maximizatio type
vector decides whether it is a minimization
of problem.
lamne aecorator manufactures two types of lamps, Alpha and Delta. Both thi
lamps require the services a cutter and a finisher. Alpha requires 3 hours of
cutter's time and 2 hours ofof finisher's time. Delta requires 2 hours of cutter
er's time
a nour of finisher's time. The cutter has 180 hours finisher has 110 hours tima
each
E month.
onth. An gives a profit of Rs.10 and a Delta a profit of Rs. 7.
Alpha type gives
probiem
Formulate the problem of how many lamps of
Omulate p of each
each type should be
type should be produced
produced each
month as a LPP. Solve this LPP and each
obtain the optimal solution.
[MODEL QUESTION
Let ,
Answer:
n, be the no. of alpha and delta type lamp respectively
Formulation: Max. Z =10x
+7x
Subject to 3x+2x, s180, 2x +x, S110;
Optimal solution by graphical
method:
,x 20
40, x, =30 and Max. Z = Rs.710.

2. Solve the following
integer programming problem using Gomory's cutting plane
algorithm:
Max
Z=+*2
subjectto 3%, +27, SS
2 2
20,x2 20 and are integers.
Answer: [MODEL QUESTION]
Max Z
x +x, +0 x3 +0-x
subject to
3x+2x +z=5
+x2
2 3 X, 20
OPRS-16
OPERATIONS RESEARCE
solve this problem by simplex algorithm (Table- 1)

Wes
Table-1
C,B |
C
5
1
2
00
,
0
Mini. ratio
S/3
2 0
0
5/3 1
2/3 1/3 0 2
|7, 2
-1/3| 1/3 0
1/3 0 1/32/3
1
2 1 0
the optimal solution by simplex

algorithm is x =/3, 7=2
Hence all the z,-c, 20,
(since x =1/3).
which is not a integer solution
method
From the 1" row of (),
one get using Gomary's cutting plane
+0+-=
Or, +0 +0--= s0
(Gomory's constraint)
- +XS-1 .()
in the Gomory's constraints]

the slack variable
used problem by
(1) and solve the
is constraint (II) with the
constraints
Now, we will add the
Dual Simplex algorithm.
OPRS-17
(lable-2 for dual simplex algorithm for the solution ofthe problem).
Table-2
Min 2
CB
1 1/3 0
1/3 -2/3 0 1/3
0 0
0
1/3 1/3 0
0 -1/3 1/3
0
-1
-
Since all of xj, 2 and
0 0
0 0
x 20
2/3 1/3
and integers, we get optimal solution by Dual Simple:

method.
=0, x =2
Max Z = 0+2=2
OPERATIONS RESEARCH
GRAPHICAL
SOLUTION
OF LPP
Short AnswerType
Questlon8
1. Solve the ollowing LPP by Graphical
Minimize Z 20X1 +10X Method: WBUT 2013]
Subject to X, +2X, s 40
3X +X2 230
4X +3X2260
X+X, 20
Answer:
30
20 C4,18)
D6, 18)
10 ItZI 40
X 20 30
-10t
3 +2 =30 1 +3 =60
X2
Here ABCDA is the feasible region.

260, =240
Now
300, =800,
B(40,0)
c(4,10) D(6,2)
A(15,0)
=6, x =12 and zmin240.
ce the required solution
is x
OPRS-19
2. A company manufactures two products X and Y. The profit contributione of

and are ana require
and Rs. 4 respectively. The productsA, B,C and D are limited the
services of four facilities. The capacities of four
and the available capacities re hrs, 100 hrs
are 200 hrs, 150 hrs, and 80
hrs and 80 hn
80
espectively. Produe s In hours
pectively. Product x reauires 5, 3, 5 and 8 hours of tacins A,B,Cfacilities hrs
and p
4, 8,C and D
respectivol milarly the requirements of products

A, B, C and D. Find the optimal product mix
are 4, 5, 5 and 4 houn
to maximize th
on
profit. Use graphical method. WBUT 20177
Answer:
et
1
the company be manufacture x, and x, units of X and ? producis respectively.
neretore, the constraints due to the facilities A, B, C, D are respectively.
Sx +4x, s 200
3x +5x, 150
5x+5x, s100
8x +4x, 80
The optimisation function is Maximize Z =
3x +4x2
So the LPP corresponding to the given problem is
Max Z =3x +4x
subjectto 5x +4x, 200
3x +5x, s150
5x+5x, 100
8x, +4x,80
and
20
0.
S0
10
X
O
2
S0
50 t 70 90
X
+5x =150
8x,+4x, =80
=
200
5x+5x, =100 P+4x
OPRS-20
OPERATIONS RESEARCH
are OACO is the feasible region.
Z= 30, Z|=80,
AtA
At C Z=0
opticalsolution is
So the x =0, x, Ato
=20
3. Solve graphically:
Minimizez=x\+X2
Subject to 5x+9x2 [MODEL QUESTIONI
S 45
X+ X222
2 S4
and X, X220.
Answer:
S +9x2 = 45
E
23 4 6 9
1t22
The shaded region ABCDEA is the convex
set of feasible solution. Now,
A=(2,0). B =(0,2). C=(0,4).
D=4 and E=(9,0)are the vertices of this
convex set. Minimum Z attains both
at A=(2,0), B=(0,2).
Min. Z 2. Note that every point on the line AB is an optimal
solution.

1.Solve the following all integer programming problem
using branch and bound
method:
Maximize
Z 6x +8x,
subject to,
4 x+16x, s32
14x +4x, 28
20 WBUT 2016]
OPRS-21
POPULARPUBLICATIONS
Answer
we begin by solving value constraint,
graphically the related LPP, ignoring the integer
which yields 268
max 13
"18
(29
13' 13
4+16x, s32
X
14x+4x,28
SInce neither x nor x is integer we can choose either variable to begin implementation
of the next step.
20
13
2-14 22
246 324
13 13
Z 22
=1 =2 No feasible solution
13
No feasible solution
4=25
Hence, the solution is z,a14, l, X =l
2. A firm makes two types of furniture: chairs and tables.

The profits for each
product as calculated by the accounting department are Rs. 20 per chair and Rs.
30 per table. Both products are to be processed on three M2, M^*
machines M,,
OPRS-22
OPERATIONS RESEARCH
uired
The time requir in hours
eek on each machine isas by each product
follows: andtotal
total time available in hours per
Machine
Chair
M 3
TableAvailabletime (hrs)
3
M, 36
5
2
M 50
) Give a mathematical 60
) Use the graphical formulationto thislinear
method programmig
to solve this problem.
Answer: RUT 20171
Let the company be produce
x and
So the mathematical formulation y units of chairs and tables respectively.
Max Z = 20x +30y of the problem is
subject to
3x+3ys 366
Sx -2ys 50
2x+6y s60
and x, y20
25
20
IS 20 25 2x+6y = 60
Sx+2y 50 r+3y=36
OPRS-23
POPULARPUBLICATIONS
OABCDO is the
feasible region.
Z=200 Z=300
At A
2=240, z330, At
At B At C
So the optical
solution is x=3,
y=9
TV requires 4 hon
urer produces TVs and VCRs in a factory. Each
o assemble 2. Each VCR requires
hours to workstation 1 and 2 hours in workstationworkstation 2. Workstation4
ana 2 function for 40 hours and 60 fit on each
TVis Rs. 3000 and on hours respectively in a w TVs, VCRs are
each VCR is Rs.4000. Assuming that all the
What should so as to earn maximum
profit using LPP? be the strategy of the manufacturer [MODEL QUESTION
Answer
et and x, be the numbers of TV and VCR to be produced to maximize profit.
W.S,-I W.S.-II
TV 4h | 2h
VCR 2h |
5h
The L.P.P. is 40 h 60 h
Max Z =3000x, +4000x,
subject to
4x +2x, S 40 (for W.S. 1) -
2x +5x, s 60 (for W.S. -I)

20 andintegers.
Consider
2x+=20
and 2x +5x, =60 (11)
to form the convex set of feasible solutions (the
region OABCO).
20.
20 30
A=(0,12), C=(10,0)
Optimal solution: x =5, x, =10 and Max Z=Rs.55,000/
OPRS-24
OPERATIONS RESEARCH
SIMPLEX METHOD
Multiple Choice Type
Questions
Some Linear Programming
a) a unique Problems
optimal solution may have WBUT 2013]
c) no solution b)an infinite number of optimal solutions
Answer: (d) d) all of these
9. Which method is used

a) simplex method
to solve a LPP
problem using artificial
c) VAM variabes
Answer: (6)
DCharne's Big-M
d) none of these
WBUT 2014]
3. How many Artificial variables

2.X, +X2 =4 can be introduced in
these equations?
4X +6X, 26 WBUT 20151
X, +6X, s4
a) o
b) 1
Answer: (b) c) 2 d) 3
4. The dual of the dual in a LPP will

a) dual remain WBUT 2015]
b) primal c) optimal
Answer: (b) d) none of these
5. In LPP maximization case C, -Z,<=0, then WBUT 2017]
a) It is basic feasible solution
b) basic feasible solution is optimum
c) cannot say d) none of these
Answer: (d)
6. The role of artificial variable in simplex
method is
a) to aid in finding the initial basic feasible [MODEL QUESTION]
b) to start phases of simplex method
solution
c) to find the shadow principle for the simplex
d) none of these
method
Answer: (a)
What is the method used to solve an LPP involving artificial variables?

[MODELQUESTION]
a) Simple method b) Charnes M method
VAM(6)
Answer:
d) None of these
OPRS-25
POPULARPUBLICATIONS
an 4-C 20 with some
So
8. multiple solutions,
In Simplex method, there will be MODEL QUESTION
Z-C=0 corresponding to vectors
a) all vectors b) only basis
d) none of these
c)basis vectors and non-basis vectors
Answer:
Answer: (c)
guestions
ShortAnswer Type
WBUT 2015
T. Find the basic feasible solutions of the set of equations
2x-y+3z +t = 6; 4r-2y-z+ 2 =16
Answer: We have
2x-y+3z +t = 6
4x-2y-z+2t = 16
This system of equations can be expressed in matrix form:
,,,,}=
4-1)4-13-
Let
Now, |=0,
B-.,
-
A-{.). B={4,). B,={i,), B,={2,,), B,={4.}
|B, |=-14,|B,=0,|B,=7, |B, |=0, |B.=7
Therefore,
27
B 3 2]16 14-s4
14-4 8
So, B.F.S. i
-54
7613]6 7
B.F.S. is 0,-
OPRS-26
RESEARCH
OPERATIONS
and
B.F.S. is 0,
Following is the starting tableau

2.Following incomplete
2. of an LPP by the simplex method in
form:
CB B
a
Write down the

3
actual linear programming problem.
-1 MODEL QUESTIONI
Answer:
Maximize z=3x, +2x,
Subject to
2x +2, $2
3x+4x,212,
W,W 20
MODEL QUESTION
the following LPP:
3. Use simplex algorithm to solve
max = +5x2
Subject to
3x +42 S
+3x2 23
where X1X220.
Answer:
Optimal solution = -
and Max. 2=2
incomplete
LPP by the simplex method in
tableau of an [MODEL QUESTION
Following is the starting
4.
form: 3
M
C
Ca
3 problem.
12programming
linear
Write downtthe actual
oPRS-27
POPULARPUBLICATIONS
Answer:
rom the column ,. it is clear that the first constraint
is of 's' form and also
from
COnumns and a, it is clear that the 2d constraint is of 2' form.
The original L.P.P. is
given by Max Z=3x, t* 22
Subjectto
2x+x, $2
3x+4x,212
and x, 20

1. a) Solve the following Linear Programming Problem using Two-phase Method:
Minimize Z=3X, WBUT 2013
+4X
Subjected to: 2X, +3X, 28
SX +2X, 212
A1,Aa 20
Answer:
Given LPP can be written in the following form:
max z3xx -4x2 + 0.x + 0.x
Subject to
2x +3x2-X3 =8
Sx +2x2 -=12
2,X3,X20.
Now we introduce artificial variables xs,x to 1" and 2 constraints respectively and the
set of constraints becomes,
2x +3x2X +X5 = 8
5x +2x2 -x =12 tX
The auxiliary objective function to be maximized is given by,
z=0.x+ O.x, +0.x3 t+0.x4 -Xs-
Phase-1 0
CB B b
8
a2 23 Min. Rati0
12 5 2 4
d6
112/5
-7t 5
0 0 -1
LCB B b Min. Ratio

OPRS-28
16/5 QPERATIONS RESEARCEH
0 12/5 l1/5
2/5 215
0
-11/5 -1/5 2/5 16/11-
T1 2/5
1/5 6
B
C 0
0 7/5
B
0 a2 16/11
20/11 -5/11 as
2/11 5/11 2/11
211 3/11 -2/11 3/11
Here all Z
Cj20, So the optimality
condition of simplex
ve see that Maxz
We =
0and artificial variables method is satisfiea. ru ther
ctart the phase-Il table are not in the basis
where the objective in the final table. so w
function to be maximized
will be
Phase-II Z-3-4x2
C -3 -4
B b
a2 16/11 0 a3 d4
-S/11 2/11
3 20/11
2/11 -3/11
14/11 1/11
All
2C20, so the optimal solution is x = 20/11, x2 = 16/11 and
ZM 3x 20/11+4x16/11 =124/11.
b) Solve the following Linear Programming Problem using Charne's Big M Method:
Minimize Z =4X, +X2
Subjected to: 3X +X, =3
4X +3X, 26
X +2X, Ss4
WBUT 2013]
X1,X2 20
Answer: following
surplus variables, the given LPP can be written in the
Introducing slack and
Torm:
+0.x3 +0.x4 +0.xs +0.x
Max z= -4x -x2
3
subject to 3x + +X
3
3x +2
-x =6
4x+3 4
+2x +4
20
23,X OPRS-29
Now introducing artificial variables we ge,

ax +0.x, +0.x, + 0.xs +0.x
- Mx, -
Mgs
subject to
2-4x -x,
3x ++ 3
=3
3x+2 +1
4x +3x 6 +X =6
=4
+2x +X
0 0 -M -M
SaB b 0
d6 asMin. Ratio
-M a7 3 0 0 1
-M a 4 0 0 -1 0 3/2
a 4
-7MT-4M M M
+4 +1
-M
Ba3 bA
0 0
5 d6 agMin. Ratio
4 1 1/3 0 0 -1/3 0 3
|-M 2 5/3 0 4/3 -I 1
0 6/5
43 0 -1/3 0 1/3
5M/3T 0 -4M/3 M 0
-1/3 +4/3
0
CR B Min. Ratio
0 a3 0 0
-4 3/5 -3/5 1/5 3
-1 6/5 0
17/5 4/5 -3/5
3/5 -1/5
0 8/5 -1/5, T
0 0
0 0
-
-1 3 -3
0 -1
0
OPRS-30
OPERATIONS RESEARCH
tHere a
2-C2, So tne optimalty condition
of simplex method is satisfied.
solution
lution is Xi=0, ¥2 = and
*
optimal zMin
4x0+1x3=3.
M method to solve the following
UseBig LP problem: WBUT 2014]
2
Minimize z= 5x, +2x, +10x,
Subjectto %S100
+X210
where, x, 2
, 20and x, 20
Answer:
slacKand surplus variables the standard form of the LPP is
aroducing slack
introducing
Max z=-5% -2X -10x, +0°x,+0°x,
S.t. + =10
+ =10
Now applying
Simplex algorithm we obtain,
Table-1
-1000 0
5-2
Min Ratio
BX L61 10
0 1
10 0
-10
0 0 5 10
3
Table-2
0
52 -10 0
aMin
Ratio
CB B
0 10
10
-10 4 10 0
0 10
Table-3 0
5 2 -10.0
X b
C 20
1
-2 10 0
0
Here condition is satisfied.

al optimality
20,
Hence,
optima solution is x =0, x =10, x =0 and
ZMin20.
dl OPRS-31
3.Solve the following by simplex method WBU

2014
Maximize Z=2x, + 3x, +4x,
Subject to 3x+x + 6x, s600
2.x +4x, +3x, 2480
2x, +3x, +3.x, = 540
and 20, x, 20 and x, 20
Answer:
riable
ntroducing slack variable (x.), surplus variable and artificial variable (z. )te
standard form of LPP is
Max z= 2xy +3x, +4x +0 x +0x, -M,- MX,
s.t. 3x +, +6xg +X4 600
2x +4x,+3x = 480
-xs+6
2x +3x +3x + 540
42, 4,s, Xg, X, 20.
Now by Simplex algorithm we get,
2 3 4 0 0-M -M
Ca
BX b Min
Ratio
a 46000 3
I 6 1
0 0 0600
-M 480 2 3 0 -11 120
-M a, z 5402 3 3 0 0 0 1180
z-4M -2-3
-7M -6M
-4
0 M 0 0
3 4 0 0 M
a a, Min
Ratio
0 | 480 5/2 0
21/4 1
1/4 0
640
3 z, | 120 1/2 1
3/4 0 -1/4 0
7
160
-M x, | 180| 1/2 0 3/4 0 3/4 1
240
M 2
0 3M
4
0 3M 0
OPRS-32
Ca B
X6 23 4 0 0
OPERATIONS RESEARCH
-M
4 640 10 a Min
7 Ratio
21 0 1920
3 4 480
2 1 21
0
0
M a, 780
0
-
0
1
156
M 0
M 5M
7
21
,23 4 0 0
CBX6
4
4| 16 46 16 0
105 105 105
3 a 792 1
1
7
as | 156 0
-37 105
0 0
105
Here all z,- C, 20.So the optimality condition is satisfied.

Therefore, the optimal solution is
16
=0, x=
105
WBUT 2015]
4.Solve the following LPP by simplex method
Maximize, Z=6X, +8X,
Subject to: 30X +20X, < 300
5X +10X, <l10
X, X, 20.
OPRS-33
POPULARPUBLICATIONS
Answer:
Introducing slack variables
the given LPP is given by
,
x(20) to the
ndard form
respective constraints the standard fom
f
Max z = 6x +8x, +0 x, +0°X4

S.t. 30x+20x, +X = 300
5x +10x +x =100
and
Now by Simplex algorithm we get
6 8 0 0
C B a2 a Min Ratio
0 15
0 300 30 20
o. 100 5
10
-8 0
6 3 0
Cs B a a Min Ratio
100 8
100
10
20 -2 5
20
10
-2 0 8
10
6 8
C B
6 1
0
20 10
15
8 0 3
40 20
0 0
10
6
10
Here all z,-c; 20, so optimality condition of simplex method is satisfied.
15
Hence the optima solution is. =5, 1 =and zma =90.
OPRS-34
hodtto solve
Use enalty method OPERATIONS RESEARCH
5.
Minimize Z =6x+4y the following
L.P. Problem:
subject to, 2x+4y S12 WBUT 2016]
3x+2y=10
5x+3y215
X, y20.
Answer:
Ancing slack.
ntroducing slack and surplus
variables into
the LPP can be written as follows: the given constraints,
the stand
tandard form of
Max W=-6x-4y +0-2+0:s
subject to 2x+4y +2 12
3x+2y =10
5x+3y -S = 15
and X, y,
Z, s20
Now to form the initial basis, we introduce two
d constraint and finally the set artificial variables u and v with 2 and
of constraints becomes:
2x +4y+2 =12
3x+2y +u =10
5x+3y -s +V=15
and X, y, Z, S, U, v20.
Now according simplex algorithm we get,
CB
0 a
B XB b
12 2
4
4
0
1
0-M-M
0
as
0
, 0
Min. Ratio
6
0 1 0 10/3
-M
-M
10
15
3
3
2
0
0
-
M
0
13 3 0
-8M-5M
+6 +4
0 -M
5 4 Min. Ratio
as
a 2/5 0 15
14/5
0 5/3
0
-M
Z
6
1 0
1/5 03/5 -1/5
1
3/5 0
-
1
-3M/5 0
6 3
-MI5 0
0 +6/5T
+2/5
OPRS-35
0 0 -M
-4
as Min Ratio
b
Ca BX 14/5
1 2/5 0 15
0 z 6
-M as 0 1/5 0 /5
-1/5
1
0
5/3
3/5 0
-6 3
-MI5 -3MI5
+2/5 +6/5T
0 0
4
B Xn
C a 16/3 0 8/3
1 0
0 5/3 0 1/3 0
-6 a x 10/3 2/3
0 0
Here all z-, 20, so the optimality condition is satisfied.

Hence min 20, x y=0.
6. Solve by Charnes' big-M method the following LPP: MODEL QUESTION

Minimize Z= 4x +2x,
subject to
3x + 27
+X2 221
x +2x, 2 30, x1, x2 20.
Answer:
Step I: Standard form of the L.P.P. after introducing surplus variables x, 4,* and
artificial variables xg, ,, x and after converting to a Maximization probiem.
Mar Z=4x, -2x, +0-x, +0-z, +0*x, +0-x, -Mr, Mr, -Mr,
-
subject to
=
3x +X-x, +*, 27
} +X, -X, +x, = 21
+ = 30
x+2x, -x,
andx,X2 X, X4» Ks» Xg X7, K 20; and M is a very large (+)ve integer.
Step : (Simplex for Big-M method)
OPRS-36
c 0
OPERATIONS RESEARCH
0 0 M-M-M
M 3 a4 , 7,Ratio
M
a7 |*, |21 0 0min {9, 21, 30}
30 0
= 9
M 0
*OM*4T4M+2 0
+MM
+M M
1/3 -1/3 0
M
,/12 0 2/3 1/3
0
0 min{27,
63/5
18,
21 0
-M S31 1/3 0
63/5
-7M/3 -2M/3 +M +M
24/5
4/3 +4/3
-2/5 1/5 min{24,9}
-M 7, x 18/5 0 +1/5 = 9
63/5 0 1/5 0 -3/5
0
a2 a-M/5 a,7,
+M -2M/S
Ratio
+6/5 |+2/5
-/2
9 0 -5/2
2 |18 1/2 -3/2 0
0 +1 |+3
Step I1: All z, -c, 20 the artificial r variables are removed from the basic variables.
Optimal solution is x, = 3; x, = 18 and Min Z = 4x3+2x18 = 48.
Using simplex algorithm solve the following LPP:

Minimize [MODEL QUESTION]1
Z=2x +3x
Subject to
3x+5x 2230
Sx +3x, 2 60
Answer: *220
The form by introducing surplus variables.
ThVen problem can be reduced to the standard
s can also be recast into a maximization problem.
Maximize
(2)=(-Z)=-2, -3x, +0-x +0x
OPRS-37
S.t.
3x +512-X 30
+3x2 -x, = 60
20, i=1,2,3,4.
Here x, x, are surplus variables.
NOW to obtain initial basis we introduce artificial variables X, ¥s ana we get,
- Mx
Maximize
Z=-2x-3x +x +0 x -Mi,
S.t. 3x +5, -X +X 30
Sx +3x2 X4 +s 60
x,20, (i=,2,,)
CB B
-M
, 2
30
-3 0
aMin.
-1
0
0 1
-M -M
0
Min.
Ratio
10
-M i 60 5 3 0-1 0
0
1 12
-8M+2 -8M+3 M M 0
3 0 0
M
Min.
Ratio
1 5/3 -1/3 00
M 6 10 0
0
-16/3 5/3 -11 6
16M
3
15M1 M0
-3
-2 3/5 -l/5
0 -16/5 1
3/5
0 9/5 2/5
Here all
z,-,20, so optimality condition is satisfied.
=
=12, x, =0 and Zmnin 24.
OPRS-38
OPERATIONS RESEARCH
the following LPP by simplex method:
Minimize Z=-2x2-X3 (MODEL QUESTION
subjectto +2-2x S7
-3x +2 +2x S3; X, *2,*3 20.
Answer:
verting the ggiven minimization problem
Converting
to a maxímization problem we obtain,
MaxZ'=2x +X3, Z'=(-2)
s.t. +*2-2x, $7
-3x +2 +2x, S3
, X2 20
troducing slack variables xa, * ,(20), the initial table of the simplex is given by
Introd
C, o 2 1 0 0
CB B b Min. Ratio
-2 1
7
Z-C 0
t
Here a, is departing vector and ä, is entering vector.
C
, 15
2
a
0
Min. Ratio
0 a 0 4 1 -1
2 3 1 1
3/2
0 -1 0 2
2,-C
0
2
CB B, 2 1
10 -2
1/2
3/2 -3/2 1/2
3/2
1
0 0 1/2
-3/2
Here are negative. Hence the

ere
solution
Z-C- <0, but both the components i.e. 1 Y21
of this problem is unbounded.
OPRS-39
MODEL QUESTION
od:
b Solve the following LPP by Charnes' Big-M metnou
Maximize Z 3x +2X
subject to
2x +h S4
Sx, +8x, Sl5;X, X2, 4, 20.
Answer: the standard tom of the
.. r. and surplus
variable x,
ntroducing slack variables
given LPP is
Max Z =3x +2x, +0.x, +0.x, +0.xs
s.t. =l
2.x +X2 +4 =4
Sx +8x2 + =15
introduce an artifclal variable x, with

Now to obtain initial basic feasible solution, we
constraint and the resulting LPP is
Max Z=3z +2x, +0x, +0x, +0.x, -Mag
S.t. +X =1
2x +X2 +a 4
5x +8x +2 =15
According to simplex method (Table-1)

0
0 0-M -M
3 2
Min. Ratio
|-M ä, | 1 -1 0 0 1
0 2
2
as 155
Z,-C -M-3 -M-2
0
M
0
0
03
3 2 0
4 a Min. Rati
1
3 -I 0
2 -1 0
10 3 5
0 12
,-C 0 -3 0
OPRS-40
OPERATIONS RESEARCH
2
0
2 Min. Ratio
0 1/2 0
-1/2 1
1/2 0
-5/2 1
5/8
2,-C -1/2 03/2 0
2 0
B
27/16 1
21/32 -1/16
21/16 1 11/32 1/16
2 2,-C
5/8
0 -5/16 1/8
0 43/32 1/16
Here all Z-C, 20. So optimality condition is satisfied. Hence the optimal solution is
101
16
9.Use simplex algorithm to solve the following LPP: (MODEL QUESTION

Maximize Z=4x, +7
subject to 2x +x, S1000
10x+10x, s 6000
2x+4x2 S2000
20
Answer:
Given LPP can be written in the following form:
Max z = 4x +7x2
S.t. 2x +* S1000
+z S600
%+2x, 1000
Now
220 three given constraints we obtain,
w introducing slack variables x3,X4Xs with the
Max 2= 4x, +7x, +0-z +0 x, +0-*s
= 1000
2x+2+ %
600
X2 +
OPRS-411
POPULARPUBLICATIONS
= 1000
+2x, +X5
Simplex Tables:
7 as Min Ratio
a
1000
0
a 1000 2
0
1 0 600
600
1000
500
0 0
-4 -7
, 0
|
500
a,
7
a2 a
1 0
0
a Min Ratio
1000
3
a 100 0 1
200 200
500 0 1000
4 7 0
CB b a a
200 0 1
200 1
-1
400 0 0
0 3
2
Here allz,-c, 20. So, the optimality condition of simplex method is satisfied.
The optimal solution is
200,x, =400 and zMax =4x200+7x 400=3600
OPRS-42
Using Simplex method OPERATIONS RESEARCH
solve
Minimize Z=4x,+3x2, the following LPP:
MODEL QUESTION]
subjectto +2x, 28
3x+2x,212
and x,X20 by Charmes
swer:
BigMmethod.
A troducing surplus and artificial
ni Z =Maximize (-2)=-4xvariables, the problem isre-stated as
-3x, +0.x,
S.t. +0x - Mr, -
M,
x+2x,-X
3x+2x
- +X5
+x, =12
=8
where X,X, are the surplus varjables and

large number.
x,X, are the artificial variables. M is a very
Now by simplex method:
C,4 -3 0 0 -M -M
a2 as
Min
Ratio
M 8
2 4
-Ma 12 3
2 0
16
,- 4M 4M M
0
M 0 0
+4 +
C,4 -3 0
-M
Min
Ratio
4 /4 -/4 0 16
-M 5/2 /2 8/5
4 0 -1
Z-C SM 0 -M/2 M 0
+3/4
OPRS-43
POPULAR PUBLICATKONS
18/5 /10 /10

8/5 VS 2/5
C, /10 1/10
Here all 2, -C, 20. so optimality condition issatistied

Therefore. x 86
=2 and 7
TRANSPORTATION OPERATIONS RESEARCH
& ASSIGNMENT
PROBLEM
Multlple
ChoiceType
1. in most ot the transportation
9uestions
a) North-West probleme,
Corner Rule (NwCR) the nearest optimal solution
b) Vogel's APproximation isgivn
c) Stepping Stone Method Method (VAM) VBUT 2013]
d) None of these
Answer: (b)
2,Hungarian method
is applied for solution
a) Assignment problems 80lution of
WBUT 2013, 2016
c) Queuing problems D) Decision
theory related problems
Answer: (a) d) All of these
3. The assignment matrix

is always a/an
a) rectangular matrix WBUT 2014, 2016]
c) identity matrix b) square matrix
d) none of these
Answer: (5)
4. For a salesman who has to visit n

cities which of the following are the ways of
his tour plan?
WBUT 2014]
a).n! b) (n+1)!
Answer: (a)
)(-1) b) n
5. Which method in Transportation problems gives the nearest optimal

a) North-West corner rule
solution
b) Least cost method WBUT 2015]
WBUT
c)Vogal's approximation method d) Row minimum method
Answer: (c)
6. The number of Basic variables in a transportation problem is at most

WBUT 2015]
a) m+n-1 b) m+n+ c) m-n+1 d) mn+1
Answer: (a)
WBUT 2015
Hugarian method is a special type of b) Simplex method
a) LPP
c) Transportation problem d) Inventory
Answer: (6)
must be WBUT 2015
balanced assignment problem the cost matrix
ina) square b) singular
c) non singular d) none of these
Answer:
(a)
OPRS-45
WBUT
should be
transportation problem demand and supply 2015
b) not same
a) same
d) none of
these
c) both (a) and (b)
Answer: (c)
the optimistic and pessimistictima
0. In PERT the span of time between WBUT 2017
estimates of an activity is d) none of thesa
a) 3a b) 6o
c) 12
Answer:(6)
transportation problem with m-roWS and n-columns

11. The solution to a WBUT 2017
feasible if number of positive allocations is d) m+n+1
a) m+n b) mxn
c)m+n-1
Answer: (c)
WBUT 2017
12. VED analysis is applied for determining
a) slow moving items b) high value items
c) critical items d) none of these
Answer: (C)
[MODEL QUESTION
13. An assignment problem is a special type of
a) transportation problem b) LPP
c) inventory problem d) none of these
Answer: (a)
(MODEL QUESTION
14. An assignment problem can be solved by
a) Hungarian method b) VAM
c) Matrix minima method d) None of these
Answer: (a)
zeros in
15. In an assignment problem, the minimum number of lines covering all
the reduced cost matrix of order n can be [MODEL QUESTION
a) at mostn b) n+1 c)n-1 d) at least n
Answer: (a)
16. The total number of possible solutions for n*n assignment problem is always
a) n b) n-1 c)1 d) n! DMODEL QUESTION
Answer: (d)
17. Which of the following is not method to obtain the initial basic feasible solution
in transportation problem? MODEL QUESTION
a) VAM b) Least cost method
c) North-West corner method d) MODI Method
Answer: (d)
OPRS-46
RESEARCH
OPERATIONS
case of degeneracy while small

18. solving transportation proble
allocation is made in [MODEL EsTION
QUESTION
a)
non-occupied cell
b) occupled cell
c) a non-occupied cell in independent position d) none of these
Answer: (c)
transportation problem is a balanced

19. A transportation problemnE OUESTION
MODEL QUESTION
a) total demand and total supply are equal and no. of sources equals to the
no. of destinations
b)total demand equals to the total supply Irrespective of the no. of sou ce
and destinations
c)number of sources matches with the number of destinations
d the corresponding basic feasible solution is to be degenerate
Answer: (b)
The initial basic feasible solution of a transportation problem becomes

no
0 optimal if the matrix|V,J=C,I-k4+v,jhas [MODEL QUESTION
at least one negative element

a) b) at most one negative element
Answer: (a)
unbounded. ls the
21. The solution of the transportation problem is never
statement (MODEL QUESTION)
a) True b) False
Answer: (a)
TP with 4 rows and 5

22. The number of non-basic variables in the balanced MODEL QUESTION
columns is d) 20
b) 5 c) 12
a)4
Answer: (c)
MODEL QUESTION]
23.The balanced transportation problem is
where
b) Total supply < Total demand
a) Total supply> Total demand
d) none of these
c) Total supply = Total demand
Answer: (C)
Questions
Short Answer Type
five workers. The
machines (of the same type) and
1. factory there
In a are six
(i=1,2,3,..)t handle-the j th machine ( =1,
handling costs for the ith worker optimal assignment
in the form of a matrix. Find the
43,6)minimumare given below machine and find which
machine will remain
cost of handling the WBUT 2013]
ind the
unused:
OPRS47
POPULARPUBLICATIONS
M6
M M M3 M M
18
10 14
W 12 8
12
W2 14 14 8 15 17 12
13 15 6
W 9 11
11 8 14
W 9 9
12 13 10 12
Ws10 15
Answer:
we add a fiction worker
ne given problem is an unbalanced problem. To make it balance
zero cost and then apply Hungarian methods to solve it.
WIn
Subtracting the minimum element of each row from every element of that row and we
Subtracting the least element of each column of from every element of that column
zeros
get. Now we draw minimum number of horizontal and vertical line to cover all the
ne number of lines is 5 but the order of the matrix is 0. Now we suouract minimum We
element from every uncovered element and adding at the of intersection of the lines
get.
Again we draw minimum number lines to cover the zeros.
Here number of lines is equal to the order of the matrix.
Therefore, the optimal assignment is
WM,, HW,
M,,W,>M,,W,>M,,W, >M,
Minimum cost: 8+8+12+8+10=46 units
M M M, M, M M
12 8 10 1411 18
W 14 14 8 15 17 12
W 9 11 13 15 6 12
W 11 9 11 8 14
Ws |10 12 15 13 10 12
W 000 00
OPRS-48
OPERATIONS RESEARCH
4
8
2
7 1
0
0
M, M, M, M. M, M,
4
W 6 6
9
W 3
7
W. 3 1 1
0 3
W 2 5 X x
W.2 2 2 2
7
2. Five menare available to do five different jobs. From past records the
hrs) that each man time (in
takes to do each job is known and is given in the following
table. Assign each man
to ajob to get minimum time. WBUT 2014]
Man Job
Answer:
T8 9
assignment problem.
apply Hungarian method to solve the given
Her
OPRS-49
3 4 5
2 3
4 5 I2
18 4 2 6 1 17 3 1
5 0
20 2/0 9 5 5 4
9 5 5 4
313 8 9 2 6 Rowoperation 31 6 7 0 4
414 3 44 3 1
0 3
1
0 3
0
519 5 8 9 5 s4 0 3 4
12 3 4 5
No. of straight lines

= order
17-95-4| 5. So
20-9-4S4| of the matrix =
Column operation319 optimality condition is
6-644| satisfied and we can assign
443--43 the jobs in the final table as
follows:
1 2 3 4 5
17 3 5 So the required assignment is

and
29 4 5 4 15,2»1,34, 43, 5-2
39 6 6
minimum time= 1+0+2+1+5 9 hrs.
4
44 3 8
54 0 2 4
3. Solve the Assignment problem: WBUT 2015

D1 D2 D33
D4
J1 8 26
1711
2 13 4 26 28
J3 28 1918 155
J4 19 26 24 10
Answerr:
D D2 D D
J8 26 17|11|
0149 3
13 284 26
Row
operation 9 24
0 22
J328 19 18 15 13 4|3 0
J19 26 24 10
9 16 14 0
OPERATIONS RESEARCH
Column
operation
Her
fere no.of
So we can straight lines= order of the matrix.
assign in this
stage.
D D2
D D
J 10 10993 So the required
assignmentis
J 9 20
22 D, J, ->D,, J, ->D2, J,D,
Js13 3
J9 12| 14
4. Explain how an assignment
problem can
be solved as a transportation
Answer: problem.
The assignment WBUT 2016]
problem becomes
variabfes is relaxed.a linear programming problem when
restriction on the
problem is unimodular In fact, the coefficient the 0-I
and therefore, we matrix of the assignment
linear programming can relax the 0-1 restriction
problem to get the optimal and solve it as a
rarely solved using solution.
the simplex algorithm But assignment
problem faster and
more efficiently. but have special algorithms problems are
that solve the
You may also have
transportation problem
observed by now that the
assignment problem is
since the objective functions similar to the
matrix. The first
difference however, is that are similar and so is
the assignment problem the coefficient
equal number of rows (resources) has a square matrix
can have unequal and columns (tasks)] while
number of supply and demand points. the transportation problem
what we do if the Later in this chapter, we
assignment problem is not square will see
The assignment
problem is a special case of the transportation
a, =l
and all b, = 1. We do not solve problem with m= n, all
the assignment problem using the transportation
algorithm because it is
a degenerate transportation problem. We have
degenerate LP problems and transportation already seen that
and take problems may require additional iterations
long time to reach optimality.
A feasible
solution to the nxn assignment problem has exactly n assignments
LP formulation while the
has n decision variables and 2n constraints. Out of the 2n
ere are 2n-1 basic variables because the coefficient matrix constraints
represents a
pendent system of equations. Since the assignment solution has n allocationslinearly
der
out of
2n-1 basic variables, it means thatn-1 basic variables take value "0' indicating
a racy.
s a linear Hence assignment problem is neither solved as a transportation problem not
programming problem.
OPRS-51
POPULARPUBLICATIONS
solution of the
t
5. By North-Westco method, find a basic feasible WBUT gven
transportation problem: 2017
Destination
BB,B,| B
42 11 10 3
Source 4| 1
47 4
2
8
5
A 3 9
34 5
Answer:
According to North-West corner method:
B B2 Bs B4
Az
A 4
bi 4
Bs B4
10
B3 B4
As
OPRS-52
OPERATIONS RESEARCH
Ba
So initial basic feasible solution

is
=3, Ka =5, A =4, =1, z=4
and corresponding cost is
2x3+11x3+7x4+2x1+8x4=
99
6.Prove that, the balance transportation
problem always has a feasible
solution
Answer: ODEL QUESTION
Let 24-26,-T(say)
i=
Consider the solution
y -20 fori 1,2,..,m&j =1,2,...
then,
=
2,=a, fori =1,2

j=l
Similarly,= ",
2,=b,, forj = 1,2,.,

i=
Therefore, solution
solution.
x, = , satisfies all the constraints. Hence it is
a feasible
. Solve the assignment problem given below for minimum cost

[MODEL QUESTION
OPRS-53
Men A B
C D
Machine
M 18 26 17 11
26
M2
13 28 14 15
Ma 38 1918
Answer: M 19 26 | 24 10
A B C D
Mi 18 26 17 11
M2 |13 28 14 26
115
M3 38 19 18
M4 19 26 24 100
Here, order of the matrix n = 4
Step 1: After Row Operation
B D
MM2 15
|13
15
M3
23 4
M4 9 16 14 0
Step 2: After Column Operation
B C D
A
M7 11 5 0
M 011|UTT
M 23-0-2-1
M 9 12 13 O
The minimum number of lines that covers all the zeros is N=3>N =3 <n =4
Hence optimal condition is not satisfied.
Step 3:
Minimum of the uncovered elements is 5. Subtract from each of the uncovered element
and add 5 to each of elements which is covered by both horizontal
and vertical lines and
other elements left unchanged.
B D
M
M2
Ms -23
185
M4
Step 4:
Now, N=n= 4, hence optimality condition is satisfied
and optimal assignment is MiCi
MA;M3->B and M4>D.
Minimum cast = 17+13+19+10 59.
OPRS-54
8. Prove that the number
(m+n-1). of basic OPERATIONS RESEARCH
varlablee
ADs
H
denote the
warehouses
na
In a tranaportation
transpor
problem s
., .Let
n. Let xy be the
t amount as W, and [MODEL QUESTION]
of a certainmarketbyM.
fow at W; and the total intlow product for i = 1,
supplied
.....,
2, m andj=1,2,
from
rom W, to M;,
atM are respectively W, o Then the total
for a balanced T.P. x, andx and, u
a,, i =1,2,...,
j=|
m,.)
and
X=b
i=l
j=12,.
Also sincee
the supplies
Xi, in order
x20 for alli and J and the to be feasible,
total cost Transportation should be non-negative
of i.e.,
1e
(which has
Minimize Z = to minimize) 1s
J=l
Moreover, we have
(4)
Rewriting, we
get
Minimize Z =
subject to constraints
2x a,; i =12,.
)
2,-b j=1,2
S-
i=l ja
and
in the
x20
above formulation the T.P., we have m x
of n cost coefticients
Ci m * n variables
and (m +n) linear equations (as
in (). Due to une presence ot (6), all
r equations in (5) are not linearly independent. Oniy
linearly independent. So, this situation dictates us (m*n-1)
the (m +n)
re that out
liear equations in
ofm *n variables x
n n-1) variables xij, at most should be basic variables and remaining mn-(m+
n-1) variables should non-basic variable for a T.P.
be
OPRS-55
can it be solved? Illustrate

an unbalanced transportation problem? How MODEL QUESTION
Answer: from the

total supply from
It is obvious that the market demands can be met if and only if the
th
warehouses is at least equal to the total demand at the markets, ie. 2 bWhen
markets i.e.,
all markets
the total supply from the warehouses met exactly total demand of
ie
as balance transportation
Eo-,,
i=l
J=
then the transportation problem is known
problem.
Now if, ie, a,, theT.P. becomes unbalanced.
In physical sense, if 4>6,, there would be surplus left at the warehouses after all
the markets' demand met, and if a <,, there would be deficit at the warehouses to
meet all the markets' demand. Problems involving surpluses and deficit are very common
and significant in practical life. These type of problems-to be posed properly to have
feasible solutions after introducing artificial market / warehouse as required to make it
balanced T.P.
10. Explain the concept of degeneracy in transportation problem.

[MODEL QUESTION
Answer:
Degeneracy
A basic feasible solution (B.F.S.) of a transportation problem, is said to be degenerate
if
one or more basic variables assume zero value an initial solution could become
degenerate whenever the remaining supply and demand are
of equal amount for a
variable selected as the next basic variable.
11. Find the initial basic feasible solution

of the Transportation problem given
below:
MODEL QUESTION]
41Availabillity
1 2 1
30
3 3 2 1 50
4 2 5 9 20
Demand 20 40 30 10
Using () North-West Corner Rule and
compare the results obtained. Test (i) Vogel's approximation method and
the optimality of the two solutions.
Answer:
) Initial B.F.S by North- West Corner method
OPRS-56
QPERATIONS RESEARCH
20
la
4
30 30
20
3
O 2
2
0 10
S0
The T.P. is a balance 20 40 9 20

T.P 30 10
Here m=3, n=4 :.mtn-1=3+4-1= 100
The 1.B.F.S.
is xi20, Xi=10, 6
Valueof x2-30, x=20, xy=10 and
Z=-lx20+2x10+3x30+2x20+5x10+9x10=310 xyF10
Optimality lest: Set
u=0.
D
20 D Ju
2
30 20
4
u0
2 u1
2 10 10
5 9 u3 4
V Vl y=2 V1 V5
Cell evaluation A, for non-basic cells:
AsC13-(4 +v3)=1-(0+1)=0
A4 C4(44
+v^)=4-(0+5)=-1<0
A2 C21(42 +")=3-(1+1) =1
Au Cu-(42 +v,)=1-(1+5)=-5<0
AC31-(4, +)=4-(4+1)=-1<0
Ay =Cn -(u +V2)=2-(4+2)=4<0
Hence the I.B.F.S (obtained by N-W corner method is not an optimal solution.
LB.F.S. by VAM-method: Using the idea of penalty, we get the I.B.F.S. as in the table
below:
Di D D3 DA
20 10 30
O 20 10
20 50
O2 2 10
2 20
Os
100
20 40 30
OPRS-57
POPULARPUBLICATIONS
The I.B.F.S. by VAM

is
X20,x1 = 10,x22 = 20,x2 20,
X2410and x32 20 and Z180.=
Optimality Test:
Set ;u=0.
Cell evaluation
for non- basic cells;
i2Ci (4
+v2)=2-(0+2)=0 A=C1-(u3 +",)=4-(0+1)=3
uCu(4 +va)=4-(0+0) =4 ACg3-(43 +V,)=5-+1)=4
A2C21(u2 +v)=3-(1+1)=1 Au =Cu -(4 + V4) =9-(0+0)=9
ence all A,20 for the non-basic
cells, therefore, the I.B.F.S. is an optimal solution and
Min Z= 20x1+10 x 1+20 x 3 + 20
x 2+ 10 x 1+20 x 2= 180
Comparing the results we conclude that VAM method is a rapid
converging method,
12. The following
data are given:
The cost of shipment
from third source to third destination is not know. How
units should be transported from many
transporting all the units to source to destination so that the total cost of
Answer
their destinations is minimum? MODEL QUESTION]
Since the cost C33 is known,
assign
VAM, we get initial basic feasible a large cost, say M> 0, to the cell (3, 3). Now, using
solution as:
X=10,x =
15,x =
20,x =15,x3 -5,
Using MODI method,
it can be shown that A =Cy-(4,
Hence the above I.B.F.S +Vy20, for all the cels.
is an optimal solution.
Note: It is to be noted that
the cell (3, 3) also appears in the
cost of shipment is not above solution for which
known. Hence, above optimal the
optimal basic feasible solution. solution is known as pseudo
13. Find the basic

feasible solution of the following transportation
North-West Corner rule. problem by
MODEL QUESTION
A Supply
B 12
C 3 14
Demand | 9 10
11
OPRS-58
OPERATIONS RESEARCH
Answer:
Q
A R Supply
B
s9 1 3 8
C
7 7
3 4
6
Demand o
hasic feasible solution by North-West corner 30
X9, 2 =3, *2 method (rule):
=7, Xz
=7 and x, =
4.
14. There are three A, Y and Z
D and D4. The production which supply goods
to
oer month capacities of these factoriesfour
respectively. The requirements
different dealers Di, D2
are 1000, 700 and 900 units
400 units per
month from the dealers are 900, 800, 500 ano
transport to the dealersrespectively. The profit matrix at the factories for
problem:
are given below (in
Rs.). Find optimal solution unt
[MODEL QUESTION
tne ot
4
5
Answer:
6 8
First, we convert maximization problem
to a minimization problem by subtracting all
unit profits from the largest unit profit the
Rs. 8 and solve this minimization problem
VAM using
D D D D4 Capacity au
X 200 800
.2 1000
Y 700
700 u2
2
z 500 400 900
Demandd
3 2 -1
900 800 500 400 2600
sbi
This is a balanced
V=2 V22 va-2 V4=1| D
a, = 2600
T.P. 2)
Using VAM, we
find I.B.F.S. as
200,x12 =800, x2 =700,x3 =500& *u =400
nch is degenerate solution (m+n-1=3+4-I5 6).
OPRS-59
Setting u = 0, we find values of values of v3, V4 and uj. If we

e allocate
vi V2, u but not e
)in the cell (1, 3) we find v 2, u=-I and v
Optimality test:
Au 4-0+1)=3 Au3-2+1)=0
Az =6-2+2)=2 A=3--1+2)=2
A 4-(2+2)=0 Ay =2-(-1+2)=
1
Hence, A 20 for all non-basic cells.,

Optimal supply is
X-200 10nitsD. &X-0 TsD,
Y- 700 units
D
Z 500 unitsD, &Z- D4
Max Z Rs.(6x 200+6x 800 + 4x 700 + 7x 500+8x 400)= Rs.15500.
15. Solve the following assignment problem using Hungarian method

[MODEL QUESTION
Machines
M M2
|M | M
J 46 3
9| 7 10 9
Answer:
J8
Step : (Row operation)
We subtract least element of each row from each element of that row (for each row).
Step II: (Column operation)
Performing similar operations for each column, we get the modified matrix as
(Table 1)
M1 M2 M3 M4
JI
03 2
J2
33 0 20-0-
4 3
3 2-9-
I Table -1
Step Il1: (Optimality test)
Now, we draw minimum numbers of lines to cover all
the zeros (see Table 1). Order of
-
the matrix n= 4. Since, minimum numbers of lines N = 3

not satisfied. Now, we select the minimum element 1
<n=4, optimality criterion is
of the uncovered elements of the
Table and subtract it from each of the uncovered elements
1
and add1 to those elements

only which are crossed by both horizontal
and vertical lines and construct the (Table 2) -
for optimality testing.
OPRS-60
OPERATIONS RESEARCH
MI M2 M3
J1 M4
2
32
1
J3 J2
J4
N 4;therefore
HereNa
therefor n=N=4 and Table-2
(Assignment) the optimality
condition
Sep IV: is satistied.
on is satisfied.
J M1,
J M,J
M, and
imum cost
Minimum cost (forthis assignment) =
1
+10+5+5=21
J M
16Find the initial basic feasible solution

hy North-West Corner method: of the following transp
sportation problem
[MODEL QUESTION
W W
F Fa
10
70 30
50 10
Capacity
40 60 9
Fs 40 70 20
Requirement: 5 18
14
Answer:
Initial basic feasible solution by North-West Comer method:
5, =2, A =6, =3, 4, =4, z =14

1. Find the initial solution to the following Transportation problem using VAM:
WBUT 2013]
Destination
DDD,D Supply
100
125
32 75
Demand
F 120 80 75 25 300
OPRS-61
Answer:
Using VAM we obtain,
D4
D D D3
F
100 / 100 100 X
(2)
4 (2)
BoV45 125 45 45
X
77/
20 30 20
2 (2)
75
(2)
75
(2)
75
(2)
55 55
F 32 (1) (1) (1) (1) (1)
120 80 75 25
2()(0_()_
120 75 25
X
(2) () ()
20 75 25
(3) () 0)
X
75 25
()_ 0)
30 25
(3) (0)
Here the number of allocations is 6(=m+n-1)
x2 80, x 45, x = 20, X=30, 4=20.
So the initial solution is X =100, =
Corresponding cost=100x 3+80x2+45x4+20x1+30x3+20x 2

790 units.
2. A steel company has three open hearth furnaces and five rolling
mills.
Transportation cost (Rs. per quintal) for shipping steel from
mills are shown in the following table. What is the optimal furnaces to rolling
shipping schedule?
M M M M Ms
WBUT 2014]
Capacity
3 2
in quintals
3
12
Requirement 14
4
Answer:
Given problem is an unbalanced problem,
at first to balance it we
fictitious column M, Wth zero cost have to add one
Then to solve we apply VAM:
OPRS-62
QPERATIONS RESEARCEH
M M2 M M Ms M,
Ms a,
82)80)8O)| 4(1)4(1)
AAAY 12(1 12(1 4(2) 4(3)
4 6
4 % 14(3 10(1|10(110(2) 10(2)
by 4 4
3
(1) (2) (1) (0) (2) (0)
4 4 6 8 8
(1) (2 () (0) 2)
4 4 6 8 X
(2) () (0)
4 X 6 8
() (0)
4 6
(2) () (5)
So theinitial feasible solution is
2 4, K«4, *4, *zs 8, X5=4, =6, z=4.
We see that no. of allocations is 7 while
m+n-1=3+6-1 =8.
Thus the problem is degenerated
To complete the basis, we allocate a very small positive quantity e in (1,1) such that
this does not form a loop among some or
all of the occupied cells and make them
independent. To test the current basic solution for optimality, we calculate «, and v, and
then the cell evaluation for non-basic cells as
in the following table:
M M M M Ms M 4,
0
2 6
F 0
4 5 2
2
F
2 2 2
Allthe cell\ev hence the optimal solution is
evaluations are pesitive and
andthe2,
nd 444, zu=4, s =8, z1=4, 4 6
theansportation =80 (Rs.)
transp cost =4x2+4x2+4x2+8xl+4x6+6x4+4x0
OPRS-63
POPULARPUBLICATIONS
3. The warehouse acities a, market demands b and the unit cost ofWBUT
shippln
201
are given in the following table
M M
W 2
W2 10
Ws 15
Find the optimum solution for the problem.

Answer:
Here we apply VAM as follows:
MA
Mi M
MM
W 3(1x
W2 B/4
/10/s75/4 7(1 7(1) 3(3)x
5(0) 5(0) 5(0)| S(0)

74
6
3
68
4 4
(5) (4) 3)
) (23 (1)_ *
1
(7) (6) (6)

So initial basic solution is =3, 4, =1, X =3,
=3, X
and the coresponding cost=2x3+3x5+4x4+1x7+3x6+1x6=68
z
Optimality Test:
-5
2
2
10 -1
3 6 8 4 =0
7 Here alf 20,
6 6
so optimality condition is satisfied.
Hence the optimal solution is
3, *=3, =4, 11, 2 =3, x =1
OPRS-64
OPERATIONS RESEARCH
optimal shipping charge is
and the
and 68 units.
y is producing a
A.A in different cities. single product and is selling
All of a sudden, rough five agencies
it through
nother five cities not having any agency there is a demand for fiveduct
he pro in
pro
oroblem of dealing on how to of the company. The compa tn is faced
th the
with
roduct to edy
need cities in assign
such a way that the exiating agencies to o atch the
prbetween the surplus and deficit
kms) the travelling dista ed (in
cities. details
distance matrix. The are given in the to wing
Deficit Cities WBUT 2015]
Surplus Cities- I IV
160 130
135 120 175 190 200
140 110 130 175
160
155 170 185
50 50 80 80 110
55 35 105 | 70 80
Answer:
To solve the given assignment problem,
we apply Hungarian method as follows:
I II III IV V
A 160 130 175 190 200 30 60 70
0 45
B 135 120 130 160 175 15 10 40 55
Row
Operationn
C 140 110 155 170 185 30 45 60 75
D 50 50 80 80 110 30 30 60
45
E
55 35 70 80 105 20 0 35 70
30
35 30 15 Here no. of straight lines = 3<5
10 (order of the matrix)
So optimality condition is not satisfied.
Column
operation
30 35 30 20
20 0 05
20 | 25
15 15
Now subtract minimum most élement among all coyered elements from each element and
add at the point of intersections.
05
OPRS-65
Here no. of straight lines =5 = order of the matrix

So, we can assign in this matrix as follows
II IV
15b
A15X20
B
15 15 10 X
05
C 150 20 15
05
D 15 20
E 05 10
Hence the required assignment is

AV, B>I1, C> II, D->1, E->IV
and min. travelling distance (is km) is
200+130+110+50+80 570
. Four different jobs can be done on four different machines and the take-down
time costs are prohibitively high for change over. The matrix below gives the cost
in rupees for producing job i on the machine j. WBUT 2016)
Jobs Machines
M M M, M
7 11
10
10 8 3
Answer:
It is an assignment problem. We have to assign
4 jobs among 4 machines optimally.
Mi M2
M M4
Mi M M M4
11
6 1
Row
operation 3
7 10 7
J 0 3
10 4 8 3
J
Column J2
operation
M
. Ma
2
Ma
6
M4
1 Here the minimum

number of straight lines
required to cover all the
zero is 3 < order of the
matrix. So optimality condition
3 3 is not satisfied.
Now we subtract the minimum
most element from
all the uncovered elements
and add with the
elements at the points intersection.
of
OPRS-66
OPERATIONS RESEARCH
M M Ms
M
J
Here also
J no. of straight lines
require to cover
all the zeros is
Js 2 3< order of
1 the matrix. So
optimality condition
satisfied. We is not
follow the same
procedure again.
Mi M M M
Here no. of straight
lines = 4
order of the
matrix. So
optimality condition is
satisfied. Now we can
assign
the jobs among the machines in
the last matrix as follows:
Mi M2 M3 M4
J XRequired assignment is
5
or,
M M, },>M, J>M,
2 1 M3. JM,, J,>M,, J,>M,
or, M,,M,. Jy->M1, J,M,
& x or,
M, JMg. J> M, J>M,
Or, M,. M, J,>M, J>M,
Or, M2, JaM,, J,>M,, J,> M,
6 Apply Vogel's approximation method to find the optimal transportation cost for
the following WBUT 2016]
problem:
Destination
Supply
|
D D,| D,D,
19 30 50 10
Factory
70 30 40 60
9
40 8 40 20 18
d5 87 34
14
Demand
OPRS-67
Answer:
Here we use VAM:
D D D Da di
2 (40) 2 (40)
7 (9) 7 (9)
O 19 30 i0 10
9 (20) 9 (20) 9 (20) 9 (20)

O 9 (10)
70 30 40 60
0
10 (50)
40 70
18
20
18 (12) 10 (20)
b 5 14
(21) (22) (10) (10)
14
(21) (10) (10)
14
(10) (10)
7 4
(10) (50)
2
(40) (60)
So, the initial basic solution is

5,=2, 2, X27, =2, *8, X =10
Corresponding cost=5x19+2x 10+7x 40+2x60+8x8+10x
a
20 779
Optimality Test (using u-v method)
7 10
19 30 S0 10
70 30 40 60 60
40 8 70
8 20
20
b 5 8 7 14
y +9 -12 -20 0
OPRS-68
OPERATIONS RESEARCH
Adjustingt allocation from X2 iS X22
We get,
30 50
0
70 9
30 40 60
32
40 8 70
18 10
20
b 5 8 7 14
Vj 19 2 10
A =Cy-(4 +") which are given

sdare all within the circles in each of the non-
H
lecated cells. Since all A, 20,so the optimality condition is satisfied.
allocate
Hence the optimal solution

is
5, u2, *z =7, Xp =8, =10 x
and min. cost= 5x19+2x10+2x30+7x40+8x8+ 10x 20 719.
1 Find the initial solution for the following transportation problem using VAM and
check for optimality: [MODEL QUESTION]
Destination
Supply
5
Source
IV 14
Demand
|
7 18 34
Answer:
Initial basic feasible solution by VAM
=10).
5, x23 =8, x =7, x4 =2, * =2,*
OPRS-69
Optimality test:
A B C
2
II u, =-2
3
8
3
III 4-3
IV 4,-1
6 2
2
=2 =7 3
A =Ca-(4 +,)=7-(0+7)=0
AC-(4 +,)=4-(0+3)=1>0
ACa-(4, +%)=3-(-2+2)=3>0
Aa C-(u, +v,)=3-(-2+7)=-2<0
AC-(4, +v)=5-(-3+2)=6>0
A7-(-3+3)=7>0
Hence the solution
5, X» =8, Xz2 =7, X =2, =2, Xa =10, is not an optimal solution.
Value of z =5x2+8x1+7x4+2x1+2x6+10x2
= 10+8+ 28+2+12+
20 80 units.
8. Assign the jobs to the four machinist for the profit

matrix given below:
[MODEL QUESTIO
62 50 101 8
71 |84 61 | 73 59
87 92 111 71 81
IV 48 64 87 7
Answer: 80
ID, II>B, Il-C, IV >E
Max. profit=376 units.
OPRS-700
profit matrix
n ,] for this problem OPERATIONS RESEARCH
The
and
numbe of column
n=5. This type
is not a square
matrix.Here
Assignmeni problem of assignment number rows m 4
uen I: (Dummy rows) problem
sep is kn
known as Unbalanced
a we
First of Aummy
make it balanced by adding
roWs are du rows 1.e., A and Y two dummy
are two dummy rows (see Table - 1; 5h
machines) 1, and 6
A
A B C D IE
B 62
71 9
78 50 101
C 7184 82
D
87
92 61|7359
| 111 71
X 48 64 | 87 77
81
80
0 0 0
Table-1 00
en J1: (From maximization problem
T change this profit to minimization
matrix to a problem)
maximum element loss matrix, we subtract
11l and rewriting (see each element from the
Table 2)
J1
A J2 33 J4 J5
B
49|33 61 10 29
40 27 | 38 52
50
C 24 190 40 30
D 63
47 24
X O 0O 343100
Step 111: (Row operation)
Table-2
After subtracting least element,
for each row from each element of that row.
A B D E
39 2351 0 19
II 13 0 23 11 25
III 24 19 040 30
IV 39 230 10
0000
Table-3
Step IV:
(Column operation)
r operations are performed for the entire column, we get Table -3.
I 39 23|1|25
II 13
III 24 030
IV 39 7
V
Table-4
OPRS-71
POPULARPUBLICATIONS
Step V: (Optimality test)

Now -
W,We draw minimum number of lines to cover all the zeros of Table 3. We get m. m=
ofthe matrix). Hence, optimality condition is not satisfied. The
order minimu
he minimun
of all the uncrossed elements (see Table 3) is 1. Subtract from each of theuncrossed
-
I
elements and add 1

to all the double crossed elements and put the single crossedeelements
unchanged (see Table-4)
A B E12
II 6 18
B
III
IV 1723
32
1L40 23
0 0
V
Since, all the rows and columns have at least one zero, we draw minimum
number of
lines (both horizontal and vertical) covering all the zeros
and test the optimality
Conaition. Since m= 5 and n = 5, i.e., N=n=6,
the optimality condiion is satisfied.
A BC D E
I
32 23S1 012
II
02319040 23 11 | 18
II 17 23
IV 230
32 10 0
Step Vl: (Assignment)
000 0 0
ID, II>B, II->C, IV>E; Max. profit= 376 units.
9. Solve the transportation problem and checking the
solution optimality, find the optimal
[MODEL QUESTIONJ
O1 D3
O2 10
0 13
Os
Answer:
12
Optimal solution:
x, =5, *4=5, 2=4, x2 =8, x24 =1 and x =12
Minimum cost of transportation
=23.
Herea =l10+ 13+ 12=35butb, =8+5+4=17 a,>
indicates that to make it a balanced
T.P,, we have to create
b,.
The problem
with demandb, =
a,
with heading D4. We use
-26,
an artificial destinationD
=35-17=18. So, we also have created
the 4 column
unit transportation
suggested by Goyel) for the cells cost as the maximum unit cost 8
of 4" column.
OPRS-72
OPERATIONS RESEARCH
D D2
D
D
O 5
3 2 u
O2 8 4
10 =0
S 0 13
Os 12
3
3 12
8 6 ug0
b 18
V1 V2=3 |
Va=0V=8
35
Table
1
Assume, c14C24 C348
ngVAM,
Using VAM we get I.B.F.S. as,
X2 S, X14 =5, X21 =8, X23
4,* X24 x34 1=12
mality test: (for all non-basic cells): =land
=l and X34
After finding allu's and v's, we calculate (see
Table 1)
A C(4+)=4-(0+1)=3
Ay
C4
Az2 C-(42
+",)=2-(0+0)=2
+v)=5-(0+3)=2
A C4 +)=3-0+1)=2
Ag2Cg2-(4, + v,)=8-(0+3)=5
As C-(4, +",)=6-(0+0)=6
Since all Aj>0 for all non-basic cells, optimality conditions are satisfied and optimal
solution is
X25, X2=8, X2 4 and

Min.Z= 3x5+1x8+0x4=23.
Note (: We will not consider optimal solution components relating to 4h column,
because the 4 column is artificially introduced to make the prohlem as a balanced T.P.
Nofe (i): Tf we solve the problem with c14
C24 C34=0, and use VAM to find
LB.F.S., we get I.B.F.S. as
4,46,*2 =1,X23 4,X2 8and xu =12,

nota optimal solution because Au-2 <0. (setting u = 0).
ch 1S
To find optimai
solution, we have to form a loop with the cells (2, 4), (1, 4), (1, 2) and
4The cell (2, 4) will be introduced as a basjc cell replacing the cell (2, 2) from the
basic cells. 4+1 6-1
(1,2) (1,4)
(2,4)
(2,2)
1-1
OPRS-73
we get optimal solution as, x,, = 5, x,, = 5, x2 = 4,x21=8,

X24 =land xz4 =12
which is obtained carlier).
verified that dummy cells with largest.
argest
Nofe (ii): So, claim of Prof. S. K. Goyal is unit
cOst provide us a better starting solution with VAM.
Whena, <2b,
The problem in which total demand of the markets
(M,) exceeds the total supply fromthe
th.
warehouses (W), may also be posed as following:
MinZ 2 2x, subjectto
2x a,;i = 1,2...m
a,
2, sb,;j=1,2. . ..
m
amd x, 20
i=l J=l
The actual supply from the warehouses (W, I= 1, 2, .
m) fails to meetthe maket
demands. This type of problems are solved by introducing a artificial row (i.e., with a
artificial/dummy warehouse) with a storage a b, -2a >0, to make the problem
j=
a balanced T.P.
Now, the number of warehouse becomes (m + 1) but the number of markets remains n
Unit costs of the (m + 1th row may be considered the largest unit cost of the actual
problem or zero.
Optimal solution: x\, =5, =5, I=4, X = Xzu =1 and x = 12
8,
Minimum cost of transportation = 23.
10. Solve the following assignment problem: [MODEL QUESTION]

Job
1
5 11 16
13 16 1 10
Man 16 11 3 3 8
E 9
10
113 12
11
10 16
3 16
Answer:
After row operation the matrix takes the form
Order ofthe matrix = n
=5> N=4 (minimum number oflines).
Minimum uncovered element is 3. Subtract 3
from each of the uncovered elemenS a d
add 3 to each of the crossed elements
and put other elements unchanged
OPRS-74
2 3
4 5
OPERATIONS RESEARCH
8
---0--
12 15 9
C
D
-3-0
3
E
5 3
8
12 3 4
5
A-F
B 9
-9-t
c- D dx 2
C
6
E
i 4
2
Ootimal assignments :
A+2,B>1,C>5,D3,E4
or
A-2,B4,C-> 5,D >1,E >3
Minimum cost= 34 units.
11. Solve the following balanced Transformation problem: MODEL QUESTION
D D D1 DA Capacity
F1 2
F2
F3 10
Requirement
Answer:
This is a balanced transportation problem. Initial B.F.S. by Vogel's approximation
method.
D, D DA
s
2 3 11
Here m+n-1 =3+4-1=6.

is non-degenerate
IHencethe L.B.F.S.
9
15
OPRS-75
For the optimality test, et u = 0 and write all the cell evaluations A, = Cy( v,in
the circles (for non-basic cells).
D D2 D3 D4 u
Fi
11
u-5
F u 3
15
VV-2 V3V 12 V6
we choose A21=C3 -(u,+v,) =6-(6+12) =6-7--1<0, as the intering cell is the
basis. The cell to be removed from the basis is shown below. We form a loop which
includes the cell (2, 3).
0+1 1-1
(2,3) (2,4)
3-3) (3.4) +1
From the above, it is clear that the cell (2, 3) enter into the new basis and the cell (2, 4)
leaves the basis.
D D D D
F 11|
u-0
(+3
F2
u
F
5 15
2 9
u3
V-V2 V=3 V=12| V4F6 |
0+1
(1.1) (1,3)
(3, 1)
(3,32-1
6+1
OPRS-76
OPERATIONS RESEARCH
0
= ACp -(4, +V,) =11-(12+0) =
-1<0
Let
D Da D
F
11 0
F 6
F
8
2 15 u4
V-VV-1V3 V1Vs
Let u = 0
Since allthe A, 20, the optimality conditions are satisfied.
Optimal solution: X12 =3,¥13 =1,X23 =1,x31=7,x33 =1 and
x4 =2
min Z= 5x3+1xl1+1x6+7x5+1x15+2x9=|100
12. Find the optimal assignments to find the minimum cost for the assignment
following cost matrix: MODEL QUESTION]
J1 J2 J3
12 24 15
P2 23 18 24
P3 30 14 28
Answer:
After row and column operations
P 15 0x
P2
Uptimal Assignment P->J,, B+J, and R
in. assignment cost =12+ 24+14 50]
VAM and find out the optimal
13.
So ve the following transportation problem by- [MODEL QUESTION
solution:
OPRS-77
n=N=4,0Optinalitity condition
satisfied
1C,2A,3-> B
and 4 D. Min cost = 59
15. Find by North-West Corner method the initial basic feasible solution of the
Tollowing transportation problem. Also find the optimal solution of the resultina
MODELQUESTION
degenerate transportation problem.
D Da Da
O 7 3 4
2 1 3
Os
Answer:
Step I: (L.B.F.S.)
Initial basic feasible solution by North-West corner method:
Here, n+ m-1=3+3-1=5 but non-zero components of the I.B.F.S. is 4. Hence, the

solution is degenerate.
Step I1: (Optimality test)

To make non-degenerate, we putx2 =€ (0), is very small number.
Di D2 D3
a 4,
O1 =0
O 3
42-5
Os 4-2
3 5
b,
K1o
V =6 V, =8
Set u= 0;
Cell evaluation for non-basic cells
A Ca-4, +v,)=3-(0+6)=-3
Similarly, A,=-4; A-2 and A =0;
Though A = 4 is the most negative we use cell (3, 1) to get better result.
OPRS-80
OPERATIONS RESEARCH
Loop formation
p I1: 2-2
(2,1) 2+
(2,3)
3.1)
0+2 3,3
(new solution its optimality 5-2
StepIV: testing)
D D D
O1
2 a u,
, =0
2tE
Os 2T 3
3 3
4 4
6 5
b,
=7
4
, =8
=10
Set u = 0, 2-2 0+2
For non-basic cells: (1,1) (1,3
Ap- As-6; A2 =2; Ag =0
So, the cell now enter in the basic cell.
Step V: (loop formation) (3.1) (3,3
Step V1: (New solution and optimality testing) 2+2 3-1
D
,
Da D3
a
O 2
2
=0
O 2+E -1
3 3
Os 4 3
32
6
Cell evaluation
b,
, 4
' 2 4
for non-basic cells =
=6>0; A 1>0; A2 =2>0 and Ay, 0
Hence,
optimal solutionis
2, X22
=lx =2;x,1 =4 and x (making€0)
=1
OPRS-81
POPULARPUBLICATIONS
problem has alternas

um Cost of transportation is 33 (since A,n = 0, thi native
optimal solution).
16. Acompany has three plants at locations A, B andC which supply

are 800, 500
warehouses located at D, E, É. G and H. Monthly plant capacities an
900 units respectively. Monthly warehouse requirements are 400, 400, 500, 400
oUunits respectively. Unit transportation costs (in Rupees) are given in
TOllowing table. Determine an optimal distribution for the company in ordero
ODEL QUESTIONN
minimize the total transportation cost.
TO
From
B
C
Answer:
It is a unbalanced Transportation Problem (T.P.). Za,=2200<b=2500. Using an
dummy plant P, we make this problem a balanced T.P. with all zero transportation costs
for thus dummy plant P.
I.B.F.S. by Vam: Ware houses
D E F G H
A 500 300 4-2

Plants
B 400 100
C 400 500 43-1
0 300 u4-6
0
8 V46 Vs5
(Table 1)
Here, m
+n-1=4+5-1=8> no. of basic cells (7).
So, we introduce at the cell (2,5) a small non-zero amount e >0 to remove degeneracy
of L.B.F.S. (see table 1).
This solution is not an optimal solution. We make the loop and get
the table 2.
500-E
(1,3) (1, 5
300+E
2,4)
100+E
.)-E
4,3 4,4)
0+E 300-E
OPRS-82
QPERATIONS RESEARCH
D E
G H
A 500-E
300+E O
400 3
B 7 100+E
8
400
C 6 500
= 1
P o300-E O -6
Vi4 V25 - 8
V4 =6 Vs 5
. colution is also not an optimal solution proceeding
in this way, we get op
.
solution as
6, s
800+6, *a400, =100+, x
K 400, X33 = 200-6, X34= 300-, x 300
Naw, making&>0, we gét optimal solution
=
K 0, is =800, Xz1 400, * =100, x =400
200,
33
X34300 and X 300 and minimum transportation cost Rs.9200/-
47. Determine the initial basic feasible solution of the following:

[MODEL QUESTIONJ
Destinations
Sources 60
9 70
3b 11
50
3 80
80 80
Also verify, whether the solution is optimal or not.
Answer:
Using VAM, we get a degenerate basic feasible solution (as a initial basic feasible
Solution): xi3 = 60, x = 50, x23 20 and x32 80.
Here, m = 3, n = 3m+n-1=3+3-1 5, which indicates the solution is degenerate
solution.
D2 D3
D
60 u 0
Oi
50 20
O2 3
u26
Os
80 U3-4
111 3
Vj VI-3|=7.Vs3
Table
OPRS-833
Set u= 0
Optimality test: Aj=0, for the basic cells.
his gives us, u +V^ = 3;u,
+V, = 9;u, + v, = 3&u, V3 3.
t+
Setting u0, we cannot find the values of all other 5 unknown u's and v's."This is
is due
due
appearance of degeneracy in the 1.B.F.S. What cell will represent the S" componento
of
the basic cel1?
o overcome this problem, we tactically allocate a small amount & to a cell such
that this cell and other basic cells does not form, in any way, a loop. With this view in
mind, we allocate e amount in the cell (1, 2) (see Table) and this gives V2 */ and ug 4 .
So, all the values ofu's and v's are now known.
Now, we calculate A for all non-basic cells.
AC-4 +y)=11>0
A C-(, +»)=-5 <0
AC-u, +)=18>0 and
Ags C3-(4, +V3)=6>0
Hence, the I.B.F.S.
18. In a textile sales emporium, 4 salesman A, B, C, D are available to 4 counter W,

X, Y, Z Each salesman can handle any counter. How the salesman should be
allotted the appropriate counter so as to minimize the service time from the
following problem?? [MODEL QUESTION]
C
W 41 2 39 52
22 29 49 65
39 60 51
Answer:
245 150 48 52
Step I: After row operation.
A B C D
W 2
33 0 13
X 0
7 27 43
Y 0 12 33 24
Z 0 5 3 7
OPRS-844
OPERATIONS RESEARCH
Step II: After column operation.

B D
W 28 6
minimum number of
X 2 27 36 lines N=3<4=n
Y (order of the matrix)
7 33 17
Z --
Step Il: Minimum element of the uncovered elements is 2.
A B C D
W 2 26 |0 4
o
X 27 34
15
Y 33
Z 2
Therefore optimal assignment is W->C,Y>A,X

s >B and Z>D
units
Total min. service time =27+29+39+52=147
following transportation problem using Vogel's approximation

19. Solve the MODEL QUESTION
method: C CAPACITY
A 400
50 40 80
30 70 40 400
60 70 60 500
400
60 60 800
30 50 40
REQUIREMENT 800 600 1100
Answer: following degenerate initial Basic
method, we get the
ng ogel's approximation a balanced 1.P.):
Teasible solution of the T.P. (It is
OPRS-85
Capacity
A B C
400 80
400
50 40
400
2 400
80 70 40
3 500
60 70 60
200 200
400
60 60 60
800
800
30
50 40
Req 800 600 1100 2500
Hence n=5, m=3, .m+n-1=5+3-1=7

But occupied cells are 6. We allot a small (+) ve amount &>
0at the cell (5, 3) andtest
Tor the optimality
of this solution (using u-vmethod).
A B C u,
50
400
40 n4
80 =0
Let , =0
Cell evaluation
2 400
80 70 40 =0 A,=C-(4+",)F
500 or Basic cells
60 70 14,20
60
A0
200 200
4,20
60 60 60
800 & 0
30 40
30 40,=40
A50-(0+30)=20>0
A 80-(0+40)=40>0
A 80-(0+30)=50>0
Az 70-(0+40)=30>0
A60-(20+30) 10>0
A =70-(20+40)=10>0
A =60-(20+30)=10>0
As50-(0+40) =10>0
OPRS-86
Hence the olution obtain by VAM OPERATIONS RESEARCH
. Minimum cost of is optimal
transportation a optimal
Min4400x40+500x60+200x60+200x60+800x30= solution
solu (making
0)
Obtain
ain an Initi
Initial Basic 110,000
20.
20.following Feasible Solution (1.B.F.S)
tothe following Transportation Problem and total transportation
using North West transportation cost
Corner Rule.
Destinations [MODEL QUESTION
S
D
10 | Supply_
SourcesS2 1 15
S3 0
| 25
Demand| 15 18
10
le that Initial Basic Feasible 15 15
Solution (l.B.F.S) a Non-Degenerate
Solution? Justify your answer. is Basic Feasible
Answer:
nitial Basic feasible solution
by North-West Corner
Rule:
D D D D Supply
S1 5
10 20
S2
12 20 5 25 26 5
S3 10
14 16 18 10
Demand
0 15
Here
50
m=3,
n=4;
m+n -1=3+4-1= 6
I.B.F.S. by North-West Corner Rule:
=15,
z5,
215,
245,
34 10
and z = 600. is less than 6, this indicates that the
Sinc
Ce non-zero components of this solution 5 which
soluti
is a degenerated Basic
feasible solution.
OPRS-87
optimality, nnd the optima

the transportation problem and checking the
ve
solution:
[MODELQUESTION
Supply
01
10
13
02
03
12
Oemand| 8
Answer:
Here total demand = 8+5 +4 =17
and total supply is 10+13+12=35.
So this is a unbalanced problems. To balanced it we add a
new column (corresponding
demand 18) with zero cost and then apply VAM.
D D, D3
D S
O 5 10 (2) 10 (2)| 10 (2) 10 (3) |10 (3)
o 8
4 13 (0) 13 (0) 5 (0) 1
(5)
12 12(3)
D8(2) 5(2) 4(2) 18 (0)
8(3) 5(2) 4(2) 6(0)

5 (2) 4 2) 6 (0)
5(2) 6 (0)
5(3) 5
(0)
So, B.F.S.is
25, 44=5, A21 =8, 12=4,x4 =1, x4 =12.
and minimum cost is
5x3+8xl=23.
Now test the optimality of the solution by computing cell evaluation unoccupied cells.
at
OPRS-88
OPERATIONS RESEARCH
D D2 D
o 4
D
0
O 8) 2
O 12
1
3
3
8 s 0
0
Here all the cell evaluation are positive. So the

solution is optimal solution.
22. Solve the transportation problem
VAM: starting with the initial solution obtained
by
MODEL QUESTION
Q
Available
2117 16 11
C 17 18 14 23 13
32 17 18 19
Requirements 6 10 12
Answer:
To obtain B.F.S. of the given transportation problem we
use VAM.
P R A
21 16 15 3
B 6 13 (3) 13 (3)9 (3) 3 (4)

17 18 14 23
10 9 18 41
19 (1 19(1)|19 (1|19 (1)|19 (1)
32 17
12 15 (18)
R 6(4 10
6 10 12 4(18)
10 12 (4)
6
10 6 (0)
10 (17) 9 (18)
OPRS-89
POPULARPUBLICATIONS
So the B.F.S. is
4 11,
6,
23,
244,
210.
=9
The minimum cost is 11x3+6x17+3x14 +4x23 +10x17+9x18=601 .
Now we test the optimality of this solution by computing cell evaluation at unoccupied
cells. P R
-20
21 16 15 3
B 6
17 18 14 23
10 9 4
32 17 18 41
17 13 14 23
It is seen that all the cell evaluations are positive so the solution is optimal.
23. Find out the initial basic feasible solution and the corresponding transportation
cost of the following transportation problem by using VAM: [MODEL QUESTION
O1
D D2 Da DA
Supply
O2
21 16 25 110
Os
17 18 14 130
Demand
32 | 17 | 18 41 190
60 100 120 150
Answer:
Here we put all the computation (of VAM) in
a single table instead of different shrunken
matrices, as follows:
OPRS-90
OPERATIONS RESEARCH
D D2 D3
D
Os
7L10
21 16 2s\/13110 (3) x
60 70|
1718142330 130(3)|130 (3|130 (3 70 (4)
Os 1005040
32 17 190 (1)|190 (1Dl150
18 41 (1)|150 (1)|150 (1)
b, 60 100 120 150
(4) () 4) (10)
60 100 120 40
(15) (1) (4)_(18)
60 100 120
X
(15)()_ (4)
x 100 120
(1) 4)
100 50
(17) (18)
Here the number of allocated cells is 6(=3+4-1).
So, the initial basic feasible solution is
4=110, X21 = 60, x =70,x2 =100, x =50, x 40.

The cost of the corresponding initial basic feasible solution is
110x13+60x17+70x14+100x17+500x18+40x 41= 7650.
24.Find out the minimum cost solution for the assignment problem whose cost
coefficient are as below: [MODELQUESTION]
2
-6
Answer:
Step I: (Row operation)
elect minimum element in each row and then Subtract it from each of the row: We get
the following table.
B5
B1 B2 B3 B4
6
Al 4 014
A2 9 0
OPRS-91
A3 6
AS
Step I1: (Column operation)
After column operation B5
B4
B2 T0B3
Al
A2
6 4:
0 9
6
4
A3 6 TO 20
A4 0 3 1
A5 04 1 3
Step III: (Optimality test)
Here N <n, optimality condition is not satisfied.
The minimum of the uncovered elements is 2. Subtract 2 from each
uncovered element
vertical lines
and add 2 to those elements only which are crossed by both horizontal and
and construct the table below for optimality testing.
B1 B2 B3 B4BS
Al
4-4Hof-to
A2
7 4 2 2
A3
410-5.--0
A4
3-54
AS
Here N n=4.
-6-3
Step IV: (Optimal Assignment)
So, get the optimal solution.
A1> B3,A2-> B2,A3>B5, A4- B1,A5 > B4.
Minimum cost=-8-9-6-4-9=-36.
OPRS-92
-
OPERATIONS RESEARCH
DECISION THEORY
Multiple Choice
Type Questions
criteria
Laplace criteria is applicable for decision
1. a) certainty b) uncertainty making under WBUT 2014, 2016]
c) risk d) none of these
Answer: (b)
The decision makers' knowledge and experience may

oking process when using the
2 mak influence the decision
criterion of WBUT 2014]
a) maximax b) minimax regret
c) realism d) maximin
Answer: (5)
, A type of decision making environment is

a) certaintyb) uncertainty
WBUT 20171
c) risk
d) all of these
Answer: (d)
A A type of decision making environment is

certainty [MODEL CQUESTION]
a) b) uncertainty c) risk
(d) d) all of these
Answer:
5. decision-maker's knowledge and experience

The
may influence the decision-
making process when using the criterion of
a) maximax
MODEL QUESTION]
b) minimmax regret c)realism
d) maximin
Answer: (c)
6.
Branch and bound method divides the feasible solution space
parts by into smaller
a) MODEL QUESTION]
branching b) bounding c) enumerating
Answer: (a)
d) all of these
1. The use of cutting plane method [MODEL QUESTION]

a)requires the use of standard linear programming approach
Cutting plane application
between each
Dyields better value of the adjectives function
Creduces the number of constraints in the given problem
d)both (b) and (c)
Answer:
(a)
.n decision theory, this of the following criterion is not considered
a) Maximax
regret criterion b) Laplace criterion MODEL QUESTION
c) Minimin
Answer: criterion d) EMV criterion
(c)
OPRS-93
L Short Answer Type guestions

1. An investor is given the following investment alternatives and percentage rate of
of
return:
States of Nature (Market Conditions)
Low | Medium High
10% 15%
Regular shares 7%
Risky shares 10% 12%% 25%
18% 30%
Property -12%
Over the past 300 days, 150 days have been medium market conditions and an
days have had high market increases. On the basis of these data, state the
optimum investment strategy for investment. [MODEL QUESTION
Answer:
By Laplace method:
Expected
Low Medium High
pay off
Regular shares 0.07 0.10
.15 0.327
Risky shares|-10 0.12 0.250.09
Property 120.18
0.180.30 0.12
Thus by Laplace method we observe that the Regular shares gives 32.7% retum
(Expected). Hence the investor should have to invest in Regular shares.

1. The R &D wing of an industrial product division has recommended to the
industrial marketing department to launch bolt with three different shearing
stresses. The manager is to decide the type of shearing stress launch under the
following estimated pay-off for the various levels of sales. Examine which types of
.
bolt can be chosen under Laplace and Herwicz a(=0.6) criterion.
Estimated levels ofsale in units
Types of bolts 20,000 10,000 2,000
25 15 10
40 20
60 25 WBUT 2013]
Answer:
Laplace Criterion:
We associate equal probability for each event say 1/3. Expected payoff is:
50
I25x+15x+10x==16.67
3
- 21.67
OPRS-94
OPERATIONS RESEARCH
60+253x-29.33
as maximum
Since II has expected payoff,
Laplace
criterion. IIl is the bolt that we have
ve to choose under
Harwicz alpha Criterion:
D 5x0.6+10x0.4 =19
D. 40x0.6+5x 0.4 26
D. 60x0.6 +3x0.4 =37.2
Gince D is maximum, we have to choose
the bolt III.
A mechanjcal engineer is seriously
nast, only 70% of well considering drilling a tube well. n thne
drilled were successful at of
Moreover on finding no water at 200 200 ft of depth in that area.
ft, some persons drilled it fúrther up to 250 ft
only 20% struck water at 250 ft. The
prevailing cost of drilling is
foot. The engineer has estimated that in case
will have to pay Rs.15,000 over the next
s.
hé does not get his own tube well he
10 years, in order to buy water from the
neighbourhood. The following decision can be optimal:
) Do not drill any well
ii) Drill up to 200ft
iii) If no water is found at 200 ft drill up to 250 ft.
Draw an appropriate decision tree and determine engineer's strategy under EMv
approach. WBUT 2013]
Answer:
At D, point:
Decision: (a) Drill up to 250 ft. (6) Do not drill
Event: (a) No wate (b) Water
Probability: (a) 0.2 (b) 0.8
EMV for drill up to 250 ft. = (12500 x0.2)+ (27500 x0.8) =24500.
EMV for do not drill =25000.
EMV is smaller for the act drill up to 250ft. So it is optimal act
At D, point:
(b) Do not drill
Decision: (a) Drill up to 200 f. (b) Water
Event: (a) No water (6) 0.3
Probability: (a) 0.7
0.7)+(24500x 0.3) =14300.
MV for drill up to 200 f. = (10000 x
EMV for do not drill =15000.
is optimal act.
the act drill up to200ft. So it
is smaller for
and D, the optimal strategy 1s to drill the
well up to 200 ft.
refore, combining D drill it up to 250 t
It no water is struck, then further
OPRS-95
a well on his farm. InIhis villag

3. Mr. Sinha has to decide whether or not to drillat 200 feet of depth. Some of
only 40% of the wells drilled were successful upto 250 feet but only 20
farmers who did not get water at 200 feet, drilled further
50 per foot. Mr. Sinha estimated th that
struck water at 250 feet. Cost of drilling is Rs. in the present value term
erms. If
ne would pay Rs. 18,000 during a 5-year period h
rather than go for the ell which would
well
continues to buy water from the neighbour to make:
have a life of 5 years. Mr. Sinha has three decisions
i) Should be drill up to 200 feet and
he drill up to 250 feet?
) If no water is found at 200 feet, should WBUT 2016
ii) Should he continue to buy water from his neighbour?
Answer:
No water10,000+ 250x 50=30.500
Do not dril
Drill up to 250 feet X
Water
No water
250x50=12,500
Drill up to 200 feet
Do not drill
Water
18,000+10,000 = 28,000
200x 50 = 10,000
At the point Di
Decision: (a) Do not droll (b) Drill up to 200 feet
Event (a) Water (6) Water
Probability: (a) 0.7 (b) 0.4
EMV for drill 200 feet =10,000x 0.4 +18,000 x 0.7 = 16,600
EMV for do not drill =18,000
At the point D2
Decision: (a) Do not drill (b) Drill up to 250 feet
(a) Water (6) Water
(a) 0.8 (b) 0.2
EMV for drill 250 feet=12,000x 0.2+30,000 x 0.8 =26,900
EMV for do not drill = 28,000
Hence Mr. Sinha will take the decision that if there is not no water at 200 ft. then drill
further 250 ft. for water.
4. Under an employment promotion programme, it is proposed to allow sale

newspapers on the buses during off-peak hours. The vendor can purchas
newspapers at a special concessional rate of 25 paise per copy against these
price of 40 paise. Any unsold coples are however a dead loss. A vendor
estimated the following probability distribution for the number O
demanded:
Number of copies: 15 18 19 20
Probability: 0.04
17
0.19 0.33 0.26 0.11 0.07
OPRS-96
many copies OPERATIONS RESEARCH
maximum? should he order
so that his expected
Compute EPPI profit wilDe
) vendor is thinking of
i)
onal information regarding
spending on a
small market survey to OD
e
be willingto spend on the
such a survey? demand levels. How mnuc
uch should he
Answer: WBUT 2016]
Conditional profit table:
Demand Probability
Possible stock action no.
(D) (in ofcopies)
15 0.04 15
225
16 17 18 19 20
16 200 175 150 125
0.19 210 240
100
17 215 190 165 140
0.33 195 225
18 255 230 205 180
0.26 180 210
19 240 270 245 220
0.11 65 195 225 255 285 260
20 0.07 150 180 Z10 240 270 300
Expected profit table:
Deman
Demand Profit Possible stock(s) action
robability
probability 15 16
17 18 19 20
15 0.04 9 5 5
4
16 0.19 39.9 45.6 40.85 36.1 31.35 26.6
17 0.33 64.35 74.25 84.15 75.9 67.65 59.4
18 0.26 46.8 54.6 62.4 70.2 63.7 57.2
19 0.11 18.26 21.45 24.75 28.05 31.35 28.6
20 0.07 10.5 12.6 14.7 16.8 18.9 21
EMV 188.81 216.5 233.85 233.05 217.95 196.8
. Max (EMV) = 233.85
Nowwe calculate EPPI from the following table:.
Demand Profit under certainty_ Probability Expected profit under certainty
15 0.04 9
225
16
240 0.19 45.6
17 0.33 48.15
255
18 0.26 70.2
270 31.35
19 0.11
285
20
300 0.07 21
Total: 225.3
Then
EVPI =233.85-225.3 = 8.55
expected profit.
should be ordered to maximize the
C(0i) copies
Total EPPI=225.3
OPRS-97
POPULARPUBLICATIONS
coet
5. How can you determine the standard cost of product? How is standard
helpful in budgeting concept? Name the various types oruages. Analyze the th
Importance of budgetary control in improving company's performance.
WBTU 2017
Answer:
Both Standard Costing and Budgetary Control are based on the principle that costs canbe
controlled along certain lines of supervision and responsibility, that focuses
parameter
controlling cost by comparing actual performance with the predefined
HOwever, the two systems are neither similar nor interdependent. Standard Costin
delineates the variances between actual cost and the standard cost, along with the reasons,
In the contrary, Budgetary Control, as the name suggest, refers to the creation of
budgets, then comparing the actual output with the budgeted one and taking corrective
action immediately.
The two systems aim at measuring performance by fixing targets. Nevertheless, The
former, forecasts, cost accounts but the later projects detail about financial accounts.
Similarly, there are many differences between Standard Costing and Budgetary Control
which has been discussed below.
Standard Costing Vs Budgetary Control
1. Comparison Chart
2. Definition
3. Key Differences
4. Conclusion
By Budgetary Control we mean, a management function in which an organization's

activities are directed and regulated in such a way reach the desired objectives. It is a
control technique, in which the operations are planned in advance, and then they are
compared with the actual results to know whether the expected results are achieved or
he tollowing are the major characteristics ofthis system:
The budgets are designed in accordance with the policy requirements.
Constant comparisons are made between the actual output and the budgeted
targets to review the pertormance.
Revisions are made if in case the existing conditions are changed.
Appropriate actions are taken if the expected results are not achieved.
Here, budget refers to a written financial statement expressed in monetary terms prepared
in advance for future periods, containing the details about the economic activities of tne
business organization.
The Budgetary Control system facilitates the management to fix the responsibilities and
coordinate the activities to achieve the desired results. helps the management
measure the pertormance of
It
the organization as a whole. Moreover, it heips m
formulation of future policies by reviewing current trends.
OPRS-98
OPERATIONS RESEARCH
dairy firm wants to determine the quantity
6. Ademand. st records of butter
butteriit should produce to meet
the Quantity required (kg)have shown the following demand
of days demand occurred
15 20 25 30pattern 40 50
35
NO
The
ck levels are
restricted to the 14
facilities. Butter costs Rs. 40 per kg
14 20 20
range 15 to 50 kg 80
due to
40 30 storing
quate
inadequ
100
Construct a conditional profitand sold at Rs. 50 per kg.

table
Determine the action alternative associated with the maximization o
expected profit.
ii) Determine EVPI.
Answer:
WBUT 2017]
Clearly,
Clearly, the diary Tim would not produce
From the data given in the
butter less than 15kg and more than s0xB-
problem, we can calculate the conditional profit values for
ach stock action and event (demand) combination.
If CP denotes the conditional profit.
the quantity in stock and D the demand, then
10S, when D2 S
CP
C 50D-40S, when D<S
The resulting payoff table is given below. Also the quantity of butter required for 6 days
out of a total of 200 days is 15kg means that the demand of 15kg has an associated
6
probability of 2000.03.
200
Similarly, probabilities associated with other demand levels
can be calculated and are shown in column (i) oftable 1.
TABLE 1
Conditional profit table
Possible Possible stock action (alternative) (kg)
demand Probability 15 20 25 30 35 40 50
(event) ) (ii) (ii) iv) (v). (vi) (vii) (viii)
(kg)
I5 0.03 150 -50 -250 450 -650 -850 -1,250
20 0.07 150 200 0 -200 400 600 -1,000
25 0.10 150 200 250 50 -150 -350 -750
30 150 200 250 300 -100 -100 -500
0.40
35 150 200 250 300 350 150 -250
0.20
40 150 200 250 300 350 400 0
0.15
50 0.05 150 200 250 300 350 400 500
OPRS-99
TABLE 2
Expected profit table
Possible Possible stock action (alternative) (kg)
demand Probability| 15 20 25 30 35 40 50
50
(event) ) )*(i) | (i)*(ii) | (i)*(iv)| (O*) |OV) |(vi)|ixti vii)
(kg)
15 0.03 4.50 1.50 7.50 13.50 19.50 25.50 37.30
20 0.07 10.50 14.00 0.00-14.00-28.0042.00-70.0
-70.00
25 0.10 15.00 20.00 25.00 5.00-15.00-35.00-75.00
-75.00
30 0.40 60.00 80.00 100.00 120.00 40.0040.00-200
35 0.20 30.00 40.00 50.00 60.00 70.00 30.00-50.00
40 0.15 22.50 30.00 37.50 52.50
45.0060.00 0.00
0.05 7.50 10.00 12.50 15.00 17.5020.00 25.00
50
EMV ( 150.00 192.50 217.50 217.50 117.50-32.50407.50
in) The calculations for expected payoftis and EMV for each action are shown in Table 2.
Since the maximum EMV is 7 217.50 for stock of 25 as well as 30 kg of butter, the dairy
firm may produce 25 kg or 30 kg of butter and can expect an average daily profit of
217.50.
iii) The EVPI is calculated from Table 3.
TABLE 3
Expected profit table with perfect information
Market size Conditional profit Probability of Expected profit with
(event) under certainty () market size perfect information ()
15 150 0.03 4.50
20 200 0.07 14.00
25 250 0.10 25.00
30 300 0.40 120.00
35 350 0.20 70.00
40 400 0.15 60.00
50 500 0.05 25.00
EPPI 318.50
The expected value of perfect information is given by
EVPI EPPI - max. EMV=7(318.50-217.50)=7101
EMV for items that have a Salvage Value

In the discussion so far, it has been
assumed that the product being stockea
completely worthless if not sold on the 'selling' day. This
assumption, that tnepen
has no salvage value is not always realistic. If the product does
have a salvage value,
it must be considered in calculating the conditional
profits for each stock action.
OPRS-100
OPERATIONS RESEARCH
7.
Write short notes on the following:
i) Training scheme
WBUT 2014]
ii) Budget and budgetary control
i) Industrial disputes
iv) Industrial safety
Answer:
) Training
scheme:
The legal defin ofa training schemeiis:
study or training that
(a) leads to an award; but
(b) does not, of itself, lead to an
award of a qualification listed on the Qualifications
Framework. "
A training scheme would normally be a

'short course', with fewer than 40 credits, which
is the credit threshold for inclusion on the Job.
A training scheme is likely to be made up of
assessment standards listed on the Directory
of Assessment standards, or non-standard-based components,
for example courses,
modules or papers.
(i) Budget and budgetary control:
A control technique
whereby actual results are compared with budgets.
Any difierences (variances) are made the responsibility of key individuals who can either
exercise control action or revise the original budgets.
Budgetary control and responsibility centres
These enable managers to monitor organisational functions.
A responsibility centre can be defined as any functional unit headed by a manager whois
responsible for the activities of that unit.
here are four types of responsibility centres:

a) Revenue centres: Organisational units in which outputs are measured in monetary
terms but are not directly compared to input costs.
b) Expense centres: Units where inputs are measured in
monetary terms but outputs are
not.
by the difference between revenues
C)Profit centres: Where performance is measured
Inter-departmental sales are often made using
outputs) and expenditure (inputs).
"transfer prices".
compared with the assets employed in
Investment centres: Where outputs are
Producing them, i.e. ROI.
ii) Industrial disputes: means any
Industrial Dispute Act, 1947, "Industrial dispute
Cording to Sec. 2 of the employers and employers or between
employers and
or difference between
Or
ute
orkmen
nen or between workmen and workmen, which is connected with e employment
the
neconaitions of labour of any
or of employment orwin
mployment or the terms symptoms of industrial unrest in the same way that
Dere
ndustrial disputes are of body.
oils are ymptoms
ofa disordered
OPRS-101
(iv) Industrial safety:

An industrial safety system is a countermeasure crucial in any hazardous plants such
suck
as oil and gas plants and nuclear plants. They are used to protect human, plans
and environment in case the process goes beyond the control margins. As the nam
suggests, these systems are not intended for controlling the process itself but rathe
protection. Process control is performed by means of process conrol systems (PCS) and
IS interlocked by the safety systems so that immediate actions are taken should the
process control systems fail.
8. A manufacturing company has to choose from several alternative methods to

increase its production to meet the increasing market demand. The following pay
-off table lists the various alternatives (courses of action) along with the differet
states of nature MODEL CQUESTION]
Table 1
Alternatives States of Nature (Demand)_
High Moderate Low Nil
Expand Facility 50,00025,000 -25,00045,000
Construct new facility 70,000 30,000 40,000 80,000
Subcontract 30,00015,000 -1,000-10,000
Choose the alternative based on Laplace Criterion and Minimax Regret Criterion.
Answer:
By Laplace criterion:
Table 2
Alternative State of nature (demand) Expected pay off
High Moderate Low Nil
(RS) IRs.) Rs.) Rs.)
Expand facility|50,000 25,000 -25,000 -45,000 (50+25-25-45)
1000
4
=L250
Construct new (70+30-40-80)100o
facility 70,000 30,000 -40,000 -80,000
=-5,000
Sub contract 30,000 15,000 -1,000 -10,000 (30+15-1-10)1000
H8.s00
This Table 2 shows that the alternative 'subcontract' results
in maximum average payoff
Rs. 8,500 (which is the optimistic return).
(i) By Minimax regret Criterion

From Table 1, we construct Table 3 to represent amount regrets
of of Table 1.
OPRS-102
OPERATIiONS RESEARCH
Table 3
Alternative States of nature
High Moderate (demand) | Maximum of|
(Rs.) Low Nil therows
Expand facility
(Rs.) |(Rs.)
20,000 S,000 (Rs.)
Constant new facility 0 |24,000 |35,000 35,000
|39,000 70,000
Sub contract 40,000 J15,000 70,000
Amount of regrets for Table 1, are shown in 40,000
ill minimize its
company wil| the Table This Table 3, tells us the
3. Thi
regrets to Rs. 35,000
by selecting the alternative 'Expand
facility
a a)Distinguish between decision making under making under

uncertainty. risk and decision
[MODEL QUESTION]
Answer:
a) Decision Making Under Condition of Risk
Majority of the decSions that are taken care by the manager in an industry or in business,
are under condition of risk. In decision- making under the conditions of uncertainty, the
decision- makers does not have sufficient information to assign probability to different
states of nature. On the other hand, the decision makers have sufficient information to
assign probabilities to each of the states of nature when decision making under
condition of risk is considered, Under condition of risk, a number of decision criteria are
available which could be of help to the decision maker. The most popular criterion for
-
evaluating the alternative is the expected monetary value (EMV) criterion.

Other important criteria are expected opportunity loss (EOL), combined expected
value and variance etc.
i) Expected monetary value (EMV) criterion alternatives.
Thiscriterion require to calculate the expected value of each of the decision
conditional pay off for
EMV for a given course of action in the expected value of the
each decision alternative. If A, denote a decision alternative, then EMV
nature(of demand).
where n= number ofstates of
4,)= E(4,)= D,P,
and to the jth decision alternative.
Dpay off for the ith state of nature
nature 7
Pprobability of occurrence of the state of

Working rule
profit labie
epl: Construct the conditional
contain state of the
nature, 2nd column are their occurrence
ne lst column should
column contain pay off elements D
Dility and other calculate the conditional expected
profits. i.e.
alternative, elements of the
p : For each decision probability column with the
corTesponding
iS the EMV for that decision
ply the elements of add them. This quantity
and
almn ofa decision alternative optimal EMV
alternative. corresponds to the
alternative which
P:Choose the decision OPRS-103
b) Decisions under Uncertainty

Decision makers, under this type of uncertainty, very often can know about the stata of
occure
nature in the future but it is not possible for them to find the probabilities of rence
of those states. for example, consider a company wishes to launch a new product (viz
DVD player), it knows that the demand of DVD in future IS ney to increase but the
probability that it will increase its future demands, is not known. This company may alsa
face the problem of price reduction in future because the imported DVD players may be De
cheaper due to new form of the Government policy.
Under this classification of uncertainty, a few decision criteria are known which could be
useful to the decision makers.
Example: Table 1
Alternatives States of Nature (Market demand)
High(Rs) Moderate(Rs)| Low(Rs)_ Nil(Rs)
a) Expand 250 200 -100 -150
b) Add New facilities 700 400 -300 400
c) sub-contract 300 175 50 -100
( Maximar criteriot (Optimistic criterion):

In Table 1, we find maximum element of each row and write them in a column at the end
of the table and then find also the maximum element of this new column. This value is
the maximum possible pay off for each possible alternatives. For 1able
1, this value is
700. i.e, max. {250,700,300)=700. By maximax we mean maximum of the maximum
elements.
i) Maxi-min criterion (pessimistic criterion):
First, find the row minimum for each row and then maximum of all these minimum pay
offelements. For Table 1, this value is 100
-
(ii) Mini-max Regret criterion:

This decision was developed by L.J. Savage. Select column maxima for each column and
subtract each element of the coresponding column from this column maxima, to form
new columns. This is performed for all columns. After this, we have to perform Min-
Max i.e. after taking maximum element of each new row, find the minimum. In
Table 2,
the last column shows the maximum element of each row.
Alternatives |
TableTable 2
States of nature (Demands) Max. of
High (Rs) Moderate Low No demand|each row
(Rs) (Rs) (Rs)_
a) Expand 450 200 50 50 450
b) Add new facilities 0 0 250 300 300
Sub-contract 400 225 0 400
From Table 2, it is clear that the company will
minimize its regret to Rs. 300.00
selecting the altermative "Add new facilities. Here,
300= min. {450,300.4007
OPRS-104
OPERATIONS RESEARCH
(iv) Hurwicz Crietrion (Criterion
ofRealism):
nder this criterion rational decision-maker
nletely pessimistic.
They always choose should not be comp
completely optimistic nor
help decision between
help of linear combination. Thus, if these two with the
limits w
two limits
(1-a) will represents the coefficient
a
(0<a <l) is the coefficient of optimism
sm, ue
ther
weighted average criterion. of pessimism. This method is also know"
known as
The working principle is as follows:
Choosethe weight factor
a)Choose a,(0<a<1) and this gives (1 a) -
b) Determine the maximum as well as
minimum pay off for each alternative and
P axmaximum pay off + (1-a)x calculate
minimum pay off, for each of the alternatives
(i.e., for ith row).
c)Select an alternative with value of
Pas maximum i.e. find MaxPfor all the rows
(i 1,2,3) and we considerthe above example =
with a 0.6 (0 <a <1); and construcCt
Table 3
Alternatives States of Nature (Demands) Maxi-mum| Minimum P=ax Max
High Moderate Low No Demand (Rs) (Rs)
(Rs.(Rs.) (Rs) (Rs) +(1-a)Min
(Rs.)
a) Expand 250 (200 -100 -150 250 -150 90
b) Add new facilities-700 400 -300 -400 700 -400 260
c) sub-contract 300 175 50 -100 300 -100 140
We get Max{P} Rs.260. It is to be noted that when a =
0the criterion is too
pessimistic and a =1 the criterion is too optimistic doe a = %, the value has no
influence of any one of the above, and a = V seems to be reasonable.
(v)Laplace criterion (Criterion of Rationality

Due to the lack of knowledge about the probability of the states for each of the
alternative, generally equally probable assumption for each states are considered. This
criterion is based on the principle known as principle of insuficient reason'"
The working rule is as follows:
a) Assign equal probability to each pay off for each alternative (strategy).
(6) Calculate the expected pay off for each alternative.
(c) Select the alternative having maximum profit value from these averages or minimum
value in the case of production prices. For the above example, we construct the Table 4.
Table 4
Expected pay off
Alternatives States of Nature (product demands)
(Rs)
| High Moderate Low No demand
(Rs)(Rs) (Rs.) (Rs)
250 200 -100 -150 (250+200-100-150)
a) Expand
4
-300 400 700+400-300-400
b) Add new 700 400 100
alternatives
OPRS-10s
-50 -100 (300+175-50-100)2=81.25

c)sub-contract 300 175
L new alternatives results in maxim
Maximum is Rs. 100. Thus the alternative 'add
Kimum
average pay off of Rs. 100.
b) A retailer purchases cherries every morning

at Rs. 50 per case and sells them
at the end of the day can
for Rs. 80 per case. Any case remaining unsold case (thereafter they have no h
par
disposed of next day at a salvage value of Rs.20 per day. The following is the
value). Past sales have ranged from 15 to 18 cases [MODEL QUESTION]
record of sales for the past 120 days:
Table 1
Cases sold 1512 16 17
48
18
36
Number of days 24
out of 120 days to maximize his profit
Find how many cases the retailer should purchase per day
Answer:
have to construct the pay
For this problem the Table for pay off matrix is not given. We
the sold cases.
offs and from the given Table (Table 1) we can construct probabilities of
conditional profit,
Let D denotes (sold) and S denotes the stock of charry cases. Then
C.P (80-50) S when D2S
80D-50S+20(S-D), When D <S
C.P=30S When D2S ..1)
60D-30S, D <S
Now, we construct the conditional profit table and C.P°s are the pay off i.e. when D=15
obtained
and S 16, then pay off = C.P=60x15-30x16= 420 etc. Probabilities are
from Table 1 as
24 48 36=(0.1,0.2,0.4,0.3)
120 120 120 120)
Table 2
Cases Probabilit Conditional Profits (Rs)
sold Stock
y(P) |15 16 |
18
15 0.1 450. 420 390 360
16 0.2 450 480 450 420
7 0.4 450 480 510 480
18 0.3 450 480
|510 |540
From column three to column seven, each column represents the pay off of the stock
alternatives (see, Table 2).
Now we construct the expected conditional profit pay off table (Table 3) by multiplying
probabilities with these columns.
OPRS-106
OPERATIONS RESEARCH
Probability Table3
Cases sold Possible stock action
15
| 16
15 0.1 45.0 42.0 18
16 0.2 90.0 39.0 36.0
0.4 96.0 90.0 84.0
17 180.0
192.0
18 0.3 135.0
204.0 192.0
144.0 162.0
EMV 450 153.0
EMV for the :strategy (when stock is 474
15 cases) is 475.
486 474
So,
enilarly, for the otner strategies i.e. when
stock is 16, 17 or 18 cases and EMV's are
4 486 and 474 respectively. So,
74, profit becomes maximum when stock is 17 cases of t
heries. So, to get maximum (optimum) profit, the retailer should purchase 17 cases per
day (See, able
I 3).
15000+12500-27,50
No water
Do not dri
Drill up to 250 ft
Water
250x50-12,50
No water
Drill up to 200 Do not drill
Water I5000+10000-25,00
200x50=10,00
Decision Tree
A, B and C in
Rs. 1 lakh among three companies
10. A person is planning to
invest returns on capital are
in terms of growth in capital and
equity shares. The pay-offs under each of the three economic conditions
investments Assuming that the
known for each of the recession, growth and stability.
which may prevail, that
is, period of one year in
among the three portfolios for a 1 lakh portfolio are
person must take his choice earnings (in Rs. 000's)
on his
of net
advance, his expectations
given beloW: Table 1
Stability Growthn
Recession 10
Company A 15
15 6
Company B 6 Laplace's rule and minimax
|6.5
Company G_ strategy for investment under (MODEL QUESTION]
etermine the optimal
regret criterion.
OPRS-107
Answer:
Table 2 Expected pay off (RRs)
(i) By Laplace rule
Alternative Recession Stability Growth 15+6+10 =0.33
10
6
Company-A - 15 3
4+15+8-6.5
Company-B 7.5
6.5+6+1-4.8
6 15
Company-C 6.5 3
that the alternative 'company B' results in maximum average
By Laplace method we get
pay off of Rs.6500.00. So, invest in Company B. 1
Table first we construct Table 3, which is
(i) By Minimax regret criterion. From from the maximum pay off of that
obtained by subtracting each pay off of a column
column.
Table 3
Growth Max. of the rows (Rs.)
Recession Stability
Company- A 21.5 1.5 5
21.5
7 7
Company-B 2.5 0
Company-C_ 0 1.5 13
Amount of regrets for Table are shown in Table 3. This table shows that the company
1
will minimize its regret to Rs. 1500.00 by selecting the alternative "Company-C' for
investment
Note: In this problem by choosing two different criterion for decision- making, we have
selected two different alternatives (companies).i.e. by Laplace rule Company-B is
selected where as by Minimax regret criterion it is Company-C.
11. A news agency receives its weekly order for a magazine every Monday and
cannot recorder during the week. Each copy costs Rs.1.80 and is sold for Rs. 3.00.
Unsold copies may be returned the following week for a Rs.1.20 rebate. When the
agency runs out of copies and cannot supply a customer, it estimates its
"goodwill" loss at Rs. 2.40 in future profits, as the customer will take his business
else where for a couple of weeks at least. Demand has been remarkably constant
between 28 and 40 copies a week, as shown below:
Demand (Copies) 28 32 36 40
Fraction of time 0.30 0.40 0.20 0.10
) Construct a pay-off table and determine the optimal number of copies to
ii) How much would it be worth to know
stock.
the exact demand each week? What
would be the expected profit if this were possible? [MODEL QUESTION
Answer:
Conditional profit table: Table 1
Demand | Probability Possible stock action ( no.
in of copies)
D) 28 32
28 0.30 33.6 31.2
36 40
32
28.8 26.4
0.40 31.2 38.4
36 36.0 33.6
0.20 31.2 36.0 43.2 40.8
40 0.10 31.2 | 36.0 40.0 48.0
OPRS-1088
OPERATIONS RESEARCH
Here, C.
c.P=1.2xS-2.4, when D> S
= (3D-1.8S) + 1.2(S-D)
when D S
2c.P =1.2S-Z.4, D>S
= 1.8D-0.6S, D<S
Ddemandand
S-stock required
table:
Expected Profit Table 2
Demand Probability Possible stock (S) action
D
0.30
28 | 32 |36 40
28 10.08 9.2 12.0
.40 8.64
32 12.48 15.6 14.40 13.44
36 0.20 6.24 7.2 8.64 8.16
40 0.10 3.12 3.6 408 4.8
EMV 31.92 |35.60 35.76
From I|38.4
Table 2, we get max {EMV} = Rs. 38.4. Now, we will calculate EPPI from the
tablebelow:
Demands Profit under Probability expected profit under
(1) certainty certainty
(2) (3) (4)
28 33.6 0.30 10.08
32 38.4 0.40 15.36
36 43.2 0.20 8.64
40 48.0 0.10 4.80
EPPI 38.88
Then EVPI= Rs.(38.88- 38.40) =Rs.0.48. Here, the column (2) is constructed from the
diagonal elements of Table 1
12. The research department of HLL recommended to the manufacturing

department to launch a shampoo of three different types. The marketing manager
has to decide one of the types of shampoo to be launched under the following
estimated pay-offs for various level of sales.
Estimated level of sales in units
Types of shampoo 15000 10000 5000
Egg 30 10
| Clinic 40 5
Deluxe 55 depending
20
upon
What will be the marketing manager's decision
) Laplace's criterion
ii) Regret
criterion [MODEL QUESTION
in) Hurwiez's criterion (a = 0.6)?
Answer:
Laplace's Criterion:
Xpectation of Egg Shampoo = E (Egg shampoo) = (30+10+10) = 16.67
OPRS-109
E (Clinic Shampoo)(40 +15+5)= 20

3
E (Deluxe Shampoo)=(55+20+3)= 26
shampoo.
Max 16.69, 20, 26 =26 which indicates to launch deluxe
sale (pay oft) 400 eacn altemauve shampoo (Epp
Regret Criterion: The minimumrespectively. Now Max{30,40,55) 55
= which
Clinic, Deluxe) are 30, 40, 55 ich
corresponds to deluxe shampoo.
of optimism(a)= 0.6.
ii) Hurwiez's Criterion: Here given company's degree
P= aMax +1(1-a)Min
For egg-shampoo: P = 0.6x 30+(1-0.6)x10
= 18+4 22
For clinic shampoo: P = 0.6x40+(1-0.6)x5
24 +2=28
For Deluxe shampoo: P = 0.6x55+(1-0.6)x3
=33+1.2=34.2
Max{P,P,B} which corresponds deluxe shampoo.
13. A repairman is to be hired to repair

machines which break down at a rate of 3
per hour. Non-productive time on any machine will cost the company Rs. 20 per
hour. Two repairmen are available. One is slow-cheap who repairs at an average
rate of 4/hour and demands Rs. 40/per hour. The other is fast-expensive who
repairs at an average rate of 6/hour and demands Rs. 72/hour. Which repaiman
should be hired? [MODEL QUESTION]
Answer:
The problem is shown in the following tree
3 machines are. If the company hired the
breakdown fast-expensíve repairmen
After 1 hour (B
All the machines
are repaired
All the machines

are repaired
After 1 hour
3 machines are
If the company hired the
breakdowm
slow-cheap repairman
OPRS-110
OPERATIONS RESEARCH
the cxpected cost at the node A
Now is
7(3x 20)+R 40 =*100
Expected cost at the node B is
(3x 20)+R 72=T132
lence slow-cheap repairmen should be hired.
14. A newspaper Doy
sels newspapers on off peak hours. He can
urchase at a concession rate of 50 paise andbuses during 60 paise. Any unsold copy
is a dead loss. He has estimated sell it for
the following probabilities for the number O
copies demanded:
Number of copies 20
Probability 21 22 23 | 24 | 25
0.1 | 0.15 0.25 0.3 0.12 0.08
Prepare a pay-ott table to find out how many copies
should be ordered so that
expected profit is maximized. [MODELQUESTION]
Answer:
Let S be the number of newspapers ordered per day and be the demand for it (number
papers sold each day). Given
of that C, =70.5, C, =z(0.6-0.5)=70.1. Now let us work
out the cumulative demand for the newspapers (because the demand for units is discrete).
Demandd
20 21 22 23 24 25
|
()
P() 0.1 0.15 .25 0.3 0.12 0.08
2PC)0.1 0.25 0.50 0.80 0.92
Now P)<C./G+C,)-2P) and c./(G+c)=-0167

r=0
This value lies between demand 20 and 21. Hence the newspaper boy has to order 21
papers per day to maximize his profit.
OPRS-111
NETWORK ANALYSIS
Multiple Choice Type Questionns
1. The common error(s) that occur(s) in a network construction is/are
WBUT 2013,20161
a) Looping (cycling) b) Dangling c) Redundancy d) All of these
Answer: (a)
2. In constructing a network, Forward Pass computations are done for
determining. [WBUT 2013]
a) Earliest Event Time b) Latest allowable Time
c) Floats and Slack Times d) none of these
Answer: (a)
3. The shortest path between any two nodes in a Network is determined by the
followingg WBUT 2014]
a) Dijikastra's Algorithm b) Floyd's Algorithm
c Critical path method d) Decision tree
Answer: (a)
4. In PERT the span of times between the optimistic and pessimistic timee
estimates of an activity is WBUT 2014, 2017]
a) 3a b) 6o c) 12o d) a
Answer: (d)
5. Critical path method (CPM)is WBUT 201M5
a) probabilistic b) deterministic c) both (a) & (b) d) none of these
Answer: (6)
6. PERT stands for

WBUT 2015]
a) Performance Evaluation Report Technique
b) Programme Evaluation Report Technique
c) Programme Evaluation and Review Technique
d) None of these
Answer: ()
7. The shortest path between any two nodes in
a Network is determined by
a) Dijkstra's Algorithm
b) Poisson distribution WBUT 2016)
c) Binomial distribution
a) Exponential distribution
Answer:(a)
8. In Hurwitz
alpha criterion the degree of optimism
a varies between
a).1 and 2 WBUT 2016)
b) 0 and 1 c) 0 and 0.5
Answer: (6) d) 0 and 2
OPRS-112
OPERATIONS RESEARCHH
Anactivity is said tobe critical if
9 a) its free float is zero
WBUT 2017]
citsindependent float is zero b) its total float is zero
Answer: (b) d) its time duration is zero
CPM has which

10 ofthe following time
a) One-time estimate g
ume estimates
estimates? WBUT 2017
c) Three-time estimate b) Two-time estimate
e) Nil time estimate d) Four-time estimate
Answer: (a)
11. ABC analysis deals with

a) flow of material WBUT 2017]
b) ordering schedule of raw material
c) analysis of process chart
d) inventory management
Answer: (d)
The objective of network analysis is to

12.
[MODEL QUESTION
a) minimize total project duration
b) minimize total project cost
c) minimize production delays, interruption and conflicts
d) all of these
Answer: (a)
13.The process of reducing the activity duration by putting an extra effort is called
crashing the activity MODEL QUESTION
a) True b) False
Answer: (a)
[MODEL QUESTION
14. An activity is said to be critical activity is
a) its free float is zero b) its total float is zero
d) its time duration is zero
c) its independent float is zero
Answer: (b)
vertex A is [MODEL QUESTION]
15. In a flow pattern a=J when the
b) any vertex other than source
a) arbitrary vertex d) none of these
c) source
sink vertex)
Answer: (a) (other than source and
pessimistic
variance of a job having optimistic time 5,
16. In PERT analysis, the [MODEL QUESTION]
likely time 8, is
time 17, and most c) 7 d) none of these
a) 3 b)4
Answer: (b)
MODEL QUESTION)
c) event oriented d) all of these
17. CPM is
a)probabilistic b) deterministic
Answer: (b) OPRS-113
18. In a PERT network, the starting vertex isa [MODEL QUESTION

a) burst node b) merge node c) root d) none of these
Answer: (d)
LShort Answer Type Questions

1. For the following network, find the critical path and minimum time to complete
the project: [MODEL QUESTION
20 -.18
23
Answer:
The following diagram will give the solution:
20 19 39
20
8. 18 19
23 24
The critical path is 12 5+7 and total project duration is 20+19+4

43 units.
2. A small project consists of seven activities.
below: The details of which are given
Activity Duration in days [MODEL QUESTION
Most likely | OptimisticPessimistic Expecteed
3 Time
B
D 10
75
12
B,.C
15
G
Draw the network; 4
D, E
find the critical path and D completion
the expected project time
OPRS-114
Answer OPERATIONS RESEARCH
Duration
Most indays
OptimisticC
likely(tm)_ Pessimistic Expected
(t) Time
B
3.33
D 6.67
E 3.0
9.33
7.67
Network with expected 6.0
times (t) 4.0
T-10-T, TE-19.33-T
T=0=T.
333
T-3.33-T 3.0 c 0
25.33
L
TM-10 T TE-19.33-T
To find the critical path, use
calculateboth forward pass
Forward pass: Let T then
and backward pass
=0; T=3.33
TE10.0;TE"=max {3.33+3.0, 10.0+0}= 10.0
TE max {19.33 +
;
TE=10.0+9.33= 19.33 TE=max { 10.0+7.67, 19.33
+0}= 19.33
4.0, 19.33+
4.0,19.33+6.0) 25.33
Backward
pass: Start with T=25.33; T=25.33-6.0 19.33
T= min {19.33 -0, 25.33-4} = 19.33
T= 19.33-9.33 10.0;T= min {10.0-0, 19.33 7.67) 10.0
TLmin {10-6.67, 10-3 =3.33
T3.33-3.33=0.
A B dummy D dummy
Critical path is
()2(2)3)45) 6.67 )
The minimum expected project compilation time = 25.33 days.
3. A small project consists of seven actívities for which the relevant data are given
below: [MODEL QUESTION]
Activity Preceding9 Activity Duration
Activities (days)
A, B
A, B
C, D,E
C, D,E
OPRS-115
(a) Draw the network

(b) Number of the events by Fulkerson rule.
Answer:
A(4) D(5)
B(7) EXT G5)

C(6)
F(6)
-----is a dummy activity with duration 0 (zero).

Events are numbered by Fulkerson rule.
[MODEL QUESTION
4. Given the following PERT network, determine:
a) earliest expected completion time for such event
b) latest allowable completion time for such event
c) slack time for such event
d) critical path.
20
o-10
8
4 10
d=2 20 =4
t 46 10
-3 -2 2 o8
t,=8
Answer:
A4= 20
As-34-
5
10 AF42-
A24 4
A-0-0
10
8
As5, Ch-21 A-30, -32
Aearliest expected completion time and
0latest allowable completion time for such event
OPRS-116
OPERATIONS RESEARCH
Events EECT= A LACT O; Slack time
0
4
2 16
24
24
34
30 32
42 42
Critical path: O
Total min. time = 42 units.
0 0 0 0
1. small maintenance project consists of the
A
following jobs, whose predecessor
relationshipsare given below:
Jobs 1-3
Durationn
-2 2-3 2-5 3-4 3-6 4-5 4-6 5-6|6-7
L (Days)
15 15 3 12 14 3 14
Draw the network diagram of the project

ii) Find the total float of each activity
iii) Find the critical path and total project duration. WBUT 20131
Answer
)
14
15
2
Network Diagram
Forward pass calculation: In this esumate ine earuest start and the earliest finish time
(1i)
ES, are given by,
ES, = 0
ES, = ES +
=0+15 = 15
ES = Max(ES, +/23,ES, +1)= Max(15 +3,0+15)= 18
ES = ES, +fz4 = 18+8 26
ES Max(ES, + t25,ES, +s)= Max(15+5,26 +1) =27
ESMax(ES, + l26, ES, +46, ES, +ts6)= Max(18 +12,26 +14,27 +3)= 40
OPRS-117
ES, = ES +167 = 40 +14 = 54.

latest finish and the latest start time
Backward pass caltulation: In this estimate the
LF, are given by,
LF, = 54
LF = LF, -1s7 = 54-14 = 40
LP = LF,-1s6 = 40-3 = 37
=
LA, = Min{LF -t45,LF, -s)= Min(37-1,40-14) 26
LP = Min(LF -4,LF-136)= Min(26-8,40-12) =18
LF Min|LF, -1g,LF-/)= Min(37-5,18-3)=15
=
LF = Min(LF, -13, LF -42)=
Min(18-15,15-15)=0.
path and total flo
Thefollowing table gives the calculation for critical
Activity Normal time Earliest .Latest To.Jat
Start Finish Finish Start LF ES, orLF, -ES,
-
ES ES LF LF
1-2 15 15
0
1-3 15 15 18
2-3 15 18 15 18
2-5 15 20 32 37 17
3-4 18 26 18 26 0
3-6 12 18 28 40 10
4-5 26 27 36 7 10
4-6 14 26 40 26 40 0
5-6 27 30 37 40 10
6-7 14 40 54 40 54 0
From the above table we observe that the activities 1-2, 2-3, 3-4, 5-6, 6-7 are the critical
activities and the éritical path is given by, 1-2-3-4-6-7.
The total project completion is given by 54 days.
2. A small project is composed of 7 activities are listed in the table below.

Activities areidentified by theirbeginning (i)and end (G) node numbers.
Activity Optimistic time Most likely Pessimistic
(weeks) (weeks) time (weeks)
1-2
1-3
1-4
2-5
3-5 14
4-6 3
5-6 3 15
a) Draw the network diagram of the activities in the project
b) Find the expected duration and variance of each activity.
c) What is the expected project length?
OPRS-118
OPERATIONS RESEARCH
d) at
What is the probadity that the
the pro
expected time? project will be
than completed at least 4 weekS
OR. WBUT 2014]
mall maintenand
ASmalna ance project
A
relationship is given belov consist of the following
jobs whose
whose precedn
precedence
Estimated WBUT 2015)
Activityy Optimistic duration (weeks)
| Most likely
1-2
1-3
Pessimistic
2-5
3-5
4-6 14
8
5-6 15
(a) Draw the project network.
(b) Find the expected duration and variance of
ic) Calculate the early and late occurrence for each activity.
each event and the expected project
length.
(d) Calculate the variance and standard deviations of project length.
(e What is the probability that the project will be completed
() 4 weeks earlier than expected??
(i) Not more than 4 weeks later than expected?
If the project due date is 19 weeks, what is the probability of meeting the due date?
Answer:
Complete the table using,
e
to+4mtp.
ActivityOptimistic Most likely Pessimistic 2
to) (ten) G)
(1,2)
(1,3)
O
1,4)
(2,5)
3, 5) 2 14
8
(4, 6) 2
(5,6) 15
3
Te and TL values along
and number the nodes and calculate the
Let us draw the network
with S values.
OPRS-119
Calculations are shown below:

Forward Pass: T-9
TE0 2
T2 TE 10=T
T=4 TE 0=T
O
Backward Pass:
TE4 T
T =17
T=[17-7]=10 TE 17T
TE=3
T' =17-5=12 TL-12
T=[10-6]=4
T =[10-1]=9
T = Min (9-2).(4-4).(12-3)]=Min[7,0,9]=0
a) Critical path is 1 -3-5-6
b) Expected project length 4+6+7= 17 weeks.
c =yoi +ojs +o, =V+4+4 =3
Standard Normal Deviation (SND) =isie-
Oc
8-17-33
Z 0 3
0.3 0.1293
Probability of completion the project in 18 weeks
.5+0.1293 =0.6293 62.93%
Probability of not completing project in week
.1-.6293=.3707=37.07%
d) ) P(Zsz,) where, Z, = 3
-1.33
P(Zs-1.33)=1-P(Z21.33)
=1-(0.5+0.4082)
= 1-0.9082 =0.0918
i) P(ZsZ,) where
z---1.33
P(Zs1.33)=0.5+0.4082 =0.9082
PZ =P(Zs0.666) =0.5+0.2514
P(Z s0.666) =0.7514

Ifthe project due date is 19 weeks, then 75.14% of the Project will be completed.
OPRS-120
mine the maximal flow
Determine OPERATIONS RESEARCH
in the network
shown below:
WBUT 2016]
(10,0)
(20,0)
(30,0) (1o,5)
(30,0)
(20,0) (20,0)
(40,0)
Answer:
(10,0) (20,0)
\(10, 5)
(30,0)
(30, 0)
(20, 0)
(20,0)
(40,0)
Forward Pass:
Let TE (1)=0; then TE (2) =20
TE (3)= Max {30, 20+40, 10+5= 60;
TE (4) = Max{10, 60+10 =70;
TE (5) = Max{70+20, 20+30, 60 +20 90.
Hence, the maximum flow in the network is 90.
below: WBUT 201M77
4. Determine the maximal flow in the network shown
(25,0)
(15,0)
O (30,0)
(20, 0)
(30,0)
(15,5)
(25,0)
(35,0)
Answer: Answer ype Questios

Umilar type Question No. 3
of Long
OPRS-121
QUEUING MODEL
.
When customers move from one queue to another hoping to receive quicker
service, it is termed as WBUT 2013, 2016]
a) Reneging b) Balking c) Jockeying d) none of these
Answer: (6)
2. "Balking" is a term associate with WBUT 2013]
a) Transportation problem b) LPP
c) Queuing problem d) Decision theory
Answer: (a)
3. Railways Reservation Centre is a typical example of WBUT 2013]

aultiserver, Finite Queue Length, Infinite Population Queuing problem
Single server, Infinite Queue Length, Infinite Population Queuing Problem
cMulti-server, Infinite Queue Length, Infigite Population Queuing Problem
d) None of these
Answer: (c)
4. If the inter-arrival time between two consecutive arrivals follows exponential

distribution, then the distribution of the total number of persons could be
present arter a certain period of time will follow [WBUT 2014]
a) normal distribution b) Poisson distribution
c) binomial distribution d) exponential distribution
Answer: (6).
5. Queueing system comprising WBUT 2015]
a) the arrival and service pattern b) the queue discipline
c) customer's behaviour d) all of these
Answer: (d)
6. In (M/M/1):(FCFSloo lco) queue system formula for expected number of

customer in the system is WBUT 2015]
a)
Answer: (b)
-A
b)
- -1) d) none of these
7. When customers move from one queue to another hoping to receive quicker
service, it is termed as WBUT 2016)
a) Reneging b) Balking c) Jockeying d) None of these
Answer: (¢)
OPRS-122
OPERATIONS RESEARCH
8. In a M/M1 queue, the
Poisson service rate
a) D linear is
(a)9 WBUT 2016
Answer: c) exponential
d) none of these
Queuing theory deals with
a) materialhandling the problem of
c) reduce the WBUT 2017
waiting time or idle b) effective use of
machines
Answer: (c, d) time d) better utilization
of man services
10. If everything else remains
rate, except that the constant, including
service time becomes the mean arrival rate and service
a) The average queue constant instead of exponential,
length will be halved
b) The average waiting MODEL QUESTION]
time will be doubled
c) The average queue length
will increase
d) None of these
Answer: (d)
Which of the following is not an

11.
assumption in common queuing mathematical
models?
[MODEL QUESTION]
a) Arrivals come form an infinite very
or large population
b) Arrivals are Poisson distributed
c) Arrivals are treated on a first-in, first-out
basis and do not balk or renege
d) The average arrival rate is faster than the average service rate
Answer: (d)
12. Monte Carlo is a MODEL QUESTION]

a) Inventory technique b) Queuing technique
c) Markov process d) Simulation technique
Answer: (d)
13. Which of the föllowing relationship is not true? [MODEL QUESTION]
a) W, =W, +1/4 b) L =AW c) L=4,+1/2 d)

L,A,
Answer: (c)
[MODEL QUESTION]
14. The general purpose system simulation language
a) requires progranmme writing
programme writing
b) doesn't require
c)requires predefined coding form
to describe a system
d) needs a set of equations
Answer: (a)
average number of customers Eln) is
FIFO) model, the [MODEL QUESTION)
15. In an (MI MI 1): (o1
given by
P D1-p) o- P
Answer: (6)
OPRS-123
16. For Queuing model MIM/1:0o/FIFO, which of the following is not true?
a) Input follows Poisson distribution [MODEL QUESTION
process follows exponential distribution
b) output
c)capacity is finite
d) it has only one service provider.
Answer: (c)
[MODEL QUESTION
17.A queue-system will remain unchangedif
d) none of these
a) p<l b) p=1 c) p>l
Answer: (6)
L Short Answer Type Questions

1. A TV repairman find that the time spent on repairing has_an exponential
distribution with mean 30 min per unit. The arrival of TV set is Poisson with an
average of 10 sets per day of 8 hr. What is the expected idle time per day? How
many sets are there on average? WBUT 2013]
Answer:
10
Here
2030 8x60 48
Expeçted no. of jobs: s

Ls
1-P -2
1
Tjobs
48 30
No. of hours in a days for which the repairman remains busy (in a 8 hour day) is
8x8x5hours.
Hence, the required idle time is (8-5) hours = 3 hours.
2. In a Supermarket, the average arrival rate of customers is 10 every 30 minutes
following poisson distribution. The average time taken by a cashier to list and
calculate the customers purchase is 2.5 minutes, following exponential
distribution. What is the probability that the queue length exceeds 7? What is the
expected time spent by a customer in the system? WBUT 2015]
Answer
Mean arrival rate of custpmer A =10/30=1/3 per minute.
Mean service rate of customer
=
u5 per minute.
The utilization factor p= /4==<1.

) Probability that queue length exceeds 6
OPRS-124
OPERATIONS RESEARCH
Prob.queuelength
27]=
(ii)Expected
Expectedwaiting
timeof a customer in
E0.279
=0.279
the system
()-3-2352minutes
3. A self service store
an average every
employs one
ASSuming 5minutes while cashier at its counter. Nine.customers
Poisson distribution the cashier can serve 1 customers arive on
service time. Find for arrival rate in5minutes.
and exponential distribution
i) average number for
i) average of customers in
number of customers the system
i) average time a customer in the queue or average
queue length
iv) average time a customer spends in the system..
Answer: waits before being
ng served. WBUT 2016, 2017]
Here, =per minute
9
5
0
per per minute
() Average no. of customer in the system
915
L
1-p 1-p 109
5
i) Average queve length=-,-9

8
(ii) Expected waiting time in the system =-
iv) Expected average
9
-
waiting time
= 5 minutes.
for the customer before being

served=- x5=4.5 minutes.
4-2) 10
4.Customers arrive at a sales counter manned by a single person accordingserve

to a
Poisson's process with a mean rate of 20 per hour. The time required to
distribution with a mean of 100 seconds. Find the
Customer has an exponential
[MODEL QUESTION]
erage waiting time of a customer.
Answer:
Average arrival rate, A= 20/hour
service rate =
60x6hour =36/hour
Average 100
in the queue
Expected waiting time of a customer
OPRS-125
2 minutes 5 sec.
W A(4-A)
20
36(36-20) 144 hour 2minutes
12
=
one cashier at its counter. Nine customers arrive on

5. A self service store employs
can serve 10 customers in every
an average of every fiva minutes while the cashier
and exponential
Assuming Poisson distribution for arrival rate[MODEL QUESTION
minuets.
distribution for service rate, find
) average number of customer in inthe system
queue
) average number of customers the system
ii) average time a customer spends in the
Answer:
Arrival rate, i =9/5=1.8 customers/minutes
Service rate, u=10/5=2 customers/minutes
1.8 -=9
9Average no. ofcustomers in the system
()=72-18
ii) Average no. of customers in the queue (,=F
of customer spends in the system
it) Average time (,)= 2-183mimutes
= =4.5minutes.
iv) Average time a customer spends in the queue
6. If the arrival rate is 1 and service rate is 4, then prove that the expected queue
[MODEL QUESTION]
length is
A4-2)
Answer:
Since there are (n-1) units in the queue excluding one being serviced,
L-r-1)-»"-
---
n=l
n=l _n=0
-1-)-4-1-1--4-
n=
n=
1-p A4-2)
7. What is meant by traffic intensity? [MODEL QUESTIONI1
OPRS-126
OPERATIONS RESEARCH
AnSwer:
rival rate and
athe mean arriva g is the mean departure
is
dtensity(or
utiliza
utilization tactor)
i5 defined by
and p= /4
rate of a queue then fraye
traffic
8 customers/hr. and =10 customers /hour of a p <l.
Customers/nr.
Let,
1hen
,
p 10
which means that utilization
queue-system.
ofthe service facility is 80%.
8.With reference
reference to Queuing Theory,
what do you mean by (M/M/):(«/FIFO)?
at do you mean by "transient state" and "steady
What
state" of queuing model? Write
the formula for L, and L.
[MODEL QUESTIONJ
Answer:
r'Part:
(MIM/1/0-FiFo) is tne Simplest queue system where the arivals follow a Poisson
nrOcess, service times are exponentially
distributed and there is only one server. In other
words, it is a system with Poisson input, exponential
waiting time and Poisson output
with single channel.
Queue capacity ot the system is infinite with first in first out mode. The first M in the
notation stands tor Poisson input, second M for Poisson output, for the number of
1
servers and e for infinite capacity of the system.
2d Part:
A system is said to be in transient state when its operating characteristics are dependent
on time.
A steady state condition is said to prevail when the behaviour of the system becomes
independent of time.
3 Part:
Formulas
Average number of units in the system (L,)=-
Average queue length (L)

-2)
(8 A.M. - 10 A.M.), trains arrive at the
S.Assuming for a period of 2 hours in a day
36 minutes per train, then calculate
yard every 20 minutes; the service time is
mentioning the queuing model
yard is empty
0 The probability that the queue assuming that the capacity of the yard is
)Average number of trains in the [MODEL QUESTION]
4 trains only.
OPRS-127
Answer:
Here, p = traffic intensity =4= 9
i) Probability that the yard is empty = (1- p)=
it) Average no. of trains in the queue is

G 2525
1-P 99-5) 36
10. Customer arrives at a sales counter managed by a single person according to a

Poisson process with a mean rate of 20 per hour. The time required to serve
Customer has an exponential distribution with a mean 100 seconds. Find the
average waiting time of a customer. [MODEL QUESTION]
Answer:
Here A= 20 per hour
20 per sec
3600
H per sec.
100
P4_20 x100 =
3600
Average waiting time of a customer is
1 1 100x9
= 225 sec.
A-P) 100
4
11. Briefty discuss the Kendall notation of queuing model. MODEL QUESTIONI
Answer:
Kendall's Notation for Representing Queuing Models
Generally, queuing model may be completely specified in the following symbolic form
(a/blc): (d/e), where
a Probability. law for the arrival (or inter-arrival) time
b Probability law according to which the customers are being served
Number of channels (or service stations)
Capacity of the system, i.e., the maximum number allowed in the system (1in
service and waiting)
Queue discipline
OPRS-128
sider a self-servi store OPERATIONS RESEARCH
with
nential service time Suppose one cashier.
5 minutes and the ca r. Assume
Assum Poisson arrivals
cashier can that nine customer and
averagenumber
The arobability of custe serve 10 ers arrives
in 5 minutes. Find on an average
having moreors queuina fnnutes.
The probability of having
arobability
that a customerthat 10 customers in system
has to queue the and
for more than 2 minutes.
Answer:
[MODELOUESTION)
QUESTION
9
verage arrival rate (2) =per min.
Average service rate

()==2 per min.
Traffic intensity rate (p)= 2=0,9<1

10
Average no. of customers in the queue
(0.9-8.1
1-p 0.1
) Probability (queue size2
11)= p'" = (0.9" =0.3138
inp>1=peu-ay
Here =2, p=0.9 and -1=2-1.8 0.2
= 0.6033
pT>PT,2)=0.9.e2 =0.9e
Long Answer 1ype Questions

1. A car servicing station has3 stalls where servicing can be offered
simultaneously.
The cars wait in such a way that when a stall becomes vacant, the car at the head
of the line pulls up to it. The station can accommodate at most four cars waiting
(seven in station) at one time. The arival patterns are Poisson with a mean of one
car per minute during the peak-hours. The service time is exponential with mean 6
minutes. Find the average number of cars in the service station during peak
nours, the average waiting time and the average number of cars per hour that
cannot enter the station because of full capacity. WBUT 2013]
Answer:
ere, S=3, N =7,2 =1per min., u=1/6 permin.
0.000145.
OPRS-129
6 x0.000145, 0Sns3
P,=
3
x0.000145,
3 3 Sn s7
=APL -5(n-3P,+3-P
N
Now, L, =L, +S-P
n=0 n! n!
n=3 n=0
=P +2P, +3P, +4P,)+3-0.000145x3+2x18+18]|

3.459
Therefore, average number of cars in the service station during peak hours is
3.459
(approx.).
Average waiting time in the system is
L, 3.459
20.99 = 21 min.
1-P1-Py) 1(1-0.8352) =
2. Arrivals at telephone booth are considered to

be Poisson with an average time
of 10 minutes between one arrival and the next. The length of the phone
calls is
assumed to be distributed exponentially, with a mean of 3 minutes.
a) What is the probability that a person arriving at the booth will
have to wait?
b) The telephone department will install a second booth
when convinced that
an arrival would expect waiting for at least 3 minutes for a
phone call. By
how much should the flow of arrivals increase in order to justify
a second
booth?
What is the average length of the queue that forms from time to
d) What is the probability that it will take customer more
time?
than 10 minutes
altogether to wait for the phone & complete his call? WBUT 2013]
Answer:
Given:
1010 u=
(a) Prob.(w> 0)=1-P,
==0.3 10
b) Averagewaitingtime in the queue

4
Since W,=3,4=l= 4 for second booth, 3 =- 4=0.16.
4)
Hence, increase in the arrival rate=0.16-0.10 0.06 arrival per minute.
(c) Average length of the queue = 1.43 persons.

=7
OPRS-130
OPERATIONS RESEARCH
Prob. (waiting time in the system2
)P 10)
30
dx=0.03.
10
3.
Customers arrive at a one-window
ibution with mean 10 per
distrib drive-in bank according to a
an 5 minutes. The
mean o space hour.
space in fron
Service
vice time
time per customa
customer to Poissona
mean
ar can
nutes. The front of the window, including is exponential WIt
accommodate a maximum of 3 cars. that for the servi
rviced
ca
space. Other cars can wait outside this
i)What is the probability that an arriving customer can drive
space in front of the window? directly to the
ii) What is the probability that an arriving customer will
the indicated space? have to wait outside
ii) How long is an arriving customer expected to wait before starting service?
iv) How many spaces should be provided in front of the window so that all
the
arriving customers can wait in front of the window at least 20% of the time?
WBUT 2015]
Answer:
Here,
i) Po+P+p, =1-
-
A=10 cars / hour and u=12 cars /hour
= 0.42
ii) 1-(Po+P +P)=1-042=0.58

10. = 0.417 hours.
ii) 12(12-10)
u-)
iv) P+R=0.30 for waiting at least 20% of the time.
There should be at least one car space
calls at a telephone booth is according to Poisson

4. Arrival rate of telephone 9 minutes between two
consecutive arrivals.
average time of
distribution, with an assumed to be exponentially distributed, with mean
The length of telephone call is
3 minutes. a person arriving at the booth will have to
i) Determine the probability that
wait. formed from time to time.
fi) Find the average
queue length that is second booth when convinced that an
telephone company will install a 4 minutes for the'phone. Find
ti) The to wait at least
expect to have a second booth.
arrival would flow rate of arrivals which will justify
to wait for more than 10
increase in arrival wll have
the probability that an WBUT 2016]
iv) What is the phone is free?
minutes before the
Answer:
Given A-u=3 OPRS-131
(i) Probability (w> 0) 1-

93
(i) Expected queue length=T
in the queue
(ii) Expected waiting time
W
H(-2)
Since W =3, 4=i, A=1 for second booth.
3 l=0.16
minute.
Hence, increase in the arrival rate= 0.16-0.11=0.05 per
(iv) Probability (waiting time is the system2 10)
20
= ]S(4-2)edw=e1u-)=e=
10
OPRS-132
OPERATIONS RESEARCH
NONLINEAR PROGRAMMING PROBLEM
Multiple Choice Type

Questions
"Kuhn-tucker" conditions pertainto
a) Non-linear Programming Problems WBUT 2013
b) ((MIMI1):(o/ FCFS)} Problems
c)LPP with degeneracy
d) None of these.
Answer: (a)
2. Dynamic problem deals with the WBUT 2014

a) multi-stage decision making problems
b) single stage decision making problemss
c) time dependent decision making problems
d) problems which fix the levels of different decisions
Answer: (C)
LLong Answer Type Questions

1.Use dynamic program tosolve the following problem: WBUT 2013, 2017]
Maximize Z=yf +yí+yi
Subject to :
+2 +y, 215
2Ys20
Answer: is three stage problem
Since the number of decision variable is three, the given problem a
defined as follows:
S3
+2 +y3 215
S =S2 +Y2
and f6,)= minly? + S,6)
3
minlyi + s)
Ss)=
iG)= =6, -n}
w.r.t. y, is zero.
minimum, ifits derivative
+(s-y2is
ie. 2 +2(6, -v2)=0
or,
OPRS-133
Hence, f6,)=2
Now,
4t,)-mini-*]
O S05)- mipl +505-»*] ky+»*»21s|
Since the minimum value of the function y+(1s-s* occur at y3=5,
s1s)-+05-5 =75.
Thus =
s15®yj 5,
25-=15-5=10n=2=5,
- =10-5 =5 =5.
Hence, the optimal solution is (5,5,5 and fs63)=75.
2. Use the method of Lagrangian multipliers to solve the following non-linear
programming problem:
Minimize Z = 2x + +3x +10x, +8x +6x, -100
=
subject to
t +, 20
g>0. WBUT 2016]
2
Answer:
Lagrangian function can be formulated as:
L)=2++3 +10x, +8x, +61,-10-(4 ++%-20)
The iecessary conditions for maximum or minimum are
aL L
4x+10-2
Ox
=0;=2x, +8- =0
OL
+6-A =0; (%+%+%-20)=0
Putting the value of x,x, and x, in the last equation 0 and solving for
30. Substituting the value of A in the other three equations, we get an extreme point:
423,)=5,11,4
To prove the sufficient condition whether the extreme point solution gives maximum or
minimum value of the objective function we evaluate (n-1) principal minors as follows:
OPRS-134
OPERATIONS RESEARCH
o1
0 11 1
40 4
10 2
is
Since sign of A, and A, are alternative, therefore extreme point: (%zs)=(5,11,4)
= 281.
a local maximum. At this point the value of objective function is, Z
OPRS-135
POPULARPUBLICATIONS
GAME THEORY
matrix is formed in favVour of player A
game theory problem if the payoff
(all the elements of the matrix will be profit of
A), then he should follow
WBUT 2014
a) max-max principle b) min-max principle
c) max-min principle d) min-min principle
Answer: (c)

WBUT 2014]
1. Solve the following game whose pay off matrix is given by:
Player B
B1 B1 B2 B3 B4
A1 4 64
18|
A2 2 13 7
6
A3 115 173
A4 12 2
76
Answer:
We have,
B1 B2 B3 B
A 18 4 6 4
Az 6 2 13 7
As
115173 12 2
A7 6
is dominated by Therefore we can discard
B3. B3 and the
By dominance property, B2
reduced matrix is
B
B2
B4
A 18 44
Az6 2 7
As1 5 3
47 6|2
Again the linear combination of B2 and Ba dominated by B1, so we can discard B and we
get,
B B4
A4 4
A22 7
A 5 3
A62
OPRS-136
OPERATIONS RESEARCH
Linear combination of Aj and A4 dominates Ag. So discarding Ag we get,

B2 B
A44
A27
Again,
A6 2
linear combination of Az and As dominates so we discard Aj and the
A,
following matrix is
B2
B
A 2 7
Now if , A4
6 2
be the probabilities with which A and As played and ya, Y., be the
probabilities with which B, B, played for the optimal solution.
2-6
4-13
2-7
4
25
4-13 9 9
and the value of the game is
442 38
4-13 9
LLong Answer Type Questions

1. A company is currently involved in negotiations with its union on the upcoming
wage contract. Positive signs in table represent wage increase while negative sign
represents wage reduction. What are the optimal strategies for the company as
well as the union? What is the game value? WBUT 2017
Union Strategies
U U,|U U,
0.25 0.27 0.35 0.02
Company. 0.20 0.06 0.08 0.08
Strategies
0.14 0.12 0.05 0.03
C 0.30 0.14 0.19 0.00
Answer:
Given, the payoff matrix is
U U0.27 U0.35-0.02
U Row minima
-0.02
C 0.25
C 0.20 0.060.08 0.08 0.06

0.12 0.05 0.03 0.03
C 0.140.14
0.30 0.14 0.19 0.00 0.00
0.30 0.27 0.35 0.08
Column maxima
OPRS-137
POPULARPUBLICATIONS
0.03, 0.00=0.06
Max (Row minima) = Max {-0.02, 0.06,
0.35, 0.08) =0.08
in (Column maxima) = Min {0.30, 0.27,
Therefore, this game has no pure strategy.
propetties and the resulting matrix is:
strategies, now we apply dominance
rixed
(1) U, is dominated by U,; therefore,
U U U
C 0.25 0.27-0.02
0.20 0.06 0.08
C H
C 0.14 0.12 0.03
0.30 0.14 0.00
C
(2) U, dominates U; therefore,
U U
G 0.27-0.02
C 0.06 0.08
C 0.12 0.03
0.14
C 0.00
Now we apply graphical method, in order to obtain the mixed strategies:
Axis- (U) Axis-lI (Ui)
Min (Max)
2.5
Ca 1.5
.5. C 0.5
0 0
-0.5 - -0.5
-1.5 -1.5
So the resulting payoff is

U, U
C 0.27 -0.02|
C 0.06 0.08
OPRS-138
OPERATIONS RESEARCH
The optional strategies are:
P Pa 0 0PtPa =1|
(U, U, U, U\
and
Su0 0
0.08-0.06 0.02
"(0.27+0.08)-(0.06-0.02) 2
0.31 31
29
Pa1 31 31
0.08+0.02
0.31 31
30
and a 31
The value of the game is5X027+0.06x0.02 = 0.07355
0.31
OPRS-139
POPULARPUBLICATIONS
DUALITY THEORY
LMultiple Choice Type Questions

1. If Dual has WBUT 2014, 2016]
unbounded solution, primal
a) no feasible solution nbounded
b) unbounded solution
c) feasible solution d) none of these
Answer: (a)
LShort Answer Type Questions

1. Obtain the dual of WBUT 2014
the following primal LPP:
Maximize
Z-2x,-2x,-4x,
Subject to 2x +3x, +5x, 22
3x,++7x, S3
* +4x +6x, s5
where, x,,X2,* 20
Answer:
At first the standard form of the given LPP is
Max z=2x-2x,-4x .
S.t. 2x-3x-5x, S-2

3x ++7x, 3
+4x, +6x, <5
So the dual problem of the given primal LPPis
Min w=-2x, +3x +5x
S.t. -2x +3x +x2-2
-3x+ +
4x,2-2
-Sx +7x +6x, 2-4
and 2, 20
2. Find the dual of the LPP:
WBUT 2017]
Maximize Z 2x- X +¥3
Subject to 4 *+, S50
+2x-5x, S80
2, +, +4, $20
2 20
OPRS-140
OPERATIONS RESEARCH
Answer:
problem is given by
Dual of the given primal
Min W=50y +80y, +20y,
subjectto ++2y,22
+2 +y2-1|
+4,21
and Pa 20
Write down the dual of the following L.P. Problem:
1. WBUT 2016
Minimize Z 2x, +5x, +X
subject to, 2x +2-z $2
-3x +2x,-5x,2-6
4x+3x,+x 210
2 220
Answer:
The standard form of the given LPP is
Max W-(2x, +5x, +)
subject to 2x, +- $2
3x-2x, +5x, S6
4-3x2-,S-10
and 2 20.
So the dual of the given primal is
Min W'=2u+6v-10w
subject to 2u+3v-4w2-2
u-2v-3w2-5
-u+5v-w2-1
and u, V, w20.
2. Find out the dual of the following problem: WBUT 2017]

Maximize Z=2x, +3x-43
subject to 3x + +x $2
4x+3x,24
+X, =5
-5x
220 and x, is unrestricted.
OPRS-141
Answer:
Since the primal
problem has 3rd constraint is equality in sign, so the 3 variable
dual problem will unrestricted of
Similarly, as the be3rd variable
in sign.
the primal LPP is unrestricted in sign, therefore,
constraint of the dual LPP will of 3
The standard form of be equality in sign.
the given LPP is
Max Z =2x +3x,-4x,
subjectto 3x +x +x, S2
4x-3x, S4
and , X20-5x
Therefore, the required
and
+x
z
=5
is unrestricted in sign.
dual problem is
Min W = 2 -4y, +3Ys
subjectto 3y, +4y+y, 22
-5y 23
y5 + y, =-4
and y y2 20 and y, is unrestricted in sign.
OPRS-142
OPERATIONS RESEARCH
INVENTORYCONTROL
Multiple Choice Type Questlons
1, In EOQ inventory problem with no shortage, in which demand is assumed to be

fixed and completely pre-determined, the economic lot size is WBUT 2017]
2DC 2DC
aC b) c) 2DcC d) none of these
Answer: (a)
1. The rate of use of particular raw material from stores is 20 units per year. The
cost of placing and receiving an order is Rs. 40. The cost of each unit is Rs. 100.
The cost of carrying inventory in percent per year is 0,16 and it depends upon the
average stock. Determine the economic order quantity. WBUT 2017]
Answer:
Given R=20 units per year
C =CxI=100x0.16=R16per unit per year
C=R40per order
Optimal lot size
16
No. of orders peryear=2
C
units.
OPRS-143

Operations Research (Organizer)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Operations Research (Organizer)

Uploaded by

Copyright:

Available Formats

OPERATIONS RESEARCH

Introduction to Operation Research 2

NTRODUCTION TO OPERATION RESEARCH

Short Answer Type Questions

year 1952, when aSEAC

application [B] demonstrates how operations research as used to enhance

Long Answer Type Questions

in place to meet those needs for the long

2. Total number of allocations in a basic feasible solution of transportation

3. Which method is used to solve the LPP, if constrains having Artificial

4. A basic feasible solution is called... .. if the value of at least

5. Which of the follo:.ing is not a major requirement

6. The number of methods used in solving

Short Answer Type Questions

respectively. Formulate the Linear programming Problem. [WBUT 2015)

4. Show that X = |(x,y)/x* +y' s4 is a convex set. WBUT 2015

solve the following linear programming

6. Find the maximum value of Z =5x +7*2 WBUT 2016

Write the LPP in its standard form:

(i) There must well-defined objective

40, x, =30 and Max. Z = Rs.710.

solve this problem by simplex algorithm (Table- 1)

the optimal solution by simplex

in the Gomory's constraints]

and integers, we get optimal solution by Dual Simple:

Here ABCDA is the feasible region.

2. A company manufactures two products X and Y. The profit contributione of

respectivol milarly the requirements of products

Long Answer Type Questions

2. A firm makes two types of furniture: chairs and tables.

2x +5x, s 60 (for W.S. -I)

9. Which method is used

3. How many Artificial variables

4. The dual of the dual in a LPP will

What is the method used to solve an LPP involving artificial variables?

Following is the starting tableau

Write down the

Long Answer Type Questions

LCB B b Min. Ratio

Now introducing artificial variables we ge,

Here condition is satisfied.

3.Solve the following by simplex method WBU

Here all z,- C, 20.So the optimality condition is satisfied.

Max z = 6x +8x, +0 x, +0°X4

Here all z-, 20, so the optimality condition is satisfied.

6. Solve by Charnes' big-M method the following LPP: MODEL QUESTION

Using simplex algorithm solve the following LPP:

Here are negative. Hence the

of this problem is unbounded.

introduce an artifclal variable x, with

According to simplex method (Table-1)

9.Use simplex algorithm to solve the following LPP: (MODEL QUESTION

where X,X, are the surplus varjables and

18/5 /10 /10

Here all 2, -C, 20. so optimality condition issatistied

3. The assignment matrix

4. For a salesman who has to visit n

5. Which method in Transportation problems gives the nearest optimal

6. The number of Basic variables in a transportation problem is at most

transportation problem with m-roWS and n-columns

case of degeneracy while small

transportation problem is a balanced