Operations Research 8th & 6th Sem Mechanical

As·per the New Syllabus of VTU
Choice Based Credit System (CBCS)
'
'
OPERATIONS RESEARCH
For 5th Sem B.E Mechanical Engineering & 6th Sem CSE/ISE
By
Dr. Ranganatha Swamy. L. · Dr. B.K. Narendra
M.Tech, Ph.D, MIE M.E, MBA, Ph.D
Associate Professor & Head Principal
Department of Mechanical Engineering B G S Institute of Technology
B G S Institute of Technology Adichunchanagiri University
Adichunchanagiri University BG Nagar, Mand ya - 571448.
B G Nagar, Mandya - 571448.
SUNSTAR PUBLISHER
#4/ I, Kuppaswamy Building, I9th Cross,
Cubbonpet, Bengaluru - 560002
Phone:OS0-22224143
E-mail: sunstar884@gmail.com
Operations Research for s•h Scm B.E Mechanical Engineering & (,•• Sem CSE/ISE
Authored by Dr. Ranganatha Swamy. L. and Dr. ll.K. Narcndra
Published by Sunstar Publisher, Bengalufl\ - 2.
I(
L: Pi;f~t;e >J
PREFACE TO FIRST EDITION
© Authors & Publisher We are pleased to put forward the first edition of the text book Operations Research. This book
is framed as per 2015 CBCS Scheme ofVTU and ACU syllabus.
The contents of the book are as follows:

No of Copies : 1000 Module l presents the historical outlook of operations research approach, its characteristic
Pages : X + 603 features and phases involved in effective decision making. It also point out the situations in which
Paper used: 11.2 kg (58 GSM) West Coast Maplito linear programming technique can be used.
First Edition : 2019
Book Size : 1/41h Crown Module 2 emphasis on simplex algorithm used to interpret and analyse solution for any LP
problem and significance of the duality concept.
Module 3 discusses on identification and formulation of transp011ation problem involving
large number of shipping routes from several origins to different consumption points and
Copy Right: Every effort has been made different transportation algorithms used to tackles those problems. It also proposes the features of
Published by : to avoid errors or commissions in this assignment problems and technique used to handle such problems.
SUNSTAR PUBLISHER publication. In spite of this, some errors
#41 l, Kuppaswamy Building, 19th Cross, might crept in. Any mistake, error or Module 4 signifies the importance of scheduling the various activities associated with any
Cubbonpet, Bengaluru - 560002 discrepancy noted maybe brought to our project to ensure its completion within specified time with minimum cost using two differem
Mobile: 080- 22224143 notice which shall be taken Gire of in the project management techniques- PERT and CPM. It also dealt with different elements of a
next edition. It is notified that neither the
E-mail: sunstar884@gmail.com published nor the authors or seller will .1 queuing system, its operating characteristics and use of probability distribution in arriving at the
be responsible for any damage or loss relationship among variety of performance measures.
of .action to <1ny one, of any kind. In any
manner, therefrom. Module 5 reviews how the optimal strategies arc formulated under conditions of conflict and
No part of this book may be reproduced competitive environment in arriving at decision making and use of dominance rules in reducing
Composed By: or copied in any form or by any means the size of the payoff matrix. It also reveals with the sequencing techniques for formulating the
(graphic; electronic or mechanical, .i optimal time table for the jobs, materials and other resources that are very much needed to assist
SB SOLUTIONS ·I
including, taping or information retrieval I
Bengaluru - 2 system) or reproduced on any disc, tape, the production schedule.
perforated media or other information
storage device, etc., without the written
permission of the publishers. Breath of
this condition is liable for legal action. Dr. Ranganatha Swamy. L.
Printed at:
For binding mistakes, misprints or for
missing pages, etc.. the publisher's . Dr. B.K. Narendra
liability is limited to replacement within
Prashanth Graphics one month of purchase by similar edition.
Bangalore All expenses in this connection are to
borne by the purchaser. ~
All disputes are subject to Bangalore s:--:.1 GUR!J !(RU?A
Jurisdiction only . ::mft. '/lG\'!~SH'.i.!;~~·J. 2,c;;~:.:.z s-:-:,·:-
1 '.'!<). ::·3. t<·:;LE:'~.\ ..,·; 2. ::r•-'..~~~
:\v~·m;s F.:."'c i1-··; :'·' _,;Q!S- - <::' •:<7
0
.~! & h ... ' ;:.-:''-'"': c'.i.:~,'.;; :. · '"'."-~

---~~.~,·
OPERATIONS RESEARCH
Subject Code : 15ME81 I.A. Marks: : 20
Hours/Week ~03L+ 02T, Exam Hours : 03
! Total Hours :50 Exam Marks : 80
I
~ Course objectives:
I. To enable the students to understand the scientific methods of providing various departments
We would like to express our sincere pranams and gratitude to Poojya Sri Sri Sri Dr.
Nirmalanandanatha Mahaswamiji, Pontiff Sri Adichunchanagiri Mahasamasthana Math
for his Divine blessings and his encouragement in our venture.
I:f
of an organization with a quantitative basis of decision making.
2. To enable the students to understand the importance of various tools-and techniques in finding
optimaholutions to problems involving limited resources in the fonn ofMen, Materials and
machinery. .
We are greatly indebted to the Hon'ble Vice Chancellor, Dr. S. Chandrashekara Shetty,
Adichunchanagiri University, BG Nagara and Dr. C. K. Subbaraya, Registrar, Adichunchanagiri
University, BG Nagara for their immoral support and encouragement in all our ventures.
IModule - 1 . --- -- - 08 Hours I
We would like to extend gratitude to Lt. Prof. M. Raja Ram for guiding and mentoring in
~roduction: Evolution of OR, Definitions of OR, Scope of OR, Applications of OR, Phases in
OR study. Characteristics and limitations of OR, models used in OR.
bringing out the quality work. Linear Programming Problem (LPP), Generalized LPP- Fonnulation of problems as L.P.P.
We are greatly indebted to D. N. ShekharaReddy of Mis Sunstar Publisher, Bangalore Solutions to LPP by graphical method(Two Variables).
for publishing this book and we also thank Mr. A. Shivakumar for taking keen interest and co-
ordination for their DTP work in preparing this book.
We also.thank our staff for their encouragement and suggestions in the outcome of this book.
IM~=2____ -·---- 12Hoursl
LPP: Simplex method, Canonical and Standard form of LP problem, slack, surplus and artificial
Dr. Ranganatha Swamy. L. variables, Solutions to LPP by Simplex method, Big-M Method and T~o Phase Simplex Method,
Dr. B.K. Narendra Degeneracy in LPP. Concept of Duality, writing Dual of given LPP. Solutions to L.P.P by Dual
Simplex Method.
1~·=3---- ll-Ho~..;1
?an.sporta!ion Problem: Formulation of transportation pro?le~, types, initial bas.ic f~asib~e

. I solution usmg North-West Corner rule, Vogel's Approximation method. Optimality m
Transportation problem by Modified Distribution(MODI) method. Unbalanced T.P. Maximization
T.P. Degeneracy in transportation problems, application of transportation problem .
.!
_,.Xssignment Problem-Formulation, Solutions to assignment problems by Hungarian method,
Special cases in assignment problems, unbalanced, Maximization assignment problems.
TraveHing Salesman Probfom {TSP). Difference between assignment and T.S.P, Finding best
route by Little's method. Numerical Problems.
.,
II HI
\
IModule-4 . -- -l~rs]
Network analysis: Introduction, Construction of networks, Fulkerson's rule for numbering the
I ..Contents . I
nodes, AON and AOA diagrams; .Critical path method to find the expected completion time
of a project, determination of floats In networks, PERT networks, determining the probability MODULE-1
of completing a project, predicting the completion time of project; Cost analysis in networks.
Crashingofnetworks- Problems.
ICHAPTER - 1 INTRODUCT\ON 1.1 - t.81
Aueuing Theory: Queuing systems and their characteristics, Pure-birth and Pure-death models I. I Development I Origin of Operations Research I. I
(o.!~ly equations), Kendall & Lee's notation of Queuing, empirical queuing models - Numerical 1.2 Definition of Operations Research 1:1
on M/M/1 and MfM/C Queuing models. 1.3 Nature I Characteristics of Operations Research 1.2
1.3. I System orientation 1.2
/\ IModule - 5 · 08 Hours I 1.3 .2 Use of interdisciplinary teams 11
':,'flame Theory: Definition, Pure Strategy problems, Saddle point, Max-Min and Min-Max criteria. 1.3.3 Application of scientific method 11
Principle of Dominance, Solution of games with Saddle point. Mixed Strategy problems. Solutio~1
1.3 .4 Uncovering of new problems 11
of 2X2 games by Arithmetic method, Solution of 2Xn m and mX2 games by graphical method.
Formulation of games. 1.3.5 Improvement in the quality of decisions/solutions IJ
~equencing: Basic assumptions, Johnson's algorithm, sequencing 'n'jobs on single machine using 1.3.6 Use of computer IJ
priority rules, sequencing using Johnson's rule-'n' jobs on 2 machines, 'n 'jobs on 3 machint:s. 'n' 1.3. 7 Quantitative solutions IJ
jobs on ·m' machines. Sequencing of 2 jobs on 'm' machines using graphical method. 1.3 .8 Human factors IJ
Course outcomes: 1.4 Scope I Areas of Applications of Operations Research IJ
On completion of this subject, studeqts will be able to: 1.4.1 In Industry IJ
I. Understand the meaning, definitions, scope, need, phases and techniques of operations 1.4.2 In defense operations IJ
research. 1.4.3 In finance I developing economies IJ
2. Formulate as L.P.P and derive optimal solutions to linear programming problems by graphical 1.4. 4 In agriculture
method, Simplex method, Big-M method and Dual Simplex method. IA
3. Formulate as Transportation and Assignment proble111s and derive optimum solutions for 1.4.5 In marketing 1.4
transportation, Assignment and travelling salesman problems. 1.4.6 In personnel management IA
4. Solve problems on game theory for pure and mixed strategy under competitive environment. 1.4. 7 In production management IA
5. Solve waiting line problems for M/M/I and M/M/K queuing models. 1.4.8 In UC IA
6. Construct network diagrams and determine critical path, floats for deterministic and PERT
1.5 Phases of OR I Methodology ofOR I OR Approach I How OR Works fj
networks including crashing of Networks.
7. Determine minimum processing times for sequencing of njobs-2 machines, njobs-3machines, 1.5. I Formulating I defining the problem 1.5
n jobs-m machines and 2 jobs-n machines using Johnson's algorithm. 1.5.2 Collection of Data lj
1.5.3 Construction of mathematical model lj
1.5.4 Deriving solution from the model lj
1.5.5 Testing the model and use the model for prediction 1.5
1.5.6 Selection of suitable alternative lj
1.5.7 Conclusion of study and presentation of results to the organization Jj
1.5.8 Implementation and evaluation of recommendations lj
1.6 Objectives of Operations Research lj
IV v
1.7 Advantages of Operations Research 1.6 MODULE-3
1.8 Disadvantages I Limitations of Operations Research 1.6 CHAPTER- 3 TRANSPORTATION PROBLEMS 3.1 - 3.62
1.9 Models in Operations Research 1.7
1.9. l Classification of Models . 1.7 3. l Formulate the Transportation Problem as LPP I Show That Transportation Problem is LPP J. I
1.9.2 Characteristics of a Goqd Model 1.8 3.2 Definitions Related to Transportation Problem 3.2
\
3.3 Steps Involved in Solving Transportation Problem I The Transportation Algorithm 3.2
3.4 Methods of Finding Initial Solution 3.3
l~HAPTER-2 LINEARPROGRAMMING --2.l~-2~19~
3.4.1. North-West Corner Method (NWCM) 3.3
2:1 Linear .Programming (LP) 2.1 3.4.2 Vogel's Approximation Method (VAM)/Regret Method/Meth0<fof Penalties 3.3
2.2 Linear Programming Problem (LPP) 2.1 3.5 Test for Optimality 3.8
2.3 Requirements of A Linear Programming Problem 2.1 3.5.1 Modified Distribution (MODI) Method/ U-V Method/Method of Multipliers 3.8
2.4 General Structure of Linear Programining Model 2.1 3.6 Closed Loop and its Properties 3.9
2.5 Procedures for the Formulation of Linear Programming Problem 2.2 3.7 Key Points for Solving The Problems 3.9
2.6 Operations Research is more than just Mathematics 2.31 3.8 Unbalanced Transportation Problem 3.25
2. 7 Important Definitions Related to LPP 2.31 3.9 Maximization Transportation Problem 3.29
2.8 Graphical Solution ofTwo Variable LP Problems 2.32 3.10 Degeneracy in Transp?rtation Problem and Its Resolution 3.44
2.8. l ISO - Profit (cost) function line method 2.32
2.9
2.8.2 Extreme point solution method
Conclusions Drawn from the solution ofLPP by Graphical Method
2.32 [ CHAPTER-=-4 ASSIGNMENT PROB~EMS -- - 4.1 - 4.80 I
2.103
4.1 Assignment Problem as A Mathematical Model/ LPP 4.1
MODULE-2
4.2 Difference Between Transportation Problem and Assignment Problem 4.2
2.10 Simplex Method 2.104
4.3 Hungarian Method I Reduced Matrix Method I Flood's Technique to solve an
2. I I Assumptions of LPP 2.107
Assignment Problem 4.3
2.12 Canonical Form of LPP 2.107
4.4 Maximization Case in Assignment Problem 4.16
2.13 Standard Form of LPP 2.107
4.5 Multiple Optimal Solutions in Assignment Problem 4.42
2.14 SimplexAlgorithm 2.108
4.6 Space Restriction Problem 4.54
2.15 Tie For Entering Basic·Variable (Key Column) 2.129
4.7 The Solution to Assignment Problem is Inherently Degenerate 4.59
2.16 Tie For Leaving Basic Variable (Key Row)-Degeneracy 2.129
4.8 Travelling Salesman Problem 4.59
2.17 Artificial Variables Techniques 2.131
4.9 Fo1mulation ofTravelling Salesman Problem As LPP 4.59
2.17. I Big~M method IM- Technique I Method of Penalties 2.131
2.17 .2 Two-Phase Method 2.148
2.18 Conclusions Drawn from the solution of LPP by Simplex Method/ Table 2.164
2.19 Advantages of Linear Programming 2.164
•
2.20 Limitations of Linear Programming 2.164
2.21 Duality in Linear Programming 2.165
2.21.1 Dual problem when primal is in canonical form 2.165
2.22 Dual Simplex Method 2.184
VI VII
I
I
MODULE-4
CHAPTER- 5 NETWORK ANALYSIS (PERT- CPM TECHNIQ!JES) 5.1 - 5.88 I 'CHAPTER- 7 GAME THEORY
MODULE-5
• 7.1 - 7.661
5.1
-
Basic Requirements of Project 5.1
j 7.1 Classification of Games I Characteristics of Game Theory 7.1
5.2
5.3
Phases of Project Management •
Network Techniques
5.3.1 CPM (Critical Path Method)
5.1
F
5.2
I ~
I•I
7.2
7.3
7.4
Definition Related to Game Theory
Strategies
Assumptions I Characteristics of Two-Person Zero-Sum Games
7.2
7.2
7.3
5.3.2 PERT (Programme Evaluation and Review Technique) 5.2 i 7.5 Pure Strategies (Minimax and Maximin Principles) For Games with Saddle Point 7.4
5.4 ·.. NETWORK LOGIC 5.3 J 7.6 Rules to Determine Saddle Point 7.5
5.5 Fulkerson's Rule of Numbering the Events I Nodes 5.3 iI 7. 7 Rules I Principles of Dominance 7.11
5.6 Activity - on - Node (AON) network 5.4 :~ 7.8 Mixed Strategies: Game without the Saddle Point 7.11
5.7 Activity- on -Arrow (AOA) network 5.4 7.8.l Arithmetic meth_od to solve (2 x 2) games without saddle point 7.12
5.8 Salient features of a Project 5.4 7.8.2 Solution of (2 x n) and (m x 2) games by graphical method 7.34
5.9 Critical Path Analysis 5.9
.~
5.9.1 Determination of floats and Slac~ Times 5.9 [cW.rTER- 8 SEQYENCING 8.1 - 8.ssl
5.9.2 Importance of Total float 5.10
8.1 Terminology used in Sequencing 8.1
5.10 Programme Evaluation And Review Technique (PERT) 5.28 ~
8.2 Basic Assumptions 8.1
' 5.11 Crashing The Network 5.54
.1
l 8.3 Processing /1 Jobs Through One Machine Using Priority Rules 8.2
5.11.1 Direct costs 5.54
8.3.1 Short Processing Time (SPT) Rule 8.2
5.11.2 Indirect cost 5.55 ~
8.3.2 Weighted Shortest Processing Time (WSPT)Rule 8.2
i··... .•
5.12 Project Crashing Procedure 5.56
I 8.3.3 Earliest Due Date (EDD) Ruic Li
1
1:
·_1:
'
~-
jettAITTR- 6 oYEUlNG THEORY
6.1 Elements/Structure/Characteristics of Queuing System

6.1 - 6.301
6.1
'
.~,i
8.4
8.5
8.3.4 Slack Time Remaining (STR) Rule
Johnson's Rule: Processing N Jobs Through Two Machines
Johnson's Rule: ProcessingN Jobs Through Three Machines
8.3
8.15
8n
,g
,_.L, 6.2 Operating Characteristics of A Queuing System 6.4 8.6 Johnson's Rule: Processing N Jobs Through M Machines 8.36
1:
6.3 Classification of Queuing Models 6.4 8.7 Johnson's Rule: Processing Two Jobs Through M Machines 8~
J: !f
J- 6.4 Pure Birth ancLPure Death Process/ Models 6.4
..t
!;'.
~
6.5 Kendall's Notations 6.5 ')
Standard Normal Cumulative Probability Table I
T 6.6 Limitations of Queuing Model 6.5 .;
j Question Bank 3
L 6.7 List of Symbols and Formulae 6.6 Model Question Paper - I
m II
L :.!:
lj Model Question Paper - 2
l. 15
i "
'·.ill
~
Bibliography
9
19
~
~
I
i~1
!t
VIII
i. IX
'l
I
I
I
rl '
i , Modu!e - 1 !
J -- - - - - - - - -- ~----
\
l
l
•
~
~·
•N"
i'
:o::·
!
'~1 ~-{l;)EVELOPMENTFORIGIN OF' OPERATIONS RES~ff.
t The name Operations Research was coined by Mc Closky and Trefthen in 1940 In UK
t during Second World war, because the team of scientists was carrying out the research on
(military) operations.
During Second World War, the military management in England called on a team of
scientists. The objective was to find out the most effective allocation (deployment) of
i
} limited military resources such as newly invented radars, British Air Force planes etc., to
l the various military operations and to the activities within each operation. This group of
scientists formed the first OR team.
1if
Soon after the war, the· success of military teams attracted the attention of industrial
managers who were seeking solutions to their problems. Industrial Operations Research was
I ~
developed in UK and USA. In USA, the National Research Council formed a committee on
operations research in 1951. The growth of OR has reached to many countries of the world,
~
1 ~
as a result, International Federation of Operations Research Societies was founded in 1959
which comprises of member societies from different parts of the world.
i
_'(
In India, the first OR unit was established in the Regional Research laboratory at Hyderabad
in 1949. In the meantime, Defense Science Laboratory was set up to clear up the problems
·r of stores, purchase and planning.
i'
-~
1.2 '[jEFINITION OF'O~,f;~TIO.NS'RESEARCH
i
i An operation refers to a set ofcourseofactions required for the accomplishment of desired
~r objective. Some 9,f the definitions suggested for operations research are shown below:
I
·';j I. Operations research is an art of giving bad answers to the problems to which
otherwise, worse answers are given. -Thomas L Saaty
ri 2. Operations research is an application of scientific method by' interdisciplinary teams
1 ;I
for the problems involving the control of organized systems (man-machine) so as
to provide solutions which best serves the purpose of an organization as a whole.
-Ackoffand Sasieni
l
Pit OPERATIONS RBsEARCH
I
I
~
~
Ilr'J'!lODUCTIOll
. ...
I
3. Operations research is a scientific method of providing executive departments with 1.3.5 Improvement in the quality of decisions/solutions
a quantitative basis for decisions regarding the operations under their control. OR gives bad answers to the problems, otherwise worse answers are given to those. By
- Morse and Kimball applying its scientific-approach, it can only improve the quality of the so,lution, but it may
i
not be able to give perfect solution.
Jn scientific method (Approach), actual problem/situation is expressed in the form of
·number of mathematical equations. \ '! 1.3.6 Use of computer
·1.3 NATURE I CHARACTERISTICS OF OPERATIONS RESEA~CH
I
'rhe essenti<1J characteristics of operations research are
Ia OR requires a computer to solve complex mathematical models and to manipulate a
large amount of data or to perform a large number of computations that are involved.
-~1
a) System orientation ~
b) Use of interdi?ciplinary teams ; 1.3.7 Quantitative solutions
;~
c) Application of scientific method OR provides the management, a quantitative basis for decision-making. It will give
d) Uncovering of new problems an:;wec like for example: The profit to the company is 'X', if decision 'A' is taken and is
e) Improvement in the quality of decisions (solutions) 'Y', ifdecision 'B' is taken and so on.
f) Use of computer
g) Quantitative solutions and 1.3.8 Human factors
h) Human factors. While obtaining the quantitative solutions. we do not consider the human factors, which
play a great role in the problem faced. OR study is incomplete without a study of human
1.3.1. System orientation
~ factors.
_g
Every organization has several divisions. Any activity performed (decision taken) in the t
one division affects the activities of eve1y other division. Therefore. in OR study, before ~ 1.4 SCOPE/ AREAS OF APPLICATIONS OF OPERATIONS RESEARCH
taking any decision, one must identify all possible interactions and determfoe their impact Whenever there is a problem for optimization, there is scope for the application of OR
on the organization as a whole.
1.a.2,Use·of interdisciplinary teams 1I in the following fields.
1;4;1111 l~dustry
OR study is performed by a team of scientists whose individual members are drawn :l
Jn industries, there is series of problems, starting from purchase of raw materials to !ht:
J
from different scientific and engineering disciplines. The people frcim different disciplines
'
dispatch offinished goods. In order to take decisions, OR team consider various alternativt:
can produce more unique solutions providing better results than one could be expected methods of producing the goods and return (profit) in each case. OR study also point
-~
from the same number of persons from a single discipline. No single person can collect all ft
out the possible changes in the entire systt:m like installation of nt:w machine, incrt:ascd
f:
useful scientific information from all disciplines. automation etc. OR has been successfully applied in industries, in !ht: field of production.
blending, sale and purchase, transportation and planning etc.
1.3.3 Application of scientific method
Jn OR, scientific met~od is used to solve the problem under study. The OR team do 1.4.2 In defense operations
not conduct any experimentation on the system, instead the actual situation I problem is Generally, defense operations are carried out by number of agencies likt: Air force, Navy
expressed in the form of mathematical model (set of mathematical equations) and conduct and Army. Under each agency, there will be sub-activitit:s like operations, intelligt:nct:,
research on it. administration, training &tc. There is a need to co-ordinate various activities in order to
1.3.4 Uncovering of new problems
!i achieve desired results. Operations Research conducted by team of experts from each field
plays a major role in accomplishing the desired goals.
The solution of an OR problem may uncover number of new problems. All uncovered t
problems need not be solved at the same time. In order to get full benefits, each of them
must be solved individually by continuity of research. ~:
i~
1.4.3 In finance I developing economies
f;; The basic problem of various countries is to remove poverty and hunger. There is a great
I
scope for OR experts (economists, statisticians, technicians, politicians and agriculturists)
working together to solve this problem with an OR approach
:1.
]\'
Pli'r--··
I ~(j~-
C>PzRATIOl'lS IUsEARCH
I +~~~f\ . . .
·~:~,J~ll1-~!~'~8l~~~~~r-:. .
1 ·~llViiow
I
i) "To maximize the per capita income with minimum resources.
iif To find out the profit plan for the country etc.
1.4.4 In agriculture OR study generally involves the following eight major phases
With population explosion and consequent shortage of food, every country is facing
the problem of optimum allocation of land to various crops- in accordance with climatic
I a) Formulating I defining the problem
b) Collection of data
I
c) Construction of mathematical model to represent the problem under study
conditions and available facilities as well as the problem of optimal distribution of water -d) Deriving solution from the model
from various resources for irrigation purposes. These problems can be solved by OR e) Testing/Verifying the model and use the model for prediction
approach. · ~
·1] t) Selection of suitable alternative
g) Conclusion of study and presentation of results to the organization
1.4.5 In marketing h) ·l1I1plementation and evaluation of recommendations
With the help-~f OR techniques, a marketing manag~r can decide
.t·:
1.5~1 Formulating I defining the problem
i). Where to distribute ihe products for sale so that the total cost of transportation is
minimum. In order to find the solution, the problem must be clearly defined by OR team. Defining
~
ii). Size of the stock to meet the future demand. li the problem includes specifying
iii). How to select best advertising media with respect to time and cost etc. i) Environment: The frame work within which the system has to achieve its goal. It
includes men, machines, materials etc.
1.4.6 In personnel management ii) Decision maker: The person who is in actual control of the operations (system) under
"
~
i' study.
The personnel manager can use OR techniques
i). To appoint the most suitable persons on minimum salary. iii) The objectives: The set of goals to be achieved.
ii). To determine the best age of r~tirement for employees. iv) Constraints I restrictions: The limitations on fulfilment of the objectives.
iii). To find out the number of persons to be appointed on full time basis when work load I 1~5~~&Collection of Data
is seasonal. iq
~ It involves the collection of data of the various parameters which affectthe organization
1.4.7 In production management problem and those data to be used in the next phase.
A production manager can use OR techniques i 1~~-~-Ponstruction of mathemcltica1-·mo.del
i). To find out the number and size of the items to be produced.
This involves the mathematical representation qf the actual problem I situation in
ii). In scheduling and sequencing the production run by proper allocation of machines. the fonn of equations. The equations include objective function, decision variables and
iii). To select, locate and design the sites for the production plants. constraints I restrictions.
1.4.8 In LIC 1.514 Deriving solution from the model

The LIC officer can use OR techniques to decide the premium rates of various policies. The solution can be obtained from a model/set of equations either by conducting
1.4.9 OR approach is atso applicable to big and small organizations while ta1ting any experiments on it i.e. by simulation or by mathematical analysis.
i'
decisions to minimize the cost and maximize the profit (benefit). Mathematical analysis has two procedures
1.4.IOOR techniques t:an also be used in big hospitals to reduce waiting time of out-door
patients and also to solve administrative problems.
Ii i) Analytical method: It involves the use of calculus, algebra etc.
ii) Numerical method: It involves the use of simple trial and error to complex iteration.
1.4.11 OR techniques are also used in the area of transportation to regulate train arrivals and i
~
their running times. 1;5.5 Testing the model and use the model for prediction
I
l
This involves to check whether the mathematical model -developed accurately represents
the reality (problem) and also to check the validity of the model for some other situation.
1i
lL
.., OPERATIONS REsEARCB INTRODUCTION
~
1.5.6 Selection of suitable alternative ii) Mathematical models are applicable only for specific categories of the problem.
With the given model and set of alternatives, OR scientists have to choose the alternative iii) A non-linear relationship changed to linear for fitting the problem to linear
that best meets the organiz.ation ~bjectives. programming pattern. This may disturb the reliability of the solution.
iv) Generally, there will be resistance from the employees to the new proposals of OR
1.5.7 Conclusion of study and presentation of results to· the organization
v) Management. who has to implement the advised proposals of OR, may itselfotfer a
This involves the submission I presentation of the model and recommendations to the lot of resistance due to conventional thinking.
organization by OR team. Sometimes, OR people have to give several alternatives and let vi) OR process is a time consuming, costlier one.
the organJzation to choose the one that best meets its needs.
f 1.9 MODELS IN OPERATIONS RESEARCH
1.5.8 Implementation and evaluation of recommendations
-~
i
A Model in OR is the idealized representation of real-life situation in the form of
If the organization has accepted the study, then the recommendations must be i, mathematical equations. The objective of the model is to provide an aid.for analyzing the
implemented and constantly monitored to ensure that the recommendations enable the ::~
behavior of the system for the purpose of improving its performance.
organization to meet its objectives.
1.9.1 Classification of Models
1.6 OBJECTIVES OF OPERATIONS RESEARCH
~
The models are broadly classified into following types.
i) To minimize the cost (total cost) and maximize the profit. E a) Iconic or Physical Models
ii) To provide a scientific basis to the manag~rs of an organization for solving the ii[
'1 b) Analogous or Schematic Models
problems involving interactions of the components of the system, by employing fJ c) Symbolic or Mathematical Models
II
team of scientists drawn from different disciplines, for finding a solution which is in -'i;
d) Static Models
the best interest of the organization. as a whole. ~ e) Dynamic Models
i;
ii t) Deterministic Models
f 1.7 ADVANTAGES.OF OPERATIONS RESEARCH f g) Probabilistic Models
""' h) Descriptive Models
1. Optimum use of production factors.: Linear programming techniques indicate how ~
a manager can.most effectively utilize his production factors by efficiently selecting j i) Predictive Models
~. j) Prescriptive Models
and distributing these elements. i~
~'.', k) Analytic Models

2. Improved quality of decision: OR always improves the quality of solution by
employing scientific approach. OR gives the clear picture of effect of different ~ 1. Iconic Model: This is a physical or pictorial representation of various visible features
ele'!~entsi1.n1 ()lved in the problem and it also indicate effect on the profit due to of the real system. The iconic models resemble the system they represent but differ in
changes made in the production method (pattern). size.
3. Preparation of future managers: OR techniques very much helpful in improving Example: Globes used to represent the various continents, oceans and other
!he knowledge and skill of young managers. geographical features of the earth.
4. Modification of mathematical solution: OR presents a possible solution that exists 2. Schematic Model: These models arc used more often and use one set of properties
for a given problem, but it is the responsibility of the manager to accept or modify to represent some other set of properties the system under study possess.
the solution before its use. Example: A flow process chart that represents order of occurrence of various events
5. Alternative solutions: OR techniques give all alternative solutions available fol"the to make a product.
given problem so that management may decide based .on their strategies. 3. Symbolic Model: This uses mathematical symbols like letters and numbers, etc.to
represent the decision variables of the system under study.
1.8 DISADVANTAGES I LIMITATIONS OF OPERATIONS RESEARCH Example: An equation representing kinetic energy.
~.
i) Mathematical models of OR do not take in to account emotional factors {such as 4. Static Model: It represent a system at a specified time and does not take into account
human relations) which are quite real. the changes over a time.
Example: An assignment problem.
"I'
"i~
.,
"'It·-.· OJ>uArio*8 -JhsEARCH
S. DynamiC.Model: It represents the sitq~tion where the time often ptays an important
role.
Example: A dynamic pro~ming problem.
6. Deterministic Model: It is one in which variables are completely defined and
~
outcomes are certain.
I
CHAPTER- 2
Example' Transportation problem
7. Probabilistic Model: it is one in which the input and/on>utput variables take the LINEAR PROGRAMMING
form of p_robability distribution.
Example: Game theory is a probabilistic model. ~
8. Descriptive Model: it is one which describes some features of the system on the l"a
basis of observation, survey or questionnaire etc. ~
<;'
Example: Pie diagram and layout plan describes the salient features of their respective 2.1 LINEAR PROGRAMMING (LP)
system:
;~ It is a mathematical modeling technique used to find the best allocation of scare or
9. Predictive Model: It predict or explain the behavior of the system based on some ~ limited resources such as labour, material, machine, money etc in order to maximize the
data. profit or to minimize the loss or to utilize the production capacity to the maximum extent.
i:;J
Example: Predicting the election results based on the survey. ~
~
Linear Programming deals with the optimization (maximization I minimization) of a
i) Prescriptive Model: It prescribes a course of action for a problem.
function of variables known as Objective function subjected to set of linear equalities and
Example: A linear or dynamic problem.
ii) Analytic Model: It is one in which exact solution is obtained by
i /or inequalities known as Constraints.
mathematical methods.
i
\§
The objective function may be profit, cost, production capacity or any other measure of
effectiveness, which may be obtained in the best possible (optimal) manner. The constraints
Example: General linear programming model.
i
~
may be imposed by the different resources such as market demand, storage capacity, money,
1 ·9~2- -Chara<:teristics-of a· Good Model -t availability of raw material, time etc.
i) The number of assumptions made to simplify it should be as less as possible.
ii) The model should be simple and approaching the reality.
I~
2.2 LINEAR PROGRAMMING PROBLEM (LPP)
iii) It should be easy and economical to construct.
i3 The problem in which the number of relations is not equal to the number of variables
iv) Number of variables used should be as less as possible. i and many of the relations are in the form of inequalities to those an objective function is
0
v) It should be adaptable to parametric type of treatment ll. subjected, is known as linear programming problem.
~
2.3 REQUIREME-NTS OF A LINEAR PROGRAMMING PROBLEM
~
~
Linear Programming can be used for optimization problems ifthe following conditions
!£ are satisfied.
~ I. There must be a well-defined objective function (profit, cost) which is to be either
ii
1 maximized or minimized and which can be expressed as a linear function of decision
• ~
! variables.
I
2. There must be constraints on the extent of attainment of the objective and these
-constraints must be expressed as linear equalities/ inequalities in terms of variables.
3. There must be alternative courses of action.
~
!~ 4. The decision variables should be interrelated and non-negative. The non-negativity

conditions show that the linear programming deals with real life situations.
'~!~
.ill.
I
I
5- The resources must be in limited supply.
-
2.4 GENERAL STRUCTURE
The general structure of LP modelI
OF LINEAR PROGRAMMING MODEL
OPERATIONS REsEARCH
consists of three basic elements.

1. Decision variables: Certain variables (activities) are used to evaluate cours.es of a~tion
1.
LINEAR PROGRAMMING
PROBLEMS ON FORMULATION OF LPP

A firm manufactures 2 types of products A and B and sells them at a profit of
Rs.2 on type A and Rs.3 on type B, each product is processed on 2 machines
G and H. Type A requires 1 minute of processing time on machine G and 2
. ~.,,-_ ! •:: .• ,
to find the optimal value of objective function are called as decision variables usually minutes on machine H. Type B requires I minute on machine G and I minute
denoted by x 1• x2 .... ... x". on machine H. The machine G is available for not more than 6 hours 40 minute,
The value of certain variables is under the control of the decision maker: such variables are while machine H is available for 10 hours during any working day. Formulate
"said to be sontrollable and values of these variables are to be determined from the solution the problem as a linear programming problem.
of the problem. · Sol. Note : The students are not necessary to show the data in the tabular form
A variable that is a function of external environment and over which the decision maker has Given data is tabulated as follows:
Processin~ time
no control. is called uncontrollable variable. Type of Product Profit
In the LP model, all decision variables are controllable and non-negative i.e. x 1, x2 • ,.x". Machine G Machine H
I
A Rs. 2 I unit I min/unit 2 min/unit
2. Objective function: The objective function of each LP problem is expressed in terms of 8 Rs. 3 I unit I min/unit I min/unit
decision variables to optimize the criterion ofoptimality (measure of performance) such as Maximum availability of machines 400 minutes 600 minutes
profit, cost. distance etc. Since profit on the sale of each unit of products A and 8 is given, the objective of the
The general form of objective function is I firm/ company is to maximize the profit, which in turn depends on number of units
Optimize (maximize or minimize) Z = c1x1 + c,;is +........+ c"x" where
Z =Variable of measure of performance depends on x1, ~' •••••• x".
i
j
of products A and B produced.
Step 1. Identify the decision variables·
Let x 1 be the number of units of product A produced/day,
c ,c 2, ....c =Contributions of a uilit of the respective variables x 1, x2, ....... x0 to measure
1 0 x2 be the number of units of product B produced/day.
-···,I. of performance z.
Step 2. Write objective function in terms of decision variables
The optimal value of the given objective function is obtained by the graphical method or
"'i: ' simplex method.
Let Z be the total profit on the sale of products A and 8.
J
t Product A
1 unit gives -+ Rs. 2 profit
II
.i: x1 units give-+ Rs. 2x 1 profit
-~.: 3. The constraints: There are always certain limitations (restrictions) on the use of
resources such as labour, machine, raw material, money etc., which limits the degree to Product B
l: which an objective can be achieved. The constraints are expressed as linear equalities or I unit gives -+ Rs. 3 pro.fit
-~
i: inequalities in terms of decision variables. x2 units give _,_. Rs. 3x 2 profit
-~· ~ The objective function is
,..
!:''' ~
lL::
! 2•5 PROCEl>ORES FOR THE FORMULATION OF LINEAR I Maximize Z = 2x 1 + 3x 2
Step 3. Identify the constraints .
l.
PROGRAMMING PROBLEM
I. Identify the decision variables carefully by analyzing the given problem.
I
i
Product A
Machine G
1 unit takes -+ 1 minute to process

i ... 2. Write the objective function.in terms of decision variables, which represents the I x1 units take-+ x 1 minutes to process
I
objective of an organization. Product B
3. Identify the constraints I limitations on the requirement/ availability in the given I unit takes-+ I minute to process
problem. x2 units take-+ x2 minutes to process
4. Write the non-negativity constraints. Machine H
I
Product A
·;
i
·;~ -~
,•.1
'hi
Pit OPERATIONS R£sEARCH LINEAR PROGRAMMING
~
I unit takes --+ 2 minutes to process Cost ofx 2 units-'-+ Rs 2~ -
x, units take--+ 2x 1 minutes to process Product C
Product B Cost of I unit= Rs.4
I unit takes-+ I minute to process Cost ofx 3 units== Rs 4JS
X units take-+ x, minutes to process
7
The objective function is
The constraints are Maximize Z == 3x 1 +2":!+4x1
x, + xe :S 400 (Constraint on the maximum availability of machine G) Step 3. Identify the constraints
2x 1 + xe :S 600 (Constraint on the maximum availability of machine H) MachineG
Step 4. Write non-negativity constraints Product A
x 1, x2 '.:': o. as the number of units of products produced cannot negative. I unit takes-+4 minutes to process
2. A firm manufactures 3 products A, Band C. The profits are Rs. 3, Rs. 2 and Rs. x, units-+ 4x 1 minutes
4 respectively. The firm has 2 machines and below is the required processing Product B
time for each machine on each product. I unit takes-+3 minutes to process
X units-+ 3x, minutes
A B c 7
P-roduct C -
Machine G 4 min 3 min 5 min
I unit takes-+5 minutes to process
Machine H 2 min 2 min 4 min x3 units-+ 5x1 minutes
Machine G and H have 2000 and 2500 minutes respectively. The firm must Machine H
manufacture 100 As, 200 Bs and 50 Cs, but not more than 150 As. Setup an LP Product A
problem to maximize the profit. Do not solve it. I unit takes-+2 minutes to process
Sol. Given data is tabulated as follows: x 1 units-+ 2x 1 minutes ..
Type of Processing time No. of units must Product B
Profit I unit takes-'-+2 minutes to process
I
,.i Product MachineG MachineH be manufactured
"'
':·· ~units-+ 2x2 minutes
A Rs. 3/unit 4 min/unit 2 min/unit 100 :SA::; 150 Product C
1:· B Rs. 2/unit 3 min/unit 2 min/unit 200 I unit takes-+4 minutes to process
,,~.
.:
c Rs. 4/unit 5 min/unit 4 min/unit 50 I
x, units-+ 4x, minutes
~
The constraints are
Availability of
2000 minutes 2500 minutes I 4x 1 + 3x2 + 5x3 ::; 2000 (Constraint on the maximum availability of machine G)
~'i.
Machines I 2x 1 + 2x 2 + 4x 3 ::; 2500 (Constraint on the maximum availability of machine H)
Since profit on each unit of products A.Band C is given,.the objective of the firm "
~ I 00 :S x 1 :S 150 (Constraint on the no. of units of product A produced)
is to maximize the profit. which depends on number of units of products A. 8 and C ~
X 200 (Constraint on the no. of units of product B produced)
i
'.:':
7
respectively.
x~'.:': 50 (Constraint on the no. of units of product C produced)
Step 1. Identify decision variables Step 4. Write non-negativity constraints
~
Let x1 be the number of units of product A produced/day,
x2 be the number of units of product B produced/day, I
!;
x 1, x~, x3 '.:': O; as the number of products produced cannot be negative.
iJ. A person has to provide lO, 12 and 12 units of chemicals A, Band C respectively
x3 be the number of units of product C produced/day. ~
Step 2. Write objective function in terms of decision variables I to his garden. A liquid product contains 5, 2 ami 1 units of chemical A, Band
I
Let Z be the total profit on products A, Band C. C respectively per jar and costs Rs. 3 per jar. A dry product contains 1, 2 and
Profit 4 units of chemical A, B and C respectively per packet and costs Rs. 2 per
Product A packet. How many of these, person should purchase to meet the requirement at
Cost of I unit-+ Rs.3
i minimum cost. Formulate this problein as an LPP.
t
Sol. Given data is tabulated as follows:
Cost ofx 1 units-+ Rs 3x, I
...-- -~1
Product B I
I
Cost of I unit--+ Rs.2
.I
jj,
I;;
(;jl
- Type of
chemical
A
Minimum requirement of
·-
chemicals
I0 units
OPERATIONS REsEARCH
Liquid
product
S units/jar
Dry product
I unit/packet
LIBEAR PROGRAMMING
The objective is to maximize the profit.

Let Z be the maximum profit. The objective function is given by
Maximize Z = 8x I + 7x,-
-
8 12 units 2 units/jar 2 units/packet Step 3: Identify the constraints
x1 :S 20000 (Constraints on the \vailability of ingredients for medicine A)
c 12 units I unit/jar 4 units/packet
x, :S 40000 (Constraints on the availability of ingredients for medicine 8)
Cost of product Rs. 3/jar Rs. 2/packet x; + ~:::; 45000 (Constraints on total number of bottles available)
Step 1: Identify the decision variables Time taken to fi 11 one bottle of medicine A is
-Let x, be the number of jars of liquid product purchased by a person, For I000 bottles--+ 3hrs taken
x7 be the number of packets of dry product purchased by a person. For I bottle --+ 31I000 hrs.
Step 2: Write the objective function in terms of decision variables Similarly, time taken to fill one bottle of medicine Bis
The objective is to minimize the total cost. For I000 bottles--+ Ihr taken
Let Z be the minimum cost. The objective function is given by For I Qottle -+ II I000 hr.
Minimize Z = 3x I + 2x,- (3/1000) x1 + (1/1000) x2 :::; 66 (Constraints on total time available)
I
Step 3: Identify the constraints Step 4: Write the non-negativity constraints
Sx, + x" 2:: I0 (constrains on chemical A) x1, x2 2:: O; as number of bottles produced cannot be negative.
2x 1 + 2x 2 2:: 12 (constrains on chemical 8)
5. Evening shift resident doctors in a government hospital works 5 consecutive
x, + 4x 2 2:: 12 (constrains on chemical C)
days and have 2 consecutive days off. Their 5 days of work can start on ·any day
Step 4: Write non-negativity constraints j
of the week and the schedule rotates indefinitely. The hospital requires following
x1, x2 2:: O; as the number of units of chemicals cannot be negative. I minimum number of doctors working:
"'J .,.4, The manufacturer of patent medicines is proposed to prepare a production plan i Sm1day Monday Tuesday Wednesday Thursday Friday Saturday
for medicines A and B. There are sufficient ingredients available to make 20000
l
i
I,,
bottles of medicine A and 40000 bottles of medicine B. There are only 45000
bottles into which either of the medicines can be filled. Further it takes 3 hours
to prepare enough material to fill 1000 bottles of medicines A and 1 hour to
prepare enough material to fill 1000 bottles of medicine B and there are 66
II 35 SS 60 so 60 so
No more than 40 doctors can start their 5 working days on the same day.
Formulate the general LP model to minimize the numb.er of doctors employed
by the hospital.
4S
hours available for this operation. The profit is Rs. 8/bottle for medicine A and Sol. Step 1: Identify the decision variables
-f ;: Rs. 7/bottle for medicine B. Formulate this problem as an LPP and find how the I! Let x1 be the number of doctors who can start their work on Sunday,
manufactures schedule its productions in order to maximize the profit. x, be the number of doctors who can start their work on Monday,
't:'. Sol. Given data is tabulated as follows: I x: be the number of doctors who can start their work on Tuesday,
Type of
Maximum ingredients
available/ maximum number
Maximum
number of
Tim_e required ..
for filling 1000
Profit
I x4 be the number of doctors who can start their work on Wednesday,
xs be the number of doctors who can start their work on Thursday,
t
medicine
of bottles can be produced bottles available bottles x6 be the number of doctors who can start their work on Friday,
i..
i A 20000 45000 3 hrs. Rs. 8/bottle x7 be the number of doctors who can start their work on Saturday.
'B
Maximum
40000 I hr. Rs. 7/bottle
-'.-.
i
~
Step 2: Write the objective function in terms of decision variables
The objective of the hospital is to employ minimized number of doctors.
• tim~ available
for lilling
66 hrs. Let Z be the number of doctors employed, then the objective function is written as
Minimize Z = x 1 + x2 + x3 + x4 + xs + X 6 + X7
I
Step 1: Identify the decision variables Step 3: Identify the constraints
Let x1 be number of bottles of medicine A prepared, x1 + x4 + xs + x6 + x7 2:: 3S (Constraint on the number of doctors work on Sunday)
is be number of bottles of medicine 8 prepared. ~ + xs + x6 + x7 + x, 2:: 55 (Constraint on the number of doctors work on Monday)
Step 2: Write objective function in terms of decision variables x3 + x6 + x7 + x1 + x2 2:: 60 (Constraint on the number of doctors work on Tuesday)
I
x4 + x7 + x1 + x2 + x3 2:: 50 (Constraint on the number of doctors work on Wednesday)
;j \
~~ .. ~
..• :L
- 0PERATIORS REsEARCH
x5 + x1 + x~ + x3 + X 4 ~ 60 (Constraint on the number of doctors work on Thursday)

x6 + x2 + x3 + X 4 + xs ~SO (Constraint on the number of doctors work on Friday)
x., + x3 + X4 + xs + x6 ~AS (Constraint on the number of doctors work on Saturday)
LIREAR PROGRAMMING
Machine
M1
Chair
3
Table
3
• Available time·
36
:
...
Step 4: Write non-negativity constraints l\12 5 2 50
0 :S xi :S 40; where i = 1,2,3, ... 7. M3 2 6 60
How should the manufacturer schedule his production in order to maximize
6. A firm can produce 3 types. of cloth, say: A, B a_nd C. Three kinds of wool are contribution?
required for it, say: red, green and blue wool. One-unit length of type A cloth Sol. Given data is tabulated as follows:
needs 2 meters of red wool and 3 meters of blue wool; and I-unit length of
type Rcloth needs 3 meters of red wool, 2 meters of green wool and 2 meters Processing time Contribution/
Type of furniture
of blue wool; and one-unit length of type C cloth needs 5 meters of green wool M M, M. profit
and 4 meters of blue wool. The firm has only a stock of 8 meters of red wool, 10 Chair 3 hrs/unit 5 hrs/unit 2 hrs/unit Rs 20/unit
meters of green wool and 15 meters of blue-wool. It is assumed that the income Table Thl·s/unit · 2 hrs/unit ti hrs/unit · · Rs 30/tmit
obtained from one-unit length of type A cloth is Rs. 3.00, of type B cloth is Rs. Availability of machines 36 hrs/week 50 hrs/week 60 hrs/week
S.00, and of type C cloth is Rs. 4.00. Determine how the film should use the
available material so as to maximize the income from the finished cloth. I Step 1: Identify the decision variables
Let x1 be the number of chairs produced per week,
x, be the number of tables produced per week.
Kinds of wool Step 2: Write the objective function in terms of decision variables
Type of cloth Profit
___
'
Red Blue Green The objective is to maximize the profit.
., _______ ,.. ..
A 2 m/unit length 3 m/unit length Rs. 3/unit length Let Z be the total profit on the sale of chairs and tables. The objective fum:tion is
B
c
3 m/unit length 2 m/unit length 2 m/unit length Rs. 5/unit length I Maximize Z = 20x 1 + JOx,
Maximum
quantity of wool
4 m/unit length 5 m/unit length Rs. 4/unit length
IOm
I Step 3: Identify the constraints I limitations
The constraints are on the availability of machines M1, M, and 1\1 3
Jx 1 + 3Xz :S 36 (Constraints on the availability of machine 1\1 1)
available 8m 15 m
Sx 1 + 2x, :S 50 (Constraints on the availability of machine M,)
Step 1: Identify the decision variables 2x 1 + 6x~ :S 60 (Constraints on the avai'labilit{ of machine !'vi)
Let x1 be the unit length/quantity (in meters) of cloth type A produced,
x, be the unit length/quantity (in meters) of cloth type 8 produced, fi Step 4: Write non-negativity constraints
x1, x2 2'. O; as the number of units produced cannot be negative.
X: be the unit length/quantity (in meters) of cloth type C produced. ~ 8. A person wants to decide the constituents of a diet which will fulfil his daily
Step 2: Write objective function in terms ofdedsion variables i
requirements of proteins, fats and carbohydrates at minimum cost. The choice
The objective of the firm is to maximize the profit. I'.ii is to be made from four different types of foods. The yields per unit of these
~
Let Z be the total profit. then objective function is as it foods are given in the table below:
Maximize Z = 3x 1 + 5x2 + 4x 3 "
Step 3: Identify the constraints or limitations i Food type
Yield per unit· Cost per
2x 1 + Jx, :S 8 (Constraints on the availability of Red wool) i Proteins Fats Carbohydrates unit (Rs.)
3x 1 + 2x, + 4x, :S 15 (Constraints on the availability of blue wool)
I I 3 2 6 45
2x, + 5x 3 :S I 0 (Constraints on the availability of green wool) ~ 2 4 2 4 I 40 .
Step 4: Write non-negativitJ constraints
x1, x2, xJ ~ 0; as the quantity of wool produced cannot negative.
I 3 8 7 7 85
4 6 5 4 65
7. A firm makes two types of furniture; chairs and tables. The contribution for Minimum requirement 800 200 700
each product as calculated by the accounting department is Rs 20 per chair and
Rs 30 per table. Both products are processed on three nwchines l\1 1• M2• M3. The
time required in hours by each product and total lime a' ailable in hours per
t Formulate an LP model for the problem.
Data:
Food I --> Rs. 45/unit--> 3(P) + 2(F) +:6(C)
I
week on each machine is as follows
:J
Food 2 --> Rs. 40/unit--> 4(P) + 2(F) + 4(C)
.i
J
,,3
J.
- Food 3 --+ Rs. 85/unit--+ 8(P) + 7(F) + 7(C)
()pERATIOl'lS REsEARCH
LINEAR PROGRAMMING
Step 3. Identify the constraints

20x 1 + I Ois :5 500
•
...
(Constraint on the availability of production time)
Food 4--+ Rs. 65/unit _, 6(P) + 5(F) + 4(C) x, :5 40 (Constraint on sale of 27-inch sets)
Minimum protein requirement= 800 units JS'.5 JO (Constraint on sale of20-inch sets)
Minimum fat requirement= 200 units Step 4. Write non-negativity constraints
Minimum carbohydrates requirement= 700 units x1, is 2: O; as the number of units of tv sets produced cannot be n_egative.
Sol. Step I: Identify the decision variables 10. A city hospital has the following minimal daily requirements for nurses.
Let x, be the no. of units of food 1 in diet,
x, be the no. of units of food 2 in diet, Period Clock Time (24 hr. day) Minimal number of nurses required
' x: be the no. of units of food 3 in diet, 1 6 A.M-10 A.M. 2
x4 be the no. of units of food 4 in diet. 2 lOA.M-2 P.M 7
Step 2: Write objective function in terms of decision variables
2 P.M-6P.M 15
The objective of a person is to minimize the cost.
Let Z be the total cost of diet, then the objective function is
;
'.~
3
4 6 P.M-10 P.M 8
~
Minimize Z = 45x 1 + 40x2 + 85x3 + 65x4 ~~
.,;:; 5 10P.M-2A.M 20
Step 3: Identify the constraints/ limitations
The constraints are on the quantity of protein, fats and carbdhydrates in the diet.
I 6 2A.M-6A.M 6
Nurses report to the hospital at _the beginning of each period and work for 8
'"
3x 1 + 4x2 + 8"1+6x4 2: 800
2x 1 + 2x 2 + 7"1+5x 4 2: 200
(Constraint on protein in diet)
(Co1istraint on fats in diet)
;* consecutive hours. The hospital wants to determine the minimum number of
nurses to be employed so that there will be sufficient number of nurses available
~
6x 1 + 4x2 + 7"1+4x4 2: 700 (Constraint on carbohydrates in diet) for each period. Formulate this as an LPP by setting up appropriate constraints
Step 4: Write non-negativity constraints I and objective function. Do not solve.
x1, x2, "1• x4 2: 0: as number of units produced cannot be negative. i Sol. Step I: Identify the decision variables
9. Formulate a linear prog~amming model for the problem given below. The apex I Lei x1 be the number of nurses reported to hospital during period 1,
II
television company has to decide on the number of27-inch and 20-inch sets to x2 be the number of nurses reported to hospital during period 2,
be produced at one of its factories. Market research indicates that at most 40 x3 be the number of nurses reported to hospital during period 3,
of the 27-inch sets and 10 of20 inch sets can be sold per month. The maximum x4 be the number of nurses reported to hospital during period 4,
numberofwork hours available is 500 pe'r month. A 27-inch set requires 20 work xs be the number of nurses reported to hospital during period 5,
hours and 20-inch set requires 10 work hours. Each 27•inch set sold produces l! x6 be the number of nurses reported to hospital during period 6.
a profit of$120 and each 20-inch produces a profit of$80. A wholesaler agreed ..~ Step 2: Write the objective function in terms of decision variables
The objective of the hospital is to employ minimized no. of nurses.
to purchase all the television sets produced if the numbers do not exceed the
maxima indicated by market research. (Jan 2010, 05 Marks)
I
~-
Let Z be the total number of nurses reported, then the objective function is
~
.i Sol. Given problem-is-tabulated as follows· t Minimize Z = x, + x2 + x3 + X 4 + xs + X 6
Type of television set Production time Maximum sale Profit
I Step 3: Identify the constraints/ limitations
The constraints are on the availability of nurses during each period.
II
27-inch 20 hrs/unit 40 units/month $120/unit x1 +is2: 7 (Constraint on no. of nurses required for period 2)
20-inch I 0 hrs/unit I 0 units/month $80/unit x2 + x3 2: 15 (Constraint on no. of nurses required for period 3)
Maximum production time available 500 hrs/month x3 + x4 2: 8 (Constraint on no. of nurses required for period 4)
ii'
[\! x4 + xs 2: 20 (Constratnt on no. of nurses required for period 5) o
Step I. Identify decision variables
xs + x6 2: 6 (Constraint on no. of nurses required for period 6)
Let x1 be the number of units of 27-inch set produced/month,
x6 + x1 2: 2 (Constraint on no. of nurses required for period I)
x, be the number of units of20-inch set produced/month.
Let Z be the total profit on sale of tv sets. Step 4: Write non-negativity constraints
x1, x2, x,, x4, xs, x6 2: O; as number of nurses reported cannot be negative.
The objective function is
Maximize Z = 120x1 + 80x2
'"I~
~
..
l l.
0PERATIOifS REsEARCH
A_boat .manufacture builds two types of boats: type A and type B. The boats
built during the months January-June go on sale in the months July-December
LINEAR PRoGRAMMIIfG
~ 12.
· 4JFI
A student has .2 final exams to prepare.. For. each hour of study, he devotes to
course A, he expected to return him Rs. 600 in terms of long range benefits and
at profit of Rs. 2000/ type A boat and Rs. 1500/type B boat. Those built during each hour of study he devotes to course Bis expected to return Rs. 300 in terms
the months July-December go on sale in the months Jaouary-Ju!Je at a profit of long ran~e benefits. The shops are closed. The student has only 15 chocolates
of Rs.4000/type A boat and Rs. 330IJ/type B boat. Each type A boat requires 5 rl:'maining. He feels he needs I chocolate every 20 minutes while studying for
hours in the carpentry shop and 3 hours in the finishing shop. Each type B boat course B and l every 12 minutes while studying for course A. It is necessary
requires 6 hours in carpentry shop and l hour in the finishing shop. During each that the student must devote at least 2 hours for study. The student would like
half year period, a maximum of 12000 hours and 15000 hours are available in to maximize his return for the effort expended. Formulate this problem as an
th~· carpentry and finishing shops respectively. Sufficient material is available to . Ll'l'.
build no more than 3000 type A boats and 3000 type B boats a year. tt;ow many Sol. Giwn data is tabulated as follows:
of each type of boat should be built during ·each half year in order to maximize Note: Since consumption of chocolate is given in minute. express the time for study
the profit. Formulate it as LPP. also in minute
Type A--+ Profit Rs. 2000/unil
Profit Rs. 4000/unit
(July to December sale)
· (January to June sale) I Type of
exam
Return/benefit
Maximum
chocolates oresent
N.:ed of chocolates
Minimum
time for studv
5 hrs carpentry shop + 3 hrs finishing shop I unit
Type B --+ Profit Rs. 1500/unit
Profit Rs. 3300/unit
(July to December sale)
(January to June sale) l Course
A
Course
Rs. 600/hr
i.e. Rs. JO/min
Rs. 300/hr
15
I chocolate I 12 111 in
1 hrs
i.e. 120 min
II
I chocolate I 10 min
6 hrs carpentry shop + I hr finishing shop I unit B i.e. Rs. 5/min
Time of availability of carpentry shop S 12000 hrs/half year Step I: Identify the decision variables
Time of availability offinishing shop S 15000 hrs/half year Let x1 be the number of minutes a studerit devotes to course A,
Maximum boats material available/year S 3000 (Type A) x2 be the number of minutes a student devotes to course 8.
Maximum boats material available/year S 3000
Sol. Step I: Identify the deci~ion variables
Let x1 be the numb'er of type A boats produced/half year,
(Type 8)
l Step 2: Write objective function in terms of decision variables
The objective of a student is to maximize his return.
I
Let Z be the total profit/return, then the objective function is
x, be the number· of type A boats produced/half year, Maximize Z = IOx 1 + Sx 2
x; be the numberoftype B boats 1produced/half year,
< be the number of type B .boats produced/half year.
'f Step 3: Identify the constraints
Course A
For 12 min= I chocolate required
The objective is to maximize the profit. I
~ x1 min= (x/12) chocolates
Let Z be the total profit, then the objective function is Ifi· Course B
Maximize Z = 2000x 1 + 4000x 2 + I500x3 + 3300x; For 20 min= I chocolate required
Step 3: Identify the constraints I limitations
j
x2 min= (x/20) chocolates
The constraints are on the availability of carpentry and finishing shops, and raw
material availability
jw (x/12) + (x/20) SIS (Constraint on chocolates)
x1 + x2 2: 120 (Constraint on time to devote to study)
Sx 1 + 6x 3 :S 12000 :Constraint on availability of carpentry shop (July to December) I
Step 4: Write non-negativity constraints
5x2 + 6x; :S 12000 and (January to June)} I
I x x, :;::-0; as the number of mmutes devoted cannot be negative.
1
,
3x 1 + x3 :S 15000 :(Constraint on avail~bility of finishing shop (July to December) '-1~"13. A manufacturer makes twi products A and Beach of which is processed through
3x2 + x; S 15-000
I
and (January to June)}
4 departments I, 2, 3 and 4 in same order. Product A could be manufactured
x1 + x~ :S 3000 (Constraint on availability of raw material for Type A boat)
either by passing it through departments 1-3-4 or 2-3-4. Product B needs
x3 + x4 :S 3-000 (C-0nstrainl on availability of raw material for Type 8 boat) processing through departments 2-3-4 only. Their rates of processing in the
departments and profits per unit product arc given below:
x1, x2• x3, x,:::: O; as number of units produced cannot be negative.
j
lL I
.... Product
Profit
OPERATIONS REsEARCH
Rate of processinii: units/week

LINEAR PROGRAIDllllG
Product A Product A
..
(Rs. /unit) DI 02 03 D4 5 units processed ---+ I week I 0 units processed ---+ I week
A .- 500 5 -- 5 10
x, units processed---> (x/S) weeks x, units processed_, (x/10) weeks
A 450 -- 4 5 5·
8 550 -- ' 2 5 8
The company works on 50w.eeksayearbasis, but the down time in the department Product A Product A
varies and the expected number of production weeks from departments 1, 2, 3 5 units processed-+ I week 5 units processed ---+ I week
and 4 are 45, 42, 48 and 50 units respectively. There is a commitment of50 units x2 units processed---+ (x/5) weeks x, units processed---> (x/5) weeks
of A aqd 50 units of B every year. Formulate the problem as a LPP and solve it.
(Jan 2009, 15 Marks)
Sol. Given data is tabulated as follows: Product B Product B
Rates of processing in Minimum S units processed ---> I week 8 units processed ---> I week
Type of product Profit deoartments units/week) production/ x3 units processed-+ (x/5) weeks x3 units processed ---+ (x/8) weeks
o, D. o, o, year
x/5-S 45
A Rs. 500/un it 5 -- 5 10 x 'S225
1
{Constraint on numbeF of production weeks of department D,)
50
x,14 + x/2 'S 42
A Rs. 450/unit -- 4 5 5
x: + 2x; 'S 168 {Constraint on number of production weeks of department Di)
B Rs. 550/unit -- 2 5 8 50 x/5 + x/5 + x/5 'S 48
No. of production x + x2 + x3 'S 240 {Constraint on number of production weeks of department D3)
45 42 48 50 1
weeks of depts./year x/10 + x/5 + x/8 -S.48
The objective is to maximize the profit. x, + 2x 2 + I .25x3 'S 500 {Constraint on number of production weeks of department D)
J Step 1: Identify the decision variables x 1 + x2 ?: 50 (Constraint on production of product A)
!:,: Let x, be the number of uhi:s of product A processed through 1-3-4 produced/week, x3 ?: 50 (Constraint on production of product B)
x2 be the number of units of product A processed through 2-3-4 produced/week, Step 4: Write non- negativity constraints
x 1, ~ 2: O; as the number of units of products produced cannot be negative.
L x1 be the number of units of product B processed through 2-3-4 produced/week.
~ .: Step i: Write objective function in terms decision variables 14. A soft drink bottling plant has two machines A and B. Though machines A and
-~
Let Z be the total profit on the sale of products. The objective function is Bare designed for bottling 8- ounce and 16 - ounce respectively, each machine
+" Maximize Z = 500x 1 + 450x 2 + 550x 3 can be used on both types with some loss of efficiency. The following data is
I
~-·
~ Step 3: Identify the constraints available:
,-J;.i
L!·:· Department D1 Department D2 Machine 8 - ounce bottles 16 - ounce bottles
,_'!''"
~ '
Product A Product A A lOO/minute 40/minute
I: 5 units processed -+ I week 4 units processed---+ I week
--'"··: 8 60/minute 75/minute
t
.L
x 1 units processed-+ (x/S) weeks · x2 units processed---> (x/4) weeks Each machine can b~ run 8 hours per day. 5 days~k. Profit on each 8-ounce
bottle is Rs. 0.5 and that on 16 - ounce bottle is Rs. 0.8. Weekly production of
ProductB
2 units processed ---+ I week
I the drink cannot exceed 3,00,00!hbottles and the mark:et can absorb 8 - ounce
25,000 bottles and 16 - ounce 7,000 bottles per week. The production planner
of the bottling plant wishes to plan the production for maximization of profit.
~ units processed---+ (x/2) weeks Formulate the problem as LPP. (Jan 2010, 10 Marks)
Department D3 Department D4 Sol. Given data is tabulated as follows:
l.
:; ~~
ii j
·'
~\
""""' Type of
bottle
Processing time
Profit
OPERATIONS REsEARCH
Production
Q(bottles
Market demand
LINEAR ~OGRAMMING
Sol. Given:
New napkin cost-> Rs. 4/unit
.. ..
Machine A Machine B Washing charge of napkin --> Rs. 1.5/unit
8-ounce I 00 bottles/min 60 bottles/min Rs. 0.5/bottlc '.5 3,00,000 I :::; 25000 bottles/week Minimum numberofnapkins (new/washed) required-> Day I -. 75
16 - ounce 40 bottles/min 75 bottles/min Rs. 0.8/bottle week ::; 7000 bottles/week Day 2-. 60
Maximum Day 3 -.! IO·
40 hrs./wcck i.e.
upcralion of Day 4-. 65
2400 minulcsiwcck
mad1i11cs Day 5-. 125
Step I: Identify the decision variables -¥Step 1: Identify the decision variables
· · Let x1 be the no. of units of 8 - ounce bottles produced/week, Let x 1 be the number of new napkins used on day I,
x2 be the no. of units of 16 - ounce bottles produced/week. x, be the number of new napkins used on day 2,
Step 2: Write objective function in terms of decision variables x:_be the number of new napkins used on day 3,
The objective is to maximize the profit. x4 be the numbitr of new napkins used on day 4.
Let Z be the total profit, then the objective function is given by x5 be the number of new napkins used on day 5.
Maximize Z= O.Sx 1 + 0.8x, Step 2: Write the objective function in terms-of decision variables
Step 3: ldentif)' the constraints Total number of napkins available to use on any particular day= New napkins to be
Considering I minute of bottling process of machines, we have used on that day+ Total napkins used two days earlier (i.e. washed napkins)
Machine A Machine B Day 1:
JOO bottles produced__. I minute 60 bottles produced-> I minute Total number of napkins available to use= New napkins+ washed napkins
(i.e. napkins used two days earlier)
x bottles produced___. (x/100) minutes x1 bottles produced-> (x/60) minutes
1 =x, +O
Day2:
40 bottles produced --> I minute 75 bottles produced-> I minute Total number of napkins available to use= New napkins + washed napkins
x2 bottles produced---> (x/40) minutes x2 bottles produced-> (x/75) minutes (i.e. napkins used two days earlier)
The constraints are = x2 + {)
x/ I 00 + x/40 S 2400 (Constraint on bottling process on machine A) Day3:
x,/60 + x/75 S 2400 (Constraint on bottling process on machine 8) Total number of napkins available to use= New napkins+ washed napkins
X: + x, S 3,00,000 (Constraint on production of bottles) (i.e. napkins used two days earlier i.e. day I)
x, s; 25,000 (Constraint' on the market demand for 8 - ounce bottle) =x 3 +x 1
x2 s; 7,000 (Constraint on the market demand for 16 - ounce bottle) J Day4:
Total number of napkins available to use= New napkins + washed napkins
II
Step 4: Write the non-negativity constraints
x,, x, '.: O; as the number of bottles processed cannot be negative. (i.e. napkins used two days earlier i.e. day 2)
'
'.Jlf1s. = x, + x2
An institute wants to host a seminar for next five days. For delegates, there is an
Day5:
arrnngement of dinner every day. The requirement of napkins during the next
Total number of napkins available to use= New napkins+ washed napkins
five days is as follows.
(i.e. napkins used two days earlier i.e. day 3)
~ Day I I I 2 I 3 I 4 I 5
Minimumno.ofnapkinsrequired J 75 J 60 J 110 J 65 J 125
~
I = x5 +{x 3 + x 1)
The objective of the institution is to minimize the total cost.
I
The institute does not have any napkins in the beginning. After five days, the Let Z be total cost to meet the requirement. The objective function is
institute has no more use of napkins. A new napkin cost at Rs 4 and washing Minimize Z = 4x 1 +4x2 +4x, + l.5x 1 + 4x4 + I .5x2 + 4x 5 + 1.5 ( x, + x1)
charge for used one is Rs 1.5. A napkin given for washing after dinner on first Minimize Z = 7x, + 5.SJS + 5.Sx, + 4x, + 4x 5
d·1y is returned on the third day before dinner and so on. The institute decides Step 3: Identify the constraints I limitations
lv accumulate the used napkins and send them for washing just in time to be The constraints are on the usage of napkins on each day
used when they return. How to meet the requirements so that the total cost
i
~ minimized'! Formulate this as an LPP.
JL.
-. x1 ::=: 75
x,:::: 60
OPERATIONS_ REsEARCH
(Constraint on minimum number of napkins required on day 1)

(Constraint on minimum number of napkins required on day 2)
LllfEAR PROGRAMMING
Step 3: Identify the constraints
x 1 + ~ + x3 :'S I 00
..
(Constraint on the availability of land)
x; + 'S ::=: 110 (Con1>traint on minimum number .of napkins required on day 3) 5x 1 + 6~ + 5~ :'S 400 (Constraint on the availability oflabour)
x 2 + x4 ::=: 65 (Constraint on minimum number of napkins required on day 4) Step 4: Write non-negativity constraints
x 1 + x3 + x 5 ::=: 125 (Constraint on minimum number of napkins required on day 5) x" x2, x3 ::=: O; as the.area of land cannot be negative.
Step 4: Write non-negativity constraints 17. A company produces 2 types of hats, type A and type B. Each bat of the type A
. x,, x~, XJ, x., x5:::: O; as the number of napkins used cannot be negative. requires twice as much labour time as the type B. If all hats are of the type B
A' 16. A (armer has 100-acre farm. He can sell all tomatoes, lettuce and radish he can only, the company can produce total of500 hats a day. The market limits daily
~· rise. T~e price he can obtain is Re.1 per kg for tomatoes, Re. 0.75 per head for sales of the type A and type B to 150 and 250 respectively. Assuming that the
lettuce and Rs. 2 per kg for radishes. The average yield per acre is 2000 kgs of profit per unit are Rs. 8 for type A and Rs. 5 for type B. Formulate the problem
tomatoes, 3000 heads of lettuce and 1000 kgs of radishes. Fertilizer is available as an LP model in order to determine the number of hats to be produced of each
at Re. 0.5 per kg and the amount required per acre is 100 kgs each for tomatoes type so as to maximize the profit.
and lettuce and 50 kgs- for radishes. The labour-required for sowing, cultivating Sol. Given data is tabulated as follows:
and harvesting per acre is 5 man-days for tomatoes and radishes, and 6 man- Labour time Max production
Type of hat Max sale/day Profit
:· days for lettuce. Total of 400 man-days of labour are available at Rs. 20 per (time units) (A+B)/day
i man-day. Formulate this problem as an LP model to maximize the farmer's
A 2t /unit 150 Rs. 8/ unit
total profit. (Jan 2017, 16Marks/June2010,15 Marks/Jan 2018, 10 Marks) 500
8 t /unit 250 Rs. 5 I unit
Step 1: Identify the decision variables
Total land fertilizer Labour
Type of vegetabk Selling cost Average yield Let x1 be the number of units of type A hat produced/day,
available requirement requirement
x, be the number of units of type 8 hat produced/day.
-1·.'~,, Tomato Re. I/kg 2000 kgs/acre I00 kgs/acre 5 men/day Step 2: Write objective function in terms decision variables
,JJ Lettuce 100 acres Re. 0.75/head 3000 heads!acrt: IOO kgs/acre 6 men/day Let Z be the total profit on the sale of hats of type A and 8. The objective is
l
:t Radish Rs. 2/kg IOOO kgs/acre 50 kgs/acn: 5 men/day to maximize the profit. The objective function is
~
'' Maximize Z = 8x 1 + 5x2
:·:. Availability oflabour 400 men/day
·.·....••.·.. ' Step 3: Identify the constraints
t ' Cost of fertilizer Re. 0.5/kg Lett be the time required to produce one unit of type 8 hat, then
:,~
Cost of labour Rs. 20 man/day 2t be the time required to produce one unit of type A hat.
tL Step 1: Identify the decision val'iables Production time
1!-i Let x 1 be the acres (area) of land allocated to grow tomato, Type A
~
x, be the acres (are~) 9fland allocated to grow lettuce, I unit-> 2t time units (say 'hr')
li
~;!
~
X::, be the acres (area) of land allocated to grow radish. x1 units -> 2tx 1 hrs
¥
h
'1' Step 2: Write objective function in terms of decision variables
Let Z be the total profit for the farmer, then,
TypeB
I unit-> t hr
f·
Selling cost (total)= (1 x 2000) x1 + (0.75x 3000) x, + (2 x 1000) x3 I ~ units -> tx, hrs
t Fertilizer cost (total)= (0.5 x 100) x1 + (0.5 x 100) x, + (0.5 x 50) x3 The constraints are
L
[
~:
Labour charge (total)= (5 x 20) x1 + (6 x20) x, + (5 x 20) x3
Profit= Selling price· - Expenditure L 2tx 1 + tx2 :'S 500t
2x 1 + x2 :'S 500 (Constrait1t on labour time I Maximum production)
~f~. ,
I
=Selling price - (Fertilizer cost+ labour charge) x 1 S 150 (Constraint on the daily sale of Type A hat)
The objeative is to maximize the profit. Then, the objective function is ~ s 250 (Constraint on the daily sale of Type B hat)
' ' Maximize Z =Selling price - Expenditure Step 4: Write non- negativity constraints
L•1 x1, x2 ::=: O; as the number of hats to be produced cannot be negative.
~· = (2000x 1 + 2250x + 2000x,)-(50x + 50x + 25x + I OOx 1 + I 20x + 100x )
2 1 2 3 2 3
I
Maximize Z = I 850x 1 + 2080~ + l 875x3
4Rll
""
OPERATIONS- REsEARCH LINEAR PROGRAMMING
7t 18. A firm.manufactures three productsA, Band C. Time to manufacture produce x/3 = x/4 and also x/4 = x/5
A is twice that for B and thrice that for .C and if the entire labour is engaged in 4x, - 3x2 = 0: (Constraint on ratio of production of products A and 8)
making product A, 1600 units of this product can be produced. These products' 5x 2 - 4x, = 0: (Constraint on ratio of production of products 8 and Cl
are to be produced in the ratio 3:4:5. There is demand for at least JOO, 250 and Step 4: Write non-negativity constraints
200 units of products A, Band C and.the profit earned per unit is Rs. 90, Rs. 40 x,, x,, x, ~ 0: as the number of units produced cannot be negative.
and Rs. 30 respectively. Fon:nulate the problem as au LPP. 19. An advertising company wishes to plan its advertising strategy in different
Sol. Given data is tabulated as follows: media-television, radio and magazfoes. The purpose of advertising is to reach
Manufacturing Maximum Minimum as large a number of potential customers as possible. Following data has been
Type of Ratio of
time (time production demand for Profit obtained from market survey:
product production
units) (A+B+C) products Media Television Radio Magazine I Magazine 11 1
A t/unit 300 units Rs. 90/unit Cost of advertising unit Rs. 30,000 Rs. 20,000 Rs. 15,000 Rs. 10,000
Rs. 4U1un1t No. of potential customers
B (t/2)/unit 1600 250 units
3:4:5 2,00,000 6,00,000 1,§0,000 1,00,000
IZs. JU/unit reached per unit
c (t/3)/unit 200 units
No. of female customers
Step I: Identify the decision variables 1,50,000 4,00,000 70,000 50.000
reached per unit
Let x, be the number of units of product A produced, The company wants to spend no more than Rs. 4,50,000 on advertising.
x, be the number of units of product 8 produced, Following are the further requirements that must be met:
X:
be the number of units of product C produced. (i) At least one million exposures take place among female customers,
Step 2: Write objective function in terms of decision variables (ii) Advertising on·magazines be limited' to Rs. 1,50,000,
The objective of the firm is to maximize the profit. (iii) At least 3 advertising units be bought on magazine I and 2 units on magazine Il,
Let Z be the total profit for the firm, then the objective function is (iv) The number of advertising units on television and radio should each be
'1 ~ : • Maximize Z = 90x 1 + 40x, + 30x3 · between 5 and 10.
fStep 3: Identify the constraints Formulate an LP model for the problem.
ii.!
11·1
Let t be the time taken to manufacture one unit of product A.
"'
I'. Data:
1::1"
t/2 be the time taken to manufacture one unit of product 8. The amount that can be spent on the advertising ::; Rs. 450000
j,,, t/3 be the time taken to manufacture one unit of product C. No. of female customers to whom the advertisements should reach~ I 000000
I
Production time :I Cost of advertising on magazines :::; Rs. 150000
Type A i
The number of units advertised by magazine 1 ~ 3
I unit.-> t time units I The number of units advertised by magazine 2 ~ 2
1
r
;;;
x, units-> x,t time units
TypeB I The numberof units advertised on TV and Radio= 5 to I 0
I unit -> t/2 time units
x2 units-> (txy2 "time units I Media of Cosl of
No. of
potential
No. of
female Maximum
Maximum
cost
Aavert1scmenls
re11uired
l
customers customers Cost of reserved for
TypeC adveiiisement advertisemem
reached/ reached ad' ertiscmenl advertisement
I unit-> t/3 time units unit oer unil on ma2azines
x, units-> (tx,)13 time units Television Rs. 30,000/unit 2,00,-000 1.50,000 5-10
The constraints are • Radio Rs. 20,000/unit 6.00,000 4,00.DOO 5-10
x 1t + (tx)l2 + (tx)/3:::; 1600t Rs. 15,000/unit 1.50,000 70,000
Rs. 450000
?.3
Magazine I
x 1 + xj2 + x/3 :::; 1600 (Constraint ~n maximum productio'n on time) Rs. 150000
Magazine II Rs. I0,000/unit 1,00,000 50,000 ~1
x 1 ~ 300 (Constraint on demand for product A)
''
-=1 Minimum no. of
x,~ 250 (Constraint on demand foF product 8)
'I
,,j
,.:J
;·:.:
x: ~ 200 (Constraint on demand for product C)
female customers
to whom lhe 1000000
:~
X
1
: X
2
: X
3
:: 3 : 4: 5 advertisement
; ·~ should reach
jj
i
-. Step I: Identify the decision variables
OPERATlou REsEARcH
Let x be the number of units advertised by the Television,

LnvEAR PRoGRAMMilfG
Type of
product
Profit
Destruction
cost
Operation time
I 2
..
Maximum units th1t
can be sold
1
"2 be the -number of units advertised by the Radio, A Rs. 3/unit ----- 3 hrs/unit 3 hrs/unit Everything produced
is be the number of units advertised by the Magazine 1, B Rs. 8/unit ------- 4 hrs/unit 5 hrs/unit Everything produced
x4 be the number of units advertised by the Magazine 2. c Rs. 2/unit Re. I/unit ----------- ---------- 5
Step 2: Write the objective functions in terms Qf decision variables Maximum
18 hrs 21 hrs
The objective of the company is to maximize the nwnber of potential op~ration tim~
customers t() whom advertisements must reach. Note: Number of units of product C produced is 3 times the number of units of
Let Z,be the total number of potential customers, the objective function is product 8 produced (given). i.e. C ->3B.
Maximize Z = 2 x lOsx, + 6 x 10sx2 + 1.5 x 10sx3 + 1x105x4 Step I: Identify the decision variables
Step 3: Identify the constraints I limitations Let x1 be the number of units of product A produced.
The constraints are on the amount to be spent on advertising, i:xposure of x, be the number of units of product 8 produced,
advertisements to fe_male customer and units advertised by each media. x: be the number of units of product C produced,
30 x I 03x1 + 20 x I 03JS + 15 x I 03x3 + I 0 x I03x 4 S: 450 x I 03 x4' be the number of units of product C that can be sold,
OR x5 be the number of units of product C that can be destructed.
30x + 20"1 + I Sis+ 1Ox4 S:450 (Constraint on money to be spent) Therefore, x3 = x4 + x5
1
15 x 104x1 + 40 x 104x2 + 7 x I 04 x3 + 5 x I 04x4 ~ 10 x 1os Step 2: Write objective function in terms of decision variables
15x +40JS +?is+ 5x4 ~ 100 (Constraints on reaching female customer) The objective is to maximize the profit.
1
15 x 103x3 + 10 x I03x4 ::; 150 x 103 i Let Z be the total profit for the company, then the objective function is
!Sis+ 10x4 S: 150 (Constraint on money to be spent on advertising on magazines)
is~ 3
I Maximize Z = 3x 1 + 8x 2 + 2x 4 - lx 5
x4 ~ 2
(Constraints on units advertised on magazine 1)
(Constraints on units advertised on magazine 2)
i Step 3: Identify the constraints
3x 1 + 4is S 18 (Constraint on available time for operation I)
I
i
·-In·: 5 S: x S: 10 (Constraint on units advertised on Television) 3x 1+5x 2 S:21 (Constraint on available time for operation 2)
Iii .. 1
5 S: is S: I 0 (Constraint on units advertised on Radio) x4 S 5 (Constraint on product C that can be sold)
Step 4: Write non-negativity constraint x3 = 3x2 (by data)
1'1( x , x , is. x4 ~ O; as the number of units advertised cannot be negative.
'.·'
1 2
i.e. x4 + xs =·3x 2
!!
20. In a chemical industry, two products A and B may involve in two operations. x4 + xs - 3x, = 0 (Constraint on number of units of product C produced)
I
1!;
1-•. ,
.f::
·-~:
The production of B also results in by-product C. The product A can be sold Step 4: Write non-negativity constraints
at Rs. 3 profit per unit and B at Rs. 8 profit per unit. The by-product C has a x1, x2, is. x4, xs~ O; as the number of units produced cannot be negative.
,;, profit of Rs, 2 per unit. If it cannot be sold has the destruction cost Rs. 11 unit. 21. A manufacturer produces three IJIOdels I, II, III of certain product using raw
[
-::
Forecasts shows that up to 5 units of C can be sold. The company gets 3 units of :ij materials A and B. The-following table gives the data for the -problem:
-i,, C for each unit of B produced. Forecasts show that they can sell all the units of
•
JIC A and B produced. The manufacturing times are 3 hours/unit of A on operation
I and operation 2 respectively, 4 hours and 5 hours/unit of B on operation I
I~
Raw material
Requirements per unit
I II 111
Availability
' ~~ A 2 3 5 4000
and operation 2 respectively. Because product C results from producing B, no
m
time is used in producing C. The available time is 18 :ind 21 hours for operation 8 4 2 7 6000
.f. la_n~_2 respectively. Determine quantity of A and Bis produced keeping C in
i• Minimum demand 200 200 150 -
.IJ.
t
I
mind to make highest total profit to the company.
Sol. Given data is. tabulated as follows:
lIg
Profit per unit (Rs) 30 20 50 -
Formulate the problem as a linear program model. (July 2009 CSE, 07 Marks)
'··
I
•••. 1
.. ,)
...,,, OPERATION!? REsEARCH LINEAR PR.oGRAMMll'IG
trainees would be remunerated at the rate uf Rs. 300 per week, the same rate as
411
Requirement of raw material Minimum for the trainers. The company has booked the following orders to supply during
Type of Model Profit
Demand
A B the next 5 weeks:
I 2/unit 4/unit 200 units Rs. 30/unit Week 1 4. 3 4 5 I
II 3/unit 2/unit 200 units Rs. 20/unit No. of cans 280 298 • 305 360 400 I
Ill 5/unit 7/unit 150 units Rs. 50/unit Assume that production in any week would not be more than the nuinberof cans
Availability ofraw material 4000 6000 booked in the order so that every delivery of the food will be 'fresh'. Formulate
The objective of the manufacturer is to maximize the profit. which depends on this pro!Jlem as an LP model to develop a training schedule that minimizes the
number of units of models l. II and Ill respectively. labour cost over the five-week period.
Step 1. Identify decision variables Note:
· Let x1 be the number of units of model I produced, 1. A trainee recruited at the beginning of week l would get salary for all five weeks
x, be the number of units of model II produced, at the rate of Rs. 300/week. Accordingly, trainees recruited at the beginning of
x: be the number of units of model Ill produced. weeks 2, 3, 4 and 5 would get salary for four, three, two and one weeks respectively.
Step 2. Write objective function in terms of decision variables 2. Trainees recruited during any ,,·ec:k has lo undergo training: for two weeks to
Let Z be the total profit on models I, 11 and Ill. become trained worker.
The objective function is Step I: Identify the decisim! rnriahi•.:s
Maximize Z = 30x 1 +20x 2 + 50x3 Lei x1 be ii:~ number of trainees recruited at the beginning of week !.
Step 3. Identify the constraints x, be the number of trainees recruited at the beginning of week '.2.
Raw material A x~ be the number of trainees recruited at the beginning of week 3.
Model I Model II Model III X: be the number of trainees recruited at the beginning of week 4:
I unit= 2 I unit= 3 I unit= 5 x5 be the number of trainees recruited at the beginning of week 5.
x1 units= 2x 1 x 2 units= 3x2 x, units = Sx, Step 2: Write objective function in terms of decision variables
Raw material B The objective of company is to minimize labour cost.
Model I Model II Model III Let Z be the total cost, then the objective function is
I unit= 4 I unit= 2 I unit= 7 Minimize Z = 300 (5x 1 + 4xc + 3x3 + 2x, + x5)
x1 units= 4x 1 h. units = 2x x 3 units= 7x,
= I SOOx, + l 200x~ + 900x 3 + 600x4 + 300x5
2 2
2x + 3x + Sx :S 4000 (Constraint on the availability of raw material A) Step 3: Identify the constraints
1 2 1
4x + 2x + 7x :S 6000 (Constraint on the availability of raw material B) Week l:
1 2 1
x 2'. 200 (Constraint on the demand for model I) 3 trainees require-> I trainer for training
1
x 2'. 200 (Constraint on the demand for model II) x1 trainer require -> x/3 trainer.
2
x 2'. 150 (Constraint on the demand for model Ill) - Total no. of trained employees available to produce I can of food/week is
3
Step 4. Write non-negativity constraints 300 - (x/3)
x" ~, x , each 2'. O; as the number of units of models produced cannot be negative.
3
Week2:
22. A company, engaged in producing tinned food, has 300 trained employees on the 3 trainees require-> I trainer for training
rolls, each of whom can produce one can of food in a week. Due to developing x, trainer .require-> x/3 trainer.
taste of the public for this kind of food, the company plans to add to the existing Total no. of trained er;iployees available to produce I can of food/week is
• (300 -(x/3)] -(~/3)
labour force by employing 150 persons, in a phased manner, over the next 5
weeks. The newcomers would have to undergo a two-week training programme Week3:
before being put to work. The training is to be given by the employees from After the completion of training for two weeks, x 1 workers recruited at-the beginning
among the exi~ting ones and it is known that one employee can train three of week I are available for food preparation during week 3
trainees. Asrnme that there would be no production from the trainers and 3 trainees require__, I trainer for training
trainees during training period as the training is off- the job. However, the x3 trainer require __, x/3 trainer.
Total no. of trained employees available to produce I can of food/week is
(300 + x1 - (~13) - (x/3)]
i
,/
J.
.... OPERATIONS 'REsEARCH
Accordingly, total no: of trained employees available for food preparation during week
4 and 5 are [JOO+ x1 + is-(x,13)-(x/3)] <ind [300 + x1 + xj + x 1 -~ (x}3)-(x/3)]
LINEAR PROGRAMMING
Part P
Running cost (Rs I hr)
..
respectively. Machining cost (Rs/unit) = Number of parts machine (units/ hr)
The constraints are
300 - x/3 2: 280 (Constraint on production of tinned food on week I) = -30 =Re. I I umt. \
30
300 - x/3 -xj3 2: 298 (Constraint on production _of tinned food on week 2)
Running cost (Rs I hr)
300 + x1 - x/3 - x/3 2: 305 (Constraint on production of tinned food on week 3) Boring cost (Rs/unit) - Number of parts bored (units/ hr)
300 + x 1 + x" - x/3 -x/3 2: 360 (Constraint on production of tinned food on week 4)
.300 +_ x1 + ~ + >s-x/3 -x/3 2: 400(Constraint on production of tinned food on week 5) 225
= - = Re.0.75 I Ulllt
.
x 1 + x, + x, + x4 + x5 = 150 30
Step 4: Write non-negativity constraints Running cost (Rs/ hr)
x1, x,, 'S, X4, x5 2: O; as the number of trainees cannot be negative. Polishing cost (Rs/unit) - Number of parts polished (units/ hr)
23. A firm buys casting of P and Q types of parts and sells them as finished product
225 R 0 51 .
after machining, boring and polishing. The purchasing cost for castings are Rs.3 =- = e.. u111t
and Rs.4 each for cast Panel Q, and selling costs are Rs.8 and Rs.IO respectively. 45
The per hour capacity of machine used for machining, boring and polishing for Purchasing cost = Rs 3/unit
two products is given below: Total expenditure= (Machining cost+Boring cost+Polishing cost+Purchasing cost)
Parts =(I+ 0.75 + 0.5 + 3)
Capacity per hour p = Rs. 5.25/unit
Q
Machining 30 50 Profit= (Selling price- Total expenditure)
Boring 30 45 = (8-5.25)
Polishing 45 30 =Rs. 2.75/unit
The running costs for machining, boring, polishing are Rs. 30, Rs. 22.5 and Rs. PartQ
__;.: 22.5 per hour respectively. Formulate this problem as an LPP to maximize the Machining cost (Rs/ unit) = Running cost (Rs/ hr)
1.-~ '-·
profit. Number of parts machined (units/ hr)
Sol. Given data is tabulated as follows: 30
= SO= Re. 0.6/ unit
Capacity of machines
I
~ ~: . Purchasing Selling
Type of cast
~T· cost cost Machining Boring Polishing Running cost (Rs/ hr)
p Boring cost (Rs/ unit) - Number of parts bored (units/hr)
H'-i ,. Rs. 3/unit Rs. 8iunit 30 units/hr. 30 units/hr. 45 units/hr.
·n.
"!::
Q Rs. 4/unit Rs. JO/unit 50 units/hr. 45 units/hr. 30 units/hr. t 22 5
· Re. 0.51 umt.
= -=
Running cost
c Rs. 30/hr. Rs. 22.5/hr. 45
.,
[ of machines
Step I: Identify the decision variables
Rs. 22.5/hr.
Polishing cost (Rs/unit)
Running cost (Rs/ hr)
• Number of parts polished (units I hr)
Let x1 be the number of units of cast 'P' produced per hour,
!:
x, be the number of units of cast 'Q' produced per hour. 22
r = .S=Re.0.75/unit
Step 2: Write the objective function in terms of decision variables 30
:;
• The objective is to maximize the profit. Purchasing cost= Rs 4/unit
Calculation of expenditure on each part Total expenditure= (Machining cost+ Boring cost+ Polishing cost+ Purchasing cost)
f
= (0.6 + 0.5 + 0.75 +4)
r-: = Rs. 5.85/unit
,_ Profit= (Selling price - Total expenditure)
= (I 0 - 5.85)
·a
;;l
1
!I\_ - -
~ OPERATIONS REsEARCB LINEAR PROGRAMMING
411
=Rs. 4.1 S/unit
Processing time (hr/unit) Sales price {Rs/unit)
Let Z be the total profit. The objective function is written as Type of product
Maximize Z =; 2.7Sx 1 +4. I5JS Machine I Machine 2
Step 3: Identify the con~traints I
2 3 65
The constraints are written as shown below. 2 3 2 70
Time required for each of un.it of cast P to be machined is 3 4 I 55
30 units ---+ I hr
4 2 2 45
I unit---+ 1/30 hr
Cost of operation of machines (Rs/hr) 10 5
Time required for each of unit of cast Q to be machined is
, 50 units ---+ I hr Maximum availability of machines (hrs) 500 380
By data, the objective is to maximize the net profit
I unit-> 1/50 hr
The maximum availability of machining machine is I hr. Then
Let x 1 be the number of units of product I produced.
( l/30)x 1+ (l/50)x2 :5 I (Constraint on machining machine)
x, be the number of units of product 2 produced.
Time required for each of unit of cast Pto be bored is
30 units---+ I hr x: be the number of units of product 3 produced.
I unit---+ 1/30 hr x4 be the number of units of product 4 produced.
Time required for each of unit of cast Q to be bored is
45 units ---+ I hr The objective is to maximize the net profit of a company.
Let Z be the maximum profit. Then objective function is given by
I unit---+ I/45 hr
Processing time on machine I
The maximum availability of boring machine is I hr. Then
··Product I
( I/30)x 1 + ( l/45)x2 :5 1 (Constraint on boring machine)
I unit takes-> 2 hrs to process
Time required for each of unit of cast P to be polished is
45 units---+ I hr x1 units take ---+ 2x 1 hrs to process
Product 2
I unit---+ 1/45 hr
I unit takes -> 3 hrs to pmcess
Time required for each of unit of cast Q to be polished is
30 units---+ I hr x2 units take -> 3x2 hrs to process
Product 3
I unit-> 1/30 hr
I unit takes -> 4 hrs to process
The maximum availability ofpolishing·machine is 1 hr. Then
x3 units take-> 4JS hrs to process
(l/4S)x, + (l/30)x2 :5 I (Constraint on polishing machine)
Product 4
I unit takes --> 2 hrs to process
x 1, x2 ~ O; as the number of parts to be produced cannot be negative.
x4 units take -> 2x4 hrs to process
24. Four products are processed successively on two machines. The manufacturing Total operation of machine I is (2x 1 +3~+4x 3 + 2x4 ) hrs
times in hours per unit of each product are tabulated below: Total cost of operating machine I is Rs. (2x 1 + 3x + 4x, + 2x.) x I0
7
Machine
Time per unit (hr) Processing time on machine i - -
Product 1 Product 2 Product 3 Product 4 Product I
I 2 3 4 2 1 unit takes -> 3 hrs to process 0
2 3 2 1 2 x 1 units take ---+ 3x 1 hrs to process
l
The total cost of producing one unit of each product is based on the machine Product 2
time. Cost per hour foe machines I and 2 is Rs. 10 and 5 respectively. The total I unit takes -> 2 hrs to process
hours available on machines I and 2 are 500 and 380. If the sales price per unit x2 units take -> 2x~ hrs to process
for products I, 2, 3 and 4 are Rs. 65, 70, 55 and 45 respectively. Formulate the Product 3
problem as a LPP to maximize total net profit. July 2018 (10M) I unit takes---+ I hr to process
I
~ol. Given data is tabulated as foHows:
L
,£ . .
-.
x; units take~ x1 hr to process
OPERATIONS REsEARCH LIKEAR PROGRAMMING
2.6 OPl;~TIONS RESEARCH IS MORE THAN JUST MATHEMATICS

ARI
Product 4 Operations research is a discipline. one of the broad areas of applied mathematics. OR
1 unit takes-> 2 hrs te process
is not just theory, but it strives to resolve problems of everyday life by applying advanced
x.., units take __. 2x4 hrs to process analytical methods. i.e. the problem to be resolved is described in mathematical terms .
Total operation of machine 2 is (Jx 1 + 2x, + x1 + 2x4 ) hrs
Opedtions research does not find the best decision, but find a better decision and thus
Total cost of operating machine 2 is Rs. (3x 1 + 2x,.+ x, + 2x 4 ) x 5
it is practically oriented and OR demands deep knowledge of various are;•s of mathcmat ics
Sales price
as well as computer science and t:conomics (optimization, network analysis. game theory.
Product 1
probability etc.)
I unit.-> Rs.65
x, units-> Rs.65x 1 Note: Give one example of formulation of LPP.
Product 2
2.7 IMPORTANT DEFINITIONS RELATED TO LPP
I unit-+ Rs.70
x, units-> Rs.70x, I. Solution: A s€t of values of decision variables\ (j=l.2J ..... n) which satisf~· the
- -
Product 3 constraints of a LP problem is said to be the solution to that LP problem.
I t:nit-+ Rs.55 2. Feasible solution: A set of \'alues of decision variables xi (j=l,2,3 ..... n) which
x, units-+ Rs.55x 3 satist)' all the constraints and non-negativity conditions of a LPP simultaneously is
Product 4 said to be the feasible solution lo that LPP.
I unit_, Rs.45
3. Infeasible solution: A set of values of decision vari(\bles \ (j= 1,2.L ... n) whid1 do
x4 units-+ Rs.45x 4
not satisfy all the co1:straints and non-negativity conditions of a LPP simultaneously
Sales price= Rs. (65x, + 70::, + 55x, + 4Sx4)
i is said to be the infeasible solutio1i to that LPP.
j
Net Profit= Sales price of products - Operating cost of machines
=(65x, + 70x, + 55x 3 + 45x)- {(20x 1+ JO"z +40x, + 20x4) +{(I Sx 1 + IO~+ 5x3 + IOx4 )} 4. Basic solution: For a set of 'm' simultaneous equations in 'n' variables (n>m),
+·,;,.
.11 ..
Nc! Profit= 30x, + JOx, + 10x3 +I Sx4
Let Z be the 1iet profit. Then objective function is given by
solution obtained by setting (n-111) variables equal to zero and solving form equations
with remaining m variables is called as basic solution. The (n-m) variables whose
values do not appear in this solution arc called non-basic variables and the remaining
~r Maximize Z = JOx 1 + JOx, + IOx 3 + 15x4
-~·1
-:1
Step 3: Identify the constraints/ limitations 'm' variables are called basic variables.
_:!,,
The constraints are 5. Basic feasil>le solution: A feasible solution to an LPP which is also basic solution is
~;;
't;; (2x, + 3x, + 4x, + 2x)-:; 500 (Constraint on the availability of machine I) called the basic feasible solution. i.e. all basic variables have non-negative values.
r:_ (Jx, + 2x, + x3 + 2x 4) S 380 (Constraint on the availability of machine 2) Basic feasible solutions are of two types
~:
,.J:,i. Step 4: Write non-negativity constraints a). Degenerate: A basic feasible solution is called degenerate, ifthe value of at least
L x,, x2 , X 3, X 4 2: O; as the number of units produced cannot be negative. one basic variable is zero.
-~:;
.I•' b). Non-degenerate: A basic feasible solution is called non-degenerate, if the values
L of all 'm' basic variables are non-zero and positive.
6. Optimum basic feasible solution: A basic feasible solution, which optimizes
(maximizes or minimizes) the objective function value of the given LP problem is
said to be an optimum basic feasible solution.
t·--·
7. Unbound solution: A ~olution which can increase or decrease the value of the
objective function of the LPP indefinitely is called as unbound solution.
.r.1· 8. Solution space or region of feasible solution: The region I area which satisfies all
.
I
'
constraints and non-negative conditions, is called as the region of feasible solution.
Any point in the solution space is a feasible solution to the given problem.
...
- 2.8 GRAPHICAL SOLUTION OF TWO VARIABLE LP PROBLEMS
OPERATIONS REsEARCH :~~1i4\l~]'l(~';';·
-~fl~~fl:?~:~111Wii~kba\~M~if.RC~•on·
25.
::\f~;;~~~'f~~;!t:~'FfJ' · ., ' ' -
Use the graphical method to solve the following LP problem.

.-:.f.. '" -
2.8.1 lso· profit (cost) ,function line method:

Maximize Z = l 5x1 + IOx,
I. Convert all inequality constraints into equations by\replacing the inequality sign by subject to constraints
equality sign. 4x 1 + 6x, :S 360,
2. Plot each equation on the graph. which is a straight line. 3x 1 :S 180,
5x2 ::;200 and
3. The inequality constraint corresponding to a line is with '"'.S ·sign, then the region
x 1 x 2 ~0.
·below the line (i.e. towards the origin) is shaded. For the inequality constraint with''.:'.
Sol. Step 1: Convert all inequality constraints into equations by replacing •:=:;•by '='
'sign, then shade the region above that line (i.e. away from the origin). The common
We have,
shaded region I area oL.ained is called feasible region and the points lying in this
region satisfy all the constraints simultaneously. 4x 1 + 6x2 = 360 ---------------------------------- ( l)
3x 1+ OXz = 180 -------------------------------------- (2)
4. Assume some value of the objective function Zand plot the objective function line.
Ox 1 + 5x2 = 200 ------------------·------------------ (3)
5. Pull the objective function line until the extreme points of the feasible region. !fit Step 2: Calculate the values of decision variables x1 and~ satisfying the above
is a maximization problem, this line lies farthest away from the origin and passing equations and plot straight line on the fK3ph corresponding to each constraint
through at least one corner of the feasible region. In the minimization case. it Ii.es Consider equation I
closest to the origin and passing through at least one corner of the feasible region. 4x 1 + 6Xz = 360
6. Note c' iwn the co-ordinates of the extreme point(s) selected and find the maximum/ Put x1 = O; then x, = 60
minimum value of Z. Put x, = O; then x 1 = 90
Plot the constraint l on the graph (i.e. line I)
/;
2.8.2 Extreme point solution method: Consider equation 2
3x 1 + Ox2 = 180
I. Cunve1i all inequality constraints into equations by replacing the inequality sign by
3x 1 =180; then x 1 = 60
~~ quality sign.
x2 = 0
'")
1'iot each equation on the graph, which is a straight line. Plot the constraint 2 on the graph (i.e. line 2)
3. If the ill':quality constraint corresponding to that line has ':S 'sign, then the region Consider equation 3
;~.
below the line (i.e. towards the origin) is shaded. For the inequality constraint with Ox 1 + Sx, = 200
' .:'. ·sign, then the region above that line (i.e. away from the origin) is shaded. The 5x2 = 200; then x2 = 40
common shaded region I area obtained is called feasible region aw; any point lying x 1 =O
in this region is cal bl feasible solution and provides values of x and x, that satisfy
1
Plot the constraint 3 on the graph. (i.e. line 3)
all constraints. Step 3: Identify the feasible region and co-ordinates of the extreme points
4. Examine the extreme point of the feasible solution space to find an optimal solution. (vertices)
i) Determine the co-ordinates of each extreme point of the feasible solution space. Note: To determine which side of the constraint equation (Line) is in· the feasible
region, check whether the origin (0, 0) satisfies the constraints or not. If yes, then all
ii) Compute and compare the values of the objective function ~teach extreme point. the points on the line and below it towards the origin are feasible points. If not, then
iii) Identity the extreme point that gives (maximum or minimum) optimal value of all the points on the line and above it aw~ from the origin are feasible points.
the objective function. Consider 4x 1 + 6x 2 :S 360
Let x1 = x2 = 0, the"n
{l :S 36Q. Since the origin satisfied this constraint, shade the region below the line I
'"! {car.responding to constraint I) towards the origin.
·I
! Consider 3x 1 :S 180
_J
•• 1
I Let x1 = 0, then
·!!
II
J
~
B:'·:'_i:;:· ~L'-.>.:J: 0PERATIOll8 RzsEARCB
··~~~G
Maximize Z = 2:1 +
26. 1
~
subject to the constraints
..
0 :S 180. Since the origin satisfied this constraint, shade the region below the line 2 x, + 2~ :S 10,
(corresponding to constraint 2) towards the origin. x, + Xz :S 6,
Consider Sis :S 200 • x, - Xz :S 2,
Let x, =0, then x1 • 2Xz :S i and
0 :S 200. Since the origin satisfied this constraint, shade the region below the line 3 x1, Xz ~o.
(corresponding to constraint 3) towards the origin. Sol. Step 1: Convert all inequality constraints into equations by replacing ':S' by'='
The common shaded region/ area obtained is called 'feasible regiun' & all the points We have,
in this region are feasible points. x, + 2is = I0------------------------------------- (I)
The co-ordinates of the extreme points (vertices) of the feasible region are 0 = (0, 0), x, + is = 6 -----------------------------"-------- (2)
A= (60,0), B = (60,20), C = (30,40) and D = (0,40) x, - is = 2----------------------------------------- (3)
Extreme Co-ordinates Objective function value x, - 2x2 = !---------------------------------------- (4)
points (x,, x;) MaxZ= ISx, + IOx, Step 2: Calculate the values of decision variables x1 and Xz satisfying the above
equations and plot straight line on the gr-aph corresponding to each constraint
0 (0, 0) 0
Consider equation I
A (j{),0) ' 900
x, + 2is= 10
B (60,20) 1100
Put x1 = O; then is = 5
c (30,40) 850
Put is= O; then x, = I0
D (0, 40) 400 Plot the constraint I on the graph (i.e. I ine I)
The maximum value of the objective function Z = 1100, occurs at the extreme point
Consider equation 2
8.(60, 20). Hence the optimal solution to the given LPP is x1+x2 =6,
x, =60
x1 = O; then is = 6
is= 20 and
is= O; then x, = 6
MaxZ= 1100
Plot the constraint 2 on the graph (i.e. line 2)
'S
J
Consider equation 3
x,- x2 = 2,
i; @ Scale: Put x 1 = O; x 2 = -2
t, Put is = O; x, = 2
f~ .: I cm= IO units
-.1!-J.I Consider equation 4
x,-2is= I,
.. Put x, = O; x2 = -0.5
Put x2 = O; x, = I
<D Feasible
<D Plot the constraint 4 on the graph (i.e. line 4)
region Step 3: Identify the feasible region and co-ordinates of the extreme points
(vertices).
0(0,0)
x, Consider x1+ 2x2 ::; I0
Let x1 = is = 0, then •
0 :S IO. Since the origin satisfied this constraint, shade the region below the line I
(corresponding to constraint I) towards the origin.
@ <D Consider x, + x2 :S 6
Let x, = x2 = 0, then
•• !
;: :
.• j
;i
·:.L.
·.··- ... ;:;:t%~~tl~~,~~f,' ~~~~i\'~~~~f§;,'.~t~)'v··~
.0 :S 6. Since the origin satisfied this constraint, shade the region below the line 2 27. Maximize Z =7x1 + 3~ • (Mixed Constraints problem)
(corresponding to constraint 2) towards the origin. subject to the constraints
Consider x 1- JS:'.S 2 x,+2~?.3,
Let x 1 = "i = 0, then • x 1 +~::;4,
0 ~ 2. Since the origin satisfied this constraint, shade the region above the line 3 0 ::; x, ::; 512,
(corresponding to constraint 3) towards the origin ... 0 :S ~::; 3/2 and
Consider x1-2JS:S I x 1 ,~?.0.
Let x1 = is= 0, then Sol. Step 1: Convert all the inequality constraints into equation by replacing"'?.'/
0 & I. Since the origin satisfied this constraint, shade the region below the line 4 ':S'by '='
(corresponding to constraint 4) towards the origin. x1 + 2x2 = 3 -----"--------------------------- (I)
The common shaded region/ area ob.tained is called feasible region' & all the points x, + ~ = 4 --------------------------------- (2)
in this region are feasible points. x, = 512 --------------------------------- (3)
The co-ordinates of the extreme points (vertices) of the feasible region are 0 = (0,0), x2 = 312 -....,------------------------------ (4)
A= (1,0), B = (3,1), C = (4,2), n·= (2,4) and E = (0,5) Step 2: Calculate the values of decision variables x1 and~ satisfying the above
Co-ordinates Objective function value equations and plot straight line on the graph corresponding to each constraint
Extreme points Consider equation I
(x , x.,) Max Z = 2x + x.,
0 (0, 0) 0 x 1 +2~=3
A (I, 0) 2 when x1 = O; "i = 1.5
B (3, I) 7 when ~ = O; x1 = 3
c (4, 2) 10
Consider equation 2
D (2, 4) 8
x1 +~=4
E (0, 5) 5
when x1 = O; ~ = 4
The maximum value of the objective function Z = 10, occurs at the extreme point C
when x2 = O; x 1 =4
(4, 2). Hence the optimal solution to the given LPP is
x1 =4 Consider equation 3
"i = 2 and x1 =512
MaxZ= 10
~
Consider equation 4
Scale: x., = 3/2
I cm= I unit Plot the constraint4 on the graph (i.e. line 4)
Step 3: Identify- the feasible region and co-ordinates of the extreme points
(vertices)
Consider x 1 + 2~?. 3
Let x 1 = x2 = 0, then
0?. 3. Since the origin not satisfied this constraint, shade the region above the line I
Q
(corresponding to constraint I) away from the origin.
Consider x1+x2 :S 4
x, Let x1 = ~ = 0, then
0 :S 4. Since the origin satisfied this constraint, shade the region below the Jine 2
(corresponding to constraint 2) towards the origin.
Consider x1 :S 5/2
Let x1 = 0, then
......
Consider "2 S 3/2
Let x., = 0, then
~~9~tP~.
0 :S 5/2. Since the origin satisfied this constraint, shade the region below the line 3
0 ::s Ji2. Since the origin satisfied this constraint, shade the region below the line 4
>,..!
~28.
·. ·Lm:il Pao0Iwt.m6-:' . - ..
Maximize Z = 2x 1 + 3~
subject to the constraints
..
(Mixed constraints problem)
x1 + is $30,
(corresponding to constraint 4) towards the origin. x 2 2'.3,
The corrhon shaded region/ ar~ obtained is called 'feasible region' & all the points 0$~$12,
in this region are feasible points. 0 ::S x1 :S 20,
The co-ordinates of the extreme i)oints (vl)rtices) of the feasible region are Jf x 1 - ~ 2'. 0 and
A= (2.5, 0.25), B = (2.5, 1.5) and C = (0, 1.5). x 1 ,~ 2'.0.
Co-ordinates Objective functiOn value Sol. Step l: Convert all the inequality constraints into equation by replacing "~'/
Extreme points
(x' x.,) Max Z = 7x, + Jx., ':S' by'='
A (2.5, 0.25) 18.25 x, + x2 = 3 0 ---------------------------- (I)
B (2.5, 1.5) 22.0 x2 = 3 -------------------------- (2)
"2 = 12 ------------------------ (3)
c (O,U) 4.5
x, = 20 ---------------------- (4)
The maximum value of the objective function Z = 22, occurs at the extreme point B
x 1 -x2 =0 ---------------(5)
(2.5, 1.5). Hence the optimal solution to the given LPP is
Step 2: Calculate the values of decision variables x 1 and x2 satisfying the above
!
i x, = 2.5
I equations and plot straight line on the graph corresponding to each constraint
i:
:>s = 1.5 and Consider equation l
i MaxZ=22
x., x1 +"2=30
·'_L when x1 = O; "2 = 30
t• when "2 = O; x1 = 3
Plot the constraint I on the graph (i.e. line I)
n Consider equation 2
~..1"·r .·
x2 = 3
!.· .
.:-
I;·:~:
- ~~: Consider equation 3
)~; Scale: :>s = 12
·-b~- I cm = 0.5 unit Plot the constraint 3 on the graph (i.e. line 3)
~-"' Consider equation 4
···
~;;.
~·t.··
. x =20
I~::: 1'fot the c~nstraint 4 on the graph (i.e. line 4)
i:: 1 Consider equation 5
0(0,0)
x, x1 - x2 = 0
when x1 = O; x2 = 0
i. ..
<D when x2 = O; X 1 = 0
f·-i.:_ ® Step 3: Identify the feasible region and co-ordinates of the extreme points
(vertTces)
Consider x1 + Xz :S 30
Let x1 = Xz = 0, then
t• 0 S 30. Since the origin satisfied this constraint, shade the region below the line I
Consider "2 2'. 3
Let :>s = 0, then
0 ~ 3. Since the origin not satisfied this constraint, shade the region above the line 2
(corresponding to constraint 2) awav from the ori11in
--
Consider is :512
Let x.., =0, then
0PERATIOll8 REsEARCB
LINEAR PaoGRAMMlllG
29> ___ Minimize Z =3x 1 + 2Xi

subject to constraints
..
0 5 12. Since the origin satisfied this constraint, shade the region below the line 3 sx. + Xi 2: 10,
(corresponding to constraint 3) towards the origin. x, + ~2:6,
Consider x 1 5 20 x 1 + 4x2 2: 12 and
Let x 1= 0, then x1, x2 2: O.
0 :::.; 20. Since the origin satisfied this constraint, shade the region below the line 4 Sol. Step 1: Convert all the inequality constraints into equation by replacing "?:'by'='
(corresponding to constraint 4) towards the origin. 5x1 + x2 = I0 --------------------------------- ( I)
Consider x 1 - is 2: 0 x 1 + x 2 = 6 . ---------------------------------- (2)
x 1 + 4x2 = 12 ---------------------------------- (3)
Since X1 2: JS, shade the region towards x1 axis from the line 5.
The common shaded region/ area obtained is called Jeasible region ' & all the points Step 2: Calculate the values of decision variables x 1 and x2 satisfying the above
in this region are feasible points. equations and plot straight line on the graph corresponding to each constraint
The co-ordinates of the extreme points (vertices) of the feasible region are Consider equation I
A= (3, 3), B = (20, 3), C = (20, 10), D = (18, 12) and E = (12, 12) 5x 1 +x 2 =10
when x, = O; x2 = I0
Extreme Co-ordinates Objective function value
when x2 = O; x1 = 2
points (x,, ~) Maxi= 2x 1 + 3x 2
A (3, 3) 15 Consider equation 2
B (20, 3) 49 x1 + x2 = 6
c (20, 10) 70 when x 1 = O; x2 = 6
D (18, 12) 72 when x 2 = O; x1 = 6
E (12, 12) 60 Plot the constraint 2 on the graph (i.e. line 2)
The maximum value of the objective function Z = 72, occurs at the extreme point D Consider equation 3
( 18, 12). Hence the optimal solution to the given LPP is x1 +4x 2 =12
x, = 18 when x 1 = O; x2 = 3
is= 12 and when x 2 = O; x 1 = 12
MaxZ= 72 Plot the constraint 3 on the graph (i.e. line 3)
x,
Step 3: Identify the feasible region and co-ordinates of the extreme points
(vertices)
Consider 5x + x1 2:I0
1
0 2: I 0. Since the origin not satisfied this constraint, shade the region above the line
I (corresponding to constraint I) away from the origin.
Consider x 1 + x2 2: 6
0 2: 6. Since the origin not satisfied this constraint, shade the region above the line 2
(corresponding to constraint) away from the origin.
Consider x, + 4x 2 2:12
0 2'.. 12. Since the origin not satisfied this constraint, shade the region above the line
3 (corresponding to constraint) away from the origin.
x, The common shaded region/ area obtained is called 'feasible region· & all the points
in this region are feasible points.
....
;;;.-·- --.:~'1~~~~-
The co-ordinates of the extreme points (vertices) of the feasible region are
A= ( 12, O)~ B = (4, 2), C = ( l; 5) and D == (0, l 0).
~~PROGRAMM.Xo ..
Step 2: Calculate the values of decision variables x1 and ~satisfying the above
equations and plot straight line on the graph corresponding to each constraint
Consider equation I
points (x, x,) Min Z = Jx + 2x, x 1 +2~=40
when x 1 = O; x2 = 20
A (12, 0) 36
. (4. 2)
when x 2 = O; x 1 = 40
B 16
c (), 5). 13
Consider equation 2
D (0. 10) 20
The minimum value of the objective function Z = 13, occurs at the extreme point C 3x, + x2 = 30
(I, 5). Hence the optim11I solution to the given LPP is when x, = O; x2 = 30
x1 = I when x2 = O; x, = I0
x, = 5 and Plot the constraint 2 on the graph (i.e. line 2)
MinZ= 13 Consider equation 3.
4x 1 + 3x2 = 60
x2
© when x, = O; x2 = 20
0(0,10) whenx2 =0;x, = 15
Step 3: Identify the feasible region and co-ordinates of the extreme points (vertices).
Scale:
Consider x, + 2x 2 :S 40
I cm= I unit Let x, = x2 = 0, then
'.:)
-·~~ 0 S 40. Since the origin satisfied this constraint, shade the region below the line I
~.; .·
fl~
r.:~
Consider 3x 1 + x2 ::>: 30
ti~
Let x1 = x2 = 0, then
"!"...'.i· 0 ?_ 30. Since the origin not satisfied this constraint, shade the region above the line
·:\l"·J'
1\i}: 2 (corresponding to constraint 2) away from the origin.
lh1·'
1~-'
Consider 4x 1+3x 2 ?_ 60
.±;ig.:·
I I "\ ==s- - - ·1 Let x1 = x2 = 0, then
0(0,0) 1 " ~ --=:::::::: r • x1 0 ?_ 60. Since the origin not satisfied this constraint, shade the region above the line
3 (corresponding to constraint 3) away from the origin.
The common shaded region/ area obtained is called feasible region' & all the points
30. Minimize Z = 20x 1 + 10x2 (Mixed constraints problem) in this region are feasible points. - -
subject to the constraints The co-ordinates of the extreme points (vertices) of the feasible region are
...
•ll;f-
~
x1 +2x2 $40, A= (15, 0), B = (40, 0), C = (4, 18) and D = (6, 12)
{;~o 3x 1 + x2 ?_30, Extreme Co-ordinates Objective function value
E~
iL,, 4x 1 + 3x2 ?_ 60 and points (x,, x,) Min Z = 20x, + I Ox,
·!.~,
x 1 ,~?_0.
A (15, 0) 300
Sol. Extreme point solution method •
,_ Step 1: .Convert all the inequality constraints into equation by replacing "?_'/ 8 (40, 0) 800
i!"'
'$'by'=' c (4, 18) 260
:if
x 1 +2x 2 = 40 ---------------------------------- (I) D (6, 12) 240
:·r
·i~ i 3x 1 +~=30 ----------------------- {2) The minimum value of the objective function Z = 240, occurs at the extreme point D
;-. 4x 1 +3JS = 60 ------------------------------- (3) (6, 12). Hence the optimal solution to the given LPP is
~·
..,,, x, =6
0PERATI01'8 REsEARCH LDl&\R PRooRAMilmo
4x 1 + 3JS = 60
411
x2 = 12 and when x1 =O;is=20
Min Z = 240 · when x2 = O; x 1 = 15
xi Plot the constraint 3 on the graph (Le. line 3)
Step 3: Identify the Ieasible region and co-ordinates of the extreme points
(vertices)
Consider x 1 + 2x2 ::; 40
0 :S 40. Since the origin satisfied this constraint, shade the region below the line I
Scale: (corresponding to constraint I) towards the origin.
I cm= 5 units Consider 3x 1 + x2 ?. 30
0?. 30. Since the origin not satisfied this constraint, shade the region above the line
Consider 4x 1 + 3x2 ?. 60
0?. 60. Since the origin not satisfied this constraint, shade the region above the line
x, The common shaded region/ area· obtained is called 'feasible region' & all the points
To draw lso-profit line, assume some positive value ofZ that should be divisible by
both x1 and x2 • Take Z = 800 (assumed) and substitute in the objective function. i.e.
Fig: Extreme point method 800 = 20x 1 + I Ox2
!so-Profit line method Now calculate the value of x 1 by equating x2 to zero.
... Step I: Convert all the inequality constraints into equation by replacing "?.'/ Similarly, calculate the value ofx2 by equating x1 to zero.
'::;'by'=' • We have x1 = 40, x2 = 80; draw an iso-profit line (hidden line) passes through these
~t x 1 +2x 2 =40 ··································(I) co-ordinates. Since given objective function is of minimization type, an optimal
c
oc. 3x 1 +x 2 =30 ································--(2) value of Z always occurs at an extreme point in the feasible region which is nearest
4x 1 +3x 2 =60 -······························---(3) to the origin. Draw lines parallel to this line towards the origin. The optimal point is
Step 2: Calculate the values of decision variables x1 and x2 satisfying the above the point D (6.12) of the feasible region nearest to the origin through which this line
equations and plot straight line on the graph corresponding to each constraint will passes.
Consider equation I The minimum value of the objective function Z = 240, occurs at the extreme point D
x1 +2x2 = 40 (6, 12). Hence the optimal solution to the given LPP is
when x1 = O; x2 = 20
x, = 6
when x2 = O; x 1 = 40
~ = 12 and
Min Z=240
Car.sider equation 2
3x 1 + x2 = 30
when x1 = {); x 2 = 30
when x2 = O; x1 = I0
Plot the constraint 2 o(l the graph (i.e. line 2)
Consider equation 3
l..!-
•r,-··
is
~'r!2~R~1WlCH LIBEAR PROllRAIOllllG
CQnsider equation 2
x1 +x2 =6
when x1 = O; x2 = 6
when x2 = O; x1 = 6
-
\
\
\
\
\
'
" \
\
\
\
Scale:
Consider equation 3
Xt JS= 2
' \ 1cm=5 units when x1 = O; is= -2
\
\
\
•·-
\
when x2 = O; x1 = 2
. 0(6,12
(vertices)
Consider -x 1 + 3x~ S I 0
0(0,0) x, Let x1 = x2 = 0, then
0 :S 10. Since the origin satisfied this constraint, shade the region below the line I
Consider x1 +is S 6
lso-profi t lines Let x1 = ~ = 0, then
1. Fig: Iso-profit line method 0 S 6. Since the origin satisfied this constraint, shade the region below the line 2
,;·
l; Note: If the given objective function is of maximization type, an optimal value of Z (corresponding to constraint 2) towards the origin.
i~ always occurs at an extreme point in the feasible region which is farthest away from Consider xtis :S 2
;;:.~
~·-
origin. Draw lines parallel to iso-profit line till the line is farthest away from the Let x1 = is= 0, then
origin. The optimal point is the point of the feasible region farthest away from origin 0 :S 2. Since the origin satisfied this constraint, shade the region above the line 3
EJ through which this line passes. (corresponding to constraint 3) towards the origin.
:J~f{ 31. Minimize Z = -x 1 + 2x2 The common shaded region/ area obtained is called feasible region' & all the points
;ir~: subject to the constraints in this region are feasible points.
l!tH
:\i:.!J:·
~;";,·;
-x 1+ 3x2 ~ 10, The co-ordinates of the extreme points (vertices) of the feasible region are
':!:~'
x, +~~6; 0 = (0, 0), A= (2, 0), B = (4, 2), C = (2, 4) and D = (0, 3.33)
x 1 - x2 :S 2 and Extreme Co-ordinates Objective function value
x •• ~ ~o. points (x,, x,) Min Z = -x,+2x,
Sol. Step 1: Convert all the inequality constraints into equation by replacing ':s' by'=' 0 (0, 0) 0
-x 1 + 3is = IO ---------------------------------- (I) A (2, 0) -2
x1 + x2 = 6 ---------------------------------- (2)
B (4, 2) 0
x1- x2 = 2 ---------------------------------- (3)
Step 2: Calculate the values of decision variables x1 and x2 satisfying the above c (2, 4) 6
equations and plot straight line on the graph corresponding to each constraint D (0, 3.33) 6.67
Consider equation I The minimum value of the objective function Z = -2, occurs at the extreme point A
-x 1 i3is= IO (2, 0). Hence the optimal solution to the given LPP is
1:: when x 1 = O; x2 = 3.33 x, =2
.~· when is= O; x1 = -1 x, = 0 and
Plot the constraint l on the graph (i.e. line l) Min Z= -2
..... ~
0P£R.\TIQllS:RE8£ARCH . L111EAR PRooilAJU,liil()
Maximize Z == 3x1 + 4x2
Step 3. Identify the constraints
-
x 1 + Xz :S: 400 (Constraint on the maximum availa~ility of machine G)
2xl+ Xz::::; 600 (Constraint on the maximum availabitity of machine H)
Scale: Step 4. Wi'ite non-negativity/negative constraints
1 cm== 1 unit x17 is~ O; as the number of units of products produced cannot be negative.
Graphical solution
Step 1: Coovert all the inequality constraints into equation by replacing'::::;; by.'=='
x1 + is== 400 --------------------------------(I)
2x 1 + x2 == 600 ---------------------~------------ (2)
Consider equation 1
x1 x1 +is== 400
when x1 == O; x2 == 400
when x2 == O; x1 == 400
Plot the constraint 1 on the graph (i.e. line I)
Consider equation 2
32. A firm manufactures two products A and Bon which the profit earned per unit
2x1 + x2 == 600
arc Rs. 3 and 4 respectively. Each product is processed on two machines M, and when x1 == O; is == 600
M2• Product A requires one minute of processing time on M1 and two minutes when x2 = O; x 1 == 300
on M2 , while B requires one minute on M 1 and one minute on M2• Machine M 1 Plot the constraint 2 on the graph (i.e. line 2)
is available for not more than 7 hrs. 30 minutes, while machine M2 is available Step 3: Identify the feasible region and co-ordinates of the extreme points
for 10 hrs during any working day. Find the number of units of products A and (vertices)
Consider x1 + x2 :S. 400
B to be manufactured to get maximum profit. (Jan 2015, 14 Marks)
Sol. Given data is tabulated as follows: Let x1 = ~ = 0, then
0 S 400. Since the origin satisfied this constraint, shade the region below the line I
Processing time (corresponding to constraint I) towards the origin.
Type of Product Profit
Machine M1 Machine M, Consider 2x 1 + x2 :S: 600
A
8
Rs. 3/unit
Rs. 4/unit
I min/unit
I min/unit
2 min/unit
I min/unit
I Let x1 = x2 = 0, then
0 S 600. Since the origin satisfied this constraint, shade the region below the line 2
Maximum availability of machines 450 minutes 600 minutes
The common shaded region/ area obtained is called 'feasible region' & all the points
Step I. Identify the decision variables
Let x1 be the number of units of product A produced/day,
x, be the number of units of product 8 produced/day.
O= (0,0), A= (300,0), 8 = (200,200) and C= (0,4-00)
Let Z be the total profit on the sale of products A and B. Extreme Co-ordinates Objective function value
The objective function is points {x, x,) MaxZ=3x +4x..
0 (0,0) 0
A (300,0) 900
B (200, 200) 1400
c (0,400) 1600
r1-1•• 0PERA'i'Io!fs· REa&\RCB
The maximum value of the objective functio!l Z = 1600, occurs at the extreme point
C (0,400). Hence the optimal solution to the given LPP is
x,=O
·~.Paoo~o:
.
Let Z be the total profit, then the objective function is given by
Maximize Z= JOx 1+ 25Xi
-
is =400 and
MaxZ = Rs.1600 Step 3: Identify th\ constraints
"i 8x 1 + 6Xi S 48000 (Constraint on the binding time)
x 1;:: 2000 (Constraint on the sale of cloth bound books)
x, S 5000 (Constraint on the sale of paper bound books)
· x1, x2 2: O; as the no. of books published cannot be negative.
Graphical solution
Step I: Convert all the inequality constraints into equation by replacing 'S'I·~· by'='
i' Scale: 8x 1 + 6x 2 = 48000 ------------------------------- (I)
I cm = 50 units XI = 2000 ------------------------------- (2)
x2 = 5000 --------------------------- (3)
Step 2: Calculate the values of decision variables x1 and x2 satisfying the above
I
:j equ'ations and plot straight line on the graph corresponding to each constraint
J
ct. Consider equation I
~ :~
,f 8x 1 +6~=48000
tL x,
when x 1 = O; x2 = 8000
"n;:·· when x2 = O; x1 = 6000
ll Plot the constraint I on the graph (i.e. line I)

Consider equation 2
I
;;;~
x, = 2000
.
33. A publisher of textbooks is in the process of presenting a new book to the Plot the constraint 2 on the graph (i.e. line 2)
. market. The book may be bound by either cloth or hard paper. Each cloth
. Consider equation 3
bound book sold contributes Rs. 30 and each paper bound book contributes x2 = 5000
$i Rs. 25 towards profit. It takes 8 minutes to bind a cloth cover and 6 minutes Plot the constraint 3 on the graph (i.e. line 3)
~.- to bind a paper back. The total time available for binding is 800 hours.After
market survey, it is predicted that the cloth cover sales will be at least 2000
(vertices)
iL copies, but the paper back will. be at the -most 5000 copies. Formulate the
~::.~.:
.,,,,., .
Consider 8x 1+6x 2 s48000
w
h
above problem as LPP and find the optimal solution by graphical method.
(June 2010, 10 Marks)
~
,,
.... - 0 ::::: 48000. Since the origin satisfied this constraint, shade the region below/left of
•"'·
f,,,-,, Sol. Given data is tabulated as follows: the line I (corresponding to constraint I) towards the origin.
~~
t.::::
Type of book Profit Binding time Predicted sales Consider x1 2: 2000
h: Let x 1 = 0, then
h_ Cloth bound Rs. JO/book 8 min/book 2: 2000 books
'--·- 0 2: 2000. Since the origin not satisfied this constraint, shade the region to the right
~·- . Paper bound Rs. 25/book 6 min/book S 5000 books of the line 2 lcorresponding to cons~int 2) away from the origin.
i: ·- i!UU llrs.
L_. Total binding time available Consider x2 :S: 5000
ti:.. i P. Ll!lOOO m im•t<>c
Let x, = 0, then
iTi'
i.C.
Step 1: Identify the decision variables 0 :S: 5000. Since the origin satisfied this constraint, shade the region below the line 3
;!
Let x1 be the number of units of cloth bound books sold, (corresponding to constraint 3) towards the origin.
;a,. ... ~ be the number of units of paper bound books sold.
·-
~ ..
l!!!1'S OPER.\Tio11~:~~ . .. Lbti'it{Pit<><Jii~~t,; ~. ;:;~~~~~"k~r;;:;;~Ji\'c: ···'c • ,~:;~;-
The common shaded region/ area obtained is called 'feasible region' & all the points lime (hrs) required/unit
in this region are feasible points. Department Available time (hrs)/month
Product-A Product- B
The co-ordinates of the eitreme points (vertices) of the feasible region,are
l 2 3, 1500
A= (2000,0), B = (6000,0), C = (2300,5000) and D = (2000,5000)
2 3 2 1500
The plant has to supply the products to market where the maximum demand
points (x,, x,) Max Z = 0.4x, + O.Jx,
for product B is 450 units/month. Formulate the problem as an LP model and
A (2000,0) 60000 find graphically, the number of products A and B to maximize the total profit
B (6000,0) 180000 per month. (July 2011, 12 Marks)
c (2300,5000) 194000 Sol. Given data is tabulated as follows:
D (2000,5000) 185000
Processing time in the departments Market
The maximum value of the objective function Z = 194000, occurs at the extreme Type of product Profit
I 2 demand
point C (2300,5000). Hence the optimal solution to the given LPP is
x, = 2300 A Rs. 20/unit 2 hrs/unit 3 hrs/unit
x2 = 5000 and B Rs. 24/unit 3hrs/unit 2 hrs/unit :S450
Max Z = Rs.194000 Maximum availability
1500 hrs/month 1500 hrs/month
is of departments
Scale: Step 1: Identify the decision variables
lcm = 1000 units Let x1 be the number of units of product A produced/month,
x2 be the number of units of product B produced/month.
CD Step 2: Write objective function in- terms of decision variables
@ Let Z be the total profit, then the objective function is given by
Maximize Z= 20x 1+ 24~
Step 3: Identify the constnJints
Department 1 Department 2
i unit takes ~ 2 hours I unit takes--> 3 hours
Q) Q) x, units take~ 2x 1 hours x, units take --> 3x1 hours
I unit takes~ 3 hours I unit takes --> 2 hours

x, units take~ 3x, hours x, units take --> 2x, hours
region The constraints are • - -
2x, + 3is ::; 1500 (Constraint on the processing on department I)
3x 1 + 2is S 1500 (Constraint on the processing on department 2)
0(0,0) I r~c2ooo~o)W!!r"W"'Oiib\ 8(6000,0) )I XI x, S 450 (Constraint on the market demand for product B)
Step 4: Write the non-negativity constraints ~
@ x1, x2 2: O; as the no. of products produced cannot be negative.
CD
34. A plant manufactures two products A and B. The profit contribution of each Graphical solution
product has been estimated to be Rs. 20 and Rs. 24 for products A and B Step 1: Convert all the inequality constraints into equation by replacing 'S' by'='
respectively. Each product passes through two departments of the plant. The 2x 1 + 3~ = 1500 ---------~-------------- (I)
time required for each product and the total time available in each department 3x, + 2x2 = 1500 -------------------------- (2)
are as follows: is= 450 --------------------- (3)
··-<=·
·---··~,,.:~~.:,- ~~~~-~~
~~~~~!·>· · "•'~/"di~f~;~$~1t,1fr;;, "" .~m~:~+ .;:;-
', >· .,,
- Step 2: Calculate the values of decision variables x1 and :1.z satisfying the above .
equations and plot straight line on the graph corresponding to each constraint Scale:
Consider equation I . !cm= 100 units
2x 1 + 3JS = 1500
when x1 = O; "2 = 500
when x2 = O; x 1 = 750 .
Consider equation 2
3x1 +2x 2 = 1500
when'x I = O·' x2 = 750
· when "2 = O; x1 = 500 3
®
Consider equation 3.
x., = 450
region
Step 3: Identify the feasible region and co-ordinates of the extreme points x,
(vertices) 0(0,0)
Consider 2x 1 +3JS:S1500
::·· Let x1 = x2 = 0, then
I
0 :S 1500. Since the origin satisfied this constraint, shade the region left of the line I r
~35~
I
i
(corresponding to constraint I) towards the origin. Old machines can be bought at Rs. 2 lakhs each and new machines at Rs. 5
~ Consider 3x 1 + 2JS:S 15QO lakhs each. The old machines produce 3 components/week, while new machines
Let xl = x2 = .0' then produce 5 components/week, each· component being worth Rs. 30,000. A
0 :S 1500. Since the origin satisfied this constraint, shade the region left of the line 2 machine (new or old) costs Rs. 1 lakh/week to maintain. The company has
(corresponding to constraint 2) towards the origin. only Rs. 80 lakhs to spend on the machines. How many of each kind should the
Consider x2 :S 450 .company buy to get a profit of more than Rs.6 lakhs/week? Assume that the
Let X = 0, then
7
company cannot house more than 20 machines. Formulate the problem and
~··
~.
0 :S 4SO. Since the origin satisfied this constraint, shade the region below the line 3
solve it graphically.
Sol. Given data is tabulated as follows:.
(Dec 2011, 15 Marks)
'~"·'
;u;; The common shaded region/ area obtained is called feasible region' & all the points Possible
No. of Amount to
_J_;_--~
in this region are feasible points. Type of Cost of accommodation
·!·:·: components Maintenance cost be spent on
Thuo-ordinates of the extreme points (vertices) of the feasible region are machine machine of machines in
·:··-~
r--· produced machines
the company
!c. A= (500,0), B = (300,300), C = (70,450) and D = (0,450)
t-
...
,, Extreme Co-ordinates Objective function value
Old Rs.2 lakhs/unit 3/week Rs. I lakh/ week/
:-:; 80 lakhs :s 20
points New Rs.5 lakhs/unit 5/week unit
(x,, x.,) Max Z = 20x, + 24x7
A (500,0~ 10000 Worth of
Rs. 30.000/unit
8 (300,300) component
13200 ~
c (70,450) 12200 Step 1: Identify the decision variables

D <0,450) 10800 Let x1 be the no. of units of old machines purchased,
The maximum value of the objective function Z = 13200, occurs at the extreme "2 be.the no. of units of new machines purchased.
point B (300,300). Hence the optimal solution to the given LPP is Step 2: Write objective function in terms of decision variables
x, = 300 The objective is to maximize the profit.
x2 = 300 and Let Z be the total profit, then
Max Z = Rs.13200
-'·-··
.. Profit= Selling cost- Expenditure
= Worth of component - Maintenance cost
~TIOllS ~£ARCH
:~d(i-~t·>. ·~
..
0 $ 20. Since the origin satisfied this constraint, shade the region left of the line 2
= 30,000 (3x 1 +Sis)- 1,00,000 (x 1 +JS) (corresponding to constraint 2) towards the origin.
Profit = 50,000x2 ~ I O,OOOx 1 Consider S~ - x 1?. 60
The objective fvnction is given by Let x 1 = ~ = 0, then
Maximiie Z = 50,000'S-10,000x 1 0 ~ 60. Since the origin satisfied this constraint, shade the region below the line 3
1' Step 3: Identify the con~traints (corresponding to constraint 3) towards the origin.
(2 x 10 ) x1 + (5 x 105) is~ 80 x 105 (Constraint on the cost of machines)
5
The common shaded region/ area obtained is called 'feasible region' & all the points
x1 + is CS: 20 . (Constraint on the accommodation of machines) in this region are feasible points.
4
. ., (5 x I 0 ) is - (I x I04) x1 ::::; 6 x 105 (Constraint on the profit) The co-ordinates of the extreme points (vertices) of the feasible region are
Step 4: Write the non-negativity constraints A= (0,12), 8 = (6.5,13.5) and C = (0,16)
x 1, x2 ::::; O; as-the no. of machines bought cannot be negative. Extreme - Co-ordinates Objectivaunction value
points (x,, x,) Max Z = SOOOOx,- IOOOOx,
Graphical solution
A (0,12) 600000 '
Step I: Convert all the inequality constraints into equation by replacing 'CS:' by'='
2x 1 + 5x2 = 80 ---------------------- (I) 8 (6.5,13.S) 610000
x 1 + x2 = 20 --------------------- (2) c (0,16) 800000
sis- x,= 60 --------------------- (3) The maximum value of the objective function Z = 800000, occurs at the extreme
Step 2: Calculate the values of decision variables x1 and x satisfying the above point C (0, 16). Hence the optimal solution to the given LPP is
2
equations and plot straight line on the graph corresponding to each constraint x1 =O
Consider equation I x, = 16 and
2x 1 + Sx 2 = 80 Max Z = Rs. 800000
when x 1 = O; x2 = 16
~. Scale lcm = Sunits
when x, = O; x 1 = 40
Plot the" constraint I on the graph (i.e. line I)
Consider equation 2
x1 +x2 =20
when x 1 = O; x2 = 20
when x2 = O; x1 = 20
L Plot the constraint 2 on the graph (i.e. line 2)
Consider equation 3
•· Sx 2 - x1 = 60 ~ ~ --- .. I >\:: '>..._x,
when x 1 = O; x2 = 12
when x2 = O; x1 = -60
Plot the constraint 3 on the graph (i.e. line 3) .t
Step 3: Identify the feasible region and co-ordinates of the extreme points 436. ABC company owns a paint factory that produces both exterior and interior
(vertices) paints for'*wholesale distribution. The basic raw materials Aand B are used to
Consider 2x 1 + Sx 2 C::: 80 manufacture the paints. The maximum availability of A is 6 tonnes/day and that
let x1 = x2 = 0. then of B is 8 tonnes/d~y. The requirements of raw materials per tonne of interior
0 .'.': 80. Since the origin satisfied this constraint, shade the region left of the line I and exterior paints
-
are given below:
(corresponding to constraint I) towards the origin. Raw material Exterior paint Interior paint
Consider x 1 + x2 C::: 20
A I 2
Let x 1 = x2 = 0. then
B 2 1
Market survey has established that the daily demand for interior paint cannot
.!i!:··-
... ~C>Ja~CJI
exceed that of exterior paint by more than I tonne. The survey also shows that
maximum demand for interior paint is limited to 2 tonnes/day. The wholesale
LtliEAR PRooRAJOUio
Graphical solution -
Step I: Convert all the inequality constraints into equation by replacing "5! by'='
price per tonne is Rs, 3,000 for exterior and Rs. 2,000 for interior paint. How 2x, + is= 6 --------------------------- ( 1)
much interior and exterior paint the company should produce to maximize the XI + 2is = 8 -------------"---------------- (2)
gross income. Formulate t~e above data as a LPP and solve graphically. x, = 2 ---------------------------------- (3)
. . . (June 2012, IS Marks) ~= 1 ---------------------------------- (4)
Sol. Given data is tabulated as follows: Step 2: Calculate the values of decision varia~les x, and x2 satisfying the above
Raw material requirement I Maximum ·r equations and plot straight line on the graph corresponding to each constraint
Type of paint tonne of paint demand for Selling price Consider equation I
A B paint 2x,+x 2 =6
Interior 2 tonnes I tonne 2 tonnes/day Rs. 2000/tonne when x, = O; x2 = 6
when Xz = O; x, = 3
Exterior I tonne 2 tonnes I tonne/day Rs. 3000/tonne Plot the constraint I on the graph (i.e. line I)
Maximum availability Consider equation 2
6 tonnes/day 8 tonnes/day
of raw material x, + 2x2 = 8
Step I: Identify the decision variables when x, = O; x2 = 4
Let x, be the no. of tonnes of interior paint produced/day, when x2 = O; x, = 8
is· be the no. of tonnes of exterior paint produced/day. Plot the constraint 2 on the graph (i.e. line 2)
Step 2: Write objective function in terms of decision variables Consider equation 3
The objective is to maximize the profit. ·
x,=2
Let Z be the total profit, then the objective function is given by Plot the constraint 3 on the graph (i.e. line 3)
Maximize Z= 2000x 1 + 3000x2 Consider equation 4
~i~
Step 3: Identify the constraints x2 = I
Raw material A Plot the constraint 4 on the graph. (i.e. line 4)
1!.l
~~~· I tonne of interior paint requires_, 2 tonnes of raw material Step 3: Identify the feasible region and co-ordinates of the extreme points
r:i x, tonne of interior paint requires-> 2x, tonnes of raw material
1
"w.~f
~ ~~
f;~'
1 tonne of exterior paint requires _, I tonne of raw material
is tonne of exterior paint ·requires -> x2 tonne of raw material
(vertices)
Consider 2x 1 + x2 :'.S 6
0 S 6. Since the origin satisfied this constraint, shade the region left of the line I
Raw material B (corresponding to constraint I) towards the origin.
1 tonne of interior paint requires --> 1 tonne of raw material Consider x, + 2x 2:'.S 8
x, tonne of interior paint requires _, x, tonne of raw material Let x, = x2 = 0, then
ff. 0 ::; 8. Since the origin satisfied this constraint, shade the region left of the line 2
r·,~· I tonne of exterior paint requires -> 2 tonnes of raw material (corresponding to constraint 2) towards the origin.
I ·~
x2 tonne of exterior paint requires_, 2x2 tonnes of raw material Consider x, :S 2
The constraints are Let x, = 0, then
2x, + is::; 6 (Constraint on the raw material A) 0 :'.S 2. Since the @l'igin satisfied this constraint, shade the region left of the line 3
x, + 2x 2 ::; 8 (Constraint on .the raw material B) (corresponding to constraint 3) towards the origin.
x, :'.S 2 (Constraint on the market demand for interior paint) Consider x2 :S 1
x, S I (Constraint on the market demand for exterior paint)
Let x, = 0, then
Step 4: Write the non-negativity constraints 0 :S (. Since the origin satisfied this constraint, shade the region below the line 4
x,, is 2'. O; as the no. of tonnes of paints produced cannot be negative. (corresponding to constraint 4) towards the origin.
The common shaded region/ area obtained is called 'feasible region· & all the points
fij•@~~~:f:k1~~. ~~~ . --~:~~ ·-·;.~ ~~~~:.1;-:[:~s::.. - :·;.:~(~~~~,·;·~. ~--~,~~~~:-:~~_.;~~-~- ~~:.~~~;~•~f~m•;~1r•••
Processing time (hr/unit) Profit
0 =(0,0), A= (2,0), B = (2, I) and C = (0, I) ,.-- Type of product Demand
Labour Special machine (Rs/unit)
Extreme
points
.
Co-ordinates
(x ' x.,)
Objective function value
Max Z = 2000x + 3000x.,
\
\
Vacuum cleaner I I 10 ?: IO
0 (0 0) 0 Water purifier I 2 15 ~5
A (2 0) 4000 Maximum availability 20 hrs 20 runs
B (2 I) 7000 Step 1: Identify the decision variables
c (0,1) 3000 Let x, be the number of units of vacuum cleaners produced,
The maximum value of the objective function Z = 7000, occurs at the extreme point ~be the number of units of water purifiers produced.
's (2,1). Hence the optimal solution to the given LPP is Step 2: Write objective function in terms of decision variables
x, =2 The objective is to maximize the profi_t.
"2 = I and Let Z be the maximum profit. Then objective function is given by
Max Z = Rs.7000 Maximize Z = IOx, + l 5x2
Scale:
x2 Step 3: Identify the constraints I limitations
tern= I unit Labour hour
Vacuum cleaner
I unit takes -+ 1 hr
© x, units take -+ x, hrs
Water purifier
I unit takes -+ I hr
~ units take -+ ~ hrs
Special machine
Vacuum cleaner
I unit requires -+ l run
x, units require -+ x, runs
Water purifier
I unit requires -+ 2 runs
x., units require -+2x, runs
P'°.W##~ \ ~ ":'>.. c .. x, The constraints are -
x, + x2 s; 20 (Constraint on the availability ..of labour)
x 1 + 2~ s; 20 (Constraint on the availability of machine runs)
x,?: 10 (Constraint on the demand for vacuum cleaner)
~ s; S (Constraint on the demand for water purifier)
<D Step 4: Write non-negativity constraints.
37. A company makes vacuum cleaners and water purifiers. Each vacuum cleaner x 1 ,~?: O;as the number of units produced cannot be negative.
bas a profit of Rs. 10/- and each water purifier has a profit offs· 15/-. Each
vacuum cleaner requires one labour hour and one run on special machine. Each Graphical solution
water purifier requires one labour hour and two runs on special machine. For Step 1: Convert all the inequality constraints into equation by replacing'$.' and
the scheduling period demand is such that at least IO va.cuum cleaners and at •;:::•by'='
most S water purifiers are required. There are 20 labour hours and 20 machipe x 1 + x2 =20 -------------------------------- ( 1)
runs available. Use graphical method of solution and find the maximum profit x, +2~=20 -------------------------------- (2)
for the scheduling period. April 2018 (15 M) x,= IO ---------------------------- (3)
Sol. Given data is tabulated as follows: ~=5 --------------------------- (4)
.., ~~~
Step 2: Calculate the values of decision variables x, and .1z S.lltisfying the above
LnrEAR PRooRAHMmo
Extreme
points
Co-ordinates
(x,.~)
-
Max Z = 1Ox 1 + l 5x2
..
Consider equation 1 , t A (10,0) 100
x,+:is=20 B (20,0) 200
when x 1 = O; "i = 20 .r.
when x2 = O; x1 = 20 '- ·
c (10,5) 175
The maximum value of the objective function Z = 200, occurs at the extreme point
B (20,0). Hence the optimal solution to the given LPP is
Consider equation 2 x, =20
x 1+2is=20 x 2 = 0 and
when x1 = O; "i = 10 Max Z = Rs.200
when x2 = O; x1 = 20 x2
Consider equation 3 Scale I cm = 2 units
x1 = I0, "i = 0 CD
Plot the constraint 3 on the grap. (i.e. line 3)
Consider equation 4. ®
"i = 5, x, = 0
Plot the constraint 4 on the grap. (i.e. line 4)
(vertices)
Consider x1 +x 2:520
.(,..
Let x1 = "i = 0, then
,. 0 :5 20. Since the origin satisfied this constraint, shade the region left of the line l
u (corresponding to constraint 1) towards' the origin.
r~ Consider x1+ 2x2:5 20
f
Let x 1 = "i = 0, then . .
~: . 0 :5 20. Since the origin satisfied this constraint, shade the region left of the line 2
!~-·- (corresponding to constraint 2) towards the origin. I j""l'!'h)ffi/fl/U~
- __ C:::: ~ xI
".:..
Consider x1 ~ l 0
lt-: Let x1 = 0, then
0 ~ JO. Since the origin not satisfied this constraint, shade the region above the line
,. 3 (correspondirig to constraint 3) away from the origin.
'
Consider x2 :S 5 k 38. Solve the following problem using graphical method
Let x2 = 0, then Maximize Z = 2x 1 + 3~
0 :5 5. Since the origin satisfied this constraint, shade the region left of the line 4 subjected to constraints
(corresponding to constraint 4) towaf51s the origin. 2x 1 + x2 :5 6; x1 - x2 ;:: 3; x , x ;:: 0 (Jan 2016, 06 Marks)
1 2
The cpmmon shaded region/area obtained is called feasible region' & all Uie points Sol. Step 1: Convert all the inequality constraints into equation by replacing ':S'/'~
in this regi'on are feasible points.' by'='
The cb-ordinates of the extreme points (vertices) of the feasible region are 2x 1 + "i = 6 ------------------------------ (I)
A=-( 1O,Q), B = (20,0) and C = (I 0,5)
x1 - x2 = 3 -------------------------------- (2)
Consider equation I
2x 1 + x2 = 6
\
····;~~~i~;f!~#~;;~~¥tf~?~ . . ~;;.' ..:i~~~~~~4~;lf;~::;;f;!>~.·~/.··
when x 1 = O; "i = 6 I 39 · The standard ~ight of a special purpose brick is 5 kg and it contains two
when "i = O; x1 =3 ingredients B 1 and B2• B1 costs Rs. S per kg and B2 costs Rs. 8 per kg. Strength
Plot the constraint I on the graph (i.e. line I) considerations dictate that the brick should contain no more than 4 kg\ofB 1
Consider equation 2 and a minimum of2 kg ofB2• Since the demand for the product is likely to be
x,-is=3 related to the price of the brick, find out graphically the minim uni cost of the
when x 1 = O; "i = -3 brick satisfying the above conditions.
when "i = O; x1 = 3 ~-- Sol. Step 1: Identify the decision variables
Plot the constraint 2 on the graph (i.e. line' 2)'- • _, · Let x1 be the quantity (in kgs) of ingredient B 1 in the brick,
Step 3: Identify the feasible region and co-ordinates of the extreme points is be the quantity (in kgs) of ingredient B2 in the brick.
(vertices) Step 2: Write objectiv.e fun~tion in terms of decision variables
Consider 2x 1 + x2 S 6 The objective is to minimize the total cost.
Let x 1 = x2 = 0, then Let Z be the total cost of the brick. The objective function is given by
0 S 6. Since the origin satisfied this constraint, shade the region below the line I Minimize Z = Sx 1+ 8x2
(corresponding to constraint I) towards the origin. ' Step 3: Identify the constraints
Consider x1 - is 2'. 3 The constraints are on the weight of brick artd quantity of ingredients in the brick.
Let x1 = is = 0, then f x1 + is= 5 (Constraint on the weight of brick)
0 2'. 3 Since the origin not satisfied this constraint, shade the region right of the line 2 x1 S4 (Constraint on the quantity of ingredient 8 1 in the brick)
(corresponding to constraint 2) away from the origin. is 2'. 2 (Constraint on the quantity of ingredient 8 2 in the brick)
-1- There is only a single point A (3,0), which is common to both shaded regions i.e. it Step 4: Write the non-negativity constraints
satisfies both the constraints and hence it is an optimal point. The optimal solution to xi. x2 2'. O; as the quantity of ingredient used cannot be negative.
the given LPP is fyfax Z = 6.
is Graphical solution
Scale: Step 1: Convert all the inequality constraints into equation by replacing ':S'/'2'.by '='
CD I cm =l unit x1 + x2 = 5 ---------------------------------- (I)
x, = 4 ---------------------------------- (2)
x2 = 2 ---------------------------------- ( 3)
Consider equation I
x 1 + x2 = 5
when x 1 = O; x2 = 5
0 when x2 = O; x, = 5
Shaded Consider equation 2
region x, =4.
O(~,O) x,
Consider equation 3
x,=2.
(vertices)
Consider x, + x2 =5
-. · ~- .. ,;~~~;~.~{' · , ":OPiijA"tJo.Ws-~~ LtiOwt PROGIWIMIRG
0 = 5. Since the origin not satisfi~ this constraint, shade the region above the line I {40, Maximize Z = 3x 1 + 2x2 Unbounded Solution
(corresponding to constraint I) away from the origin. · subject to x 1 - ~ :S 1,
Consider x1 :S 4 x 1 + ~?.3 and
Let x1 = 0, then x 1 .~?.0. \
0 :S 4. Since the origin satisfied this constraint, shade the region below the line 2 SoL Step 1: Convert all the inequality constraints into equation by replacing ':S' r?. by '=='
(corresponding to constraint~) towards the origin.. x 1 - JS = I ------------------------------- ( l)
Consider x, ?. 2 XI + X 2 = 3 -------------------------------- (2)
Let x, = 0, then Step 2: Calculate the values of decision variables x, and x2 satisfying the above
0?: 2~ Since the origin not satisfied this constraint. shade the region above the line 3 equations and plot straight line on the graph corresponding to each constraint
(corresponding to constraint 3) away from the origin. Consider equation I
The c_ommon shaded region/ area obtained is called feasible region' & all the points x, - x2 =I
I
1: ',
in this region are feasible pointS. when x 1 = O; x2 = -1
The co-ordinates of the extreme points (vertices) of the feasible region are when x2 = O; x, = 1
.l A= (4,2), B = (3,2) and C = (0,5) Plot the constraint 1 on the graph (i.e. line 1)
!·I . Extreme Co-ordinates Objective function value
x1 + x2 = 3
r points (x,, x.,) Min Z = Sx, + 8x,
when x1 = O; x2 = 3
I. A
B
(4 2)
(3 2)
36
31
when x2 = O·' x I = 3
l c (0, 5) 40
1~ The minimum value of the objective function Z = 31, occurs at the extreme point B
~
-~, (vertices)
(3,2). Hence the optimal solution to the given LPP is
- ' x, =3 Consider x 1 - x2 :S 1
Let x1 = ~ = 0, then
JS= 2and O :S I. Since the origin satisfied this constraint, shade the region above the line 1
MinZ= Rs.31
..... (corresponding to constraint I) towards the origin .
I
Consider x1 + x2 ?. 3
0?. 3. Since the origin not satisfied this constraint, shade the region above the line 2
(corresponding to constraint 2) away from the origin.
# It has been observed in the shaded region that there exist a number of points for
Scale: w~ich the value of the objective function is raising continuously. i.e. as the variables
:1,.
x 1 and x2 are made arbitrarily large, the value ofZ also increases. There is no limit for
I cm = 0.5 unit
the value of Z. This is an example for unbounded LP problem (i.e. solution) which
<D has been caused due to improper formulation of the real-life problem:
x,
0(0,0)
<D
®
.. is .
OP~T;l!;;}(~)R~~~ LmBAJt PROGRAlllUlfG
Profit=Selling cost of eggs - Cost of feeding
Let Z be the total profit, then the objective function is
..
Maximize Z = (0.9-1) x1 + (1.5-1) JS
Maximize Z = 0.5JS"l0.lx 1
Scale: Step 3: Identify the constraints I limitations
2x 1 +Sis S 80 (Constraint QA amount to buy hens) o.s-t.,_-0.\1, >-/ (,
I cm = 0.5 unit
x 1 + x2 S 20 (Constraint on accommodating hens) ( thvJj, ~J; S.'1 pH-tJ)
x 1, x2 :'.". O; as number of hens oought cannot be negative.
Sol. Step 1: Convert all the inequality constraints into equation by replacing 'S' by'='
2x 1 + 5x2 = 80 --------------------------- (I)
x1 + x2 = 20 ------"---------------·---- (2)
x1 Step 2: Calculate the values of decision variables x1 and x2 satisfying the above
,}
equations and plot straight line on the graph 1:orresponding to each constrain
Consider equation I
2x 1 + 5x2 = 80
./!t. Old hens can be bought at Rs. 2 each and young ones at Rs.5 each. The old
whenx 1 =O;x2 =16
when x2 = O; x 1 = 40
hens lay 3 eggs per week and young ones lay 5 eggs per week, each egg being
worth 30 paise. A hen (young or old) costs Re. I per week to feed. I have only
Consider equation 2
Rs.80 to spend for hens, how many of each kind should I buy to give a profit
x 1 +x 2 =20
of more than Rs.fi per week, assuming that I cannot house more than 20 hens.
when x 1 = O; x2 = 20
'- (Jan 2014, 10 Marks) when x1 = O; x 1 = 20
Data:
•'· Plot the constraint 2 on the graph (i.e. line 2)
~· Old hens:
~· Cost of each hen= Rs.2 Step 3: Identify the feasible region and co-ordinates of the extreme points
,.f., No. of eggs laid = 3/hen/week (vertices)
~ Cost of each egg= Re. 30 Consider 2x 1 + Sis S 80
Let x 1 = x2 = 0, thenO S 80. Since the origin satisfied this constraint, shade the region
Selling cost of eggs =Re. ~·tl9'x 3
!- below the line I (corresponding to constraint I) towards the origin.
= Re~lien/week
6. Cost of feeding= Re. I/hen/week Consider x1 + x2 S 20
Young hens: Let x 1 = x2 = 0, then
Cost of each hen = Rs.5 0 S 20. Since the origin satisfied this constraint, shade the region below the line 2
No. of eggs laid = 5/hen/week (corresponding to constraint 2) towards the origin.
Selling cost of eggs= Re. 0.30 x 5 The common shaded region/ area obtained is called feasible region' & all the points
= Rs. 1.50/hen/week
Cost of feeding= Re. I/hen/week The co-ordinates of the extreme points (vertices) of the feasible region are
Sol. Step I: Identify the decision variables 0 = (0, 0), A= (20, 0), 8 = (7, 13) and C=(O, 16).
Let x 1 be the number old hens bought, Extreme Co-c>rdinates Objective function value
x, be the number of young hens bought. points {x,, "2) Max Z = O.Sis- O.lx 1
Step 2: Write objective function in terms of decision variables 0 (0,0) 0
\
The profit is more than Rs. 6/week (as per given data) means that the A (20,0) -2 '.'.')
objective is to maximize the profit. B (7,13) 5.8 ,.I
\ _;_ ::!
c (0,16) 8
.,. OPERATJoliS REsEARcn
The maximum value of the objective function Z = 8, occurs at the extreme point C
· ·LmiWt PiwolWIMllfG
Sol. Step 1: Identify the decision variables
..
(0, 16). Hence the optimal solution to the given LPP is . Let x be the quantity (in quintals) of scrap purchased from supplier A,
1
x1 =O is be the quantity (in quintals) of scrap purchased from supplier B.
is= 16 and Step 2: Write objective function in terf1s of decision variables
MaxZ=8 The objective is to minimize the total cost.
x2 Let Z be the total cost, then the objective function is given by
Minimize Z= 200x 1 + 400x2 .
Step 3: Identify the constraints.

@ Scale: The constraints are on the quantity of scrap purchased and the quantity of
1cm=4 units metals X and Y .in the scrap.
MetalX
1 quintal of scrap= 0.25 quintal of metal X, then
x quintal of scrap= 0.2Sx 1 quintal of metal X. Supplier A
1
Similarly,
region I quintal of scrap= 0.75 quintal of metal X, then
f. ... . n ·o, =::...., < )I xi x quintal of scrap= 0. 7Sx, quintal of metal X Supplier 8
2
0(0,0) MetalY
I quintal of scrap= 0.10 quintal of metal Y, the.n
x quintal of scrap= 0.1 Ox 1 quintal of metal Y. Supplier A
1
.. ~ 42. A firm plan to purchase at least 200 quintals of scrap containing high quality
Similarly,
I quintal of scrap= 0.2 quintal of metal Y, then
metal X and low-quality metal Y. It decides that the scrap to be purchased is quintal of scrap= 0.2x 2 quintal of metal Y. Supplier B
; must contain at least 100 quintals of X- metal and not more than 35 quintals JI x + x 2':. 200 (Constraint on the quantity of scrap purchased)
~·.-
1 2
of Y-metal. The firm can purchase the scrap from two suppliers (A and B) in
. unlimited quantities. The purchase ofX and Ymetals in terms of weight in the
0.2Sx + 0.75Xz 2':. I00 (Constraint on the quantity of metal X in the scrap purchased)
1
or
. !.:. scrap supplied by A and B is given below.
x, + Jis2':.400
r"''·
f.·.:.: Metals Supplier A Supplier B
x 25% 75%
O. lx +0.2Xz:S35(Constraint on the quantity of metal X in the scrap purchased)
1
or
+--
-;,--:-·
y JO% 20% x, + 2is :s 350
\: The price of' A's scrap is Rs. 200 per quintal and that ofB is Rs. 400 per quintal. Step 4: Write the non-negativity constraints
~~-
The firm wants to determine the quantities that it sb.ould buy_from the two x , x 2':. O; as the quantity of scrap purchased cannot be negative.
\.... 1 2
.~
suppliers so that total cost is minimized and solve it graphically.
1:··
(Jan 2010, IO Marks I May 2017 14 Marks) Graphical solution
L ,f Data: The given data is tabulated as follows:
Step 1: Convert all the inequality constraints into equation by replacing''?.'/~ by'='
~~ Mass of metal present/quintal
xI + is = 200 --------------------------------- ( I)
Mass of ·x1 + 3x2 = 400 ---------------------------------- (2)
Supplier scrap to be of scrap Cost of scrap x1 + 2x2 = 350 ---------------------------------- (3)
~
purchased x y
A 2':. 200 0.25 quintal 0.1 quintal Rs. 200/quintal equations and plot straight line on the graph corresponding to each constraint
i B quintals 0.75 quintal 0.2 quintal Rs. 400/quintal Consider equation I
Mass of metal x1 + Xz=200
2':. 100 quintals :S 35 quinta!s
present in scrap when x1 = O; x2 = 200
!l when is= O; x1 = 200
.. Plot the constraint I on the graph (i.e. line I)
Consider equation 2
OPERATIONS REsmcH ;~·faooRmliRo
~·
-
x1 + 3x2 = 4"00
when x1 = O; x2 = 133.33 Scale:
when~= O; x 1 =400
!cm =50 units
Consider equation
x1 +2x 2 = 350
when x1 = O; x2 = 175
when x2 = O; x 1 = 350
. Step 3: Identify the feasible region and co-ordinates of the extreme points
(vertices)
Consider x1 + x2 2:: 200 0(0,0) ''\: ...... , <::::::::: ':',, x1
0 2:: 200. Since the origin not satisfied this constraint, shade the region above the line
I (corresponding to constraint I) away from the origin.
Consider x1 + 3x2 2:: 400 43. The manager of an oil refinery must decide on the optimal mix of two possible
Let x1 = x2 = 0, then blending processes of which the input and output per production run are given
0 2:: 400. Since the origin not satisfied this constraint, shade the region above the line as follows:
2 (corr.esponding to constraint 2) away from the origin. Process Input (units) Output (units)
Consider x 1 + 2x 2 :<::: 350 (units) Crude A Crude B GasolineX Gasoline Y
Let x1 = x2 = 0, then I 5 I 3 5 I 8
0 :<::: 350. Sincy the origin satisfied this constraint, shade the region below the line 3 2 4 I 5 4 . I 4
(corresponding to constraint 3) towards the origin. The maximum amount of crude available is 200 units of crude A and 150 units
The common shaded region/ area obtained is called feasible region' & all the points of crude B. Market requirements show that at least 100 units of gasoline X
in this region are feasible points. and 80 units of gasoline Y must be produced. The profit per production run
The co-ordinates of the extreme points (vertices) of the feasible region are from process 1 and 2 are Rs. 300 and Rs. 400, respectively. Formulate a suitable
A= (I 00, I 00), B= (250, 50) and C= (50, I 50) mathematical model and solve the same by using graphical method.
Extreme· Co-ordinates Objective function value (Jan 2007, 10 Marks/Dec 2012, 10 Marks)
points (x ,xJ Min Z = 200x + 400x, Sol. The given data is tabulated as follows;
A (250,50) 70000 Input (units) Output (units) Profit per
Process
B (50, 150) 70000 Crude A Crude B Gasoline X ·Gasoline Y production run
c (I 00, I 00) 60000 l 5 3 5 8 ~.300
The minimum value of the objective function Z = 60000, occurs at the extreme point 2 4 5 4 4 Rs. 400
C ( t 00, I 00). Hence the optimal solution to the given LPP is Maximum input
200 150
x1 = 100 available (units)
x2 = 100 and Minimum output
100 80
Min Z = Rs. 60000 requirement (units)
Let x 1 be the number of pmduction runs of process I,
x2 be the number of production runs of process 2.
... OPERAnons REs~ce
Step 2: Write an objective function in terms of decision variables
LllfEAR :PaooiwiliurG
(vertices)
Let Z be the total profit. The objective function is given by Consider Sx1 + 4JS :'.S 200
Maximize Z =300x 1 +400x2 Let x1 = is = 0, then .
Step 3: Identify the constraints/ limitations
The constraints are on the availability of units and requirements of outputs.
,. \·
0 :'.S 200. Since the origin satisfied this constraint, shade the region below the line I
Sx1 + 4'S :'.S 200 (Constraint on the availability of crude A) Consider 3x 1 + Sx 2 :'.S I SO
3x 1 +Sis :'.S ISO (Constraint on the availability of crude 8) Let x1 = 'S = 0, then
Sx 1 + 4Xz ~ I 00 (Constraint on the requirement of gasoline X) 0 ~ ISO. Since the origin satisfied this constraint, shade the region below the line 2
8x 1 + 4is ~ 80 (Constraint on the requirement of gasoline Y) (corresponding to constraint 2) towards the origin.
Step 4: Write the non-negativity constraints Consider Sx 1 +4x2 ~ 100
x1, x2 ~ O; as the number of production runs cannot be negative. Let x1 = x, = 0, then
0 ~ l 00. s·ince the origin not satisfied this constraint, shade the region above the line
Graphical solution 3 (corresponding to constraint I) away from the origin.
Step 1: Convert all the inequality constraints into equation by replacing 'S.'f~ by'=' Consider 8x 1 + 4x2 ~ 80
Sx 1 + 4is = 200 ---------------------------------- (I) Let x1 = x2 = 0, then
3x 1 +sis= ISO ---------------------------------- (2) 0 ~ l 00. Since the origin not satisfied this constraint, shade the region above the line
.ft:· Sx 1 + 4JS = l 00
8x 1 + 4JS = 80
--------------------------------- (3)
---------------------------------- (4)
3 (corresponding to constraint I) away from the origin.
The common shaded region/ area obtained is called feasible region· & all the points
Step 2: Calculate the values of decision variables x1 and ~ satisfying the above
.lf. in this region are feasible points.
~i.;
equations and plot straight line on the graph corresponding to each constraint The co-ordinates of the extreme points (vertices) of the feasible region are
~;:· Consider equation I ,
::t;; A= (20, 0), B= (40, 0), C= (31, 12), D= (0, 30) and E= (0, 2S)
Sx 1 + 4JS = 200 Extreme Co-ordinates Objective function value
l
-
~ when x1 = O; is = SO points - (x , x,) Max Z = 300x + 400x,
- when is = 0; x1 = 40
A (20, 0) 6000
~ Consider equation 2
8 (40, 0) 12000
c (31, 12) 14100
',_
3x, + sis = ISO
D (0, 30) 12000
-Ut:.. when x1 = O; is= 30 when x2 = O; x = SO
1 E (0, 2S) - 10000
!;·. Plot the constraint 2 on the graph (i.e. line 2)
Consider equation 3 The maximum value of the objective function Z = 14100, occurs at the extreme point
C (31. 12). Hence the optimal solution to the given LPP is
Sx 1 +4JS =-LOO
x, = 31
Ifl:E...... when x1 = O; x2 = 2S
when x2 = O; x1 = 20
x 2 = 12 and
Max Z = Rs.14100
~
HTI··-
E:: 8x 1 +4is=80
--
·- when x1 = O; x, = 20 0
I""''
~:. -
.
.
when -'""2
x =O·' x-I =IO
Plot the constraint 4on the graph (i.e. line 4)
14!.
~
r;,;;
t""'
,,_
.. x,
OPERA.110_11.s ~£ARCH LIRAR PaoalWUtllll'i;l
is be the num~{ofunits ofAM - PM radio produced/week.
-:,-
The objective of the company is to maximize the profit.
Let Z be the total profit. then the objective function is written as
Scale:
Maximize Z = 40x 1+ 80x,
I cm = 5 units Step 3: Identify the constraints
2x, + Jis S 48 (Constraint on the operation of plant)
x 1 S 15 (Constraint on the sale AM radios)
x S I0 (Constraint on the sale AM - FM radio)
2
x , x =:-: O; as number of units of radios produced cannot be negative.
2
1
Graphical solution
Step I: Convert all the inequality constraints into equation by replacing 'S' by'='
2x, + 3"2 = 48 --------------------------------- (I)
x, x, + Ois = 15 ------------------------------- (2)
0(0,0J
Ox, + is = I0 -------------------------------- (3)
Step 2: Calculate the values of decision variables x, and x2 satisfying the above
<D equations and plot straight line on the graph corresponding to each constraint
44. The XYZ company has been a producer of electronic circuits for Television Consider equation I .
sets and certain printed circuit boards for Radios. The company has decided to 2x, + 3JS = 48
expand into full scale production and marketing of AM and AM - FM radios. when x, = O; x2 = 16
It has been built a new plant that can operate 48 hours per week. production of when x2 = O; x1 = 24
an AM radio in the new plant will require 2 hours and production of AM - FM Plot the constraint I on the graph (i.e. line I)
radio will require 3 hpurs. Each AM radio will contribute Rs. 40 to profit, while Consider equation 2
an AM - FM radio will contribute Rs. 80 to profit. The marketing department, x, +Ox,= 15
·~
after extensive research, has determined that a maximum of 15 AM radio and x, = 15

10 AM - FM radios can be sold each week. Formulate an LP model to determine Plot the constraint 2 on the graph (i.e. line 2)
the optimal production mix of AM and AM - FM radios that will maximize Consider equation
profits and solve the problem using graphical method. Ox 1 + x 2 = 10
(June/July 2015, 10 Marks.) x = 10
Sol. The given data is tabulated as follows: Pl~t the constraint 3 on the graph (i.e. Iine 3)
Production Contribution Maximum sales of
Type of radio (vertices)
time I Profit radio
Consider 2x1 + 3x2 S 48
AM 2 hrs/unit Rs. 40/unit 15/week Let x 1 = x, = 0, then
AM-FM 3 hrs/unit Rs. 80/unit JO/week 0 S 48. Since the origin sati\fied this constraint, shade the region below the line I
Maximum operation (corresponding to constraint I) towards the origin.
48 hrs/week Consider x 1 S15
of the plant
Step 1: Identify the decision variables Let x, = x2 = 0, then
Let x, be the number of units of AM radio produced/week,
lil:M:
0PERATIOIJS ffEsEARCH
0 :5 15. Since the origin satisfied this constraint, shade the region left of the line 2
Consider is :5 I 0 · ,
r®k· PRooR.Uu.mo ·
- '
45.
'· ~.:.t.~ _-··
The manufacturer of a line of patent medicines is preparing a production plan

for medicines A and B. There are sufficient ingred~ents available to make 20000
..
. bottles of medicine A and 40000 bottles of medicine B. There are only 45000
Let x1 = is = 0, then bottles into which either of the medicines can be filled. Further, it takes 3 hours
0 :5 I 0. Since the origin satisfied this codstraint, shade the region below the line J to prepare eiiough material to fill 1000 bottle8 of medicines A and I hour to.
(corresponding to constraint I) towards the origin. prepare enough material to fill 1000 bottles of medicine B and there are 66
The common shaded region/ area obtained is called feasible region· & all the points hours available for this operation. The profit is Rs. 8/bottle for medicine A and
in this region are feasible points. Rs. 7/bottle for medicine B. Formulate this problem as an LPP and Solve by
Tht; co-ordinates of the extreme points (vertices) of the feasible region are graphical method. (June/July 2014, IO Marks)
0 = (0,0), A= (15,0), B.=(15,6), C =(9,IO)and D = (0,10) Sol. Given data is tabulated as follows·
Co-ordinates Objective function value Maximum ingredients Maximum Time
Extreme points
(x, x,) Max Z = 40x , + 80x, Type of available/ maximum number required for Profit
0 (0, 0) medicine number of bottles can of bottles filling I000 (Rs)
0
A be produced available bottles
(15, 0) 600
8 A 20000 45000 3 hrs. 8/bottle
(15,6) 1080
t c E9, 10) 1160
8 40000 I hr. 7/bottle
Maximum time
D (0,10)
f:» 800 available for 66 hrs.
The maximum value of the 'objective function Z =I I 60, occurs at the extreme point
··~: C (9, I0). Hence the optimal solution to the given LPP is
filling
Step I: Identify the decision variables
h.··.·'
j1f.:
.t<;o x 1 =9
"'
Let x 1 be number of bottles of Medicine A prepared,
is= 10 and x2 be number of bottles of Medicine 8 prepared.
Max Z = Rs.1160 Step 2: Write objective function in terms of decision variables
x2 The objective is to maximize the profit.
Let Z be the maximum profit. The objective function is given by
Maximize Z = 8x 1 + 7x2
x 1 :520000 (Constraints on the availability of ingredients for medicine A)
@ .Scale: ~ :5 40000 (Constraints on the availability of ingredients for medicine 8)
D(0,10) x 1 + is :5 45000 (Constraints on total number of bottles available)
I cm= 2 units Time taken to fill one bottle of medicine A is
Q) ~ Q) For I 000 bottles--t 3hrs taken
Feasible region For I bottle --+ 311000 hrs.
8(15,6) Similarly, time taken to fill one bottle ofmedicine B is
For I 000 bottles-+ I hr taken
For I bottle --+ I/ 1000 hr. o
WlllQl/111111111111~·
(3/ I000) x 1 + (I/I 000) ~ :5 66 (Constraints on total time available)
0(0,0) x1 Step 4: Write the non-negativity constraints
A(l5,0) xi' is 2'.: O; as the number of bottles cannot be negative.
Graphical solution
@ Step 1: Convert all the inequality constraints into equation by replacing ':5' by'='
CD
x 1 + Ois = 20000 ------------------------ ( I)
....:11-.
-..,,
Ox 1 + l':z = 40000
0PERATIOl'IS REsEARCR
------- (2)
~ PROGJWOHl'IG ·.··:.· .. ~~==-: ..
The co-ordinates of the exfrerrie Jioints (vertice~ cifthe feasible region are
0 = (0,0), A= (20000,0), B = (20000,6500), C =(I 0500,34500), D = (5000,40000)
x, + l':z = 45000" --------- (3) and E = (0,40000)
3x1 +l':z=660p0 - ---------- (4) Co-ordinates Objective function value
\ Step 2: Calculate the values of decision variables x1 and~ satisfying the above Extreme points
(x,, x,) Max Z = 3x, + 4x,
Consider equation I. · 0 (0,0) . 0
x1 + Ox2 = 20000 A (20000,0) 160000
x, = 20000. B (20000,6500) 205500
· Plot.the constraint I <in the graph (i.e. line I) c (I 0500,34500) 325500
Consider equation 2 D (5000,40000) 320000
Ox 1 + l':z = 40000 E (0,40000) 280000
x, = 40000 The maximum value of the objective function Z =325500, occurs at the extreme
Pfot the constraint 2 on the graph (i.e. line 2) point C (I 0500,34500). Hence the optimal solution to the given LPP is
Consider equation 3 x, = 10500
x, + x, = 45000 ~ = 34500 and
when x 1 = O; x2 = 45000 Max Z = Rs.325500
when x2 = O; x1 = 45000 Scale:
Plot the constraint 3 on the graph (i.e. fine 3) I cm = 5000 units
Consider equation 4. (i)
3x 1 + x2 = 66000
when x1 = O; x2 = 66000
when x2 = O; x1 = 22000
(vertices) ©
Consider x 1 :S 20000
Let x, = 0, then
0 :S 20000. Since the origin satisfied this constraint, shade the region below the line
<V
I (corresponding to constraint I) towards the origin.
Consider x2 :S 40000
Let x, = 0, then
0 :S 40000. Since the origin satisfied this constraint, shade the region below the line
2 (corresponding to constraint 2) towards the origin.
Consider x, + x2 :S 45000 ~
z~
Let x, = x2 = 0, then zz
·1l"'"'''''''"'~'"'~ ~
0 :S 45000. Since the origin satisfied this constraint, shade the region below the line •
3 (corresponding to constraint 3) towards the or_igin.
Consider .Jx, + x2 :S 66000 0(0,0) . \ A(20000,0) '\:
•x I
0 :S 66000. Since the origin satisfied this constraint, shade the region below the line ©
4 (corresponding to constraint 4),towards the origin.
The common shaded region/ area obtained is called feasible region' & all the points
... 46.
drin~-:-
OPERATIONS REsEARCH
A factory has two bottling plants located at A and B. Each plant produces three
P, Q and R. The number of bottles_produced per day are as follows;
-~~-
LlllBAR PROGffAM1'IltO
3000x + 1000~?: 40000 (Constraint on demand for drink Q)
1
2000x + SOOOis?: 44000 (Constraint on demand for drink R)
1
di'
Plant Step 4: Write non-negativity constraints
Product
A B x , x ?: O; as the number of.days of operation cannot be negative.
p 1500 1500 1 2
0 3000 IOOO Graphical solution
' ·R 2000 5000
In a particular month, there is a demand of20,000, 40,000 and 44,000 for P, Q
Step 1: Convert all the inequality constraints into equation by replacing'?:' by'=='
1500x + I 500~ == 20000 -----------------------...:------- (I)
1
and R respectively. The operating cost per day at A and B are Rs. 6000 and Rs. 3OOOx +I 000x 2 == 40000 ~------------------------------- (2)
1
· 4000. For bow many days each plant be run for meeting the market demand to 2000x, + 5000x~ == 44000 --------------------------------- (3)
minimize the production cost? Solve graphically and state redundant if there is Step 2: Calculate the values of decision variables x, and x2 satisfying the above
any. (Jan 2008, 10 Marks) equations and plot straight line on the graph corresponding to each constraint
Sol. Given data is tabulated as follows· Consider equation I
Number of bottles of drinks produced Operating I500x 1+ l 500x2 == 20000
Plant when x, = O; x2 == 13.33
p Q R cost of plant
when~= O; x1 == 13.33
A 1500/day 3000/day 2000/day Rs. 6000/day Plot the constraint I on the graph (i.e. line I)
B 1500/day IOOO/day 5000/day Rs. 4000/day Consider equation 2
3000x, + I000x 2 == 40000
Minimum 20000 bottles/ 40000 bottles/ 44000 bottles/
demand for drinks month month month when x1 == O; x~ == 40
Step 1: Identify decision variables when x: = O; x1== 13.33
\. Plot the constraint 2 on the graph (i.e. line 2)
1•. ~
Let x1 be the number of days that plant A operates/month,
x2 be the number of days that plant B operates/month. Consider equation 3
2000x, + 5000x2 == 44000
The objective is to minimize the production cost. when x1== O; x2 == 8.8
Let Z be the total cost of production. The objective function is when x2 = O; x1== 22
Minimize Z == 6000x 1 + 4000x 2 Step 3: Iclentify the feasible region and co-ordinates of the extreme points
Plant A Plant B (vertices)
Drink P DrinkP Consider l 500x 1+ i 500x 2 ~ 20000
l day-> 1500 bottles I day -> l 500 bottles Let x, = x: == 0, then
0 ~ 20000. Since the origin not satisfied this constraint, shade the region to the right
rt-?.: x1 days-> 1500x, bottles x2 days -+ I500x2 bottles
'.Ii'.' of line I {corresponding to constraint I) away from the origin.
.1::·
f'"'·
4:.e
Drink Q
Consider 3000x, + l OOOx: ~40000
:1::. Drink Q
·I·• ...
: ~·
I day_. 3000 bottles I day _. I000 bottles Let x, = x2 == 0, then
i
0?: 40000. Since the origin not satisfied this constraint, shade the region to the rii.rht
x1days -> 3000x 1 bottles x2 days -+ IOOOJS bottles
}:2:
&o of line 2 {corresponding to constraint 2) away from the origin.
•·
,;.;.
Consider 2000x 1+ SOOOx:?: 44000
==--
~;T
Drink R Drink R
Let x1= x2 == 0, then .
I day __... 2000 bottles I day -+ 5000 bottles 0 ~ 44000. Since the origin not satisfied this constraint shade the region right"' ··
m . x, days -+ 2000x 1 bottles ~days -+ 2000x 2 bottles
line 3 (corresponding to constraint 3) away from the origin.
it 1 · I ~flOx~?: 20000 (( · ·1aint on demand for drink P)
The common sha<led region/ area obtained is called 'feasible region·&. all'
-- ..
r
OP£bno11s REsEARca WEAR PROGRAlllDJIG

The co-ordinates of the extreme points (vertices) of the feasible region are Washer assembly department : only 9000 washers.
A= (6.25,0), 8 = (9,0) and C = (9, 11)
Stamping department can produce parts for 10000 washers or 10000 dryers per
Extreme points Co-ordinates Objective function value month as well as for some-suitable combinations. It is assumed that there is ao
(x 1, x2) Min Z = 6000x 1 + 4000x~ changeover cost from washers to dryers. A similar situation exists in motor and
A (22,0) transmission department, but assembly lines are separate. The contribution to
132000 monthly profit is Rs. 900 per washer and Rs. 1200 per dryer. Determine the
8 (12,4) 88000 number of washers and dryers to be produced. (Dec 2010, 15 Marks}
c (0,40) 160000 Sol. Given data is tabulated as follows·
The minimum value of the objective function Z = 88000, occurs at the extreme point Manufacturing capacity of department/month
Type of
8 (12,4). Hence the optimal solution to the given LPP is Dryer Washer Profit
x, = 12 product Stamping M&T
assembly assembly
x, = 4 and
Min Z = Rs.88000 Washers :5 I 0,000 units :5 16,000 units :5 9,000 units Rs. 900/unit
..
x2 Dryers :5 I 0,000 units :5 7,000 units :5 5,000 units Rs. 1200/unit
Scale: Step 1: Identify the decision variables
I cm= 5 units Let x1 be the no. of units of washers produced/month,
~ be the no. of units of dryers produced/month.
Let Z be the total profit, then the objective function is given by
Maximize Z= 900x 1 + 1200x2
Considering m·anufacturing capacity of departments as I month, we have
Feasible
Stamping department Motor & tr;insmission department
region
I 0000 washers produced -+ I month 16000 washers produced -> I month
x1 washers produced-. (x/10000) months x1 washers produced-+ (x/16000) months
8(12,4)
10000 dryers produced-+ I month 7000 dryers produced -+ I month

0(0,0) x1 x2 dryers produced-+ (x/10000) months x2 dryers produced-+ (xj7000) months
The constraints are
x/I 0000 + x/10000 :S I (Constraint on capacity of stamping department)
x/16000 + x/7000 :SI (Constraint on capacity of M&T department)
47. x1 :S 9,000 (Constraint on capacity of washer assembly department)
A plant manufactures washer! and dryers. The major manufacturing
~ :S 5,000 (Constraint on capacity of dryer assembly department)
departments are stamping department, motor and transmission department and
final assembly department. Stamping department fabricates a large number of
x1, x2 2: O; as the no. of parts produced cannot be negative.
metal parts for both washers and dryers. Monthly departmental capacities are
as follows: Graphical solution
Stamping department Step 1: Coovert all the inequality constraints into equation by replacing'~' by'='
: 10000 washers or 1,0000 dryers.
Motor & transmission department x1+ x2 = I0000 --------------------------------- ( I)
: 16000 washers or 7000 dryers.
Dryer assembly department x1 + 2.286~ = I 6000 --------------------------------- (2)
: only 5000 dryers.
x, = 9000 -------------------------------{3)
.. x, =~5000
OPERATIONS REsEARCH
----------------~--------- (4)
Step 2: Calculate. the values of decision variables x 1 and ~ satisfying the above
Lil'IEAR PROGRAMMING
Extreme points
Co-ordinates
(x 'x.,)
Max Z = 900x + l 200x,
..
equations and plot straight line on the graph corresponding to each constraint A (9000,0) 8100000
Consider equation I B (9000, I 000) 9300000
x1 + x2 = 10000
when x1 = O; is= 10000
c '(5400,4600) 10380000
when x2 = O; x, = 10000 D (4400,5000) 9960000
Plot the constraint I on the graph (i.e. line I) E (0,5000) 6000000 ..
Consider equation 2 The maximum value of the objective function Z = I 0380000, occurs at the extreme
x1 + 2.286x, = I 6000 point C (5400,4600). Hence the optimal solution to the given LPP is
when x =o· x, = 7000 x, = 5400
I ' -
when x2 = O; x1 = 16000 x2 = 4600 and
Plot the constraint 2 on the graph (i.e. line 2) Max Z = Rs.10380000
Consider equation 3 x2
Scale:
x, = 9000
Plot the constraint 3 on the graph (i.e. line 3) CD I cm = 2000 units
Consider equation 4
x, = 5000
Plot the c~nstraint 4 on the graph (i.e. line 4)
Step 3:. Identify the feasible region and co-ordmates of the extreme points
·J:'
I' (vertices)
i' Consider x1 + x2 :S I 0000 ~ -$h~vvv":-s,::'
W/1111/1/11/llM , c: ~ X
Let x1 =x2 =0, then 1
0 :S l 0000. Since the origin satisfied this constraint, shade the region below the line
I (corresponding to constraint I) towards the origin.
Consider x1 + 2.286x 2 :S 16000 <D
Let x 1 =is= 0, then 48. A furniture maker has 6-units of wood and 28 hrs of free time, in which he
0 :S 16000. Since the origin satisfied this constraint, shade the region below the line will make two-models of decorative screens. He estimates that model-I requires
2 (corresponding to constraint 2) towards the origin. 2-units of wood and 7-hrs of working time, while model-2 requires I-unit of
Consider x1S 9000
wood and 8-hrs of_workingJime. The prices of the models arc Rs.120/- and
Let x1 = 0, then
Rs.80/- per screen respectively. Formulate this problem as LPP and solve it by
0 S 9000. Since the origin satisfied this constraint, shade the regi~n to the left of the graphical method. (June 2017, 10 Marks)
line 3 (corresponding to constraint 3) towards the origin.
~-; Consider JSS 5000
Sol. Given data is tabulated as follows·
Let x., = 0, then Wood Working hours
p,: requirement requirement
0 S 5000. Since the origin satisfied this constraint shade the region below the line 4 Type of decorative screens Cost of screens
(corresponding to constraint 4) towards t11e origin. A 8
;· The common shaded region/ area C·btained is called Jeasible region. & all the points
1~; Model-I 2units/unit 7 hrs/unit Rs. 120/unit
~'
' ~
Model-2 I unit/unit 8 hrs/unit Rs. 80/unit
The co-ordinates of the extreme poilits (vertices) of the feasible region are --
ti, A= (9000,0), B =(9000, I000), C = (5400.%00), D = (4400,5000) and E =(0,5000) Maximum wood available 6 units
"i"
""- - , ,, I
-·-
Maximum free time available
[
-- -- ---
Step]: Identi~" thr drcbion ,·:1ri<1hks
- °'!RA.ttolis •·REsl:ARcs
Let x1 be the number of units of model- I screen produced,
is be the number of units of model-2 screen produced.
>tmi4R:h~tl
Consider 2x 1 +is:S6
Let x 1 = ~ = 0, then
..
·;--
The objective is to maximize the profit. 0 :S 6. Since the origin satisfied this constl1\int, shade the region below the line I
Let Z be the total profit, then the objective function is given by (corresponding to constraint I) towards the origin.
Maximize Z= 120x 1 + 80JS Consider 7x 1+ Sis :S 2S
Step 3: Identify the constraints Let x1 = 'S = 0, then
Wood requirement 0 :S 2S Since the origin satisfied this constraint, shade the .region left of the line 2
I unit of model-I requires-+ 2 units of wood (corresponding to constraint 2) towards the origin.
x1 unit of model-I requires-+ 2x 1 units ofwood The common shaded region/ area obtained is called feasible region' & all the points
in. this region are feasible points.
I unit ofmodel-2 requires-+ I unit of wood · The co-ordinates of the extreme points (vertices) of the feasible region are
is unit ofmodel-2 requires-+ lx2 units of wood 0 = (0,0), A= (3,0), B = (2.2, 1.5) and C = (0,3.5)
Working hours requirement Co-ordinates Objective function value
I unit of model- I requires -+ 7 hrs of free time Extreme points
(x1, 'S) Max Z = 120x 1+ SOis
x1unit of model-I requires-+ 7x 1 hrs of free time 0 (0,0) 0
I unit ofmodel-2 requires-+ 8 hrs of free time A (3,0) 360
x., unit of model-2 requires -+ Sx, hrs of free time B (2.2, 1.5) 3S4
The constraints are - c (0,3.5) 280
2x1+ is :S 6 (Constraint on the wood) The maximum value of the objective function Z =384, occurs at the extreme point B
7x1+Sis :S 2S (Constraint on free time) (2.2, 1.5). Hence the optimal solution to the given LPP is
Step 4: Write the non-negativity constraints x 1 = 2.2
x 1, x2 2'. O; as the no. units of model screens produced cannot be negative. x2 = 1.5 and
Max Z = Rs.384.
Graphical solution
Scale:
Step I: Convert all the inequality constraints into equation by replacing ':S' by'='
2x 1.+ x2 = 6 ---------------------------------- { I ) I cm: I unit
7x 1+ Sx2 = 2S --------------------------------- (2)
Step 2: Calculate the values of decision variables x1 and x2 satisfying the above
equations and plot straight line on the graph corresponding to eac-h- constraint
Consider equation I
2x 1 + x2 = 6
when x1= O; x2 = 6
0
when x2 == O; x1= 3
Consider equation .
• 7x 1+ Sx, = 28 region
when x1= O; x2 ; 3.5
when x2 = O; x1= 4 x1
0(0,0)
(vertices)
....
49.
Ol'ERATioNS .lb:SEDCB
A toy company m!lnufactures two types of doll; a basic version doll A and a
deluxe version doll B. Each doll of type B takes twice as long to produce as one
-PR.ooRAJIKDrtf;· " ·.~·~ ••; !~~;)fti;~/>§e:.;,,;
. ·;s-P"
Step 2: Calculate the values of decision variables x and x.z satisf;Ying the above
1
of type A, and the company would have time to make a maximum of 2000 per
Consider equation l
day. The supply of plastic is sufficient to produce 1500 dolls per day (both A and
x, + 2JS = 2000 \
B combined). The de~uxe version requires a fancy dress of which there are only when x, = O; x2 = 1000
600 pedlay arnilable. If a company makes a profit of Rs. 3 and· Rs 5 per doll
when x2 = O; x 1 = 2000
respectively on doll A and B; then bow many of each doll should be produced Plot the constraint l on the graph (i.e. line I)
per day in order to maximize the total profit. Formulate this problem and solve
Consider equation 2
it graphically. (August 2005, 10 Marks) x 1 + x 2 = 1500
Sol .. Given data is tabulated as follows· when x 1 = O; x2 = 1500
Maximum Maximum Maximum when x2 = O; x 1 = 1500
Type Production time Profit
supply of availability of Production/ Plot the constraint 2 on the graph. (i.e. line 2)
of doll (time units) Plastic/ day fancy dress/ day day
A t /unit
__ ,..____ Rs. 3/unit
Consider equation 3
x 2 = 600
1500 2000 units when x, = O; x2 = 1500
B 2t /unit 600 Rs. 5/unit
y Clata, the objective is to maximize the profit Step 3: Identify the feasible region and co-ordinates of the extreme points
Step l: Identify the decision variables (vertices).
'. Let x, be the number of units of doll A produced/day, Consider x, + 2x2 :S 2000
l x2 be the number of units of doll B produced/day. Let x I = x2 = 0' then ._
Step 2: Write objective function in terms of decision variables 0 ::; 2000. Since the origin satisfied this constraint, shade the. region below the line I
J The objective is to maximize the profit of a company. (corresponding to constraint I) towards the origin.
['
r Let Z be the maximum profit. Then objective function is given by Consider x, + x2 :S 1500
Maximize Z = 3x 1+ 5x2 Let x I = x2 = 0' then
Step 3: Identify the constraints /limitations 0 :S I 500. Since the. origin satisfied this constraint, shade the region left of the line 2
Lett be the time required to produce one doll of type A, then '2t' be the time required· (corresponding to constraint 2) towards the origin.
to produce one doll of type B (given). Consider x2 :S 600
Production time Let x, = 0, then
Type A TypeB 0::; 600. Since the origin satisfied this constraint, shade the region left of the line 3
l unit= t hr. I unit= 2t hr. (corresponding to constraint 3) towards the origin.
x, units = x,t hrs x2 units =2tx 2 hrs The common shaded region/ area obtained is called 'feasible region' & all the points
tx, + 2tx2 :S 2000t in this region are feasible points.
x 1 +2x2 :S2000 (Constraint on labour time/ production time) The co-ordinates of the extreme points (vertices) of the feasible region are
x, + x2 :S l 500 (Constrainron the maximum supply of plastic) 0 = (0,0), A= (I 500,0), B = ( l000,500), C = (800,600) and D = (0,600)
~ :S 600 (Constraint on the maximum availability of fancy dress for type B/day) Co-ordinates Objective function value
Extreme
Step 4: Write non-negativity constraints points (x , x,) Max Z = 120x + 80x,
x 1, is ~ O; as the number of units produced cannot be negative. (0,0) 0
0
(1500,0) 4500
• Graphical solution A
5500
Step l: Convert all the inequality constraints into equation by replacing ':5' by'=' B (l000,500)
5400
x, + 2x 2 = 2000 ------------------------------- (I) c (800,600)
x, + x2 = l 500 --------------------------------- (2) (0,600) 3000
D
Xi = 600 -------_--------------------- (3) The maximum value of the objective function Z = 5500, occurs al the extreme point
- B (I 000,500). Hence the optimal solution to the given LPP is·
x, = 1000
x2 = 500 and
0n:RATIOlfS REsEARCB ::',~LtriEA.a PROGRAMlllXG
Step 2: Write objective function in terms decision variables -
Let Z be the tota1 profit on the sale of belts of type A and B. The objective is
to maximize the profit. The objective function is
Maximize Z = 0.4x 1 + 0Jx2
Max Z = Rs.5500.
\ Step 3: Identify the constraints
x,
Lett be the time required to produce one unit of type B belt, then
Scale:
2t be the time required to produce one unit of type A belt.
I cm = 200 units Production time
Type A TypeB
I unit= 2t time units (say 'hr') I unit= t hr
x, units = 2tx hrs is units = tx 2 hrs
1
2tx, + tis :S I OOOt

2x, + x :S I 000 (Constraint on labor time I Maximum production)
2
x, + x :S 800 (Constraint on supply of leather)
2
x :S 300 (Constraint on the buckles of type A belt)
Q) Feasible 1
x :S 650 (Constraint on the buckles of type B belt)
~ region 2
Step 4: Write non- negativity constraints
~
!~''"'""'"""""''"'"'""~ x, x , x 2: O; as the number of belts produced cannot be negative.

1 2
0(0,0)
Graphical solution
Step 1: Convert all the inequality constraints into equation by replacing 'S' by'='
<V 2x 1 + x 2 = 1000 ----------------------- (I)
50. XYZ company manufactures two types of leather belts, 'A' and 'B'. Both belts x, + x, = 800 ---------------------------.-- (2)
require the same length of leather per belt and both belts use different kinds x, = 300 ------------------------------- (3)
of buckles. The supply of leather iS sufficient to make 800 belts per day (both x, = 650 -------------------------------- (4)
types included). The number of buckles available for A and B type are 300/day Step 2: Calculate the values of decision variables x, and x2 satisfying the above
and 650/day respectively. Each belt of type A requires twice as much time as equations and plot straight line on the graph corresponding to each constraint
required by a belt of type B, to manufacture. The speed of production is such Consider equation I
that in the absence of any constraints with regard to buckles and leather, the 2x, + x2 = 1000
company would be able to produce 1000 beltS of type B day if only belt B is when x 1 = O; x2 = 1000
manufactured. Tlie profit margin for belt A is Re. 0.4/belt and for belt B is Re. when x2 = O; x 1 = 500
0.3/belt. Set up the LP problem and solve graphically. (June 2008, 15 Marks) Plot the constraint I on the graph (i.e. line I)
Sol. Given data is tabulated as follows· Con~ider equation 2
Type Supply of No. of No. of belts x, + x2 = 800
Labour time when x, = O; x 2 = 800
of leather to buckles produced based Profit 0
(time units) when x2 = O; x 1 = 800
belt produce belts available on labour time
A 300/day 2t/belt Re. 0.4/belt
:s 800 :S IOOO Consider equation 3
B 650/day !/belt Re. 1:l.3/belt x, = 300
Step 1: Identify the decision variables Plot the constraint 3 on the graph (i.e. line 3)
Let x 1 be the number of units of type A belt produced/day, Consider equation 4
x2 be the number of units of type B belt produced/day. x2 = 650
i}~,~~G ../~'-
0PERATIO.NS ~BARCH
x,
Plot the constraint 4 on the graph (i.e. line 4) Scale:
Step 3: Identify the feasible region and co-ordinates of the extreme points Icm = 200 units
(vertices)
Consider 2x 1 + x, :S fOOO
Let x 1 =~=0, then
0 ::; I000. Since the origin satisfied this constraint, shade the region below/left of the
'
line I (corresponding to constraint I) towards the origin.
Consider x1 + x, :S 80-0
Feasible region
Let x1 = x., = 0, then . ©
0 ~ 800. Since the origin satisfied this constraint, shade the region below/left of the
line 2 (corresponding to constraint 2) towards the origin.
Consider x1 :S 300 P"l'//,w&q \ "'< ~ x1
0::; 300. Since the origin satisfied this constraint, shade the region left of the line 3
Consider x., :S 650
Letx 1 =~-;,,O, then
©
0::; 650. Since the origin satisfied this constraint, shade the region below the line 4 51. The following are the two constraints for the LPP under consideration:
(corresponding to constraint 3) towards the origin. x - x2 ~ 1 ; x 1 + x2 ~ 7; and x1, x, ~ 0
1
The common shaded region/ area obtained is called Jeasible region' & all the points Using graphical method, answer the following 9uestions:
in this region are feasible points. i) What are the extreme points for the feasible region?
ii) If the problem has an objective function, maximize z = 3x 1 +~·what is the
A= (6.25,0), B = (9,0), C = (9, 11 ), D = (0, 11) and E = (0,8.3) optimal point?
,'.. iii) If the problem bas an objective function, minimize z =3x 1 + ~·what is the
Co-ordinates Objective function value
:J fatreme optimal point? (Jan 2016, 10 Mar~)
t~u:;
points (x, xJ Max Z = 0.4x + OJx_ Sol. i)Two extreme points for the feasible region are A (7,0) and B (4,3).
A (300,0) 120 ii) The value ofobjective function at points'is Z(A) =21 and Z(B) = 15. If the given
B (300,400) 240 LPP is of maximization, there exists a number of points in the feasible region I
t.~ c (200,600) 260 solution space where the value of objective function is much more than 21. Thus,
:F D ( 140,650) 251 as value of variables x1 and Xz increases arbitrarily large, the value of Z also starts
~: E (0,650) 195 raising. Hence, the LPP has an unbounded solution.
ii The maximum value of the objective-function Z = 260, occurs at the extreme point iii). If the given LPP is of minimization, the optimal point is B (4,3) with Z = 15.
I 1:t;
.,..:....
~
C (200,600). Hence the optimal solution to the given LPP is
x 1 =200
x2 = 600 and
:....:....:.. Max Z = Rs.260
i:
F
;:::.
;.:.:,;.
~i, c
'.
.f
J_
lL
I±'..
l"
J:..~
t
-· Scale:
Oi»ERATIOft'S REsEARCH ':~·PitooWu.1110
Scale:
"cm= I unit I cm= I unit
CD Unbounded
Feasible
''
''
''
'' '''
' ''
' '\., ' ',,
', ',
x1 ' ' xI
0 I 0(0.0) ', "\ ' ........
' ', ... ', ' .........
'' ''
'
2> ''
''
[so - profit lines or
lso - Z lines
;
52. 53. A company has two grades of _inspectors I & II who are to be assigned for a
Consider the following constraints
quality control inspection. It is required that at least 2000 pieces be inspedecl
x1 + 2x 2 ~ 10; -x 1 + x2 :S 10 and x2 ~ 0. per 8 hours a clay. Gracie I inspector can check pieces at the rate of 40 per hour
Represent the constraints graphically and clearly show the feasible region. with an accuracy of 97%. Gracie II inspector checks 30 pieces per hour with
,, Draw two iso-Z lines if Z = x1 + x2• Show the direction of improvement of Z if an accuracy of 95%. The wage rate of grade I inspector is Rs.5 per hour, while
' Z is to be minimized. Find the minimum value of z. What can be the maximum that of a grade II inspector is Rs.4 per hour. An error made by an inspector
~-. value ofZ? (Feb 2006, 10 Marks) costs Rs.3 to the company. There are only 9 grade I inspectors and 11 grade II
Sol. By assuming Z (say 9.·5 shown in graph) divisible by the coefficients of x and x,,
. I -
inspectors available in the company. The company wishes to assign work to the
we have x1 = 9.5 = x2 and draw an iso-z line. ff we move left parallel to lso-z line, available inspectors so as to minimize the total cost of inspection. Formulate
~-: the vah1e ofz decreases and minimized value ofz is obtained at point B (0,5) in the this problem as an LP model so as to minimize daily inspection cost and solve
feasible region i.e. Z(B) = 5. The value of objective function at points A, B and C the same graphically. (Similar to July 2007, 15 Marks)
is Z(A) = I0, Z(B) = 5 and Z(C) = I0. If the given LPP is of maximization, there Sol. Given data is tabulated as follows:
exists a number of points in the feasible region I solution space where the value
of objective function is much more than I0. Thus, as value of variables x and X Type of inspector Grade I Grade II
1 7
increases arbitrarily large, the value of Z also starts raising. Hence, the LPP has a1i"
unbounded solution. Minimum number of pieces to be
0 2000 units
inspected per <lay (i.e. 8 hrs.)
Rate of inspection 4{) units/hr. 30 unit~/hr.
L
Errors in inspection 3% 5%
· Wage rate Rs. 5/hr. Rs. 4/hr.
Total number of inspectors available 9 II
Cost due to an error Rs 3/unit
Number of units that can be inspected 40 x 8 = 320/day 30 x 8 = 240/day
L
·r
..Step I: Identify decision variables

0P~Tl911S ~~CH
Letx,-be-the number of Grade I inspectors assigned for inspection,

LfriAR··Jtao0R~1·. ~. ·. -
Graphical solution
•ii
Step 1: Convert all the inequality constraints into equation by replacing ':5'/'
"i be the ~umber of Grade II inspectors assigned for inspection. ;::'by'='
Step 2: Write the objective function in terms of decision variables x1 + Ox2 = 9 -------------------------------- ( I)
The objective is to minimize the inspection cost. \
Ox, + X; = 11 ------------------------------ (2)
Let Z be the total cost of.inspection.
320x 1 + 240X; = 2000 ---------------------------------- (3)
GRADE I INSPECTOR Step 2: Calculate the values of decision variables x, and x2 satisfying the above
Wage rate of Grade I inspector = Rs. 5/hr equations and plo~ straight line on the graph corresponding to each constraint
Wage of a Grade I inspector= Rs.5 x 8 (i.e. I day= 8 working hours) Consider equation I.
= Rs.40/day x 1 +Ox 2 =9
% of error of inspector I is 3. It means that out of l 00 units inspected, 3 units are x, =9
defective. Plot the constraint I on the graph. (i.e. line l)
I
!'
Total number of defective units per day Consider equation 2. ·
For 100 units-> 3 defective items
i. Ox,+ X; = l 1
320 units -> (320 X 3) I I 00 = 9.6 defective items
[' Cost of error
x., = 11
j\~ Plot the constraint 2 on the graph. (i.e. line 2)
I defective item = Rs. 3
kfC For 9.6 X 3 =Rs.2U/day.
Total cost of inspection of Gradel inspector= Rs. (.ro + 28.8)/day
320x1 +240x2 = 2000
p-
r-! •
when x1 = O; x2 = 8.33
...
l<{ = Rs.68.8/day when x2 = O; x1 = 6,25
GRADE II INSPl:CT-OR Plot the constraint 3 on the graph. (i.e. line 3)
Wage rate of Grade ll inspector= Rs. 4/hr. Step 3: Identify the feasible region and co-ordinates of the extreme points
Wage of a Grade II inspector= Rs.4 x 8 (i-.e. l day= 8 working hottrs) (vertices)
= Rs.32/day Consider X 1 :S 9
% of error of inspector II is 5. It means that out of l 00 units inspected, 5 units are Let x1 = x2 = 0, then
defective. 0 :S 9. Since the origin satisfied this constraint, shade the region left of the line l
Total number of defective units per day (corresponding to constraint l) towards the origin.
~ For IOO units-> 5 defective items Consider x2 :5 11
tr--
~.;
240 units -> 240 x 5 I I 00 = l 2 defective items
Cost of error= 12 x 3 = Rs.36/day
0 :5 11. Since the origin satisfied this constraiilt, sha¢e the region below the line 2
1,:· Totalcost of inspection of grade II inspector= Rs. (32 + 36Yday (corresponding to constraint 2) towards the origin.
[
-~:. The objective function is
= Rs.68/day Consider 320x 1 + 240~ ::;2000
a:
~-·
Minimize Z = 68.8x 1 + 68X; 0;:: 2000. Since the origin not ~atisfred this constraint, shade the region right of the
:,;:-;:::
Step 3: Identify the constraints line 3 (corresponding to constraint 3) away from the origin.
~~~. x1 :s; 9 (Constraint on the availability of grade I inspector) The common shaded region/ area obtained is called jl!'Clsible region' & all the points
~~:.:..- ..
x., :s; l 1 (Constraint on the availability of grade II inspector) in this region are feasible points.
~ 320x, + 240X;;:: 2000 (Constraint on the number of units to be inspected)
~~- The co-ordinates of the extreme points (vertices) orthe feasible region are
~ Step 4: Write non-negativity constraints A= (6.25,0), B = (9,0), C= (9, 11 ), D = (0, 11) and E = (0,8.3)
~:,
i: x,, ~;:: O; as the number of inspectors cannot be negative.
*=
......
~~-
~--
~
.__
E
.,, OPERATIONS REsEARCH
LINEAR PROG1W!14tl'i<l
'-
54,<~Solution space identified by a set of constraints iS shown in fig. Ql (c). If one
more constraint x1 + ~ ~ 3 is to be included, then is there any change in
Extreme Co-ordinates Objective function vallie
points (x,, JS) Min Z = 68.Sx, + 68JS the solution space? If so, show the new feasible zone. With respect to the new
A. (6.25,0) 430 feasible zone,_ state the redundant constraint or constraints if there any.
(Jan 2010, 06 Marks)
B (9.0) 619.2
\ Sol. Yes, there is a change in the solution space and is shown in the fig. With respect to
c (9, 11) 1367.2 the new feasible zone, there are two redundant constraints x, ~ I and x2 :<:: 3, whose
D (O,l l) 748 removal has no effect on the new feasible zone.
E (0,8.3) 564.4 is
The minimum value of the objective function Z = 430, occurs at the extreme point A Scale:
(6.'25,0). Hence the optimal solution to the given LPP is l cm= I unit
x, = 6.25 = 7
x2 = 0 and
Min Z = Rs.430 (Rs. 48 l ifx, = 7)
is
CDj Scale:
I cm= I unit
0(0,l l) C(9,ll) x,
@ @
55. Feasible zone AB.CDE identified by a set of constraints is shown in the figure
below. If a constraint x '.S 2y is added, identify the new feasible zone. Also,
identify and state all redundant constraints.
Co-ordinates of A= (1, 0)
B = (1, 2)
c = (2,3)
D = (4,1)
E = (2, 0)
y
B(9,0)
x, c
oa
x
0 A
"'
r
.. ()PERATIOKB>~EARCR.
Determine maximum and minimum value ofZ ifZ =3x +Sy, after the inclusion
ofadditionalconstraint.- · · July2018(10M) ~-\
a~llfilAli :Pit&iiWonNci
,,_._ .....~. ~ __
ff: GRAPHICA.t Mt:TMob . . .... ,

,,- ·::. .:
.
. : ·.
t..·.~ ;.(foN.c1.Qsfg·ftl$)).~\VfU=aoM:ifileioLU1'1()N OF LPP BY

.
-·.
· ,.: ..·
. :•..
~
Sol. The additional constraint is x 5 2y _

~·(
1. LPP has an alternative (or multiple) optimal solutions: When the constraint that
Convert the additional inequality constraints into equation by replacing '5' by'=' -·
x - 2y= 0 forms the b_oundary of the feasible region is parallel to the objective function. i.e. the
Calcul~tc the values o{ decision variables xand y satisfying t~e above equation
slope of the objective function is same as the constraint that forms the boundary of
the feasible region (lso profit line method}
and plot straight line on the graph corresponding to the given constraint
Consider equation OR
x-2y=O When the value of the objective function remains same at several extreme points
when x = O; y = 0 irrespective of the values of the decision variables x, and x2, then there exists an
when y = O; x = 0 alternative (or multiple) optimal solutions for the given LPP.
Identify the feasible region and ca:-oi:dinates of the extreme points (vertices) 2. LPP has an unbound solution: When one or more decision variables and value
Consider x, - x2 ~il .
of the objective function are permitted to increase infinitely without violating
,,
11·· Since x :5 2y, shade the region towards y axis from the line. the feasibility condition, then the solution is said to be unbounded. This is due to
.::.
ji. The common shad~d region/ area obtained is called 'new feasible region'& all the imprope! formulation of the real life problem.
( points in this region are feasible points ..
.~.::.
3. LPP has an infeasible solution: When no value of the variables satisfies all of the
The co-ordinates of the extreme points (vertices) ofthc new feasible region are
/;;:: F = (l, l), G =(2.5, 2.5), C=(2, 3)and B =(I, 2)
constraints simultaneously. i.e. there is no unique (single) feasible region, then there
j:•.•. exists an infeasible solution that is due to inconsistent constraints.
it' Extreme Co-ordinates Objective function value
Lj 4. LPP has redundant constraints: When a constraint which is parallel to the objective
points (x, y) Z= 3x+ Sy
f;~;
f.~ F (I, I)
function does not form the boundary of the feasible region, then the multiple solutions
8 will not exist. Such constraint is called redundant constraint whose removal does not
~·· G (2.5, 2.5) 20 change the feasible region.
.L
~:
c
B
(2, 3) 21
it!!!" (I, 2) 13 **Note**
i:
r.:at·' The maximum value of the objective function Z = 21, occurs at the extreme point C 1. Redundancy I Redundant constraint:
r·..-· (2, 3).
CZ:---
A redundant constraint is one that does not affect the feasible solution region and
~-· The minimum value of the objective function Z = 8, .occurs at the extreme point F
( l, I). thus redundancy of any constraint does not cause any difficulty in solving an LP
""
~--
problem graphically. The removal of redundant constraint does not change the
ia:_: There are two redundant constraints y S 3 and x - 2y S 2
y' feasible region.
~··
...,...,.
::_::- .
The rec!undant constraint is one to which the objective function is parallel, does not
!~--' form the boundary of the feasible region.
~'-
~
-.W---
2. The constraint is said to be active, or binding or tight, if at the optimality, the LHS of
= a constraint equals RHS.
<a
~·
~f
n-c-1
fiti
~--
~J;-i
~;_ .. r-~_.._~~.:::.....~~~~~~~~-+x
....
i.;;.:
~
::-~ ...
~~-
~
tiL
~~;,:
·%,~
LlllEAR PROGRAIUllNG
i. Basic feasible
, 2x 1 + 3~ + 5~ =:= 7
Also, find which of the basic solutions are
ii. Non - degenerate basic foasihle and
..
iii. Optimal basic feasible .Jan 2008(08 M)
Sol. In the given problem,
n = 3 i.e. No. of variables
LINEAR PRGlGRAMMING
. ·. ' ::: :·;· ....... ·~ . .. m = 2 i.e. No. of constraints
(n - m) = (3 - 2) = I variable must be equal to zern
The total number of basic solutions are
n!
nCm = m!m-n{ )
!
)C = ~ = 3 x 2 x I "' 3
2.10 SIMPLEX METHOD 2
2!1 ! (~ . l), i
The simplex method is used to solve linear set of equations for which the solution exists. The~' •l:ii 1. ·:h in \1 iii-: Ii ;di basic 1<1riables (x,) ~ 0 <ire basic fe<1siblc.
Simplex method utilizes following points in reducing infinite number of solutions to a The ~,, l1i1 h ., , < 111 ,. i' ic·h a 11 basic variables> 0 are non - degenerate basic feasible.
finite number of promising solutions. The i';1:'1c· ka..;:lJk ,uluti1111 tlial optimizes the objective function is an optimal basic
fe;i .. 1lik :,ulutiun
I. If there are n number of variables and m no. of equality constraints. The initiation for
1.d:k :..'.i1c·-; tliL' :,u111111ary of the characteristics of till: various basic solutions.
arriving at optimal solution is done by putting (n-m) no. of unknowns (i.e. variables) equal
to zero and then solving for them equations with the remaining m unknowns, provided that
the solution exists and is unique. The (11-in) variables equalled to zero are called 11011-basic ~!.'·""I
lhr li;i...,Ll'
I l'·l\ir
\ :11'.;ahks
I ,,,,, _I
h.;·1.~1r
. '.
\'alm•s of lhl' h:1sit:
, ariahks gin·n
by lht• l'Oll~lr:lilll
. . ., I..,. ,..
or !hr
h 111"
fra>illk '!
I Is thl'
solution nun
~ dl'j!l'Ol'r:lk
I Is lhl'
~olurion
fcasibll' \
variables and the remaining 111 variables are called basic Fariables which form a basic objrrlin· (..\re all, I
l\
.'iol1Hi1111 \.111.1hlls (..\n·oll h:1>k and
' ~- '
l'ljll:lfion.~ funrt1011 o·,
> .)
J
,·;1riabk,, > U'!)
solution. If the solution yields all non -negative basic variables, it is called basic feasible oplim:il
;:,,, solution otherwise it is infeasible. \ + :1.\: = 4
2. In simplex method, the elimination of all infeasible basic solution.s is done by starting with x,.x, \, 2x + 3x, = 7
1
5 Yes Yes Yes
a basic solution which is non - negative. The feasibility condition ensures that the next basic :.x,=2,x,=l
solution to be selected from all the possible basic solutions is always feasible. This solution 2x_ + 3x_ =4
is called basic feasible solution. If all the basic variables are greater than zero, the solution is - '
,.,
No
r; "'· I , l'.~:; ;·:·~, 'I

;-"'~'
\,.\_ 3 No Nll
... called non - degenerate If some of them are zero, the solution is called degenerate. The new I 1,
3
~ 1 · . .
basic feasible solution can be obtained from the previous one by setting one of the 111 variables
I I I I
~'~
equal to zero and replacing it by a new non - basic variable. The basic variable, equalled to
zero is called leaving variable, while the new one is called an "Entering variable". '4 '{es Yes No
3. The entering variable can be selected in such away that it improves the value of the !. _______ _ .x. - l.x, =I
objective function so that the new solution is betterthan the previous one by using optimality 2. Fi11d all lhc ha~ic solutions of the following system of equations identifying in
condition which selects the entering variable which produces the largest per unit gain in the l'ad1 cast· the hasic a11d non-1Jasic ,·ariables. .July 2009 06CSi1<il(6M)
objective function. This procedure is carried out until no ~rther improvement in the value h+x+.h=ll
of the objective function is possible. The fi~al solution that satisfies the objective function,
. I . . 3 ~
3\ + x, + Sx, = 14
the constraints and the non -negativity conditions, is called optimal solution. 111 tl11s prnblem,
Sol.
11 =:;
BASIC PROBLEMS Ill co~
1. Find all f'hc basic solutions to the following problems (11 - 111) = (3 - 2) = I \'ariabk must be equal to zero
Maximize Z = x1 + 3x2 + 3x C,,,, I :
3
subjected to x 1 + 2x 2 + 3x = 4 Let , · () is the: 11011 - basi.: variable, then x, and x, are thl' bas;c variables
3
Fnl111 ~\·nstraint l'quatiuns,

JS+ 4JS = 11
is+Sis=I4
~=-1,x 3 =3
~ttolt's REsEARCR
;'.~~~oo~q. . ..
~~itM'§•-~f9'att~f1s:,Qf;LI>.~ i'~:·:'.:.~~i~~~:.t~:~t~~i~~}.~>;;~~~~~~i:~2--;~;;;~:.=?\~~·2~·; .
Following are the major assumptions ofLPP/ LP models.
Case 2:
1. Certainty: In all LP models, it is assumed that all model parameters such ·as
Let >s = 0 is the non - basic variable, then x1 and x3 are the basic variables. availability of resources,. profit (or cost) contribution of a· unit of dec~ion variable
From constraint equations,
2x 1 +4JS = 11 and consumption of resources by a unit of decision variable must be known and may
3x 1 +Sis= 14 be constant.
'.-·il
I
X1 ~Yi, X3 = 2 Yi 2. Additivity: The value of the objective function and the total amount of each resource
used (or supplied) must be equal to the suin of the respective individual contributions
Case3: of the decision variables.
... Let xJ =0 is the non - basic variable, then x1 and x2 are the basic variables. Example: The total profit earned from the sale of two products A and B must be equal
From constraint equations, to the sum of the profits earned separately from A and H.
2x 1 f JS= 11
3. Linearity (or Proportionality): The amount of each resource used and its
3x1 +JS=14
contribution to the profit (or cost) in objective function must be proportional to the
x1 =3 1 JS = 5
value of each decision variable.
3.
Find all basic solutions for the following problem and group them into basic 4. Divisibility (or Continuity): The values of decision variables are allowed to assume
'
feasible and basic infeasible solution. continuous values and decimal values are neglected.
j Maximize Z = x1 + ~ + 7xJ ·
t. subject to x1 + ~ - 2x3 :::; 10 and
' 2.12 CANONICAL FORM OF LPP
rL x 1 , x2, x3 ;::: 0 Feb 2006(6M) •
1j~L Sol. In this problem, The characteristics of this form are
:l:::~ / n=3 I. All decision variables are non- negative.
2. All d:instraints are in the form :S inequalities always.
''''""";
:'l,"'c.f:".·.·
:,·.;:_. .
m=l
~ . . .!-
:. (n - m) = (3 - J) =2 variables must be equal to zero 3. Objective function is of maximization type.

~]~;" litrll"-·-.
x3 is the basic variable.
2~13 STANDARD FORM OF LPP
'.i!.~~7;.i.
•~c,·
From the constraint equation,
-'~~;_
~:±- __, x, + JS - 2JS = I 0 The characteristics of this form are
~-;;;;·?:.~ 0+0-2is=JO I. All decision variables are !'ion-negative.
.. ~.--:- - '. -·
is= -5 2. All constraints are expressed in the form of equations.
~~
~Et::
Maximize Z =7(-5) = -35, Basic infeasible solution 3. The right-hand side of each constraint equation is non-negative.
Case2: 4. Objective function is of maximization or minimization type.
~:;,~~.
rr:-,··
l'.-'C_,
Let x, =x, = 0 be the non - basic variables and x1 is the basic variable Note: To convert canonical form of LPP into Standard form, convert all constraints into
G;. ~'·· From the constraint equation, equations by adding slack and or surplus variables with artificial variable.
[it~~:
~:±!- ;~.,
: ·~:: .:~:·
x, + >s - 2x, = lO Slack variable: A slack variable is one which is added to the LHS of:S type constraints to
x,+O+O= IO
convert it into equations. Slack variable represents unused resources such as labour hours,
:.x, =IO
money, warehouse etc.
Maximize Z = I0, Basic feasible solution •
Case3: Surplus variable: A surplus variable is one, which is subtracted from LHS of~ type
constraints to convert it into equations. Surplus variable represents the amount by which
- Let x, =x, = 0, be the non - basic variables and x2 is the basic variable
~t:~ From the constraint equation, solution value exceeds a resource.
ii;r'.i
Ef;H x, + >s - 2is = JO Artificial variable: A non-negative variable added to the LHS of all constraints of(== or~)
~
i~_. ,·:e. 0 + JS - 2(0) = IO type just to obtain an initial basic feasible solution.
~~-- :. x, = JO then
t=~.
tt;;;;__ll·~,
-
MaXimize Z = I 0, Basic feasible solution
-
-
.... '
2.14 SIMPLEX ALGORITHM

<>PzuTJOlfS REsEARCH
The steps of the simplex algorithm for obtaining an optimal solution to a linear
LmEAR PRooRAMMilfG
iii) Construct simplex table

c --+ 6000 4-000 0 0 0
...
programming problem are Shown in detail in the first problem. Simplex method is used, if CB B XB x1 ~ s. Si ~3 Minimum ratio
and only, if all constraints are of (:5) type with positive RHS and the objective function is of Basic Basis Basic xB/x1
maximization type. Suppose th_e objective function of given LPP is of minimization type, vai iables (Basic variables K~y ro ~
multiply the objective funclion throughout by minus I to convert it into maximization type. co- variable) value Pivot ~lement
I
efficient
SOLVED PROBLEMS ,,
0 s, 360 (if' .) I 0 0 360/4 = 90
I.
Solve the following linear programming problem using simplex method. 0 s, 160 I 2 I 0 I OJ 160/2 = 80->LV
Maximize Z = 6000x 1 + 4000x 2
"t
subject to 4x 1 + 3x 2 :5 360 0 s, 300 2 3 0 0 I 300/2 ' 150
z --+
~
2x 1 + x 2 :5 160 MaxZ .I
0 0 s ~- ~,
2x 1 + 3x! :5 300 =O
0
x1, x2 ~ 0
Sol. i) Express the problem in standard form
@Z-+ J
6000'
~00 0 00 0 '•
s_ 0
jEV
~-'-- S_
Conver! all inequality constrainls inlo equation by adding slack variables Kt) Wlllllln
4x 1 +Jx 2 +s1=360 ....... (1) In the simplex table,
2x 1 +x:+s 2 =160 ....... (2) First row : ci -> Co-efficients of the variables in the objective function. They
represents profit I cost per unit of each of decision variables in the objectin: function.
2x +Jx +s 3 =300
1 2 ....... (3)
This row remains unaltered in subsequent tables.
Where sl's: and s, are lhe slack variables, which represents unused resources or First column : cB column --+ represents co-efficients of current basic v ·· ' 1es in the
~ I capacity lhat contribute zero lo the nhi\.'ctivc function. The objective function in the objective function.
standard form can be wrilten as Second column : B --+ Basis column. represents bas:( variables :;. ~11rrent
Maximize Z=6000x 1+-1000x 2 +Os 1+Os 2 +Os 3. ••.••• (4) solution i.e. s1,s: and s,
x.,x 2 ,sl's 2 ,s3 ;:: 0 Third column : xu - Column or Solution values column, represen• ialucs of
2:_:
basic variables s1, s2 ands; in the initial bnsic fensiblc solution fou •\' ,1rlie1.
ii) Find initial basic feasible solution Body matrix I Co-t'fficicnt matrix --. represents the rncHicienls l ia-;ic: ;111d non
Let start with the feasible solulion by assuming that profit earned is zero i.e. the - basic variables in the conslraints indicating. quantity of resources re(1uired to make
~-:,
decision variables x1and x2 are equal to zero and are called non - basic variables. a unit product .
Let 'n' be the no. of variables in lhe objective function Zi row represents summation uf product of basic variable coefficients c11 and j'h
..,_ (i.e. equation(4)) = 5 i.e. n = 5
column of the body matrix.
'm' be the no. of constraints (i.e. equation 1,2 & 3) i.e. m = 3
Therefore, Zi=c11 x aiJ
Where a•J is the matrix element in the bodv• matrix in j•h row andJ"•h column
(n - m) = (5 - 3) = 2 variables must be equal to zero to obtain initial basic feasible Z represents the contribution lost or rrofit lost per unit of the variables.
F. solution. J
J.iist row (c; - Z) is net evaluation row (NERJ, which represents net profit in the
~.~j ~)x 2 = 0 } Nun - basic variajbles
6
'-
value of the objective function 'Z' rur taclh unit of the respective column variable
introduced in the sllfutiun. This row determines whether or not the current solution
52 =160 FromequationsWto(J) Basicvaraibles is Lj>timal. If c - ZJ ::5 0. th<: current :'<ilution is optimal for maximization problem .
1
S3 =300 .Last column minimum ratio colu1r tl column, which repre,enh the ralio x11 to the
corresponding +vc numlY: 111 tlic kl'.' column.
lite rasultant obje~ti ve function can be written as Key column : If c, - I - 0 for non b;isic variables, the solution is not optimal.
MaximizeZ=O Choose a !lllll - basic 'ariablc "ith highc~l positive (c, - l,l as an i11comit1K / ,,.,.
"ariahle and rnJTesponding ~l•lt;:- · 'calkd key colun1n.
;.
-.......___
- Or~~o~~,!Js~cu
Key row: When Ka values are divided by the corresponding values of key column,
we obtain minimum ratio values, The row with minimum ratio (9) value is the key
row and correspo!!ding basic variable is called outgoing! leaving/ departing variable.
:izit,lir~"*°°'~~:~i:;y· ·. ·
Cn B
c. -+
Xn
6000
x
4000
x..
0
s
·.·:'
0
s.
0 Minimum ratio
s Kai Xz
PIHi
Pivot element : An ~lement at the intersection of key column and key row is cal led 0 s 4U lT TI 1 -71 0 40/I = 40 -+LY
pivot element or key element.
6000 x 80 I . 1/2 0 112 0 80/(1/2) ~ 160
iv) Test for optimality :. Since c.J - ZJ > 0 for non - basic variables, the solution is not 0 s, 140 0 2 0 -I I 140/2 = 70
optimal.
Max Z = 480000 Z.-+ 6000 3000 0 3000 0 s x s
v) Select the incoming variable or variable to enter the basis: Since (c. -Z.) value
J J
is highest positive value (i.e. 7) for x 1 column, mark that column as a key column and C;-Z; 0 1000 0 -3000 0 I 0 0
SI
the corresponding variable \ ' as incoming variable that indicates 'largest per unit jEV
x1 0 I 0
improvement in the current solution.
SJ 0 0
vi) Select outgoing/ leaving/ departing variable or variable to leave the basis: .
Calculate the minimum ratio by dividing each number in x - column by the Since (c.J - Z.) > 0 for non - basic variable, current solution is not optimal
8 J
corresponding positive number in the key column and s1 row with minimum ratio of is is the incoming variable.
80 is the key row/ pivot row and the corresponding basic variable in the key row i.e. s 1is the leaving variable, then key element= I
s, is the outgoing variable.
The element at the intersection of key row and key column is called pivot element
R2 (new)=R 2 (old)-fiR 1(new) IR (new)=R (old)-2R (new)
3 3 1
i.e. 4 is the key element. 80- ,Yix40=60 140 - 2 x 40 = 60

l. vii) Find the new solution : Since the key element is 4, divide each element in the
~·
11 key row including x8 value by the key element, to find the new values for that row. 1- }ixO=I 0-2x0=0
ij
:1..
::;.:: (i.e. If key element is I, the row remains the same in the new simplex table). The new 2-2x I =0
Yz-Yzxl=-Yz
.,~1;. .
values of the elements in the remaining two rows of the new simplex table can be
obtained by performing elementary row operations on two rows so that all elements o-}ixl=-Yz 0-2xl =-2
' I :--~ '
x .; except the key element in the key column are zero. The relation I formula used is
Number in (Number in) [(Number above or J(
Corresponding number J] Yz-}ix-2 =Yz -1-(2x-2)=3
~ew row = old row ± below key element x in the new key row replaced 0-}ixO=O +1-(2x0)=1
i
·.
and update thec 3 and x 8 values in the new simplex table of current solution. The new improved simplex table is written as
viii. Repeat the same procedure from step 3 until all the elements of ci - Zi row c -> 6000 4000 0 0 0
~ are either negative or zero.
R, (new)= R, (old)/2 R, (new)= R1 ( old)-4R, (new)
CR B x,, x, x, s s, s
i
R3 (new)= R3 ( old)-2R, (new) 4000 x, 40 0 I I -2 0
16012 =80 360-(4x80) =40
'
300-(2x80) = 140 6000 x 60 I 0 -112 3/2 0
212=1 4-(4xl)=O
2-(2xl) =O 0 s, 60 0 0 -2 3 I
m;.::
,: 112 =0.5=Yi 3-4(h)=1 3-2x(}i)=2 Max Z = 520000 Z.-+ 6000 4000 1000 IOOO 0
St::
~-
%=o 1-4(0)=1 0-2(0)=0
c. -Z 0 0 -1000 -1000 0
Since (c; - Z) :5 0 for all non-basic variables, the current ptimal with
II~= Yi
£1.·.~
0-4(Yi)=-2 0-2(,Vi)=-I x 1= 60, x2 = 40 and
012 =O 0-4(0)=0 Maximize Z = 6000 x 60 + 4000 x 40
, 1-2(0)= I
·';. Then new simplex table is constructed as follows
Max Z = 520000.
I
l,
..
2. Solve the LPP by simplex metho_d
Maximize Z = 71 1 + 51i
OPERATIONS REsEARCH
:~~~~~~: .. :~:~~~:ft~
iv) Find the new solution : TO make key element as 1, perfonn elementary rows ·
subject to -x 1 - 2x~ ~ - 6 operations shown below.
4x 1 + 3~ :S 12 and R 2 (new) =R 2 (old)/4 IR, (new)= R, (old)- R 2 (new)
x, 'xl ~o ·%~3 6-3 =3
Sol. i) Express the given problem in standard form
Since RHS of constraint· 1 is negative, multiply that constraint throughout by -I to ~=I 1-1=0
make it positive. The modified c;instraint is x, + 2x, :S 6
3/ _3/
Now, convert all inequality constraints into equations by adding slack variables. ;4-;4 2-X=%
x1 +2x,+s 1 =6 ........ (1) %=0 1-0=1
4x,+3x 2 +s 2 =12
The objective function in the standard form can be written as
........ (2)
.
~ ~x; o- ){=- ~ ...
; 'f
MaximizeZ=7x, +Sx, +Os, +Os, The new simplex table is written as

....... (3)
x,,x,,s,,s 2 <:O
c...... 7 5 0 0 ·,~,
.,
CR B x~ x, x, s s,
ii) Find initial basic feasible solution
0 s, 3 0 514 I -1/4
Let n = 4 From equation (3)
·7 x 3 I 3/4 0 1/4
m =2
(n - m) = (4 - 2) = 2 variables must be zero MaxZ=21 Z:-> 7 21/4 0 714
~e~xG =} X2 = 0 Non - basic variables c. -Z. 0 -1/4 0 -714
1 Since ci - Zi :S 0 for all non - basic variables, the current solution is optimal with
Basic variables
s2 =12 x, = 3, x2 = 0 and
Maximize Z (7 x 3) + 5(0)
:. Maximize Z = 0 Maximize Z = 21
Key column 3. Solve the following LPP using simplex method July 2017 {14 M)
Maximize Z = 4x 1 + lOxz
c --> subject to 2x 1 + xz :S 50
7
2x 1 + Sx 2 :S 100
c·,, I B XU
2x 1 + 3xz :S 90
x Ix
()
6 6/1=6 :I x,, x2 ?0
0 I ~. 12 Convert all inequality constraints into equations by adding slack variables
12/4 = 3 -->LV
;\fa\ !. ~ (I I --> 0 0 0 2x,+x 2 +s,=50 ... (!)
--
l - I 7
!f V
5 0 0
j::
.
0
2x 1 +5x 2 +s 2 =100
2x, + 3x 2 + s3 = 90
Then, the objective function can be written as
... (2)
... (3)
Sin..:L· (c. - i',l > 0 for all 1w11 - basic 1ar1;1!11<::· 111,. solu11011 is not optimal
1'io11 \ is :i>c i11co111i11g variable MaximizeZ=4x, + l-Ox 2 +-Os,+ Os 2 +.Os 3 ... (4)
.\ is c0lu11111 is !he l\t:1· c,1lu11111
> • x,, X 2 , S 1,S 2,s3·2: 0
'·is th..: <'lll~!oing; k;11 ing ·•ariable
• I'• 111 is I hl' i;c·1· ro11
: !-. i1·.: ~·~·1. '-'~l'llh:'rl: Let n = 5
m =3
-.":. (n - m) = (5 - 3) = 2 variables must be equal to zero
~e: io=}x 2 = 0 } Non - basic variables
0PEaATioNs REsEARc:e
·f.J.llEAR PROGRAllM!JG
c,. B
c.-
x..
4
x,
IO
x,
0
s,
0
s,
0
s,
...
s: = I 00 Basic variables ·~,:.
-:-c
0 s 30 8/5 0 l -115 0
S 3 = 90
10 ' x., 20 215 I 0 1/5 0
Then the resultant objective function can be written as 0 s, 30 415 0 0 -315' I
Maximize Z = 0
MaxZ=200 z.- 4 10 0 2 0
Kev col c. -Z. 0 0 0 -2 0
Since cJ - ZJ :::; 0 for non - basic variables, the current solution is optimal.
-· . -1\ IV v J u u I As (c.J - Z)
J
= 0 for x1 variable, an alternate solution also exists.
B The optimal values are x1 = 0, x2 = 20 and
j
CB
I
XB
x 1\ x2 s2 SJ I/Minimum ratio
Maximize Z = 4(0) + 10(20)
.,,I:· 0 s 50 2
/ X0 Ix, Maximize Z = 200
L 0
I I j I 0 !I 50/1=50
4. Minimize Z = ~ - 3x3 + 2 x5
s, l-00 (2 5 0 I 0)
·i· 10015 = 20 -+LY subject to 3x2 - x3 + 2x 5 :::; 7
0 s, 90 2 3 0 0 I 9013 = 30 -2x 2 + 4x3 :S 1'2
~:
MaxZ =O '
Z-t· 0 \.O_.., 0 0 0 -4x2 + 3x3 +8 x5 :S 0 and x2, ~· x5 2: 0 Jan 2018 (15 M)
c.-z s, s, s,
J J
4 JO 0 0 0 Sol. Since all inequality constraints are of·~ type, convert this minimization problem
SI I 0 0
~L tEV into maximization type by multiplying the objective function throughout by -1. The
s2 0 I 0 modified objective function can be written as
s, 0 0 I Maxi~1ize (-Z) = -~ + 3~ -2x5
Since cJ - ZJ > 0 for all non. - basic variables, current solution is not optimal Maximize Z* = -x 2 + 3x3 - 2x 5
x2 is the incoming variable i) Express the given problem in standard form :
s, is the leaving variable Convert all inequality constraints into equations by adding slack variables
5- is the key element 3x 2 -x 3 +2x 5 +s 1 =7 ...... (I)
To make key element as I, perform elementary row operations -2x 2 +4x 3 +Ox 5 +s 2 =12 ...... (2)
R2 (new)= R2 ( old)/5 R, (new)= R, (old)-R, (new) R3 (new)= R ( old)-3R (new)
3 2 -4x 2 +3x 3 +8x 5 +s, =10 ...... (3)
IO_% =20 50-20=30 90-(3x20)=-30
The objective fun ct ion in standard form can be written as
Ys =Ys 2
-Ys =Ys 2 -(Jx Ys) = Ys Maximize(Z*)=-x 2 +3x 3 -2x 5 +Os, +Os 2 +Os 3 ..... (4)
Ys =I 1-1=0 3-(3xl)=O X 2 ,X 3 ,x 5 ,Sl'S.2,S 3 ~0
%=O l-0=!
0-(JxO)=O
ii. Find initial basic feasible solution
Let n = 6
Ys= Ys 0 -Ys =-Ys J{)=-Ys m=3
If
'
0-(3x
~
%=o 0-0=0 I-(3x0)=1
(n - m) = (6 - 3) = 3 variables must be equal to zero
~e~x =lx 3 = x 5 = 0 } Non - basic variables
7
II.:
The improved simplex table can be written as
.
s~ = 12 Basic variables
s, = 10
Then the resultant objective function is
. Maximizc(Z *) = 0
..
Key column
OPi!:RATiOilS REs~..
Key row
-~~99~~:,
Again, (c.J - Z.)
J
. ..:-
= 112 for non - basic variable x.,•.• the current solution is not optimal
"i is the incoming variable
...
Key Element
s1 is the outgoing variable
""· - 7 ""'! J - ... / v v V/ \ 5/2 is the key element
~\ >s Perform elementary row operations to make key element as I .
CB
0
B
s,
XB
7 3 ~ .- I I
12
SI
I
s2 ,hJ Minimum ratio
)5 0
I X X,
7/-l=-
0 /
1 1
I
R (new}= R ( old)x Ys R2 (new)= R2 (old)+ Yz R (new}
1 R1 {new)= R1 (old)+% R1{new)
0 s, 12 [ -2 l4" 0 0 I 01 12/4 = 3 -+LY Jox%=4 3+(Jix4) ~ 5 I+(_% x4)·=11

0 s 10 -4 3 8 0 0 I 10/3=1013 -Ji+(Jixl}=O -,%+(,%xt)=O
Max (Z*) = 0 z -+ 0 '-0_, 0 0 0 0 s, s, s
,%x%=1
1+(Jixo)=1 o+{,%xo)=o
cJ -ZJ -I 3 -2 0 0 0
SI l 0 0 ox% =0
jEV s2 0 I 0 2x%=%
o+(JixYs)= Ys s+(,% x%} = 10
SJ 0 0
Ix%= Ys o+(Yix%}= Ys o+(,%x%}=t
Since (c.J - Z.)J 1:: 0 for all non - basic variables, the current solution is not optimal.
~xYs = Yio ~ +(Jix Yio) = Xo - ~ +(,% x Yio) = -Yz
Then, x3 column is the key column
xJ is the incoming variable oxYs=O o+(Yzxo)=o 1+(,%xo)=1
s, is the outgoing variable and corresponding row is the key row
4- is the key element The improved simplex table can be written as
>.
c.-+ -I 3 -2 0 0 0
L:· To make that key element as I, perform elementary row operations as shown below
~.: R2 (new)= R2 ( old)/41 R1 (new)= R, (old)+ R2 (new) R3 (new)= R3 ( old)-3R 2 (new) I CR. B XD x., x., x<
4/5
s
2/5
s,
l/10
s.
0
12/4=3 7+3=10 I0-(3x3)=1 -l x, 4 l 0
f,:...
~.~·:
~
'~,~
-2/4 = -1/2 3 -fi=Yz -4-(3x Yz)=-Yi 3 x, 5 0 I
0
2/5
10
1/5
I
3/lO
-112
0
1
¥. 4/4= i -1+1 =0 3-(3xl)=O 0 s, 11 0
=,i:;:
-!-::~
.:;,,:,; 0/4 =0 2+0=2 8-(3x0)=8 Max (Z*) z-> -1 '
j +2/5 1/5 4/5 0
~~
= -1(4) + 3(5) =l l J
%=0 1+0= I 0-(JxO)=O 0 -12/5 -115 -4/5 0

c. - z. 0
L
;;; .. ~=~ O+~=~ o-(Jx ~)=-}r; Since c. - Z < 0 for all non - basic variables, the current solution is optimal with
J J
"i = 4, x, = 5 , x5 = 0 and
%=0 0+0=0 1-(JxO)=I Maximize (Z*) = -1(4) + 3(5)
1:0·
~:;:. The improved simplex table can be written as Maximize (-Z) = l I

;:.. c -+ -l 3 -2 0 0 0 :. Minimize Z = -11
~ Jan 2015 (10 M)
;;
CB B XB x2 XJ xs SI s2 Minimum ratio
SJ s. Solve the following LPP using simplex "1ethod
Jan 2007(10 M)
~: X X, 0 / Maximize Z = 3x 1 + 2~
0 s, 10 _')fl. 0 2 I 1/4 U I 20/5 -4 ->LV subject to constraints x 1 +~~4
x 1 -~ ~2
3 x, 3 -l/2 1 0 0 114 0 3/(-1/2) = x1 .~~o
0 s, l 512 0 8 0 -3/4 I 11-5/2) = i) Express the given problem in standard form
Sol.
Max (Z*) = 9 z-+ -3/2 3 0 0 3/4 0 s, x, Convert all inequality constraints into equations by adding slack variables
~ ...(I)
c.-Z 1/2 0 -2 {) -314 1)
I 0 0 X1+JS+S 1=4
J J SI ... (2)
jEV x, - x2 + s2 = 2
~ 0 I {)
:-
. -s_,• 0 {) I
~
L_
..The objective function can be written as
Maximize Z = 3x 1 + 2'S + Os + Os
1 2
<>nuno11s REs&\RcH .<·:~~l'.>GRAJliUirG
Xz is incoming variable
J J -
..
The optimal solution not yet been arrived, as c : Z. > 0 for variable ofx, column.
x1,x2,si>s 2 2'. O .... (3)
s1 is outgoing variable
ii) Find initial basif feasible solution : 2 is the key element
Let n = 4
Perform elementary row operations
m=2 ·l
R, (new)== R, (old) I 2 R,(new) == R,(old) + R,(new)
(n - m) = (4 - 2) = 2 variables must be equal to zero
212 ==I 2+1=3
~e:~ }= 'S = 0 } Non - basic variables
1 012 == 0 1+0=1
Basic varaibles
S2-=2 '.":'.<;. 2/2 ==I -1 +I =O
Then MaximizeZ=O 1/2 = 112 0 + 1/2 = 112
012 = 0 I +0=1
iii) Construct simplex method
__ Key coh.imn The improved simplex can be written as
C.-> 3 2 0 0
- \
_, L./ v /U Ca 8 x~ x x, s s,
I >/
CB 8 XB \ x1
I/
2 x I 0 I 112 0
s, Minimum ratio ?
I
XA Ix 3 x 3 I 0 1/2 I
0 s, 4 fll1 I '/1 0 4/1 =4 MaxZ= 11 z__, 3 2 5/2 3
0 s? 2 ( lC IJJ -I 0 IJ 211 =2 --. LY c -Z 0 0 -5/2 -3
t. Max Z = 0 z-. 0 0 0 0 Since (c.J - Z.) < 0 for both non - basic variables, the current solution is optimal with
c-Z s s, J -
·J J
3 2 0 0 x1 = 3. x2 = I and
s, I 0
L
,, jEY Maximize Z == 3(3) + 2( I)
.H. s2 0 I Maximize Z = 11
:t::.
.. ~ -'
Since (cJ - Z)J > 0 for both non - basis variables, the current solution is not optimal Solve the following LPP using simplex method Jan 2014 (08 M)
~.,,_,.
!,:.
,,, 6.
I., _ then x, is the incoming v11riable.
zm .. = tox. + 5xz
!",:-.
.! r~: s, is the leaving variable .

E~ subject to constraints
k_ (is the key element, then 4x 1 + 5x2 ~ 100
f'.k=. R,(new) = R,(old) - R2(new)
¥------ sl'. 1 +2~ ~ 80
£~:~. 4-2==2
*"-.-~
I - I= 0
x. & xz:::o
1-(.-1)=2 Convert all inequality constraints into equations by adding slack variables
Ff- I - 0 =I
!£_ 4x 1 +5x 2 +s 1 =100 ...... (1)
:t 0- J =-I
The improved simplex table can be written as 5x 1 +2x 2 +s 2 =80 ...... (2)
C.-> 3 2 0 0 The objective function can be written as
CB 8 XO x, x2 s, s, Minimum ratio zmax =IOXI + Sx2 +Os! +Os, •.. _. .. (3)
XO Ix, xPx 2 ,sPs.-2 ~ 0
0 s, 2 (0 (2)
~
I -I ) 212 == I -->LY ii) Find initial basic feasible solution
j x,
.)
2 I t!J 0 I Let n =4
MaxZ = 6 z-> 3 -3 0 3 m=2
s x,
cJ -ZJ 0 5 0 -3 (n - m) = (4 - 2) = 2 variables must be equal to zero
s, I 0
jEY
x, 0 J
;..¥'~_-;:.;:~~-
.,,,,
Letx, =x 2 =O}Non-basicvariables
O~TloifsREsBARcB
·--iiti'-
+3::.."' _, "._.. ~
The optimal solution not yet reached as c.1 - Z1 = I for~ column.
~is the incoming variable
...
s, = 100} Basic variables s, is the leaving variable
S2 =80 , 17/5 is the key element
The resultant objective function can be writen as The elementary row operations required are
zm.. =0 R1 (new)= R 1 (old) x ?{7
R2 (new)= R2 (old)-_% R1 (new)
iii) Construct simplex table 36x 51 _ 180/ l6- 21(180/ )-200/
Key column Key Element Key row 11r 111 75 111 - 111
51 -0
Ox /17- 1-_%(0)=1
c\.+ 10 5/ 0 J 0
If i
CB B x, s2 Minimum ratio 'Ysx7{7=l Ys-_%(1)=0
xB\
x Ix, 0
lxYi7=7{7 0 -Ys(Yi1)=-7!'1
0 s IOO ¥4°')/ 5 171 0 100/4 = 25
0
Z___ =O
s, 80
z_,
rt'5l
0
2
0
0
0
I 1
0
8015 = 16 ->LY -Ysx;{7=-){7 Ys -/521(_4//17)-- ;17
51
s, s, The improved simplex table can be written as
cJ -ZJ 10 5 0 0 s, I 0 c -> 10 5 0 0
iEV 0 I
s2 Ca B X" x, x, s, S,
Since cj - ZJ > 0 for non - basic variables, the current solution is not optimal 5 x 180/17 0 I 5117 -4/17
then x1 is the incoming variable.
' I 0 -2/17 5117
10 x, 200117
s2 is the outgoing variable. Z_ = 2900/17 Z-> 10 5 5/17 30117
5 is the key element. 0 0 -5117 -30/17
c. -Z
The elementary row operations required are
~ Since (ci - Zi) :S 0 for both non - basic variables, the current solution is optimal with
R2(new)= R 2 (old )15 R1 (new)= R1 (old)-4R 2(new) ,;!:'
x, = 200/17, x2 = 180117 and Z"'" = I 0(200117) + 5(180/17)
80/5=16 100-{4x16)=36 zm., = 2900/ 17
Ys =I 4-(4xl) =0 7. Solve the following LPP using simplex method in tabulator form :
Maximize Z = Sx, + 4x2
.; ..
Ys = Ys 5 -( 4 x fs) =I A Subject to 6x, + 4x 2 :S 24
~tt.·
X + 2X :S 6
%=0 l-(4x0)=1 1 2
-x 1 + x 2 :SI
Ys -Ys
- 5 o-(4x Ys)=-Ys x2 :S 2 and
x, ~O, x2 ~O
The improved simplex table can be written as Sol. i) Express the given problem in standard form
c.-> 10 5 0 0 Convert alPinequality constraints into equations by adding slack variables
8 x, s, Minimum ratio 6x 1 +4x 2 +s 1 =24 ... (1)
CB XB xz s2
XQ Ix, Xz +2X2 +Sz =6
... (2)
0 36 ( 0 ~7/5'J.. I -415) 180/17 ->LY ... (3)
10
s,
x 16 I \:;.15) 0 115 80/2 = 40
-X 1 + X 2 + S3 = 1ti
x, +S 4 = 2 ... (4)
z = 160 z --> 10 4 0 2 s, x
c -z -2 Theobjectiveequation can be written as
0 I 0 s, I 0
J J
MaximizeZ=5x 1 +4x 2 +Os,+ Os 2 + Os 3 + Os 4 ... (5)
jEV 0 I
x,
J"l''
..
ii) Find initial basic fe8$ible solution
Letn=6
~1'l91'~·b£ARCB ;LJKEAR'PltoGR•wo ..
The improved simplex able can be written as
,-·--
:.:~-;.___lilliliim
m=4 C.-+ 5 4 0 0 0 0
(n-m) = (6 - 4) = 2 vatiables must be equal to zero. CB B "a x, is s, s2 . si s4 Minimum
1 i4
~ e~ =} is= 0] Non - b~ic variables. ratio x., Ix,
5 x 4 I 213 116 0 0 0 4/(2/3) 6 =
S2 =6 . 0 s, 2 0 M3 -J/6 1 0 0) 21(413) =312 -+LY
Basic varaibles
.S 3 =l 0 s. 5 0 513 1/6 0 1 0 5/(5/3) = 3
S4 ='= 2
Theresultantobjectivefunction is
0 s,
MaxZ=20
2
z.--+
0
5
'10/3
-' 0
516
0
0
0
0
I
0
2/1 =2.
x, s. s, ~
MaximizeZ=O c-Z
J
0 213 -516 0 0 0 x, I 0 0 0
' -
fEY s, 0 I 0 0
iii) Construct simplex method s.• 0 0 I 0
111 0 0
ii s, 0
\: \. ~
l..-. (,\-+ ) 'I /U u 0 QI'
x\ x, Vi
r·-·
The optimal solution stage is not yet reached . as (c .1 - Z)J > 0 for x,- column.
h'' CB B s, si Vs. Minimum ratio
.f::.
L::, 0 s, 24 @ 4 I
l x.tx
x2 is the incoming variable .
s2 is the leaving variable. ·
t.• 0 0 OJ 24/6 =4 -+LY
tL 413 is the key element.
n 0 s, 6 I 2 0 I 0 0 6/1 =6
lL The elementary row operations required are
0 s, I -I I 0 0 I 0
~
R,(n.,..·)=R,(oidJxX R,(n<w)=R,(old)-lj'R,(n.:w) R,(m:w)= R,(old)-xR,(n""') R.{new)= R,(old)-R,(n.:w)
0 s. 2 0 I 0 0 0 l 2x%=Yi 4-(~xX)=3 s-(J-s'x~)=% 2-Yi=Yz
~i~.;. z_, s s, s s
MaxZ=O 0 0 0 0 0 0 s, I 0 0 0 oxX=O 1-(7j'xo)=1 o-()J'xo)=o 0-0=0
cj-Z; 5 4 0 0 0 0
' s2 0 l 0 0 JH-4'=' Y,-(~«1)=0 X-(J-s'"')=o 1-1=0
fEV
:: SJ 0 0 I 0 -Xx% =-Ys Ji-(Y, x- fg)= /;; }'(;-(}')' x- fg)= -Yz4 ff-(-Ya)= Ys
<
S4 0 0 0 l 1xX=X o-(Y,x){)=-/;; o-(J,j<J-;;)=-}'.; 0-J{=-}:';
!E J < 0 for both non basic variables, the current solution is not optimal then
Since (c.J - Z) ox}:';=o o-(Y,"xo)=o 1-())'•0)=1 o-M
E- x, is the incoming variable oxX=o o-(Y,xo)=o o-(Y,xo)=o i-0=1
ei s, is the outgoing variable
The improved simplex table can be written as
~· 6 is the key element
c 5 4 0 0 0 0
Hik" Perform the elementa7 row operations to makes key element as l.
ll& I
R, (new)= R, (old)/6 R2 (new)= R2 ( old)-R, (new) jR 3 (new)= R3 (old)+ R (new)
1
c. B x,. x,
s, s, x,
s, s,
le 2%=4 6-4=2 1+4=5
5 x 3 114 -1/2 0 0
I 0
~
ii]
4 x, 03/2 I - r/8 3/4 0 0
%=1 l-l=O -1+1=0
~~;, 0 s, 05/2 0 -1/24 -514 I 0
%=% 2-%=~ . 01/2 1/8 -314 0 I
I
1+%=% 0 s, 0
K=K 0 -K=-K
o+K=~
Max Z = 15 +6 = 21 --+ z5 4 314 1/2 0 0
1£.
%=o
%=0
1-0= I
0-0=0 • 0+0=0
1+0=1
c-Z 0 0 -314 -1/2 0 0
Since{c. -Z) < 0 for non - basic variables , the current solution is optimal with x, = 3,
x, = 3/2' andJ Maximize Z = (5 x 3) + ( 4 x 3/2) and
l
Maximize Z = 21
%=0 0-{) 0+0=0
_.,, ,c,, - ~--f ~~~c,;;;f~f.i'~~· -c.-,, '"'f:fc~W@
8. Maximize Z = 4x 1 + ~ + 3~ + 5x4 (Unbounded problem) Since c.J -ZJ > 0 for non - basic variables,. the current solution is not optimal.
subject to
x4 is the entering variable and corresponding column is key -column.
4x 1 - 6x 2 - 5x 3 - 4x 4 :?: -20 s1 is the leaving varia!J.le and corresponding row is key row.
-3x 1 - 2x 2 +4x 3 + x 4 s; I 0 Key element is 4.. To make key element as I, perfonn row operations as shown below.
-8x1 - 3x2 + 3x 3 + 2x 4 s; 20 and R, (new)= R, (old)/4 R2 (nC:V.:) = R2 ( old)-R 1 (new) R1 (new)= R3 ( old)-2R 1 (new)
x.,x 2 ,x 3 ,x 4 ~o 2%=5 IO-(lx5)=5 20-(2x5)=10
Sol. i) Express the given problem in standard form : ~=-I -3-(lx-l)=-2 -8-{2x-1)=-6
Since RHS of constraint I is negative, multiply throughout that constraint by -I to
· convert it into positive. The resultant constraint can be written as %=Yz -2-{txYz)=-/i -3-(2xYz)=-6
-4x 1 + 6~ + 5~ + 4x4 ~ 20
%=% 4-{tx%)=% 3-{2x%)=Yz
Now, convert all inequality constraints into equations by adding slack variables.
-4x 1 +6x 2 +5x 3 +4x 4 +s1 =20 ............... (!) ~=I 1-(lxl)=O 2-(2xl)=O
-3x 1 -2x 2 + 4x 3 + x4 + s2 =I 0
............... (2) ~=~ o-{tx~)=o o-(2x ~)=-Yz
-8x 1 -3x 2 + 3x 3 + 2x 4 + s3 = 20 ............... (3) 1-(lxO)=O 0-(2x0)=0
%=0
The objective function can be written as
%=0 0-(txO)=O 1-(2x0)= I
MaximizeZ=4x 1 + x2 +3x 3 + 5x 4 + Os 1 + Os 2 +Os 3 ............... (4)
The new simplex table can be written as
where x1,x 2 ,x3 ,x 4 ,s1,s 2 ,s3 ~ 0
c.---> 4 3 5 0 0 0
Let n = 7 i.e. No. of variables from equation (4) CR B XR x, x, x, x, s, s? s,
m = 3 i.e. No. of constraints 5 x, 5 -i 3/2 514 I 114 0 0
'.; ~
(n - m) = (7 - 3) = 4 variables must be zero. 0 s, 5 -2 -712 914 0 -114 0 0
'~ Letx 1 =x 2 =x 3 =x 4 =O}Non-basicvariables. 0 s, 10 -6 -6 1/2 0 -1/2 0 I
s1 =20) From equations MaxZ=25 Z.---> -5 15/2 2514 5 514 0 0
. .
s? = I 0 ( ) ( ]Basic variables. c. - z. 9 -13/2 -13/4 0 -514 0 0
J J
- O I to 3)
S3 =2 jEV
l... Since (cJ - Z.)J t:. 0 for• all non - basic variables,- the current solution is not optimal.
The resultant objective function can be written as
x1 with highest +ve (c.J - Z.)J (i.e. 9) is the incoming variable, but .
all the elements of
MaximizeZ=O key column {i.e. x 1 column) are negative The minimum ratio for all basic variables
iii) Construct simplex table is negative and hence no outgoing variable. It indicates that the value of x 1 can
Key col Kev El t K be increased indefinitely which also results in an infinite increase in the value
~· . . I\ J ;J v/ v u / of Z without violating any of the constraints and hence no bounded solution and
computation stops.
CB B Xe x, x2
I\ x. V{. 52 k' Miniinum
x.
ratio
Ix, • 9. Solve the following LPP :
"
0 s 20 [-4 ....... LV
(J ,.. rc41 u 01 20/4 5 Maximize Z = x1 + 2x2 + 3~
0 s, 10 -3 -2 '
4 I 0
I
I 0 10/1 = 10 subject to constraints x1 + 21i + 3~ S IO
0 s, 20 -8 -3 3 2 0 0 I 20/2 = 10 x 1 +~$5
MaxZ=O z ... 0 0 0 0 0 0 0 s
x.s 1
s, s
c.-z
J
4 I. 3 5 0 0 0 x,~.x;?:O
J
'-' SI I 0 0
fEV Sol. i) Express the given problem in standard form
s2 0 I 0
SJ 0 0 I
:.....__
... OPERA11011s REsEAR.CH
Convert all inequality constraints into equations by adding stack variables
x1 +2x 2 +3x 2 +s1 =IO ........ (!)
•.--L~PRooJWOIIRO
21 -21. -·
73-73
..
X1 + X2 +s 2 =5 ........ (2) ~=I
x, +S3 =I :....... (3) ~=~
'I,
The objective funciton cao be written as %=0
Maximize Z = x1 + 2x 2 + 3x3 +Os, + Os 2 + Os 3
ii) Find initial feasible solution
%=0
Letn =6 The improved simplex table can be written as
C---> l 2 3 0 0 0
m=3 Minimum ratio
(n - m) = (6 - 3) = 3 variables must be zero
CD
B- x -
B
-
~x,
x2 Xl s, s1 s,
x" Ix
Letx 1 = x 2 = x 3 =O;)Non-basicvariables 10
3 X, 10/3 '111' 213 l l/3 0 0
s, = 10} 0 s, 5 I I 0 0 I 0 5
-+LV
s 2 = 5 Basic varaibles 0 s, l :I IT 0 0 0 0 11 l
S3 =I Max Z =10 z .... I 2 3 I 0 0 x s s
I c-Z 0 0 0 -l 0 0 x, I 0 0
.1- The resultant objective function can be written as J J
0
s, 0 I
f MaximizeZ=O
tEV
s, 0 0 I
:1J.__ ----~'
'L iii) Construct simplex table
Key column Key Element Key row Since ci - Z; ::S 0 for non - basic variables, the current solution is optimal with x, = 0,
ll':i. x = 0, x = l 0/3 and Maximize Z = I(0) + 2(0) + 3( 1013) = I0
-:. 2 3
. i.e. Maximize Z = 10
iL.. CB B Xa x,
\ xf /s I s2 ~
,I
Minimum ratio
xn Ix,
Since c - Z = 0 for non - basic variable for x1 and x,, an alternative optimal solutien
J J -
I
exists •
,p.r: 0 s, 10 (I 2 3J I 0 O) 10/3 -+ LV Case (1) : To find an alternative optimal solutions, take x 1 as incoming variable as
'
~:· 0 s, 5 I - I 0 0 I 0 - shown in above table.
~: 0 s. I I 0 0 0 0 I - Then
~ MaxZ =O 0 0 0 0 0 - I
R2 ( new)= R2 (old)- R3 (new) R, (new)= R, (old)~-R1 (new)
--
~~
Z-+ '-0___..
;;-;;;:-- c.- zJ I 2 3 0 0 0 s, s, s.
E!- J
tEV s, I 0 0 5-1=4 1~-(/Jx1)=3
..,.,} __ -
s1 0 l 0
~-(~xl)=O
..... , s, 0 0 l
1-1=0
,,..· Since cJ - ZJ > 0 for all non - basic variables, the current solution is not optimal. 1-0=1 %-(~xo)=%
it x3 is the incoming variable. •
0-0=0 1-(/xo)=l
~- s, is the leaving variable.
3 is the key element 0-0=0 ~ -(~ xo)= )'j
Perform elementary row operations to make key element as 1.
R, (new)= R1 ( old)/3 1-0=1 o-(/ xo)=O
[Q/ _ [Q/
13 - 13 0-1=-I o-(~ x I)= - )'j
-,
X=X
..
The improved solution can be written as
C.-+ I 2 3
{;o
.;;·.
0
, •...
0 0
·liil(JWl PaOGRAJotlNG
2.15 TIE FOR ENTERING BA~HC V)UtJ~LE (l<EY COLUl\llN)

A situation may arise at any iteration when two or more columns may have exactly
-- ,-;· 1,
CB B ·"e . x, is is s, s2 SJ Minimum ratio

x.,. Ix.,
the same ci - Zi value (i.e. maximum+ ve value in maximization problem and maxtmum
negative value in minimization problem). In order to break this tie, adopt the following
3 x.. 3 0 ('jj3 I 1/3 0 -113 912 rules to minimize the number of iterations to arrive at the optimal solution.
0 s, 4 . 0 (11 o, 0 I -Il 4 --->LVi I. Ifthere is a tie between two decision variables, then selection can be made arbitrarily.
I x I I \.0, 0 0 0 I - 2. Ifthere is a tie between a decision variable and a slack I surplus variable, then select
Max.Z=IO. Z.-+ I 2 3 I 0 0 x s, x \(, a decision variable to enter into basis first.
cJ -ZJ 0 0 0 -1 0 0 x; l 0 0 3. If there is a tie between two slack variables, then selection can be made arbitrarily.
jEV s2 0 I 0
x, 0 0 I
-- 2.16 TIE FOR LEAVING BA$1C·~VA~IABiE (KEY ROW)-DEGENERACY
Degeneracy in LPP is said to occur when there is a tie between two or more basic
It is an optimal solution with x, = I , ~ = 0, x3 = 3 and Maximize Z = I0
variables for leaving basis i.e. either minimum ratio to identify the basic variable to leave
Case (2) : Take x2 as incoming variable in the above table
the basis is not unique or in which values of one or more basic variables in the solution
R1 (new)= R1 (old)-7'jR 2(new) values column (x 8 ) become equal to zero at any iteration.
3-(_7j'x4)= lJ' The problem of degeneracy is due to redundant constraint. However, the number of
iterations required to arrive at the optimal solution can be minimized by following rules
o-(,% xo)=o I. Divide the Co-efficient of slack variables in the simplex table by the corresponding
+ve number of the key column in the row starting from left to right.
,%-(,% xl)=o 2. The row that contains the smallest ratio comparing from left to right column wise
1-(_% xO)=l becomes the key row.

Note: If there is a tie between a slack and artificial variable to leave the basis, the preference
l)'-(Jj' xo)= lJ' should be given to the artificial variable for leaving the basis.
10. Solve the following LPP by simplex method Jan 2010(10 M)
'
o-(X x 1) =-.% Maximize Z = 3x 1 + 9x2
-~ -(Jj' x(-1))= lJ' subject to x 1 + 4x1 ::::; S

x, + 2x2 ::::; 4 and
The improved solution can be written as x 1 , x 2 ?: 0
Sol. i) Expr~ss the given problem in standard form
c ....... ? 3 0 0 0 Convert all inequality constraints into equations by adding slack variables
,, CR 8 XR x x, s, x_ s s_ x +4x 2 +s,=8 ... (!)
.i 1
·' 3 1/3
x, 0 0I -2/3 1/3 1/3
x,+2x 2 +s 2 =4 ... (2)
2 x, 4 I 0
0 I -1 0
I .. x I 0 0I 0 I 0
MaximizeZ=3x, +9x 2 +Os, +Os 2 ... (3)
MaxZ =IO Z. 2 3I 0 0 I
c-Z 0 0
0 -l 0 0 ii) Find initial basic feasible solution :
An alternative optimal solution is x, = I, x2 = 4, x3 = I/3 and Maximize Z = I{) Let n = 4
m =2
(n - m) = (4 - 2) = 2 variables must be zero
Let x, = x2 = 0 } Non - basic variables
-· s1=8}
s2 =4
Basic varaibles
·
. }~fti>it~:~~c11 ·
-"li#M~ifi~ ~-·
The improved simplex table can be written as •
c --> -I 3 -2 0
:.,~ ....
The resultant objectiye function can be written as
Maximize Z = 0 CD B XR x, x, s, s,
iii) Construct simplex table 0 s, 0 -1 0 1 -2
Kt;y C()lumn Key Element 9 x, 2 112 I 0 112
MaxZ= 18 z_, 912
-· 'j
0/ 0
9/2 9 0
""
CB
0 s,
B XB
8
x,\
I
\
x1
) y Minimum ratio
X lx,
0
c. -Z -3/2 0 0 -912
Since (ci -Z) S 0 for both non - basic variables, the current solution is optimal with
x, == o,~ = 2 and
T4l I 1/0 814 =2 Maximize Z = 3(0) + 9(2)
0 s, ( 4 I d.2 JJ 0 11 412 -2 Maximize Z = 18.
MaxZ=O z-. ->LY
0 0 0 0
cJ -Z 3 9 0
s, s, 2.17~RTIFICIALVARIABLES TECFINIQUES
J 0
s, I 0
jEV In linear programming problems, the addition of slack variables to the constraints of
,. s2 0 I (:S) type with non-negative RHS readily provide initial basic feasible solution. But, if at
J-
:)',
Smee c.J - ZJ > 0 for -both non - basic variables, the current solution is not optimal,
then x2 column and x: are the key column and entering variable respectively.
least one constraint is of (2:) or(=) type, we need to add artificial variable to the LHS of
that constraint to get initial basic feasible solution so that simplex method is used as usual
,., But minimum ratio 0 = 2 for both row s and s to get optimal solution. There are two techniques that use artificial variables to solve such
Ji, 1 1
Degeneracy occurs, as both s1 and s: are eligible to leave the basis. problems. They are
~
.
To remove degeneracy, construct a table comprises of column of rows s, and s: along I. The Big-M method and
-c-·
with a key column elements with columns of s, & s in the body matrix. Divide 2. Two phase method.
l :, 1
-41;1.-. . . elements_ of s, and s2 column by key column element 4 in the s, row and 2 in the s
~~. -
l
row as shown belo\y in the figute. 2
~-...c-:
2&17~1-.Big-M method IM- TechniqueifJlet~~-d ·of('~nalties
~~~-~--. Row Key column Column
~-
s, The addition of artificial variables violates the equality of constraints obtained in the
~--
s,
s 4 114
standard form. Therefore, it is necessary to dispose of these variables and not to permit
=~-~ 014
them to exist in the final solution. To accomplish this, artificial variables are assigned very
~_-,;-·· s, 2 012 112 large unacceptable penalty coefficient to the objective function. The penalty is entitled by
~-
;.~:;::-. Now check the minimum ratio among s, and s, column elements columnwise only. -M for maximization problems and +M for minimization problems.
~3"
e_~
Since the minimum ratio of0/2 =qoccurs forthes row compared to 114 ofs row in
2 The Big-M- method used for solving an LPP can be outlined in the following steps:
li!t•: 1
first column, variable s, is the outgoing variable. Now, the key efement is 2. Perform
ltl~~. elementary row operat{ons to make key element as I Step 1: Express the given problem in the standard form by adding slack variables, surplus
:;n::.·
:!::.;
~-:.. R2 {new)= R2 ( old)/2 R1 (new)= R1 (old)-4R (new) variables and /or artificial variables. Assign zero coefficients to both slack and surplus
_z.. ~ 2
J'i =2 8-(4x2)=0
variables and very large penalty coefficient-M (maximization case) and +M (minimization
case) to the artificial variable in the objective function.
Yi= Yi • I -( 4 x X) == - I Step 2: Obtain initial basic feasible solution by assigning zero value to (n-m) variables.
:i ..
Yi=I 4-(4xi)==O
Step 3: Construct the simplex table and calculate the values of cJ -ZJ in the simplex table
and examine these values.
·%=0 1-(4x0)== I i) If -Optimal condition is satisfied and no artificial variable is present in the basis, then
the solution is an optimal to the given problem.
Yi= Yi o-(4xX)==-2 ii) If optimal condition is satisfied and at least one artificial variable is present in the
i::MR?
.. O~RATIOllS ~~~H
basis with zero value, then the solution is an optimal to the given problem.
iii) If optimal condition is satisfied and at least one artificial variable .is present in the
-~-(
·· LDrukPRooiWDUllo
; •.
··~r. -- .-·
2x 1 +x 2 +s1 =2
.
411
... (4)
basis with positive value, then original problem· has no feasible solution. 3x 1 +4x 2 -s 2 +A 1 =12 ... (5)
iv) If optimal condition is.not reached and all the entities in the key column are negative Now, the artificial variable Jith value greater than zero violate the equality in
or zero, then the solution to the given problem is unbounded. constraint represented by the equation (2). Hence 'A 1',should not appear in the final
Step 4: Determine the key row and key element in the same manner as did in the simplex solution. To accomplish this, it is assigned a large unit penalty (-M) in the objective
algorithm. function, which can be written as
MaximizeZ=Jx 1 + 2x 2 + Os 1 + Os 2 - MA 1 ••• ( 6)
Step_5: Continue the same procedure to update the solution till optimal solution is obtained.
Note: The 'slack and surplus variables once driven out of the iteration may re-enter in the Xl'X2,sl's2AI ;::: 0
subsequent iterations. But an artificial variable once omitted, can never re-enter. Hence Now,
omit the column of that variable completely in the further iterations. n=5
m=2
SOLVED PROBLEMS
(n-m) = (5-2) = 3 variables must be equal tozerotoobtaininitialvasicfeasible
II. Solve the following LPP using Big- M method or penalty method
Maximize Z = 3x 1 + 2x 2 solution.
subject to constraints 2x 1 + x2 :5 2 Letx 1 =x 2 =s 2 =O;}Non-basicvaraibles
3x 1 +4~2: 12
s1 =2 } Basic variables
x1 , x2 :;::O.
Sol. i) Express the given problem in standard form A1 =12
Convert inequality constraints into equations by adding slack variable s1 subtracting :. MaximizeZ=-12M
surplus variable s2 from the left - hand side of the constraints Now, we have a least profit of - 12 M, which must be maximized intthe subsequent
2x 1 + x~ + s 1 = 2 .... (t) tables while arriving at the solution.
3x 1 + 4s 2 - s2 = 12 .... (2) iii) Construct simplex table and perform optimality test
The objective function can be written as Kev col
MinimizeZ=Jx 1 + 2x 2 + Os 1 + Os 2
x"x 2 ,s"s 2 ;::: 0
... (3)
CB B XB x, \ xi
J
vs, s2
-j
VA, Minimum ratio
x Ix,
0
0 s, 2 2 \lHt I 0 0) 2/1 =2 ---+LV
Let n =No. of variables in the objective function
i.e. n = 4 -M A 12 3 l4J 0 -I I 12/4 =3
m = No. of constraints MaxZ=-12M z ---+ -JM -4M 0 M -M s A
m=2 c-Z 3M+3 4M+2 0 -M 0 s, I 0
) J
:. (n - m) = (4 - 2) = 2 variables must be equal to zero. jEV A, 0 I
Let x1 = x2 = 0 } Non-basic variables
s, = 2 Since (c.J - Z)
J
> 0 for non basic
.
variables x1 and x,- , the current solution is not
s, =-12 optimal. Now choose a variable with highest (c.J - Z)J value as incoming variable.
Ii is not a feasible solution, as s2 has negative value that does not satisfy the non - Then x, is the incoming variable.
negativity conditions. s1 is the outgoing variable
Therefore, add an artificial variable A in the constraint 2. The equations {I) and (2) I is the key element. So row s 1 remains unaltered
becomes Perform elementary row operation in order to arrive at an improved solution
~(new)=~ (old)-· 4 R 1 (new)
12-(4x2)=4
!~'i'
1rr
-· ·-:-:: PRooiWOiilto
Lnim
H&pk:~"'~~:";,~tf~!~;;~\~:'"- ·- > Qp~rJi)ij':~~CH ... _.,.
_,
Key column Key Element Key row

3 -(4 x 2) = -5
4-(4xl)=O -. - .
0-(4x l)=-4
,A
B A1 Az Minimum ratio
-I-(4x0)=-I
1-(4 xO)= I
CB Xa\ x, \ XJ SI
;I Xnf X
M A 2 \llJT I, 0 -I 0 I 0 l 2 -+LV
The improved solution can be \vritten as shown in the table
c -> 3 2 0 0 -M
M A, 5 12J 0 l 0 -l 0 I 512
A, Z.-+ 3M M -M -M M M M A A
en B Xo x, x, s, s,
l . I 0 0 c;-Z; 4-3M 8-M 3-M M M 0 0 A, I 0
2 x., 2 2
tEV Ai 0 I
-M A, 4 -5 0 -4 -I I
MaxZ=-4M+4 z -> SM+4 2 4M+2 M -M Since (c1 - Z) < 0 for non - basic variables x1 x: & x3 current solution is not optimum.
c-Z -SM-I 0 -4M-2 -M 0 x 1is the incoming variable, as it has largest -ve value
Since (cJ - Z.)J :S 0 for all non - basic variables, the current solution is optimal. But.. A1 is the leaving variable
an artificial variable 'A 1', remains with +ve value of 4 as basic variable in the final I is the key element
simplex table. With x1=0, >s = 2, A1=4 and Maximize Z = 4 -4M, it is an infeasible Perform elemental)' row operation required to improve the solution
R2 (new)= R2 (old)-2R 1(new)
l solution.
L
t- 12. Solve the following LP problem using Big - M method. April 2018(15 M) 5-(2x2) =I
1.• · Minimize Z = 4x 1 + 8x2 + 3x3
t1 2-(2x1)=0
~I.' subject to constraints x 1 + x2 2:: 2
F 2x 1 +X3 2::5 0-(2xl)=-2
~~~. X , X ,X3 2;: 0
~ 1 2 I-(2x0)=1
~
.
.
Convert all inequality constraints into equations by subtracting surplus variables and 0-(2x-1)=2
Br-.~.·-.·· adding artificial variables. -1-(2x0)=-I
§;·_ X1+x 2 -s1+A 1=2 .... (!) 0-(2xl)=-2
PE- 2x1+x 3 -s 2 +A 2 =5 .... (2) l-(2x0)=1
IF- The objective function can be written as
-·
~--
;...::,;_--~
;.~
;::;;::::;
~:-:.
~-.
MinimizeZ=4x 1+8x 2 +3x 3 + Os 1+Os 2 + MA 1+ MA 2
X1,Xz,X3,S1,S2,Al'A2 ~o
.... (3)
Since A1is a leaving variable, its column is deleted in the next table.
The improved soltion can be written as shown in table
~.·. c.-+ 4 8 3 0 0 M
tL.:. ii) Find initial basic feasible solution
~~. CB B XB x1 X2 xi SI s2 Ai Minimum ratio
·k~ Let n = 7 Xa I SI
m=2
4 2 l I 0 r-.n 0 0 -
. (n - m) = (7 - 2) = 5 variables must be equal to zero. x,
l~t ~ ;}x2 = x3 = s1= s2 = 0 }Non - basic variables.
M A, I (0 ·. -2 . I .ll7·ll -1 I} 1/2
---
1 MinZ= Z.-+
J
4 4-2M M 2M-4 -M M x, A,
Basic variables 8+M 0
A,=5 x1 I
c.J - Z.J 0 2M+4 3-M -2M+4 M 0 Ai 0 I
MinimizeZ=2M+5M=7M
tEV
iii) Construct simplex table and perform optimality test
.... S
1
is the incoming Variable With largest - Ve value.
A, is the leaving variable.
OPERl.T1bis RBS£ARce Lnnwt·PRoo~6'
x1 + 2x 2 + s1 = 4
..
...(3)
2 is the key element. ,
The elementary row operations required are shown below. MinimizeZ=4x1 + x 2 + Os 1 + Os 2 + MA 1 + MA 2 ... (4)
R2 (new)=R 2 (old)/21 R1 (new)= R1 (old)+ R2 (new) ii)'Find initial basic feasible solution
Yi=Yi . z+Ji=Yz
Let n = 6
m=3
%=0 1+0=1 :.( n-m) = ( 6-3) = 3 variable must be equal to zero
-Yz =-I 1-1=0 Letx 1 =x 2 =s 1 =O;}Non-basicvariables
Yi= Yi O+ II - II
12-12 A~ =31
A ·
= 6 ·B~sic variables
Yz=l -1+1=0 S2 =4
-Yi =-Yi 0-Yi=-Yi :.Minimize Z=3M+6M=9M

iii) Construct simplex and perform optimality test
-Yz =-I 1-Yi=Yi Key colum_n Key Element Key row
Yi= Yi 0 +Yi=Yi
Since A 2 is leaving variable, its column has to be deleted in the next table CB B
\ x, VKz . s.
/ A1 Az Minimum ratio
x /x,
The improved I new solution can be written as shown in table ' 0
c.--+ 4 8 3 0 0
M A, 3 i\I 3 I 0 0 I o, I -+LY
M A, 6 4 3 -I 0 0 I 3/2
co B x., x x, x, s s,
I 0 1/2 0 s, 4 '-L. 2 0 I 0 0 4
4 x 5/2 0 -1/2
1/2 0 -1 1/2 I -1/2 MinZ=9M z.--> 7M 4M -M 0 M M A, s,
0 s, A
4 0 2 O· c.J -Z 4-7M l-4M M 0 0 0 I 0 0

MinZ= 10 Z.--+ -2 J A1
c-Z 0 8 I 0 2 fEV Ai b I 0
52 0 0 I
Since (c - Z.) > 0 for all non basic variables , the current solution is optimal with
J J
_x1 = 5/2, x2 = 0, x3 = 0 and Minimize Z = I 0 Since (c.J - Z)J :S 0, for non - basic variables x 1 & x,,- the current solution is not optimal
13. Solve the following LPP by Big - M method Now, x1 is the incoming variable
Minimize Z = 4x 1 + x2 A1 is the leaving variable
subject to 3x 1 + x2 = 3 3 is the key element
4x 1 +3x2 ;::: 6 The elementary row operations required are
x +2x 2 ~4
1 R1{new) = R1(old)/3 R2{new)=R2(old)-4R 1(new) R3(new)=R3{old)- R 1 (~ew)
x. 'x2 ;:::o 313 = I 6 - (4 x I)= 2 4- I= 3
3/3=1 4-(4x!)=O 1-1=0
Convert :S constraint into equation by adding slack variable, = constraint into
equation by adding artificial variable and 2:: constraint into equation by subtracting 1/3 = 113 3 - (4 x 1/3) = 5/3 2 - 113 = 513
surplus variable and adding artificial variable respectively. 0/3 =O -1-(4 x 0) =-I -0--0={)
Jx 1 +x 1 +A 1 =3 ... (!) 0/3 =O 0-(4x0)=0 I -0 =I
4x 1 + 3x 1 -s 1 + A2 = 6 ... (2) 0/3 = 0 I -(4x0)= I -0-0=0
~ O~T;Iolis~B.\it.¢&,,
"· :.-~-· \
····-.-··
· ·~:·:~iWIM
The improved solution can written as shown in table It is not an optimal solution, as (c. - Z.) < 0 for·s,.
1 1
c., 4 0 0 M Now s 1 is the incoming variable
CB B ·xs. x, s, . s2 s2 is the leaving variable
x2 A2 Minimum ratio
f i: i I is the key element and key row remains unaltered
XA Ix,
:.~ ~:~:'
:'.: i·
M
4 x I I 1/3 0 0 0 - 3
The elementary row operations uired are
I 3
.ti. A, (2 ·o 513 -I 0 Il 615 ->LY R, (new)= R 1(old}-5R 3 (new) R2 (new)= R 2 (old)+5R 3 {new)
;}: ;-~ -,
0 s, 3 0 513 0 I 0
~::=
!1
1!,ti: MinZ=2M+4 z , 4 (SM+ 4)13 -M 0 M

915
x A, s,
Ys -(Ys x I)= Ys %+(Ys x I) =%
~:. :~:. ,:;
".i. ;~.
~) {.
c.J "Z.J 0 (-SM-1)/3 M 0 0 x, I 0 0 1-(Ys x 0) =I 0+(Ys x 0) =0
jEV A, 0 I 0
~::~ t.~
11_
,·•;
,~,·,
s, 0 0 I -(Ys x 0) = 0
0 I +(Ys x 0) =I
~,. ~
I
;'.;~ :·'.a;
Note : Column AI is eliminated ' as it is a leaving variable.
Again, optimal solution not reached yet, as (ci - Z) S 0 for non - basic variable~
Ys -(Ys xI)= 0 -Ys + (Ys-x I)= 0
;:~:!'.~ Now, x2 is incoming variable O-(Ys x I)= - Ys 0+ (Ys x I) =Ys
if~
A2 is leaving variable
;".; :; ·,.
: 2·· -
~-._;
~...:
513 is the key element
As A2 is leaving variable, leave A2 column in the next table.
The new solution can be written in the form of table as show1.1 below
c.-. 4 I 0 0
I-·m:: . ', The elementary row operations required are CB B XB x, x2 s, s: Minimum ratio
..
'
R2 (new)= R (old)xYs R,(new)=R,(old)- XR(new) R(new)= R,(old) =.?§ R (new)
2
2 3 2
x,, Is,
4 215 I 0 0 ':I/)
2x Ys =% 1-(X x%)=Ys 3-(?j'x%)=1
x "
·~_..,,_
:"!' I x 915 0 I 0 315 3

~-
oxYs=o 1-(Xxo)=l o-(,% xo)=o 0 s,
'
I (0 0 I l( I) I ->LV
?{xYs=I X-(Xxl)=o %-(%xl)=O z-. 4 I 0 -1/5 x x, s,
-lxYs=-Ys 0 -(Xx{-Ys))=Y, c -Z 0 0 0 1/5 x, I 0 0
!t~~· o-(7§ x:Ys)= I J J
~~ oxYs=o jEV x1 0 I 0
~
o-(Xxo)=o 1-(,%xo)=1 52 0 0 I
~ .. The new solution can be written as shown in table.
The optimal solution is not yet been reached. Now,
:~
c., 4 I 0 0
s2 is the incoming variable.
CB 13 x, s, Minimum ratio
, ......... XB x2 s2 s, is the outgoing variable.
ua:L Xn / S I is the key element.
IZU
~,!.i;:~ .
JI';:.:·
U1::'
4
I x,
x
"
315 I 0 1/5 0 3 R2 (new)= R2 ( old)-Ys R3 (itew) R, (new)= R, (old)+ Ys R (new)
3
615 -
~
0 I -315 0
:;;t.... ..
0 s, I (0 0 .CI: IJ I ->LV %-(Ysxt)=% Ys+~(l)=Ys 0
~·~· Min Z = 18/5 Z.-. 4 I 1/5 0

c.-z 0 0 -115 0
x,
I
x, s, o-(,Ysxo)=o 1+ Ys(o)=I
!\:1 J x, 0 0
Ys (0) = 0
J
l"T
!L.J
iL i
..j
jEV x2
s2
0
0
I
0
0
I
I -(Ys x 0) = I
o-(,Ys x 1) =-Ys
0+
o+ Ys(1) =Ys
~'.i
lbJ. Ys-(Ysx1)=0 .-Ys+ Ys(l)=O
Ii
.
:-.L_
..,
The new solution can be written as shown in table
C-> 4 I 0 0
0PERATI01'1S REsEARCH
. LnfEAR PROGRAMMIHG
I
R, (new)= R, (old)+SR;(old) R2 (new) = R2(old)-% R 3 (new)
...
Ys +(~xi)= Ys .%-(% x I)= Ys
CB 8 . x/l x, is s, s2 Minimum ratio
It . XO Is,
4 x, 315 I 0 '115 0 3
I +(Ys xo) =I o-(Ys xo)=o
I x., 615 0 I 315 ·o -
0 s, ( I 0 0 ,{I} I I ->LY o+{Ys xo)=o t-(Ys xO )=I
Min Z = 18/5 z--> 4 I 115 0
cJ - zJ 0 0 -115 0 x,
x
I
x
0
s
(j 0 + {Ys x I)= Ys o-(% xl)=-Ys
jEV x2
s,
0
0 0
I 0
I
-Ys + (Ys x I) = 0 %-(Ysxt)=o
The improved solution is written in the table

Since (cJ - Z.)
J -
< 0 for non - basic variable S1 , the current solution is not optimal. Now, C.-> 4 0 0
s, is the incoming variable.
s2 is the leaving variable. Co 8 Xo x, x.,
s, s,
I is the key element, row S, remains unaltered. 4 X, 315 I 115
0 0
R, (new)= R, (old)- Ys R- (new)
3 R2 (new) = R2(old)+ Ys R (new) 3
I
0
x,
s.
115
I 0
I -815 0
0
0 I I
Ys-Ys(t)= Ys Ys +(Ys x 1) = % Min Z= 1315 z---> I
4 -415 0
c. -Z. 0 0 415 0
1-Ys(o)=I o+(Ysxo)=o
Since (c. - Z.):;:: 0 for non - basic variable, the current solution is optimal with
0- Ys (0) = 0 I+ (Ys x 0) =I 1) J
5 Ys
x1 = 7 ,x 2 = and
I
Ys-Ys(l)=O -Ys~(Ysx1)=0 Minimze=4(Ys)+ t(Ys)= Ys

1
o-Ys(l)=-Ys 1+{Ysx1)=Ys 14. Solve the following LP problem

Maximize Z = 3x, + Sx 2 (Unbounded problem)
The new solution is written in the table.
subject to constraints
c __, 4 I 0 0
x, -2x 2 ::;;6
CB 8 XB x, x2 s, s2 Minimum ratio
x, ::;IO
XR Is,
x 2 ~I and
4 x 215 I 0 0 ".:"175' -
I x., 915 0 I 0 815 918 x"x 2 ~ 0
0 s, (I 0 0 I l{ll Ill = I ->LY Sol. i) Express the given problem lo standard form
Convert all inequality constraints into equations by adding slack variables and
Min Z = 1715 z---> 4 I 0 415 x x, s,
artificial variables and subtracting surplus variables
c-Z
J
0 0 0 -415 x, I 0 0 ... (!)
J x, -2x 2 +s, =6
jEV x2 0 I 0
0 0 l x, +s 2 =10 ... (2)
s2
X2 -S3 +A, =I ... (3)
MaximizeZ=Jx, +5x 2 +Os, +Os 2 +Os 3 -MA, ... (4)
x"x 2 ,s"s2 ,s3 ,A 1 :<:0
..
Letn=6
·~Ttoll'B '.R.Ess&Rcs ~J~,•Milto'
c. B
c.-+
x..
3
x
5
x,
:~-?,f~{{f·;· -,
0
s,
.
0
s,
0
s,
.-
m=3
0 s, 8 I 0 I 0 q
(n-m) = ( 6- 3) = 3·varaiblesmustbeequaltozero
0 s, 10 I 0 0 1 0
Letx 1 =x 2 =s 3 =O;}Non-basicvaraiblell.
5 x. I 0 I 0 0 l:L s s. x
S1 =6 } . Max=5 z.- 0 5 0 0 -5 I 0 0
SI
s2 = I0 Basic varaibles
c.J - zJ 3 0 0 0 5 s,
- 0 I 0
A 1 =1 0 0 I
jEV x2
Since cJ - ZJ = 5 is the largest positive value for the variable s3. , it is an incoming
MaximizeZ=-M variable that should enter the basis. But, coefficients of the s3 column are all negative
iii) Construct simplex table and perform optimality test and /'or zero. There is no variable that can be removed from the basis, although the
Key column Key Element Key row value of s3 can be increased infinitely. In addition to this, the variable x, will also be
increased infinitely which can be expressed as x2 = I +s 3 - A 1• (i.e. fro-m constraint
equation (3) Hence, the solution to the given problem is unbounded.
Solve the following LPP by Big - M method
I.
r( Maximize Z = 6x 1 + 4Xz
subject to 2x 1 + 3Xz ~ 30
3x 1 +2x 2 ~24
~~
!!
x1 + Xz~3 and
.
X1•Xz~O
·~.:· i) Express the given problem in standard fonn
.
.
-' Convert all inequality constraints into equations by adding slack and artificial
.
variables and subtracting surplus variables
~'.
2x 1 +3x 2 +s 1 =30 .... (!)
16.-.·
~r As (cJ - Z)J
> 0 for non - basic variables, the current solution is not optimal. Now, 3x 1 + 2x 2 + s2 = 24 .... (2)
ii_
~--=
jJ.;;-
x2 is the incoming variable.
A 1 is the outgoing variable.
l is the key element
xi +Xz-S; +Al =3
The~bjectivefunction can be written as
.. .. (3)
~~ · The required row operations are MaximizeZ=6x 1 + 4x 2 + OS 1 + Os 2 + Os 3 - MA 1 .... (4)

E~ .. R 1 (new)= R 1 (old)+ 2R 3 (new)
XpX 2 ,SpS 2 ,s 3 ,A 1 ~ 0
I
~
.; 6+(2xl}=8
' ii) Find initial basic feasible solution
1+(2x0)=1
~·
Letn=6
12.!dl.; - -2+(2x1) =0 m=J
iE:
;;,.;;; (n - m) = (6 - 3) = 3 variables must be eftual to zero
1+(2x0)=1 Let x1 = x2 = s3 = O;} Non - basic varaibles
IIt
0+(2x0)=0
0+(2x-l)=-2
The new solution can be written in the table
s
s
A
30)
24 Basic variables
3
MaximizeZ=-3M
l--.·..____
Rlbr,,- OPERATIONS REsEARCH
lpBAR Paomwoo110
iii) Construct simplex table s, is the outgoing variable

Kev col K f is the key element
The elementary row operations required to make the elements of key column as zero
- ' - - - ,. -- retaining key element as I .
\ C9 B
x~ x1
y SI .s2
-;
'Is J A1 Minimum
ratio x Ix,
0
R, (new)= Rlold/3) R1(new)= R, (old)- 2R 2 (new)
24 - (2 x 5) = 14
R3 (new)= R,(old) +~(new)
3+5=8
15/3 = 5
0 s 30 \ 'T /J I lJ 0 0 30/2=15
0- ( 2 x 0) = 0 l+O=l
0 s, 24 3 I 2 o. II I 0 0 2413 = 8 0/3 = 0
I - (2 x (- I/3) = 513 I+ (-1/3) = 2/3
-M A, 3 ((ll I 0 0 -1 I) 3/1=3 ->LY -1/3=-l/3
I - (2 x 0) =I · O+O=O
MaxZ =-JM l-> -M -M 0 0 M -M 013 = 0
s, s, A 0 + 1/3 = 1/3
1/3 = 1/3 0 - (2 x 1/3) = -213
C. -Z 6+M 4+M 0 0 -M 0 s, I 0 0
J J
2 - (2 x I)= 0 -1+I=0
jEY s, 0 I 0 3/3 =I
A, 0 0 I
c --> 6- 4 0 0 0
Since (c.J - Z.) > 0 for non basic variables, current solution is not optimal. Now, x X, s, S, s,
J c,. 8 Xa
x, is the incoming variable 513 I -2/3 0
0 s, 14 0
A, is the leaving variable ,.
s. 5 0 -I /3 0 1/3 I
I is the key element , the row R, remains unaltered and delete column A in the next table 0
The elementary row operations required are x, 8 I 213 0 113 0
6
R, (new)= R, ( old)-2R 3 (new) R2 (new)= R2 (old)-3R 3 (new) MaxZ'"'48 z__. 6 4 0 2 0
30-(2x3) = 24 24-{3x3)= 15 c -z 0 0 0 -2 0
Since (cJ - Z) S 0 for all non - basic variables, the current solution is optimal with x,
2-(2x1)=0 3-(Jxl)=O
= 8, x, =0 and
3-(2xi)=l 2-(Jxl)=-l
Maximize Z = 6(8) + 4{0)
l-(2x0)=1 0-(JxO)=O Maximize Z = 48.
.,. 0-(2x0)=0 l-(3x0)=1 Also, (c, - Z) = 0 for non - basic va[iable x,. This indicates the existence of an
~;;.
'<;·
0-(2x-1)=2 O-(Jx-1)=+3 alternate optimal solution with same Z"'·" = 48
~- To obtain an alternate optima solution. take x, as an entry/ incoming variable and s,
The new solution can be written as shown in table as leaving variable. then Maximize Z = 48 with x, = 4215 and x, = 1215.
C-> 6 4 0 0 0
~- 16. Solve the following LP by Big - M method
~.
CR 8 XO x, x2 SI s2 SJ Minimum ratio Minimize Z = -8x,
x,.I s. subject to x, - x, 2: 0
0 s 24 0 I I 0 ,...2" 12 2x, + 3x,S-6
.I
0 s, 15 !U -I 0 l jJ 5 ->LY and x, , x2 arc unrestricted
6 x, 3 I I 0 0 -I - Sol. i) Express the given problem in standard form
0 Since RHS of constraint is negative, multiply throughout it by -1 to make it positive.
Max Z = 18 z --> 6 4 0 0 -6 s s, x
:. -2x, -3x::?: 6
C.
J
-ZJ 0 0 0 0 +6 s, I 0 0
Since x, and x: are unrestricted in sign . introduce the non - negative variables
jEY s, 0 I 0
x:.x:',x~andx'.' sothatx, =x:-x:' and x, =x~-x~',where
x, 0 0 I
The optimal solution is not yet been reached. Now, xI1,x Ii1 ,x,,x:
I .II>{)
_
s3 is the incoming variable No\\' ,conve11 all inquality constraints into equations by adding artificial varaiblesA, & A,
and subtracting the surplus varaibless 1 ands, from LHS of the constraints.
'-
'Plif
1 11 1
(x I -x I )-(x 2 -x")-s
2 I +A I -
-2(x: -x:')-3(x~ -x~' )-s

- 0
2 +A2 =6
~;,_·, rt:....
vr~TIOKB. AriDEARCB
..
.... (!)
.... (2)
-. L~PRoo~<i
-
The objective functiorl in the standard fof!U can be written as
\ MinimizeZ= -8( x~ - X~ 1 ) + o( x: - x: I)+ Os, + Os2 +MA, + MA2 .... (3)

i.e.MinimizeZ=-8x~ +8·x~1 +ox: +ox: 1 +Os 1 +Os 2 +MA 1 +MA, .... (4)
x:,x: ,x~,x~ ,s"s 2 ,A"A 2 ~ 0
1 1

Let n = 8
· m=2
I (n-m) ={8-2) =6variables must be equal to zero. Minimum ratio \
!
~
Let x: = x: 1 1
= x~ = x~ = s1 = s2 = O} Non -basic varaibles. L I I I I ,..-.. I ' I ' I . I .. I .. I XR I xi' I I
I',.'
A1 =0} Baiscvariables I ; 11;\l I -~ I ~ I -; I I :, I -Yi 6/S 1 :LV
~r··-
~~:
~~
tt
,~.
~:~--
..
..
A2 =6
The resultant objective funciton can be written as
MinimizeZ=6M
Key column Kev El The optimal solution not yet reached. Now,
x 11 is the incoming variable.
x';
AZ r::
~i1·_ · ,
1
A2 is the leaving variable.
. .
x11 x" v~ 5 is the key element.
~
CB B Xe x' I x'2\ /s, s2 Minimum ratio
ot;:;,. I
2./ Xa I x ~
1 Perform elementary row operations required
~i R2 (new)= R2 (old)/5 \R 1 (new)= R1 (old)+ R2 (new)
I~~ M A 0 10 -I -I ~ll . -I 0 1 0 Oil =O --+LV
-·- M l 613,; 2
i ~-.
A,-- 6 -2 2
MinZ=6M Z.-+ -M -M
-3
-4M
l3J
4M
0
-M
-1 0
-M M M A, A,
%=%
-Ys =-1
o+%=%
l+(-1)=0
~
c.-Z M -M 4M-8 -4M-8 M M 0 0 A, I 0
i]i~
.......
J J
jEV Ai 0 I Ys =1 -1+ 1=0
... . .
Ii
~-
~.,
Since (c.J - Z.)J < 0 for some non~basic variables, the current solution is not optimal. 015 =0 -1+0'=-1
.
Now, 015=0 l+O=I
.
x~ istheincomingvaraible
1
3/ _)/
~-~ A1 is the leaving varaible
;s - ;s -i+Ys=-Ys
~.~.
ra_.,_
I is the key element. The row A1 remains unaltered fornext iteration.
• -Ys=-Ys 0 + (- Ys) .= - Ys
~, The elementary row operations required are
R2 (new)= R 2 (old)-3R 1(new)
' 6-(Jx0)=6
!IL:
EL
--~
.. Ca 8
c-+
x ..
0
x'
0
x"
-8 +8
x',' 'x" '
OPERA11011s lb:&EARcH
0
s,
0
s,
Llli'EAR PRoGRAMMIKG AR
b) If Min W = 0, and no artificial variable appears in the.basis, then a basic feasible solution
to the given problem is obtained. Go to phase II to get to get optimal solution to the original
problem by deleting the artificial variables column.
8 x.1', 615 0 0 -1 I -215 -115 c) If Min W = 0, and at least one artificial variable appears in the basis with zero value,
0 x" 615 -I I 0 0 315 -1/5 then a feasible solution is obtained for the original problem and proceed to the phase II by
Min Z=48/5 z -+ 0 0 -8 8 -1615 -815 retaining the artificial variable with. zero cost coefficient.
c -Z 0 0 0 0 +1615 +815 Phase II
Since (ci - Z) 2: 0 for all non basic variables, the current solution is optimal with The basic feasible solution obtained at the end of phase I is now used by assigning
.- 15 ,x,'-o
x,''-61 - ,x '-o
2 - ,x,·"-61
- IS an d actual coefficient in the original objective function and zero coeffieient to the artificial
variables which appears at zero in the basis at the end of phase I and last simplex table of
8
MinimizeZ=-8(0-%)+0(0-%)= ~ - phase I is used as a starting table for phase If by changing the coefficients of cj row. The
simplex method is then applied to arrive at the optimal solution.
butx, =x:-x:'
SOLVED PROBLEMS
x, =(o-%)=-%
17. Use the two - phase simplex method to
X 2 =X,-X
Maximize Z =Sx, + 3x2
( I ")
2
Subject to 2x, + x2 '.S 1
=(o-%)=-% x, + 4x 2 2: 6
. . . z=s
... x,= -6/ ,x 2 = -6/ an d m1111m1ze 48 x 1 , x2 2: 0
15 15 Sol. Phase - I
i) Express the given pro!Jlem in standard form
~- Convert all inequality constraints into equations by adding slack, artificial variabks
2.17.2 Two-Phase Method
and subtracting surplus variable.
,._ It is one more method of using the aitificial variable technique to solve the linear
2x, + x2 + s, =I ... (I)
1"" programming problem with constraints of (2:) or(=) type. This method uses two phases
x1 +4x 2 -s 2 +A, =6 ... (2)
I
to solve the problem. In the first phase, the initial basic feasible solution Is obtained for
;.
the original problem by driving out the all artificial variables. This is don~ by creating x,,x 2 ,s 1,s 2 ,A 1 :?:0
;
t.·· minimized artificial objective function comprises of sum of artificial variables. In the Now, consider an auxiliary/ artificial objective function of minimization type which
;_:.. second phase, optimal solution is obtained for the original objective function by using the comprises otonly the artificial variables in the constraint ,quations with a co-efficient
basic feasible solution obtained at the end of the first phase.
+I in phase I
The steps involved in this method are summarized as shown below: Minimize W=A,
Phase I The a11ificial objective function· in the standard form can be written as
i) Express the given problem in standard form by converting all inequality constraints MinimizeW=A,
into equations by adding slack. surplus and artificial variables as per the requirement. The artificial objective function in the standard form can be written as
ii) Write artificial objective function (W) of minimization type which comprises of sum . .13)
MinimizeW=Ox, +Ox 2 +Os 1 +Os 2 +A,
+ of all artificial variables with coeffi~ent as I.
ii) Find initial basic feasible solution for a~ auxiliary objective functiou
iii) Obtain initial basic feasible solution by assigning zero value to {n-m) variables.
Let n = 5
i<i) Construct simplex table and perform optimality test. At the end of phase I. three m=2
different cases arise: (n - m) = (5 - 2) = 3 variables must be equal to zt:ro .
.) If Min W> 0, and at least one artificial variable appears in the basis with positive value,
then the given problem has no feasible solution and procedure terminates .
..
~
~:-
.,,,,.
Letx 1 = x 2 =s 2 = O;} Non-basicvaraible
OPERATIONS REsEARCB L111&\R PRoaRAliMiKo
18.
~,
Solve the following LPP by using two phase simplex method.
Maximize Z = 3x1 + 2~ + 2~
...
s I } Basic vara1bles
. Subject to Sx 1 + 7~ + 4~::; 7
! A 6 -4x 1 + 1Xz + 5~ ~ -2
:. Minimise W=6 3x1 + 4Xz - 6~ ~ 29/7
. . x•.Xz.~ ;:::o
iii) Construct simple table and.p_erform optimality test
Sol. Phase • I
c.---+ 0 0 0 0 I i) Express the given problem in the standard form
,.'
! Si I B I "s I x, I JS I s1 I s2 I A I Minimum ratio
1 Since RHS of constraint 2 is negative , convert it into positive by multiplying
x,Jx, throughout by -1
I I-> LY :. 4x 1 - 7x 2 -5x 3 $ 2
H:
i.1:· 0 s, I 2 1 1 0 0 1/1 = 1
If-,
~ :r: =
1 I A 6 1 4 0 -1 1 6/4 = 312 Convert all inequality constraints into equations by adding slack and artificial
MinW=6 z_, 1 4 0 -1 1 variables and subtracting surplus variables
cJ - ZJ -1 -4 0 1 0 sI 5x 1 +7x 2 +4x 3 +s 1_=7 ... (1)
jEV A2 4x 1 -7x 2 -5x 3 +s 2 ='2 ... (2)
::r.·
l~~-l
Since ci - Zi :S 0 for non - basic variables, solution is not optimal

·."""T
.;~ ~.
3x 1 +4x 2 -6x 3 -s3 +A 1 =2/"j ... (3)
~~:. x 2 is the incoming variable
X"X 2 ,X 3 ,S 1,S 2 ,s 3 ,A 1 ;e:O
[ s1 is the leaving varaible
1is the key element. Row R1 remains unaltered in the next table Consider an auxiliary objective function of minimization type comprises of only
E Perform elementary row operation to get improved solution
artificial variables in the constraint equation with the co-efficient I
Minimize W=A 1
R 2 (new)= R2 (old)-4R 1 (new) The auxiliary objective function becomes
.
·1". 6-(4xl)=2 Minimize W =Ox 1 + Ox 2 + Ox 3 +Os,+ Os 2 + Os 3 + A 1 •••• ( 4)
.' .
1-(4x2)=-7
4-(4xl)=O
ii) Find initial basic feasible solution for an auxiliary objective function
Let n = 7
l
. m =3
l -
. 0-(4xl)=-4 (n - m) = (7 - 3) = 4 variables must be zero.
-l-(4x0)=-l Let x, = x2 = x3 = s3 = O; Non-basic variables
!I
iii;:~;· l-(4x0)=1
1·' c ---> 0 0 0 0
s =7
s: = 2 Basic varaibles
IEt c.. B XR s, xs, A, X, A, -29/
- /7
Ii·
~
0 x, 1
1 1 20 0
The auxiliary objective function can be written as
fiE;. I A 2 0 -4 -7
-1 I Minimize W = 2917
I11·'
~ .
MinW=2 z_,
c. -Z 7
0
0
-4
4
--7
-1 I
1 0
iii) Construct simplex table and perform optimally test for initial basic feasible
solution for an auxiliary objective function
Since c.J - ZJ >-
0 for non - basic variables, an optimal basic feasible solution is
obtained for an axillary objective function. But minimise W = 2 (i.e. > O)and an
.
artificial variable A1 = 2 appears in the basis , hence the problem does not possess a
' feasible solution and procedure stops.
I
.... Key column Key Element ~ey
OPERATIONS REsEARCH
row
,£ii£Alt PitoorWritfG
c -+ {) 0
I
I
0 0 .-0 0
••
'- ~ \V v v v v )I I CB B "a x1 is is SI ~s2 SJ A, Minimum ratio
CB
0
8
s, r
XB
1
\
...
is
I
v
4
s,
I
7
II
SJ
II
A1
II
Minimum ratio
x,/x,
717 - I
0 x, l '57i l 417 l/7 0 0 0
x.Jx
715
I -.LV 0 s, 9 9 0 -I I I 0 0 919=1
0 s, 2. 4 -7 -5 0 I 0 0 - I A 1/7 II~ 0 -58/7 -417 0 -1 IJ I -+LY
1· A, 29/7 3 4 -6 0 0 -I I 29/2.8 Min W= 1/7 z.-+ 117 0 -58/7 -417 0 -I I x, s A
Min W = 29/7 z .... 3 4 -6 0 0 -1 l s s, A, cJ - zJ -117 0 58/7 417 0 I 0 Xz I 0 0
c -zJ J
-3 -4 6 0 0 I 0 s, I 0 0 jEV s, 0 I 0
jEV S., () I 0 A, 0 0 I
A, () () I
The optimal solution is not yet reached. Now,
Since (cJ - Z)J < 0 for non - basic variables, current initial basic feasible solution is x 1 is the incoming variable.
not optimal for auxiliary objective function. Now, A1 is the outgoing variable, (as A1 must be eliminated from the basis)
xz is the incoming variable 1/7 is the key element
s 1 is the outgoing variable The elementary row operations required are
7 is the key element R3 (new)= R3 { old)x7 R2 (new)= R2 (old)-9R 3 (new) I R, (new)= R, {old)-~ R3 (new)
Following elementary row operations are required
R, (11t:11·) = R, (old)/7 R,(new)= R,(old)+?R,(new) IR, (new)= R; (o.ld)-4R,·(new) ~x7=1 9-(9x1)=0 i 1-(~xl}=+?j
x =I 2+(7x1)=9 :}~ -(4·-: 1) = h _!_x7 =I
7
9-(9x1)=0 ~-(~xl)=o
J:;=J:; 4+(7xy.;)=9 / 3-l4xJ:;)=J; Ox7 =0 0-(9x0)=0 1-(~xo)=l
/S=I -7+(7xl)=O 4-(4x1)=0
_5% x7 = -58 -l-(9x-58) = 521 S-(~x-58)=42
~=70 -s+(1x:Yj)=-I -6-(4x~)=-SJj
-Sx7=-4 1-(9x-4)=37 X-(~x-4}=3
II - I/ o+(7xJ;)=l
/7 - /7 o-(4x);.;)=-~
Ox7 =0 1-(9xO) =I o-(~xo)=o
?0 = () 1+(7x0)=1 0-(4x0)=0
-lx7=-7 I o-(9x(-7)}=63 o-(~x-7)=5
?0 =0 O+(?xO)=O -1-(4x0)=-I
?0 =0 0+(7x0)=0 1-(4x0)=1
c B
C.--->
x'o
0
x
0
x,
0 0
s
0
s,
0
s.
x,
The new solution is shown in table "'
• 0 x, 2/7 0 I 42 3 0 5
0 s, 0 0 0 521 37 I 63
0 x I I 0 -58 -4 0 -7
Min W=O z .... 0 0 0 0 0 0
c. - z 0 0 0 0 0 0
Since c.J - Zj = 0 for non basic variables and also minimize W = 0, optimal basic
feasible solution is obtained for auxiliary objective function and also no artificial
variable appears in the basis. The table gives basic feasible solution to the original
problem.
9'l'
.. The original objective function is
Phase-II
OPERATIOllS REsEARCH
-~bd~if
19. Using two - phase method, solve the LPP
Minimize Z = 7.5x1 - 3~
-~,~~;i:::i·: . . ~~~s~~rr~~ -~·:·.~~iffi~~~,.
'·:;.
Maximize Z = 3x 1 +.2JS + 2x 3 + Os 1 + Os2+ Os 1 subject to 3x 1 - ~ - ~ 2: 3

Use the final table of phase I as a starting solution for phase II just by change c) row.
x.- ~ + ~2:2
C.-+ 3 2 2 0 0 0 x 1 , x2 ,x3 2:0 \
CB B xB xI JS 'S SI s2 SJ Minimum ratio Sol. Phase-I

x,/ x, i) Express the given problem in the standard form
Convert all inequality constraints into equations by adding artificial variables and
2 x, 217 0 I (if!' 3 0 5 12
subtracting surplus variables
0 s, 0 lO 0 521 37 I 63J 0 -+ LV
3x 1 -x 2 -x 3 -s,+A,=3 ...(I)
3 x, I I 0 -58 -4 0 -7 x, s, x, X 1 - x2 + x 3 -s 2 +A 2 = 2 ... (2)
MaxZ = 11/7 Z.-+ 3 2 -90 -6 0 -II x2 I 0 0 x1,x 2 ,x 3 ,sJts 2 ,A,A 2 ~ O;
c.J - zJ 0 0 92 6 0 II s,- 0 I 0 Consider an auxiliary objective function of minimization type comprising of only
jEV x1 0 0 1
artificial variables in the constraint equation with the co-efficient of I
Since (c) - Z.) > 0 for non basic variables, the solution is not optimal. Now, MinimiseW=A 1 +A 2 ••• (3)
)
x3 is the incoming variable Now, the auxiliary objective function can be written as
! s, is the outgoing variable Minimise W =Ox,+ Ox 1 +Ox,+ Os,+ Os1 +A,+ A2 ••• (4)
L
;:; 5l I is the key element ii) Find initial basic feasible solution to the auxiliary problem/ function
:
~+
il: - i
~
R1 (New) = R 2 ( old)/521 I
I
R,{New) = R,(old)-42R 2 (New) R3 {New) = R3 ( old)+ 58R 2 (New)
,%.-(42x0)=~
Letn=7
m=2
:. ( n-m) = (7 -3) = 4 variables must be zero
iiu. % 21 =0 1+(58x0)=-l
1ii . 0-(42x0)=0
I
1+(58x0)= 1 Letx 1 =x, =x 3 =s 3 .=0;}Non-basicvariables
%21= 0
!s
~
Iii;,:: %21= 0 1-( 42x0)= I · 9+(58x0)".'0 SI =81 Basic variables
s1 = I
Im
~
52Ys521-- I 42-(42xl)=O -58+(58xl)=O
A 1 =4
~L
El;-'= 3Ys -3Ys
521- 521 3-{42x 3Ys21} = %21 -4 + ( 58 x 3%21) = 86%21 :. Minimise W=4
if
~:ii'
Ys21= Ys521 4
o-( 42 x Ys21)= Ys21
5 -{ 4zx 6Ys21)=-4Ys21
o+( 58 x Ys21)=5_%21
6
iii) Construct simplex table and perform optimality test for initial basic feasible
solution for auxiliary problem
6Ys: -6Ys - 7 + ( 58 x Ys21) =-Ys21 Key Element ~ey row
~ 521- 521 Key colum_n
m.
i:L
The improved solution can be written as shown in table
'-'·\' v 1 1
v
V/ V V /V
C-+ 3 2 2 0 0 0
i@
f,:. CD B XD x x, x, s, s, s, CB 8
x0\ x, /2 ~ s2 A, A2 Minimum ratio
2 x, 217 0 I 0 9/521 42/521 -41/521 I x,/x,
I A, 3 "ll.3 - I -I -I 0 I 0) 313 =I -+LY
• 2 . x., 0 0 0 I 37/521 1/521 63/521
3 x, I I 0 0 862/521 58/521 7/521
I A, 2 lt. -I I 0 -I 0 I 2/1=2
Min W= 5 Z-+ 4 -2 0 -1 - I I I A A,
MaxZ=25/7 Z.-+ 3 2 2 908/521 101/521 29/521
r-, cJ - zJ -4 2 0 I 1 0 0 I 0
c. - z 0 0 0 -908/521 -101/521 -29/521 A,
jEV A, 0 I
Since (c.) - Z.)J
< 0 for all non - basic variables, the current solution is the optimal
solution with x 1 = I . x2 = 217, 'S = 0 and
Maximize Z = 2517
- .
Since (c, - Z.)
axillary problem. Now,
x1is the incoming variaple
'· .:.~·.
, < 0 for non -basic variable x1,'the
A1is the leaving variable & hence delete A1column in the next table.
-<lPERATiOllS lb:s~CB
r: optimal solution is not reached for

; -
_iq~Pa~~DiG
I
<:D
0
B
x, 514
c.--+
XD
I
0
x
0
x,
-112
0
x.,
0
. 0
s, s,
0
-114 -1/4
~
3 is the key element. 0 x, 314 0 -1/2 I 1/4 -314 x x_

The elementary row operations required to arrive at optimal solution are MinW=O z --+ 0 0 0 0 0 x, I 0
R1(new)= R1 ( old)/31 R2 (new)= R 2 (old)-R 1 (~ew) - c-Z 0 0 0 0 0 Xl 0 I
X=r 2-1=1 Since (cJ - Z)J = 0 for all non - basic variables and Min W = 0, move the phase 11 to
get optimal solution for the original problem.
X=r 1-1=0 Phase-II
-X=-X - -(-X)=-%
1 C.--+ 7.5 -3 0 0 0
-X =-X 1 -(-X)=~ C"

7.5
B
X,
Xn
514
x
1 -1/12
x, x,
0
s
-114
s,
-114
-X=-X 0-(-X')=+X'
0 x., 3/4 0 -1/2 I 1/4 -3/4
0=0 -1-0=-I Min Z = 75/8 z --+ 7.5 -7.5/2 0 -1.514 -1.514
0=0 1-0=1 c. -Z 3/4 1.514 1.514
0 0
The improved optimal solution is shown in table. Since (ci - Z) :'.': 0 for all non basic variables, the current solution is optimal with
c.--+ 0 0 0 0 0 - 51
X1- x - 0' xJ -- /4
74• 2 - 3/ and MinimizeZ-- 75/
18
CB B XB x1 is XJ SI sz A1 Minimum
20. Use the two phase method to
xR/x,
Minimize Z = x1 + x2
0 x I I -1/3 "(-1/'J' -1/3 0 0 Subject to 2x 1 + x, ~ 4
I A, I (0 -2/3 '{4/3} +1/3 -1- I) 3/4 --+LY x1 +7x2 ~ 7
MinW= I Z--+ 0 -2/3 4/3 +1/3 -I I x A, x1 , x2 ~ 0
cJ - zJ 0 2/3 -413 -1/3 I 0 x1 I 0 Sol. Phase-I
A, 0 l i) Express the given problem in standard form
tEV
Convert all inequality constraints into equations by subtracting the surplus variables
Since cJ - ZJ < 0 for x3 , the optimal solution is not reached. and adding artificial variables.
Now, x, is incoming variable 2x 1 + x2 - s, + A, = 4 ... (!)
A2 is leaving-variable
413 is a key element x, + 7x 2 -s 2 + A2 = 7 ... (2)
The elementary row operations required to obtain optimal solution are x1,x 2 ,s 1,s 2 ,Al'A 2 :::: 0
R2 (new)= R2 ( old)x ,X' R1(new)= R1(old}+ )'; R2 (new) Consider an auxiliary objective function -0f minimization type comprising of sum of
artificial variables present in the constraint equations with a co-efficient of I.
lx,X' =,X'
ox,X'=o
l+{X'x%}=%
l+{X' xo)= I
Minimize W ""A 1 + A2 ••• (3)
Now, an artificial/ auxiliary objective function in standard form can be written as

.
••• ( 4)
-%xX=-Yz -K+(K x(-fi))=-Yi Minimize W =Ox, + Ox 2 +Os, + Os 2 +A, + A2
ii) Find initial basic feasible solution to the artifiCial/ auxilliary problem
~x,X'=I -X'+(X'x1)=0 Let n = 6
~xX=~ -x (X' x~) =-Yi2 =- ~
+ m=2
(n - m) = (6 - 2) = 4 variables must be zero.
-rx,X"=-X o+(){ x(-%))=- ~
The improved solution is obtained as shown in the table
•·
~\'1'
- Let x, = x2 = s1 = s2 =O; Non - basic variables.

A,=4;
A 2 =7;
Ol'uATtoa's R!:sEARCH ::;:~~,-~QG~~!l\'IKG:
The optimal solution not yet reached. Now,
choose x1 as incoming variable.
A1 as outgoing variable..
--
1317 is the key element.
:. Minimize W=11. The e~mentary row operations required are
iii) Construct simplex table and perform optimality test for feasible solution of phase I R1{new) = R1(old)x Yt
3 2
R (new)= R2 (old}- y.; R (new)
1
Kev column · Kev El· · 3x 7/ -21/ 1-( I/ x21/ )-10/

/13- /13 /7 113 - 113
-, - ., .
·s 1_%x/{3 =1 y.;-(y.;{I)) = 0
l/1
CB
I A,
xB
4 2
\ VYY is )
-1
s2
fl
I
I
Ai
0
Minimum ratio
xix,
4/1 =4
Ox /{3 =0
-Ix /{3=-1{3
1-{~xo)= I
o-(~x-j{3)= }(3
I A, 7 l I l 7J 0 -I 0 I) 717- I -+LV
MinW=II ~x/{3= }'j3 _ll_(llx 11)=~
Z-+ 3 8 -I -I I I 17 17 /13 91
A, A,
c-Z
J J
-3 -8 I I 0 0 A, I 0 The improved solution is shown table below
jEV Az 0 I C-+ 0 0 0 0
Since (c.J -Z.)J < 0 for non basic variables x1 and x.,,- the current solution is not optimal. Now, CD 8 XD X, x. S, s,
Select~ as incoming variable. 0 x 21/13 I 0 -7/13 I/13
A2 as outgoing variable.
t::
0 x. I0/13 0 I l/IJ -14/91
f,'
MinW=O Z.-+ 0 0 0 0
~· The elementary row operations required to obtain optimal solution for auxilliary
, __
problems are '--~~~~~_..~
c. -Z....... 0 0
~~..._~...._~__...__~~
0 0
L;::
~-
~~':!'"
.;!"~/,
I
R2(new)= R 1 (~)/~ R 1 (new)=. R1 (old)-R 2(new)
Since (c.J - Z) J
= 0 for non - basic variables and minimize W = 0, an optimal solution
i.e. basic feasible solution is reached for auxiliary problem. Move to phase II for
~~;: /j=I · .· .4-,!=3 arriving at optimal solution for original problem.
~~t.
- Phase - II
i-J.:.;~_.,.
~
~4:
X= y; 2- Jj=l}j c.-+ I I 0 0
~
~
/j=I 1-1=0 c. 8 x.. x x. s s,
I x, 21113 I 0 -7/13 1/13
fr
~-.
%=0 -1-0=-I
__._: I x., I0/13 0 I 1/13 -14/91
~-
1.i!.Z.''
~
-X=-X o-(- Jj)= y; MinZ=31/13 Z-+ I I -6/13 -1/13
l.i.a~.,
i-~··I c. -Z. 0 0 6113 1/13
~ %=0 1-0=1
Since (c.J - Z)J > 0 fornon basic variables, the current solution is optimal with x1 = 21/ 13,
;:~~t The improved solution is shown in table ~ = I0/13 and Minimize Z =21/13 + IO/ 13 =31/13
~
0 0 0 0.
± C-+ 21. Use two - phase simplex method to
~--·
t~·., CB B XB xI x, s, s, A1 Minimum ratio Maximize Z =2x, + 1z + 1/4 ~
1f..
:.::~
x)x, subject to 4x 1 + 6~ + 3~ :5: 8
I A 3 [13/~ 0 -1 1/7 I l 21/13 -+LV 3x 1 - 6x2 - 4~ :5: I
iY
~
0 x, I \.,,117) I 0 -l/7 0 7 2x 1 + 312 - 5x3 2: 4
ik .. Min W=3 z -+ 1317 0 -I l/7 I A x,
x 1 ,~,x 3 2:0
!P.i• c-Z -1317 0 I -1/7 0 A, I 0
I.
J J
jEV xi 0 I
IL
-
Sol. Phase-I
i) Express the given problem in standard form
()pERATiOl'fS llEs!:ARca )~~G
A1 as a leaving variable.
...,,
Convert all inequality constraints into ·equations by adding slack and artificia1
variables and by subtracting surplus variable \ The elementary row operations required to move towards optimal solution are
4x 1 +6x 2 +3x 3 +s 1 =8 R3 ( new)= R3 (old)/3 R2 (new)= R 2 (old)+ 6R,( new) R 1(new)= R,( old)-6R 3(new)
... (1)
3x 1 -6x 2 -4x 3 +s 2 =I J'j =J'j 1+{6xJ'j)=9 s-{6xJ'j)=u
... (2)
2x 1 +3x 2 -5x 3 -s 3 + A 1 =4
... (3)
%= % 3 + ( 6 x %) = 7 . 4-( 6 x %) = 0
x,,x2,X3,SpS2,S3,A1~0 %=1 -6+(6x1)=0 '6-(6xl)=-0
Consider an auxilliary objective function of minimization type -jj =-jj -4+(6x-,X') = -14 3-(6x-?j)= 13
Minimize W=A 1
%=0 0+6x0=0 1-(6x0)= I
i.e. Minimize W=Ox, + Ox 2 +Ox,+ Os,+ Os 2 +Os,+ A, ... (4) %=0 1+6x0= I 0-(6x0) =0
ii) Find initial basic (easible solution
Let n = 7 -};=-}; o+(6x- /j)=-2 o-(6x-/j)=2
m = 3,
The new solution is shown in table.
:. {n-m) = (7 -3) = 4 variables must be zero
c.---+ 0 0 0 0 0 0
Let x1 = x 2 = x3 = s3 = O;} Non -basic variables 8 Xo x, x.. s s, s.
CD ~
s, =8) 0 s 0 0 0 13 I 0 2
s2 = I Basic variables 0 s, 9 7 0 -14 0 I -2
A 1 =4 0 x, 4/3 213 I -5/3 0 0 -1/3
:. Minimise W =4 Min W=O Z-+ 0 0 0 0 0 0
C. - l 0 0 0 (J 0 0
Key column Key Element r<;ey row (c.J - Z.)J = 0 for all. non - basic variables and Min W = 0, the current solution is optimal
for auxiliary problem. Now move to phase II keeping the final table of Phase I as first
\ - - - /v v
'I . table of phase II to obtain optimal solution for the original problem.
CB
0 s
8 XB
8
\
4
X,
\ 6
l
V3
S·
I
I Q'
s2 /s3 - A I Minimum ratio
0 0
'x)x,
816 = 4/3
Consider an original objective function
Phase- II
Maximize Z = 2x 1 + x2 + I/4 x; + Os 1+ Os 2 + Os 3, then

0 s, I 3 -6 v -4 0 111 0 0 -
c ---+ 2 l 1/4 0 0 0
I A 4 CB B XB x, Xz x3 s, Sz s, Minimum ratio
12 .) -5 u u -I l1 4/3 -+LY
MinW=4 z---+ 2 3 -5 0 xnlx.
0 -I I s s, A
cJ - zI -2 -3 5 0 0 s, 0 0 0 ('{13)'1 I 0 2 0113 = 0 -+LY
0 I 0 s, I 0 0
jEV 0 I
0 s, 9 7 0 -14 6 1 -2 -
si 0
A, {) 0 I
I x, 413 213 I 0/J,; 0 {) -1/3 -
MinZ=4/3 z_, 213 I -5/3 0 0 -1/3 s s, x,
There is a tie for the leaving variable among s1 and A1• Choose A as a leaving
1 c.J -ZJ 4/3 0 23/12 -0 0 1/3 s, I 0 0
variable, as an artificial variable has to be removed from the basis in phase - I. Since
(cJ - Z) < 0 for non - basic variables x1& x2, the solution is not optimal jEV s, 0 I 0
Take x~ as an incoming variable. x, 0 0 I
.. OnllATJOllS r(a~
As (ci - Z) > 0 for non - basic variables x1 ·'S , & s3 , the current solution is not
optimal. now,
' -..~ PRoo~~,, ..•.
R1 (new) =R2 (old)17 R1 ( new)= R1 (old)-% R1 (ncw)
-
x.3 is the incoming variable
s 1 is the outgoing varia)>le %=% %-(%x%)=1% 1
13 is the key element ;0=1 %-(%xt)=0
R,(new)= R,(old)/13 R,(new)~ R_,(old)+ R,(new)x 14 R,(new) =R;(old)+ ,% R,(new) %=0 1-{?'jxo)=I
9{3=0 9+14(0)=9 ~+(%xo)=~ %=-0 o-(?'jxo}=O
9{3=0 7+(l4x0)=7 X+(%xo)=% 14
1
113 y: _2/
7 -713
'
7J'9-(%x7{3)= ~9
9{3=0 0+(14x0)=0 1+(7J'xo)=l )!;= y; o-(%x }l.;)=Yi1
IJ{3=l -14+(14xl)=O -%+{.X'xt)=o 21~/
11
11 =%1 -){3-{7'jx%1)= 2%73
:i ){3-- ){13 o+(14x ){3)= 11{3 o+(.% x ){3)= %9
The improved solution is shown in table
9{3=0 1+(14x0)=1 o+(lJ'xo)=o c -> 2 l 1/4 0 0 0
,.! . s, s, s,
\..1""-'.
?{3--7{13 -2+{14x 7{3)= 7{3 _I/ +(51 x21 )--11
/3 13 713 - /13 en B XR x x, X,
\,~~
0 0 0 I l/13 0 2113
Ii"..::·:
'
The improved solution is shown in the table

114 x...
1~ 117 2/91
J: 2 x 917 I 0 0 2/13
jfa . i c. -+ 2 I 114 0 0 0
10/21 0 I 0 1/39 2/21 25/273
~---
j#~-, B x1. s2 Minimum ratio I x.,
fli"; ·:.~
CB XB is 'S SI s3
Z.-+ 2 I 1/4 55/156 8/21 95/546
XR/ X 1 Max Z=64/21
ii-- 1/4 x., 0 0 ,...0..., I 1/13 0 2113 0 c.-Z 0 0 0 -55/156 -8/21 -95/546
it
:::.;I.,
.'
0 s, 9 7 d) 0 14113 I 2/13) 9/7 -+LY
Since (c. - Z) :'S 0 for all non - basic variables, the current solution is optimal with
~t: I x., 4/3 2/3 I 0 5/39 0 -1113 2 x = f/.:,x

1 2 = '% 1,x, = 0 and
~;'.
~-
·t:
Z.-+ 213 1
c.J - zJ 4/3 0
114
0
23/156
-231156
0
0
-1/26
1/26 x,
x,
I
s,
0
x.,
0
MaximizeZ=2(7j') + i(1% 1) + ~ (0) = 6Ji 1
~
~
fEV s,
x,
0
0
I
0
0
I
!t~ •.·
1·m:.··.··
!V'l
Since (c.J - Z.)
J
> 0 for non - bask variable x1, the current solution is not optimal Choose
x 1 as incoming variable. Despite the minimum ratio for 'S variable is 0, it is not chosen
as leaving variable, as it makes key element as zero. Now choose s2 as leaving variable
i;;~ with next minimum +ve ratio. The key element is 7. The elementary row operations are
ati.
:!:.~::. •
L
i IiIL
L.
!l!
L
f,
::_
~-
....
2lta&NcLusao.Ms 1>1v,vm:Fko,., tlfi; soLuT10N'<t,:'.:P-P:iif·::>. ·
0PERA'J'IO!lli·~
... siM-PLEX·METHobttJUiLE :>> -~:- _ •. - · . . ... . ... ,: . -· . -

. 'Lll!EAR PROGRAMMING
tzj21 DUALITY IN u'NEAR'.PRQGRAMlllllJ1G
~r. .
Every linear programming problem is associated with another programming problem.

··--
. ..,~
... ~· '.
i) LPP has an alternative {or multiple) optimal solutfons: In the simplex table, at any The original problem is called Primal; while the other is called its dual. In general, ifthe
iteration, if all c.-Z {i'.e. profit) :S 0 fo~ all non-basic variables, then the solution is - optimal solution to one is known, then the optimal solution to other is readily available.
'- J J
optimum in case of maximization and if all ci-ZJ (i.e. profit) 2: O for all non-basic Duality is an important feature of the linear programming. If the primal problem
variables, then the solution is optimum in case of minimization problem. contains a large number of rows (constraints) and a small number of columns (variables),
When the solution is optimum (Le. in maximization I minimization case) and one the computational procedure can be considerably reduced by converting it into dual and
or more c-Z = 0 for one or more non-basic variables, then there exists multiple · then solved easily.
J J
optimum solution, but the value of the objective function remains unaUered.
·~.21.1 Dual problemwhen,primal is in cano'nical form
ii). LPP has no limit for the improvement of the objective function I LPP has an
unbounded solution: In a maximization LP problem, if c-Z J J < 0 for
J J > 0 {c.-Z. The general linear programming {primal) problem in the canonical form is given in the
minimization case) for a column corresponds to a non-basic variable (i.e. not in the form of
CB column) and all the entries in that column are negative or zero, then there is no Maximize z = c1x; + c2x2 + CJXJ + ................ + cnxn
minimum non negative ratio and hence no leaving variable, then the problem is said
subject to
to have unbounded solution which is due to wrong formulation of the problem.
a11x1 + a12 x2 + a,iJS + .................. + a1nxn :S bl'
iii). LPP has no feasible solution/consistency: In the final simplex table.' when all c-Z. J J a11x1 + az: K~ + azixi + .................. + a2nxn :S b2,
:S 0 (maximization case) or cJ-ZJ 2: 0 (minimization case) for all non-basic variables
indicates the optimal solution, but at least one of the artificial variables appears in the
basis (i.e. cB) with+ ve value, then there exists an infeasible solution. This is due to
the fact that no value of decision variables which satisfies all the constraints in LPP. amlxl + am2 JS+ am,JS + .................. + amnxn :S bm
2.19 ADVANTAC'.H$~S-:Oi{ LINEAR PROGRAMMING - where X 1, X2' X3.................... X 2: 0
0
I. Linear programming helps in making the optimum use of productive resources. then, the corresponding dual problem is defined as
2. Linear programming technique improves the quality of decisions. Minimize W = b1y 1+ b2y2+ b3y3 + .......... bmym
3. Linear programming technique provides possible and practical solutions since there subject to
may be other constraints operating outside the problem that must be taken into a11Y1 + a11Y2 + ai1Yi + ...................+ am1Ym2: c1,
account. a12Y1 + a12Y2 + a,2Yi + ................... +am2Ym2:c2,
4. Highlighting of bottlenecks in the production processes is the most significant
advantage of Linear programming technique.
5. Linear programming also helps in the re-evaluation of a basic plan for changing
conditions. a1 ..Y1 + a1 ..Y2 + ai1Yi + ................... + am..Ym 2: c"
On observing the above two (primal and dual) problems, the following points can be
2.20 LIMITATIONS OF LINEAR PRQ.GJIAMMING listed out;
I. Linear programming treats all relationships among decision variables as linear. I. If the primal contains n variables and m constraints, the dual will contain m variables
However, neither the objective function nor the constraints in real life situations are 4 and n constraints.
linearly related to the variables. 2. The maximization problem in the primal becomes the minimization problem in the
2. While solving an LP model, there is no guarantee of getting integer valued solutions. dual and vice versa.
3. Linear programming model does not take into account the effect of time and 3. The maximization problem has :S constraints, while the minimization problem has;::
uncertainty. constraints.
4. Parameters appearing in the model are assumed to be constant but in real life 4. The constants (i.e. coefficients) c1, c2, ..... c0 in the objective function of the primal
situations, they are frequently neither known nor constant. appears as RHS of constraints in the dual.
5. Linear programming deals with only single objective, wher-eas in real life situations 5. The constants {i.e. RHS) b1, b2, ...... bm in the constraints of the primal appears as the
we may come across conflicting multi-objective problems. . coefficients of the objective function in the dual.
Ff'
~~
-.6. The variables in both the problems are non-negative.

OPERATIONS REs~CH
Lmw PR00RAJ01mo
MinimizeW=IOy 1 +2y 2 +6y 3

subject to
..
The relationship of the primal and its dual constraints is represented in a table shown
below. · Y1 +2Y2 + 2yi ~I
Primal constraints ---+ Along the rows Y1-Y2-2Yi ~-1
Dual constraint~ ---+Along the columi:is Y1 -y2 -3y 3 ~3and
.. Y1 ,Y2,Yi ~O
Y1 a,, a,, a,, a, .. :S bl Note:- The constraints of the dual are obtained by replacing the primal variables in
Y2 a,, a,, a,, a, .. :S b2 the constraints column by the dual variables keeping the co-efficient of those same.
Yi a,, a,, a" a, .. :S bl 23. Write the dual of the following LP problem
MinimizeZ=3x 1 - 2x~ + 4x 3
subjectto3x 1 +5x 2 +4x 3 :2'.7
Ym a... a.. , aml a.... :S bm 6x 1 +x 2 +3x 3 :2:4

2: c 1 2: c 2 2: c3 2: c 11
7x 1 -2x 2 -x 3 :>;10
i~' Note: If the i111 primal constraint is of equality (i.e.=) type, then i111 dual variable is x 1 -2x 2 +5x 3 ~3
r'' :~
unrestricted in sign and vice-versa 4x 1 + 7x 2 - 2x 3 ~ 2and

...~-:-:
,
L SOLVED PROBLEMS XpX 2 ,X 3 :2:0
LI
11:;;;: .. Sol. Since the given LPP (i.e. primal) has minimized objective function, all constraints
22. Write the dual of the following LPP
fi
~:.
MaximizeZ=x 1 -x 2 +3x 3 must have ~ symbol. But the constraints (3) has S symbol. Hence, multiply it
thorough out by -1 to convert S to~ symbol
subjecttox 1 + X 2 + X 3 Sl0
.
'¥~ .•
-7x 1 +2x2 + x3 ~ -10
§:- 2x 1 - X 2 -X 3 :>;2 From the keen observation of the primal, the following conclusions have been drawn
I ·.·
~"
f.t:. 2x 1 - 2x 2 -3x 3 :>;6and for its dual.

m= No. of variables= 5;
i~
~;;,.~
Sol.
X 1 ,X 2 ,x 3 :>;0
The relationship between the primal and its dual are shown below
n = No. of constraints = 3;
The objective function is of maximization type, the co-efficient of the objective
Primal Dual function are c1=7, c2=4, c3 =-I 0, c4 = 3 and c5 =2 respectively.
!!~.·_ c
~;;;
i) n = No. of variables in the objective i) m =No. of variables in the objective The RHS of the constraints are b1=3, b2=-2 and b3=4 respectively.
!:!!'" function =3 function =3 Let yi.'y2,y3 , y4 and y5 be the dual variables, then the dual problem is given by
~: ii) m =No. of constraints =3 ii) n =No. of constraints =3 MaximizeW=7y 1 +4y 2 -10y 3 +3y 4 +2y 5
~-1
.pj.d
iii) Objective function is of maximization iii) Objective function is of minimization subjectto3y 1 +6y 2 - 7y 3 + y4 +4y 5 :>;3
11
ii~
type i.e .. Max Z
iv) The constraints have::; symbol
type i.e .. Min W
iv) The constraints must have~ symbol
5y 1 + y2 +2y 1 -2y 4 +7y 5 :s;-2
4y 1 +3y 2 +y 3 +5y 4 -2y 5 ::>4and
- v) The coefficient of the variables in the v) The RHS of the constraints are b1 = 1,
o
Y1>Y2,Yi.Y4.Ys ~O
IrE::·:: objective function are c1= I. c2=- l and c, b2 =-I and b3 = 3 respectively
24.
!h =3 Find the optimal value Z of the following LPP by inspecting its dual only (do not
~' vi) The RHS of the constraints are vi) The co-efficients of the variables in solve it)
lie
1i_ b1=IO,b 2 = 2 and b3=6 the objective function are c1=I 0, c2=2 MinimizeZ=4x 1 +5x 2 +3x 3 +4x 4
i.
!:::· and c.=6 respectively. subject to2x 1 +6x 2+3x 3 -4x 4 ~50
L Let y 1, y2 and y3 be the dual variables, then the dual problem is giv~n by
ii:: XpX 2,X 3,X 4 2!0
;... July 2007(5M)
±:.
ms .i "I"·-"
In the dual,
...::: OPER&nol'fS REsEARCH
Sol. Here, the objective is to write the objective function of the dual and its constraints.
:'~~Paoo~o
Sol. In the dual problem,
i) m = 4 i.e. No. of variables.
ii) n = 2 i.e. No. of constraints.
..
i) m = I variable;
iii) The objective function is of minimization type
ii) n = 4 constraints;
iv) The constraints should be of~ type
iii) objective function is of maximization type.
v) c1 = 10, c2 =6, c3 =2, c4=1
iv) The constriants are of~ type.
vi) RHS of dual constraints are b1 = 2 & b2 = I
v)c 1 =50
Let y1, y2,Y 3 and y4 be the dual variables, then the dual problem is
vi) b1 = 4, b2 = 5 , b3 = 3 and b4 = 4;
MinimizeW=IOy 1 +6y 2 +2y 3 +y 4 •
Let y 1 be the dual variable, then the dual problem is
MaximizeW=50y 1 subject toy, + y2 +Yi+ Y4 ~2
subject to 2y 1 s4 2y 1 +y 2 +y 3 -2y 4 :?:1 and
y,,y2,Y3,y4.~o
6y 1 ss
3y, s3 27. Consider the following LPP
-4y 1 s4and Max Z=Sx, -6x 2 +12x 3
y, ~o. su6jecttoconstraintx 1 +3x 2 +3x 3 s90andx"x 2 ,x 3 ,:?:0
Find the optimal value Z of the following LPP by inspecting its dual only (don i) Find all basic solutions and thus obtain the optimum solution.
25.
ii) Find the optimum solution by simplex method.
not solve it)
. i iii) Write the dual for the given primal. July 2018 (lOM)
Maximize Z = I Ox, + 4x2 + 5x3
.r·;
I
Sol. In the given problem,
subject to Sx 1 - 7x 2 +3x 3 ~100
n = 3 i.e .. No. of variables.
x1, x2, x3 ~ 0. Jan 2009 (5 M)
m = I i.e .. No: of constraints.
i'
/..·
:. (n-m) = (3-1) =2 variables must be zero.
~::: i) m = I No. variable;
~-; Total number cif basic solutions are
1:::-: ii) n = 3 No. constraints;
iii) c, = 100;. "C =~
iv) b1 = I0, b2 = 4 and b3 = 5; mm!(n -m)!
.4..:..:
v) The objective function is of minimization type. -. 2
"I
Jc =_:.:__=.:2_=3
vi) Constraints should be of~ type. . I (!2! (x2
Let y 1 be the dual variable, then the dual problem is Case I :
Minimize W = I OOy 1 Let x1 and x2 be the non basic variables and x3is the basic variable.
subject to Sy 1 2:: I0 From the constraint equation,
j
-7y, ~ 4 0+(0)+3x3 =90
J 3y 1 2::5and X3 =30
Y, 2:: 0
l· Max Z = 5(0) - 6(0) + 12 x 30 = 360
26. Write the dual of the given problem. • April 2018(5M) Case 2:
Maximize Z=2x 1 + x2 Let ~and x3 be the non basic variables and x, is the basic variable.
subjecttoconstraints x, + 2x 2 :5:!-0 From the constraint equation,
x, + 3(0) + 3(0) = 90, then
x,+x 2 :5:6
x, =90
X1 +x 2 :5:2 Max Z = 5(90)- 6(0) + 12(0) = 450
x, -2x 2 :5:1 and Case3:
x,x 2 ~0.
Let x1 and ~ be the non basic variables and is is the basic variable.
" From the constraint equation,
·:;;;;,. ·.· .t~,;~~f };f~9J.:•1~EAR.ca L~PRoCi~6:·· ··}~..-i-~::· r.,.~·:;\:\~f '~~--~ =·:;: . .·
0+3~ + 3(0) =90 Following points have been extracted from the keen observation of the primal to
is =30 write its dual.
:. Max Z = 5(0)- 6(30') + 12(0) = -180 i) m =No. of variables= 2;
The optimal solution is Max Z = 450 ii) n =No. of constraints= 3;
iii) The co-efficient of the objective function of the dual are c1 = 7 and c2=3
Optimum solution by simplex method respectively.
iv) The RHS of the dual constraints are b1=3, b2=10 and b3=2 respectively.
Convert in~uality constraint into equation by adding a slack variable.
v) The objective function should .be of minimization type
.".X 1+3x 2 +3x 3 +S1=90 ........ (1) Let y1and y2 and y2 be the dual variables. Since y2 is unrestricted in sign is expressed
Then,MaxZ=5x1-6x 2+12x 3 +Os,· ........ (2) as the difference of two non negative variables y'2 and y"2 i.e .. y2= y'2-y2"
The dual objective function can be written as
Here,n=4;
Minimize W = 7y1+ 3(y 12 -y 11 2)
;
I m=I; subject to
i· :.(n -m )=( 4-1)= 3variablesmust be equal to zero 2yl +3(y~ -y~1 )2:3
Let x1 = x2 =x 3 =O;} Non basic variables
3y,-2(y~ -y~').2:10
S1=90;basicvariable
2y1+4(y~ -y~ 1 ) 2: 2and
:. Max Z=O(i.e.from equation 2)
J ypy~.y~l 2:0
Dual for the primal
~ i) m = I i.e. Number of Variables Substituting( y~ -y~1 )=y 2 , where y 2is unrestricted in sign, the dual problem becomes,
~·
~ ii) n = 3 i.e. Number of constraints MinimizeW=7y1+3y 2
~i·,,. iii) c1 = 90
subject to.
, iv) b1= 5, b2=-6 and b3 = 12
..
v) The objective function should be of minimization type & constra~nt must have ;:>symbol. 2y, +3y2 2:3
''; Let y1be the dual variables, then the dual problem is Jy, -2y2 2:10
',
g,:
minimize W=90y 1 2y 1 +4y 2 2:2and
!IE· subject to y12:0,y 2 is unrestricted in sign.
Irr-:.
ii:~ Y1:2:5 29. Construct the dual of the primal problem
it Y1 :2:-6 MaximizeZ=2x 1 + x2 + x3
II,
~·
28.
y1:2:12 and
Y1 ·Y2 ,y] :2:0
Write the dual oftbe following LP problem
MaximizeZ=3x1+ l0x 2 +2x 3
subject to x1 + x2+ x3 2: 6
3x 1 -2x 2+3x 3 = 3 ·
-4x 1 +3x 2 -6x 3 =land
XpX 2 ,X 3 ,2:0
IE subject to 2x1+3x 2 + 2x 3 ::;;; 7 • Sol. Since the given objective function is of maximization type, all constraints should
1.:.~.
have:::: symbol. But constraint (I) has~ symbol, hence, multiply it through out by - I
tl
3x 1-2x 2 +4x 3 =3 and
to convert it into constraints of:::: type. In addition to this, constraints (2) and (3) are
X1,X 2,X 3 :2:0
in the form of equations. So the znd and Yd dual variables must be unrestricted in sign.
Sol. Since the objective function is of maximization type, all constraints should have The resultant constraint I is
:::: symbol. But, the constraint (2) has = symbol. Hence 2nc1 dual variable must be -x 1 -x2 -x 3 :S-6
( unrestricted in sign. i) m = 3 i.e .. No. of dual variables;
I
It
-~'.
ii) n = 3 i.e .. No. of constraints;
-' .•.·, "~{~cb~cu
iii) The objective function should be of minimization type

~fl.if~~®RAl!IMlllG·
MinimizeZ=3x 1-2x 2+( x; -x;1)
....
,.,
iv) The co-efficients_ of the dual variables in the objective function are c =-6, c =3
1 2
subjectto - 2x 1+ 3x 2 - ( x~ - x; 1) ~ - 5
and c3=1. • ·
4x 1 -2x 2 ~9
v) The RHS of the dual constraints are b1=2, b2=1 and b =l.
1 3
Let yPy~,y~ ,y~ and yi are the dual variables then the dual problem is -8x1+4x 2 +3( x; - x;1) = 8
1
Minimize W=-6y 1+3(y~ -y~ 1 )+(y; -y:') Let y1, y2 and y3 be the dual variables. As per the data, constraints (3) is in the fonn
of equation, hence the dual variable y3 must be unrestricted in sign
subje_ctto-y1+3(y~ -y~ )-4(y; -y;1) ~2
1
:. Yi =y;-y;'
-y,-2(y~ -y~ 1 )+3(y~ -yi 1 )~1 Now, the dual problem becomes
-y1+J(y~ -y~ )-6(y; -yn~1and
1
MaximizeW=-5y 1+9y 2 +8(y; -yn
Y1,y~,y~1,y~,y~1 ~0. subjectto-2y 1 +4y 2 -8{yi -y~ 1 )s3
Nowsubstituting(y~ -yn = y2and(y~ -yn = Y;, where 3y 1 -2y 2 +4(y; -yi1)s9
y2and y3 are both unrestricted in sign, then -y, +3(y;-y;1)=l
MinimizeW=-6y 1+3y 2 + Y3
Note : The constraint. (3) is in the form of equation, because the primal variable~
subjectto-y 1 +3y 2 -4y 3 ~2
is unrestricted.
-y1-2Y2+3yi~l Now,subst_itute{ y; - y; 1) = y3 , where y 3 is unrestricted in sign
-y1 +3y2 -6yi ~I
:.Maximize W=-Sy1+9y 2 +8y 3
y1 ~ 0, y2 and y3 unrestricted in sign.
subjectto-2y1+4y 2 -8y 3 s3
30. Obtain the dual of the following primal problem 3y 1 -2y 2 +4y 3 s9
MinimizeZ=Jx; -2x 2 + X 3 -y1+3y 3 =I and
subject to2x 1-3x 2 + x3 s5 yPy 2 ~O,y 3 is unrestricted.
4x 1-2x 2 ~9
31. Write the dual of below given primal LP problem May 2017(4M)
-8x 1+4x 2+3x 3 =8
MinZ=x 1 +x 2+x 3
xP x2 ~ 0, x3 is unrestricted
subjecttoconstraintsx 1 -3xi +4x 3 =5
Sol. Change the constraint (2) of :S type to?: type by multiplying through out by -1 x 1 -2x 2 s3
. :. - 2x 1+ 3x2- x3 ?: -5
Here 2x 2 -x 3 ~4
i)m =3 x"x 2>0; x3 unrestricted

ii) n = 3
Sol. Since the constraint (2) of the primal is of :S type, convert it into?: type by multiplying
iii)tThe co efficients of the dual variables in the objective function are c = -5, c =9 throughout it by - I
and c3 = 8 1 2
:. -x 1 + 2Xz ?:-3
iv) The RHS of the dual constraints are b1 = 3, b2 = -2 and b3 =I
Asx 3 is unrestricted, it isexpressedasx 3 = ( xi-x;1)
v) The objective function is maximization type.
Since the primal variable~ is unrestricted, take~= x\-x/ 1 The constraints become
:.The primal problem becomes
x1 -3x 2 +4( x~ -x; )=5
1
-x 1 +2x 2 +o(x;-xn~-3
-
If:;
1i
~
.. Ox 1 +2x 2 -(x:-x: )~4 1
·. ·. '.l)~~'iii~oa ~~EA!i, ,PRoo~q~t/· ::<
1
subjectto-(x:-x: )+2x 2 -3x 1 ~-IO
1
'~i1M~:}:; ;)-
Since constraint {I) of primal is of equation type, the dual variable Iis unrestricted in sign 3(x:-x: )+Sx 2 -x 1 ;:::9
In the dual problem;'
-(x:-x:')-4x 2 +x 3 =6
i)m=3i.e.No.ofvariables.
x:,x: ,x 2 ,x 3 ~0
1
ii) n =3 i.e. No.of constriants.

In the dual problem,
iii)Theobjectivefunction is of maximization type with the constraints of :s;type
iv)c1 =5,c2=3,c1 =4; i)m= No.ofvariable=3;
~ ! ii) n =No. of constraint=3;
'.':: v)b 1 =l,b 2 =landb 3 =I;
I;'.·· iii) The objective function should be of maximization type.
rt~~ Lety"y2andy 3 bethedual variables, but y3 =(y~ -y: 1),as theprimalconstraint(l)
j.,J,~.·~,
iv)Allconstraintsshould be of :s;type.
i:(:H· is of equation type. The dual problem becomes
I :~:· • v)c 1 =-IO,c 2 =9&c3 =6
~:L MaximizeW:Sy1 +3y2 +4(y; -y; 1 ) vi)b 1 =3,b 2 =1andb3 =-7
l,'f::,. subject toy 1 -y 2 :s;I
Since constraint ( 3) is of equation type, the dual variable y3 is written as y3 =( y~ -y~ 1 )
·.~!-;,,.
'.:.;-:.:.:;"
~~:t -3y, +2y2 +2(y; -y;1 ) :s;J 1
:;i.;~
Let y 1,y 2,y 3 andy~ 1 arethedualvariables,then the dual problem is
§' 4y 1 -(y; -y~')=l(':x 3 isunrestricted)
r•:.r ...
MaximizeW=-IOy 1 +9y 2 +6(y:-y: 1)
l.Lla..
~- .l substitute{y;-y; 1 )=y1
subjectto-y 1 +3y 2 -3(y~ -y~ 1 )=3( ·:x 1 is unrestricted)
Then, Maximize W =Sy 1 +3y+4y 3
subjecttoy1 -y 2 :s;I
2y,+5y2-4(y~-y~):s;1
-3yl -y2 +(y:-y~ ):s;-7
1
-3y1 +2y2 +2y1 :s;I
4y 1 -y3 :s; and Now,substitute(y~ -y~ 1 )=y3 , then
Y" y 2 > O; y3 is unrestricted.
.--
Maximize W =-IOy1 +9y2 +6y 3
32. Write the dual for the following primal subject to- y1 +3y2 -3y3 =3
MinimizeZ=3x 1 +x 2 - 7x 3 2y 1 +5y2-4y1 :s;I
E: subject to x1 -2x 2 +3x 1 :s;IO -3y 1 -y2 +y 3 :s;-7and
~
IIf
3x 1 +5x 2 -x 1 ;:::9 y., y 2 2: O; y3 is unrestricted.
-X 1 -4X 2 +X3 =6
33. Show that both the primal and the dual of the following LPP have the same
x 1 unrestricted, x2 , x3 ;:::o optimal Zand the solution can be read from the primal solution.
Feb 2006(6M)
i:=;.. Sol. Convert the constraint (I) of~ type into:'.". type by multiplying it throughout by- I. Maximize Z = 2x 1 + x2
sa:· -x 1 +~ 2 -3x 3 2:-10 subject to constraint x1+sx;; JO
x1+3x;s 6
Sincex 1 isunrestrictedinsign,expressx 1 =x: -x: 1•
2x 1 + 2~58 l).nd
il
The primal problem becomes x1, ~ :S 0 June 2012(15 M)
MinimizeZ=3{x:-x: 1)+x 2 -7x 1 Sol.
a:,__
IBt,i OPERA.nol'islb:sE.\RcH
'.. ...
~ ..
The dual for the primal must have

K Kev El K
i) m= No.ofvariables=3; ,,. v v u
ii) n=No.ofcoristraints=2; "· ' I . V/ 1YJ.UIUUWH
B ~ x, /.,I
S, S, s, I
ratioxJx
iii) The objective function of minimization type.
CR
0 ' s 10 rr Is 1 0 of 10/l=_IO
iv) The constraints of<:: type. · 0 s, 6 1 3 0 I .P 6/1=6
v)c 1 =IO,c 2 =64,andc 3 =8; 0 8 ((2) 2 0 0 l) 812=4 --+LV
SJ
vi)b 1 =2andb 2 =l; MaxZ=O Z.--+ 0 0 0 0 0
Let y"y 2 and yJ.bethedual variables, then the dual problem is· 2
c-Z.
J J I 0 0 0
MinimizeW =lOy1 +6y 2 +8yJ fEV
subjecttoy1 +y 2 ·+2yJ <::2 Since (c.J - Z.) > 0 for the non basic variables, the current solution is not optimal.
J
5y 1 +3y 2 +2y 3 ~l and x1 is the incoming variable

SJ is the leaving variables
Y1>Y2·Yi ~O 2 is the key element
Solution of the primal using simplex method The elementary row operations required to obtain improved simplex table are
i. Express the given problem is in standard form
Convert all in equality constraints into equations
~(new)=~(old)/21 ~(new)=~(old)-~(new) I R 1 (new)=R 1 (old)-~(new)
8/2=4 6-4=2 l 0-4=6
x1 +5x 2 +S,=10 ......... (1) 2/2=1 l-1=0 1-1=0
x1 +3x 2 +S 2 =6 ......... (2) 2/2=1 3-1=2 5-1=4
2x 1 +2x 2 +SJ=8 ......... (3) and 1 0/2=0 0-0=0 1-0=l
,
MaximizeZ=2x 1 +x 2 + OS 1 + OS 2 + OSJ 012=0 1-0=1 0-0=0
........ (4)
1/2= 1/2 0-1/2=-l/2 0-1/2=-l/2
ii. Obtain initial base feasible solution
Letn=S; The improved solution is shown in the table
m=3; c.--+ 2 0 0 0
( n - m)=( 5 -3)=2 variables must be equal to zero.
CR B XR x x., s s, S,
0 s 6 0 4 l 0 -1/2
Let x 1 =x 2 =0;) Non basic variables.
0 s, 2· 0 2 0 l -112
s =10) 2 x 4 l 1 0 0 1/2
S~ =6 Basic variables. MaxZ = 8 ., Z.--+ 2 2 0 0 I
S3 =8 c.-Z. 0 -1 0 0 -1
:.MaximizeZ=O Since (ci - zJ~;: Ofor all non basic varialbes, the current solution is optimal with
iii) Constraint simplex table and test optimally test x 1 =4,x 2 =0 and
MaxZ=2(4)+ 1(0)=8
In the{ cJ - zJ values of slack variables in the final simplex table are
S1 = 0, S1 = 0 and SJ = -1 which indicates the values of dual variables y1, y2 and yJ
respectively
S, =0= Y1
S2 =0= Y2
Pih
S3 =+ l=y 3 (ignoring-sign)
OPERATIONS REsEARCH
LlriAR PR.oGRAMMll'lG
Let x1 =x 2 =0} Non basic variables
,,.
The optimal value of Zfor the dual problem is
1
Minimize W=l0(0)+6(0)+8(1) S =10l
S2 =6
Minimize W =8 Basic variabfS
S3 =2
34. Write the dual for the following LPP. Solve the primal and read the solution of 84 =I
both primal and dual problems. :.Maximize Z=O
Maximize Z = 2x 1 + x2
subject to constraint x 1 + 2 x2 S 10 iii. Construct simplex table and test for optimality
x 1 +x 2 S6
Kev column Kev Element K·
x1 - x2 S 2 C.-> 2 I 1 0 0 0 0 'j Minimum
x 1 - 2x2 S 1 and c~ B x~ x, x.,J S, S, S, s. ratio x0 /x 1
x1, x2 2: 0 Dec 2010 (20M) 0 s, IO 1 I t 0 0 of 10/I = IO
0 s, 6 I /1 0 I 0 6/1=6
i) m = 4 No. variables;
ii) n = 2 No. constraints;
iii) The objective function should be of minimization type.
0
0
S,
s.
2
I
I
I
I/ -I
-2 0
0 0
0
1
0
"
Jo
I)
2/1=2
1/1 =I ->LY
15-": iv) The constraints should be of:::: type. MaxZ = 0 z ---- 0 0 0. 0 0 0 0

~:.
..
J'
;r
,..__- ·,_
v) c1 = 10, c2 = 6 c3= 2 and c4 = I;
vi) b1= 2 and b2 = l; C. - Z
J J
2
jEV
I 0 0 0 0
ii>i••·
!!j< Let y 1, y2 , yJ and y4 be the dual variables, then the dual problem is
~ Minimize W = 10 y 1 + 6y2 + 2y3 + Y4 Since (ci - Z) > 0 for non basic variables, the solution is not optimal.
l!,; subject to x 1 is the incoming variable.
~ Y1 + Y2 + Y) + Y4 2'.. 2
84 is the leaving variable.
I~:i_
!!~-;
2y 1 + y2 - y3- 2y4 :::: I and I is the key element.

'-! The elementary row operations required are
Y1• Y2' Yi' Y. 2: 0.
R,(ncw) = R3 (old)- R.(ncw) R2 (new)= R2(old)- R, (new) R1 (new)= R1(old) - R, (new)
Solution for primal by simplex method
== 2-1 =I 6-1=5 10-1=9
f
Convert all inequality constraints into equations by adding slack variables 1-1 =O 1-1=0 1-1=0
ii x 1 +2x 2 +S 1 =IO ..... (1) -1-(-2) =I 1-(-2)=3 2-(-2) =4
if: X1 +x 2 +S 2 =6 ..... (2) 0-0=0
0-0=0
0-0=0
1-0=1
1-0=1
0-0=0
If
~<
x 1 -x 2 +S3 =2 ..... (3)
1 - 0 =I 0-0=0 0- 0 = 0
flj·- ..:;_. x 1 -2x 2 +S 4 =1 ..... (4) 0-1=-I 0-1=-I 0-1=-1
-
-~
The objective function in standard from is written as
MaximizeZ=2x 1 +x 2 +OS1 +OS2 +083 +084 ..... (5) CR B
C.->
x"A
2
x,
0 0
x, S, s,
0
s,
0
S,
Mm1mum
ratio x/x 2
1 ::.·
-"-
!f'.!'
a;!:"
ii. Obtain initial basic feasible solution
Letn =6;
m=4;
0
0
0
s
S,
s,
9
5
I
0
0
0
4
I
1 0
3 0 1
0 0
0
0
I
-I
-I
-1 1 i;1
914
513
=I -. LV
~ ( n - m)=( 6- 4)=2 variablesmustbeequaltozero 2 x, [ 1 -2 0 0 0 1 -

I! Max Z=2 z_, 2 -4 0 0 0 2
Ii
Ii:__
c-ZJ
I
0 5
-tC'T
0 0 0 -2
,.
I
..
As(<:J.- Z)J
x2 is the incoming variable
;~iii~!~~E!-:
> 0 for non basic variable ":i ,the current solution is not optimal
:}~j-a~~i9/ ~: ,;_ .:g{l~J~~~~~-f.:W~~~~~~~:~:J~t-
cc B
c
x.,
2
x, . x
0
s
0
S,
0
S,
0
s
s3 is the leaving variable
I I is the key element · 0 s 2 0 0 l ~312 l/2 0
.I The elementary row operations required are 0 s. I 0 0 0 112 -3/2 1
R4 (new)= R4 (old)+ 2 · Rz (new)= Rz (old) . R1 (new)= R1 (old) I x, 2 0 I 0 1/2 -112 ' 0
·.;.
R., (new) JR,(new) -4 R., (new) 2 x 4 I 0 0 1/2 l/2 0
~:
1+(2Xl)=3 5-(3xl) =2 9-(4XI) =5 MaxZ =10 Z.-+ 2 l 0 3/2 l/2 0
,._,
I+ {2xO)=I 0-(3xO) = 0 0 -(4xO) =O c.-Z. 0 0 o. -312 -1/2 0
i. ~2+(2x l)=O 3-(3x l)=O 4-(4X ()=0 Since (c.-Z.)
J J
:S 0 for all non basic variables, the current solution
.•
is optimal with x1=4,
.j
O+(fxO)=O 0-(3x0) =O l-(4xO)=l is=2 and Max Z = (2x4)+(1 x2)=10

, ~.
In the final/ optimal simplex table for the primal, the (c; - Z) values of the slack
:t 0+(2xO)=O 1-(3xO) =I 0-(4xO)=O
variables ignoring the sign represents the optimal values Qf the dual variables:
0+(2x 1)=2 0-(3x l)=-3 0-(4x l)=-4 i.e. S 1 =0 = y 1
·., I+(2x- I)=- I -l-(3x-J) =2 -1-(4x- l) =3 S2 = +3/2 = y2
;,r,
:y The improved solution is shown in table S3 = +112 = y 3

c. 2 •I 0 0 0 0 Minimum s4 = o=Y4
;;,·.
"
en B Xn x x, s s, S, s. ratio x/S4 The optimal value of the objective function of the dual is
Minimize W = 10(0) + 6(3/2) +2(1/2) +I x (0)
·i.~-~· 0 S, 5 0 0 I 0 -4 ~3-- 513
Minimize W= 0 + 9 + l +O
0 S, 2 ( 0 0 0 I -3 (2 2/2=1 Minimize W = I0 = Maximize Z
"-
~:_: I x, 1, 0 I 0 0 2 -1 - Solve the following LPP by Big M method Dec 2011 (ISM)
~!: 2 x 3 I 0 0 0 I -L - Minimize Z =-Sis
~;~ Max _,,
... subject to the constraints x 1 - is?: 0
~~i Z.-+ 2 I 0 0 5
Z=7 J 2x1 + Jis :S -6 and
rt; '
lOi..
3 X1,Xz are unrestricted.
~--~
~_:_! (c;-Z) 0 0 0 0 -5 i) Express the problem in standard form
tEV
~ Since the given objective function is of minimization type, all constraints should be
s4 is the incoming variable. of?: type. Multiply the constraint (2) throughout by-I to convert it into?: type
£:. s2 is the leaving variable. -2x1 - Jis?: 6
ti 2 is the key element. The variable x 1 and x2 are unrestricted type, express x1 and is as the difference of two
""'
~'~" The elementary row operations required are non negative variables.
~ R1(new)=R 1(old}- J\(new) =~(old)+ R4(new)= :.x 1 =x: -x: andx 2 =x~ -x~ 1
1
Ri<new) =
fi _ _ R,(old)/2 3R.,(new) R.,(new) R,( old)+R.,(new)
Now, the objective function is
~~· 2/2=1 5-(3x 1)=2 1+1=2 3+1=4
~.:__
MinimizeZ=-8( x~ -x~ 1 ) 0
......... _ 0/2=0 0-(3xO)=O O+o=O 1+0=1

~·
,,.. 0/2=0 0-(3xO)=O l+o=I O+o=O subjecttoconstraints( x: -x:')-( x~ -x~ 1 )<:O ·
...
r:·
0/2=0 1-(JxO)=I O+o=O O+o=O -2(x:-x: 1 )-3(x~ -x~ )<:6
1
"
!!:".
ITT 1/2=1/2 0-(Jx l/2)=-3/2 O+l/2=1/2 O+l/2=1/2
x:,x: .x~,x~ <!O
1 1
tE- i
i
-3/2=-3/2
2/2=1
-4-(3x-J/2)=1/2
3-(3xl)=O
1-3/2=-l/2
The improved solution is shown in table below

-l+l=O
2-3/2=1/2
-l+l=O Convert all inequality constraints into equations by adding artificial variables and
subtracting the surlpus variables.
i,
IU
_,._J
; ....
-
(x:-=-x:')-(x~ -x~')+A 1 =S 1 =0
OPERATIONS REsEARCH
........ (1)
LINEAR PROGRAMMING
8
c
XR
0
x' I
0
x''
-8
x'
8 • 0
x" S,
0
s,
M Min ratio _
A, ~Ix'\
...
c"
:-2(x:-x:1)-3(x~ -?'~')+A 2 -S 2 =6 ........ (2) 8 x"
'
0 +I r-n' -I
'
I
'
-1 0 0
MinimizeZ=Ox: -ox: I - 8x~ + 8x~ +OS, + os2 =t-MA, + MA2
1
........ (3) ' M A, 6 -5 IC'\11 0 0 3 -ll I 615 -+LY
- -
ii) Obtain initial basic feasible solution MinZ

Z-+ 8-5M 5M-8 -8 +8 3M-8 -M M
Let n = 8; =6M J
m=2; 8-5M
c.-Z. 5M-8 0 0 8-3M M 0
(n-m) = (8 - 2) = 6 variables must be zero J J jEV
Let x: = x:' =x~ =x~' = S, = S2 = O}Non- basic variables As( ci -zJ~:;:Ofornon basic variables, the current solution is not optimal
A,= OandA 2 = 6} Basic variables
:.MinimizeZ =6M
x: is thejncoming variable.
1
A2 is the leaving variable.

iii) Construct simplex table and test for optimally
Key colurpn Key Element Key row
c.-o r/
-8 s o 0 I M M
R, (new)= R, (old) /5 R,(new) = R, (old)+ R, (new)
··~:
...,.
~
CB B XB x' I ji, x' 2 x7 s, s,
I Az
Min ratio
x/x 1, 6/5 = 6/5 0+6/5 = 615
!k
i M A, 0 lI -I -I l J)) -1 0 I 01 0/1=0 -+ LV -515 =-I l+(-1) = 0
;!; ..
M A, 6 -2 2 -3 l3 J 0 -t 0 I 613=2 515 =I -1+1 =O
iii'.; --
MinZ
Z-+ -M M -4M +4M -M -M M M
015 =O -1+0 = -1
=6M J
015 = 0 I+O= I
_·
-4M+8 3/5 = 315 - I+(3/5) = -215
c.-Z. M -M 4M-8 M M 0 0
e---_'
J J jEV
~"' -1/5 = -115 0+(-115) = -1/5
As (c.J -Z.)J < 0 for few non basic variables, the current solution is not optimal. Then The improved solution is shown in table
x~ is the incoming variable
1
l-- -
c.-+ 0 0 -8 8 0 0
A, is the leaving variable c. B x~ x, x", x' x'', S, S,
'
'
I is the key element 8 ·x", 615 0 0 -l 1 -215 -1/5
·i-,_-
The elementary row operations required are 0 x" 615 -1 1 0 0 3/5 -115
'
R2 (new)=R 2 (old)-3R 1 (new) MinZ
Z.-+ 0 0 -8 8 -16/5 -815
- 6-(3x0)=6 =4815 J
: c-Z 0 0 0 0 16/5 815

-2-(3xl)=-5
-
EE-
-
Since (crZ) 2: 0 for all non basic variables, the current solution is optimal
2-(3x-1)=5
l!b withx: 1 =,%',x~1 =,%'andMinimizeZ=-8(o-_%')=4Ys •
-3-(3x-l)=O
1,.;
1'
-
---
__
3-{3x+1)=0
0-{3x-1)=3
-1-(3x0)=-I
I '
1-(3x0)= l
'
The improved solution is shown in table.
BL
-
~-2<~Q~~~1$~~~~lfilt§Jl~ti·4\~~~~~~~/::~:.:;_:t . ·
:~ ~~\'t,t~.,~-'.t;t~~EAifu~.
The simplex method generally starts with a basic feasible solution and is terminated
,.-_'.:"."
LlllEAR PROGRAHMlllG
36.
SOLVED- PROBLEMS
Solve by dual simplex method the following problem
..
July 2016 (12M)
as soon as an optimal solution
-i
is reached i.e. the procedure is stopped when all c.J - zJ <
-
0 MinimizeZ=2x 1 +2x 2 +4x 3
for maximization problem and c. - Zi ~ 0 for minimization problem. When one or more subject to 2x 1 + 3x 2 + Sx 3 ~2
solution values (i.e. x8 ) are negative and optimality condition c.J -z.J both for maximization
3x 1 +x 2 +7xJ S:3
and minimization is satisfied, then current optimal solution may not be feasible. The dual
simplex method is used with a basic infeasible but optimal solution and works towards x1 + 4x 2 + 6x 3 s:S
feasibility, (i.e. x8 i ~ 0 for all i) x1,x 2 ,x 3 ;:::0
The steps involved in dual simplex method are shown below: Sol. i) Express the given probtcm in the standard form
I. Convert the given problem int() maximization problem, if it is of minimization type. Since the given problem is of minimization type, convert it into maximization type
2. Convert ~ type constraints, if any, into '.S type by multiplying both sides of such by multiplying the objective function throughout by - I
constraints by minus I. :. Maximize (-Z) =-2x 1-2x2-4x,
3. Convert inequality constraints into equations by the addition of slack variables and Maximize W =-2xt2x 2-4x,
Convert constraint (I) is of maximization type, into minimization type by multiplying
obtain the initial basic solution. Enter the basic solution in the dual simplex table.
throughout by - I and then express all constraints into equation by adding slack
4. Compute CJ - zj for every column. variables
i) If all (ci -Z)::::; 0 and all x8 i are non-negative, the solution is optimal basic feasible -2x 1 -3x 2 -5x 3 s:-2
solution.
:.-2x 1 -3x 2 -5x 3 +s 1 = -2 .. .... (!)
ii) lf all (ci -Z) '.S 0 and at least one x8 i is negative, then go to step 5.
3x 1 + x 2 + 7x 3 + s2 = 3 ...... (2)
iii) If any (c. - Z.) > 0 i.e. positive, the method fails.
J J
5. Select the row that contains the most negative x8 ;. This row is called the key row or x1 +4x 2 + 6x 3 +s 3 =5 ...... (3)
pivot row. The corresponding basic variable leaves the current solution. Theobjective function can be written as
6. Look at the elements in the key row, Maximize W= -2x 1 - 2~ 2 - 4x 3 + Os 1 + Os 2 + Os 3 .. .... (4)
i) If all elements are non-negative, the problem does not have a feasible solution. ii) Obtain initial basic feasible solution
-- ii) If at least one element is negative, find the ratios of the corresponding element of Let n =6
ci - Zi row to th_ese elements. Ignore the ratios associated ,with positive or zero m=3
elements of the key row. Choose the smallest of these ratios. The corresponding
column is the key column and the associated variable is the entering variable. ( n - m)=( 6-3)= 3variables must be zero.
Mark the key element. Let x1 = x2 = x, =O} Non - basic variables.
7. Make the key. element unity (i.e. I), carry-out the row operations as in the regular
simplex method and repeat iterations until either an optimal solution is obtained in a SI=-21
s2 = 3 Basic variables
finite number of steps or there is an indication of non-exis_tence of a feasible solution.
s, =5
SinceS 1 =~2(i.e.negative ), the solution is infeasible.
iii) Construct the dual simplex table
r.;. ...
;.;.:-
L
r
..... OPERATIONS REsEARCH
Key element
L.µy~tJl.ioolWllUllo .
Sinc_~_alL{£rZ)S 0 for all non basic variable arid all
is optimal with is = 2/3 , x1 =O is=O and
., .
tfR
"a are +ve, the current solution
co . ~
XR x'1 x., x, s, s? s, Max W =-2(0) -2(2/3)-4 (0)
0 s, -2 ( -2 ~3J -5 1 0 0 J ->LY Maximize W =- 413
1 . ~ 0 :. Minimize Z = 413
0 s ' J 3 1 7 0
' 37. Use dual simplex method to solve
0 s. 5 I 4 6 0 0 1
Maximize Z = -3x 1 - 2x 2
Max W=O z _, 0 o\ 0 0 0 0 subject to x, + is 2'.: 1
c-Z -2 -2 ' -4 0 0 0 x, +is:::: 7
c.-Z. 2/3 x, +2x~ IO
J J
a;;
I
jEV
\415 - - - X2 $3
· x 1 , is2'.: 0
Key column Key row i) Express the given problem in standard form
Sol.
Since (c(Z):::: 0 for all non basic variables the current solution is optimal and x01 = -2 Multiply the constraint (I) and (3) by-I to convert them into the constraints of:::: type
l
i.e. negative, it is infeasible
i and then convert them into equation by adding slack variables
f: The row containing -ve x8 value i.e. row R, is called kt:y row . -X -X 2 :5:-I
1
i-~; . Divide (c.-Z.) values from corresponding -ve elements of key row a.IJ
J.'..· J J
-x,-2x 2 :S:-10
L:i -2 - 1 -2 - 2/ -4 - ~
;.::· -2 - -3 - /3 -5 - 5 -x 1 -x 2 +s,=-l ....... (I)
bi
,.._I
t;::: I
The column with minimum (c.-Z.)
J J
I Key row element (a.)
lj
ratio i.e. x2 column is the X1 + X2 +S 2 = 7 ....... (2)
~ key column ....... (3)
-x,-2x 2 +s 3 =-10
iL -3 is the key element
....... (4)
~!:
!ol!kl~~
The elementary row operations required to make key element as 1 and other key X 1 +X 2 +S 4 =3
~
column elements as zeroes are The objective function becomes
ifll!«
R,(new)=R,(old)/-3 ~(new),; ~(old)-R,(new) R3 (new)=~(old)-4R 1 {new) ....... (5)
~~.
MaximizeZ= -3x 1 -2x 2 +Os, +Os 2 +Os, +Os 4
-2/-3=2/3 3-(2/3 )=7/3 5-4x(2/3)=7/3
ii. Obtain initial basic feasible solution
EE: -2/-3=2/3 3-(2/3)=713 J-4X(2/3)=-5/3 Letn = 6
t -3/-3=1
-5/-3=5/3
1/-3=-1/3
1-1=0
7-(5/3)= 16/3
0-(- 113 )= 1/3
4-(4x 1)=0
6-4X(5/3 )=-2/3
0-4X(-I/3)=4/3
m=4
:. ( n - m)=( 6-4 )= 2 variables must be equal to zero
1-_ 0/-3=0 1-0=1 0-(4xO)=O
Let x, =X 2 =O}Non- basic variables
I 0/-3=0 0-0=0 1-(4xO)=I s, =-l 1

Iff The improved solution is shown in table
c.-> -2 -2 -4 0 0 0
s? = 7
-
S3=-lO
Basic variables
E:. CA B Xo x, x, x, S, s? S, S4=3 •
I
~·
-2 x, 2/3 2/3 I 513 -113 0 0 Sinces, =-I ands,= -1.0are-ve, the initial solution is infeasible
.
. 0 s? 7/3 7/3 0 16/3 1/3 I 0
' 0 S, 7/3 -513 0 -213 413 0 I
.
' Max W=-4/3 z_, -413 -2 -10/3 2/3 0 0
I c.-Z -2/3 0 -213 -2/3 0 0
i
';;!
;.i.
!I ..,,,
iii) Construct dual simplex table and test-for optimality
0PERATJOl'IS REsEARCH LmEAR PaoGRAMMil'IG Ag
Kev col,,, mn c -3 -2 0 -0 0 0
Key Element
c 3 -2 /J 0 ~Jrow en 8 x. x, x, s, s, s, s.
0 0
cu B 0 s, 4 '..•/? 0 I 0 _l/2 0
.::i
~R t!., x, /s S, 1, ·s,
0 s, -I I /-1 I I 0 /o 0 0 s, 2 1/2 0 0 I . 1/2 0
0 s, 7 . I 0 -2 s, 5 1
I 0 0 _l/2 0
I" 0 I I 0 /2
0 s, -10 -I ~2 0 0 s. -2 I _!/, 0 0 0 1/, I) -+LV

0 I OJ -+ LV
0 s, 3 0 I , 0 0 MaxZ=-10 z__, -1 0 0 0 l 0
,, 0 I
MaxZ=-10 Z-+ 0 0 0 0 0 0 (c.-Z.) -2 -2· 0 0 -1 0
Ii
(c-Z.) -3 -2 0 0 0 0 (crZ) 4 - - - - -
-a-
,, tEV
(c-Z.)
.:....L..l:
3 I - - - -
a jEV Although (c.-Z.) :S 0 for all non basic variables, x8 4 (i.e. -2) is negative. It is not feasible.
' J J
Since (c-Z.) < 0 for the basic variables, the solution is optimal but x8 and x are -ve, c-Z
J J I 8J J i ratioisminimumforx 1 hence
,. and hence it is infeasible. Key row element
~! Since x83 =-10 is the highest negative value, choose S3 row as key and calculate x 1 is the incoming variable
(c -Z.) ratio to find key column and key element
~3
s 4 is the leaving varible
-)3 1-2=1!
.~;.
j
jl.
-I -2 -Yz is the key element
"
n
Sincex, column has lower
(c -Z)
J i ratioof2,
¥··: Key row element R/n)=R4(o)X-2 R3(n)=R/o)-112Rin) ~=~(o)-I/2R/n) R1{n)=R 1(0)+ l/2R4(n)
( Select x2 column as key column and element- 2 as key element. -2X-2 =4 5-(l/2x4)=3 2-(l/2x4) =O 4+(If2x4)=6
litol•
·-·"'
!:---- .
Now, the elementary row operations required are -l/2x-2=1 l/2-(l/2xJ)=O 1/2-( 1/2x I )=O -1/2+(1/2x l)=O
'"
~·
R3(n)=R 3{0)/-2 R4(n)=Ri0)-R 3(n) R2(n)=R (0)-R,(n) Ox-2=0 l-(l/2xO)=I O-(l/2xO)=O O+( 1/2xO)=O
2 R/n)=R1{0)+R/n)
-10/-2=5 3-5=-2 Ox-2=0 _0-( l/2xO)=O 0-( 1/2xO)=O I +(l/2xO)= I
it..' 7-5=2 -1+5=4
-1/-2= 112 0-1/2=-l/2 Ox-2=0 0-( l /2xO)=O (-{l/2X0)=1 O+(l/2xO)=O
-1-1/2=-l/2 - I+ 1/2=-I/2
~.: -21-2=1 1-1=0 l/2x-2=- l -1/2-( l/2x-1)=0 l/2~(1/2X-1 )=1 -112+( l/2x- l )=-1
1-1=0 -1+1=0
0/-2=0 I X-2=-2 0-( (/2X-2)=J 0-(1/2x-2)=1 O+( l /2x-2)=- l
~:
0-0=0 0-0=0 l+O=I
The improved solution is shown in table
r;
.:...•.
0/-2=0
1/-2=-l/2
0-0=0
0-(-1/2)=1/2
1-0=1
0-(- 112 )= 112
1+0=1
0+(-1/2)=-l/2
c -3 -2 -2 0 0 0
"'·
CR B x. x x, s s, s, s
'"!'..· 0/-2=0 1-0=1 0-0=0 O+O=O
The improved solution is shown in table 0 s, 6 0 0 l 0 -I -I
• 0 s, 0 . 0 0 0 I I I
-2 x, 3 0 1 0 0 0 I
-3 x 'I 4 I 0 0 0 -I -2
Max Z = -18 Z-+ -3 -2 0 0 3 4
c. -Z 0 0 0 0 -3 -4
Since (cj - Z) :S 0 for all non basic variables, the current solution is optimal with
x1 = 4. ~ = 3 and maximize Z = -3(4)-2(3) = 18
- ~
~
"
.,'.!
!~- .,.,
38. Solve the following problell! by dual simplex method
OPERATIONS REs~ce LlliEAR PROGRAMMlliG
Am
No~, choose row ~1 a~ a key row because x8 ;alue corresponding to the row has
=
Minimize Z 2x 1 + ~ highest negative value i.e. -6
subject to 3x 1 + x2 ~ 3 c-Z
,.,
4x 1 +3x2 ~ 6 Calculate-J-.-._J forcolumns,with-vekeyrowelement
x 1 +2~::'.:3
a•J
~
~=Yz l=~=il
x1, Xi::: 0 June 2010 (10 M)
Sol. i) Express the given problem iri standard form
Convert minimization probletn into maximization type by multiplying throughout
1·r . by ~I and express all~ constraints into :S form by multiplying all of them by -I and
(c -z)
choose x 2 column as keycolumn,as-J-._J_ratio is minimum.
:1",.
form equation by adding slack variables -.~,. .. a1v
~? : :
~,.
-3x, -x 2 +s 1 =-3 .. ... (1) -3 is the key element.
jti):
rrF: -4x 1 -3x 2 +s 2 =-5 ..... (2) The elementary row operations requ'ired to make key column elements zero and key
!~~--!
element as l are
itit
~::.' .;
-X 1 -2x 2 +s 3 =-3 ..... (3)
R2(n) = R2(o)/-3 R1(n)=R 1(o)+R 2{n)
:. Maximize W = -2x 1 -x 2 +Os, + Os 2 + Os 3 ..... (4) R3(n)=R 3(o) +2Rln)
n x,, x~,s,,s 2 ,s 3 2':0
-6/-3=2 -3+2=-I -3+(2x2) = 1
I
-4/-3=4/3 -3+4!3=-513 -I +(2 X4/3 )=5/3
ii. Obtain initial basic feasible
-3/-3=1 -1+1=0 -2+(2x l)=O
Letn =5
·~j 0/-3=0 t+O=t 0+(2 x 0) = 0
m=3
l/-3=0=-1/3 0- 1/3 =-1/3 O+ (2 x -1/3) = -213
.·.( n - ril )={ 5 -3)= 2 variables must equal to zero
0/-3=0
i
O+O=O t+(2xO)=l
Letx 1 =x 2 =O;Nonbasicvariables. The improved solution is shown below in the table
c--> -2 -1 0 0 0
SI= -3 8
s 2 = -: Basic variab !es CR XD x, x., s s, s,
0 s -I 51 0 I -113 01 ->LV
53 =-.)
-I x, 2 413 l 0 -1/3 0
then Maximize W =0
0 s, I 513 0 0 -2/3 I
Sinces, = -3, s 2 = -6and s3 =-3, the solution is infeasible z_.
Max W=-2 -413 - t 0 t/3 0
iii. Construct dual simplex method : c -z -213 0 0 ~ 1/3 0
- --.1 - - ------
. --~-·-···-~· w
·~1 215
c.-> - -I
•v
-
cJ - Z./
j
aIJ..
jEV
- - I -
CR B XR ~ x, Is s, /s. The solution is not yet feasible as; XBI = - t. Perform the elementary row operations
0 s, -3 - "':_(''I I 0 /o shown below
0 s, -6 1-4 rn 0 I 0 J ->LY
0 s, -3 -I v2_..1 0 0 I •
Max W=O Z-> 0 0 0 0 0
c.-Z -2 -1 0 0 0
c.-Z
..l..._l
1/2 1/3 - - -
a" . jEV
Although, the solution is optimal, as (cj- Z) :S 0 for all non basic variables, but it is
infeasible, because xBI' x82 and x83 are negative.
...R,(n) = R,(o)x (-3/5)
-Ix -315 =315.
R.,(n)=R,(o}4/3 R,(n)
2-(4/3x3/5)=6/5
OPERATIONS REsEARCH
R.,(n)=R.,(o)-5/3 R (n)
l-(5/3x3/5)=0
-513 X-315= I 4/3-(4/3 x I)=O 513 - (5/3x l)=O
Ox-3/5=0 1-(4/3 xO)= I 0-(5/.JxO)=O
I X-3/5 =-315
o-(~x ~ )= Ys
3
o-(,1)'x-Ys)=1
'.-'· :~_;r:m;~i':,t~
-~x-Ys=~ - ~ -(~ x Ys)=-Ys -%-(75' x Ys) =-I
h
h~·
;.}
·:i
~u
ox-Ys =0 o-(~~o)=o 1-(15' xo)= I
The transportation problem is to transport various amounts of a single homogeneous
;l.L The improved solution is in the table shown below.
commodity (goods) that are initially stored at various origins, to different destinations in
c.-> -2 -1 0 0 0 such a way that the total cost of transportation minimum.
u· c" B x" x, x, s s, s. In transportation problem, there are more than one centers called Origins from where
~.~
;~'. -2 x, 315 I 0 -3.5 1/5 0 the goods need to be shipped (transported) to more than one places called Destinations and
i!· -I
0
x.,
s, 0 0 0
615 0 I 415
I
-315
-1
0
I
the costrnftransportation from each of the origin (source) to each of the destinations being
different and known. The objective is to ship the goods from various origins to different
i~- Max W =-12/5 Z.-> -2 -I 2/5 1/5 0 destinations in such a way that the total cost of shipping minimum.
C. • l 0 0 -2/5 -1/5 0 3.1 FORMULATE THE TRA~S~ORTATIQN PROBLEM AS LPP I
Since (c. - Z.) < 0 for non basic variables, the current solution is optimal with
i#t
w--1
I''
x1 = fs,x %
2 J= and Max W =-2{Ys)-1(Ys)
Let
SHOW THAT TRANSPOIJTATIQN PROBLEM IS LPP
.:;.-.~
'5¥:c;. Max W=-IYs m be the number of origins (sources)
lt'
a; be the number of units stored at ilh origin.
:. MinimizeZ='Ys n be the number of destinations
b} be the number of units required (demand) at destination 'j'
ii~- _ cij be the_cost of shipping one product from ilhorigin to jlh destination.
~:~ xy.. be the number of goods I units needs to be transported from ilh origin to jlh destination.
~:; It is assumed that total units stored L:a, satisfy the total requirement L:bi i.e.
E. ~), = L:bi where i= 1,2 ..... m (rim condition)
~·.
j= 1,2 ..... n (rim condition)
n may I may not be equal tom. Now we have to determine non negative C~O) values {)f .r,1
• satisfying both the availability and demand constraints. The constraints are
~· n
tf- L:x. =a for i=

j=l
m
U I
1,2 ....... m. {Availability constraint}
l!J: L:xIJ =b.forj=l,2

J
......... n. {Demand constraint}
li: i=l
tE The objective is to minimize (determine) the total cost of transportation.
[
~
EL__
I·f.Y,.;
'. t~~tl
'.'1.li'
.
.
I
,..
Let Z be the total cost of transportation. Then
m n
'Oi>P:RA.noifs REsEARCH 2j~@:PJ?!tTA'J'.l61' PRoiu.us
!~i,~!~if(qQ~:()f.fl~DIN~ • INITl~~~-~l!JJPJ!~J\:~IX: ..
· :" o:. · 'R
~-~.
;1ij~I
1~11 Minimize Z =I I c IJ xIJ . (Obiective
J
function) ~;!{a'.~r[~ttth~i~i.'.~i~i~Lr~l~j~Rij;r{j\Y£il!l1~f~~L~·,o;-_>.J,'.i:iJi;:'.!~,'.:
·--~-·
. i=I j=I
:~1· It is a simple method used to obtain an initial solution. This method does not take into
Thus transportation problem is formulated as LPP.
··~;
:r,1 account the cost of transportation on any route of transportation.
'"111 Step 1: Start with the cell at the left top (North-West) comer of the transportation matrix
3.2 DEFINITIONS RELATED TO TRANSPORTATION PROBLEM
. Jn •;_ 1. Feasible solution: A set of non-negative values (basic variables/ allocations) x
and allocate as much as possible equal to the minimum of the supply I demand for the first
IJ row and first column i.e. min (a 1, b1).
':. ilf: · i=I ,2 ......... m and j= 1,2 ...... n that satisfies the constraints is called a feasible
. solution to the transportation problem . Step 2:
•.· +!'.!'· 2. Basic feasible solution: The feasible solution tom origin and /1 destination problem i) If the allocation made in step I is equal to the supply available at the first source (a 1,
·~ is said to be basic ifthe number of positive allocations x.IJ (basic variables) are m+n-1
i.e. one less than sum of rows and columns.
3. Optimal solution: A feasible solution (not necessarily a basic) is said to be optimum,
in the first row), then move vertically down to the cell (2, I) in the second row and
first column and apply step I again for next allocation.
ii) If the allocation made in step! is equal to the demand of the first destination (b 1, in
~-:~i if it minimizes the total transportation cost. the first column), then move horizontally to the cell ( 1,2) in the first row and second
'fil
:: ,_
~:i ~
4. Non-degenerate basic feasible solution: A basic feasible solution for (m x 11) column and apply step I again for next allocation.
...--~--.
~- ! ' transportation problem is said to be non-degenerate, if number of positive allocations iii)Ifa 1=b 1, allocate x11 = a1 or b1 and move diagonally to the cell (2,2) _
.,.,
., (filled cells) are exactly (m+n-1) Step 3: Continue the procedure step by step till an allocation is made in the South-East
::-n.:.:
5. Degenerate basic feasible solution: A basic feasible solution for (m x 11) corner cell of the transportation table.
~J.
transportation problem is said to be degenerate, if number of positive allocations Note: During the process of allocation at a particular cell, if the supply equals demand,
(filled cells) are less than (m+n-1). then next allocation of magnitude zero can be made ·in a cell either in the next row or next
q.-:::;,,rF
6. Balanced and unbalanced transportation problem: A transportation problem is
~~:
column. This condition is known as degmeracy
••":'~-·
said to be balanced, ifthe total supply from all sources equals the total demand in all
!;;ll::-
~
destinations; otherwise it is called as unbalanced. 3;4,2 Vogel's Apprpximation Method, . (VAM)tR.t!gr~t-Method/Method
~~··
Ir
~~~S,
~~t~;-: ..;..
7. Occupied and non-occupied I empty cells: The cells in the transportation table
having positive allocations are called occupied cells; otherwise empty or un-occupied
cells.
of P~nalties :
In this method, each allocation is made on the basis of the opportunity (or penalty or
extra) cost that would have been incurred if allocations in certain cells with minimum unit
~--- 3.3 STEPS.INVOLVED IN S0LVING'.¢.ft4N"'$iJORtATION PROBLEM I transportation were missed. In this method, allocations are made so that the penalty cost is
·~:~:.'
;;t;:;;.. THE TRANSPORTATION ·ALG.ORlittNl: ' .. . . .minimized.
l:;::I ..· VAM is preferred to the NWCM due to the fact that it gives an initial solution which is
::!:::~ .. 1. Formulate the problem and arrange the data in the matrix form: Here, the
~r~~: objective function is the minimization of total transportation cost and constraints are nearer to an optimal solution or is the optimal solution itself.
~~· supply and demand at each source and destination respectively. Step 1: Calculate the penalties for each row (column) by taking the difference between the
»Ol•J<o.·
;!,.:!;..~~-
::l':·r-.";t
2. Obtain an initial basic foasible solution: The initial solution can be obtained by smallest and next smallest unit transportation cost in the same row (column).This difference
¢..;::;:
]J:.i · NWCM or VAM. The solution obtained must satisfy the following conditions. indicates the penalty or extra cost which has to be paid, if one fails to allocate to the cell
~~f-_: a) The solution must be feasible i.e. It must satisfy all the supply and demand with the minimum unit transportation cost.
constraints (rim CQflditions) Step 2: Select the row or column with the largest penalty and allocate as much as possible in
i~~g b) The total number of positive allocations must be equal to (m+n-1 ), where the cell having the least c9st in the selected row or column satisfying the rim conditions. If
tr-~'!:".
m =number of rows
J~- 11 =number of columns.
there is a tie in the values of penalties, it can be broken by selecting the cell with minimum
unit transportation cost. If there is a tie in the values of unit transportation cost in the cells,
t" 3. Test the initial solution for optimality: Use Modified Distribution (MODI) method it can be broken by seleeting the cell where maximum allocation can be made.
rJ-. to test the optimality of the solution obtained. If the current solution is optimal,
I.,~
....... then stop; otherwise calculate new improved solutions until an optimal solution is Step 3: Adjust the supply and demand and cross out the satisfied row or column. If a row
EL_ reached. and a column are satisfied simultaneously only one of them is crossed out and remaining
~l
ta
~~.
li!ae•.
Mlle:.:;_
demand should not be used in computing future penalties.
'·
' ···OPERATIONS
.. :r.. -· ..
row (column) is assigned a zero supply (demand);.Any row/column with zero suppty/
REsEARCH TRANSPORTATION PROBLEMS
·,
..
iii) Allocate 5 to cell (S 2,02) as number ofunits needed at destination D2 (i.e. 5) is less
than that of number of units available at source S2 (i.e. 13). Move horizontally to
Step 4: Repeat steps I to 3 until the entire available supply atvarious sources and demand cell (S 2,D3), as demand of D2 is met.
at different destinations are satisfied. iv) Allocate 8 to cell (S 2,D3 ),as the maximum availability at S2 (i.e. 8) is less than the
requirement at D3 (i.e. 12) and move vertically down to cell (S 3,03).
INITIAL BASIC .PfUl-BLEMS ·. v) Allocate 4 to cell (S 3,03) to meet the need of destination 0 3 and move horizontally
to South - East (bottom right) corner (S 3,DJ
I. Determine an initial basic feasible solution to the following transportation
vi) Allocate 15 to cell (S 3,D4), as the max number of units available at source S3
problem by using (a) NWCR and (b) VAM.
(i.e. 15) equals the maximum requirement at destination D4 {i.e. 15) and thus
Destination completes allocation.
D, D, D, D Supply Now, the initial basic feasible is obtained by the summation of product of uit
S, 21 16 IS 3 II transportation cast in the fille cells and corresponding positive allocations. The total
Source S, 17 18 14 23 13 positive allocations obtained is 6 and is shown below.
x(01,51) = 6' x(D1.5~) = 5' x(02,52) = 5' x(03,51) = 8' x(OJ.53) = 4 and x(0.,53) = 15 •
S, 32 27 18 41 19
The total cost ot transportation
Demand 6 IO 12 IS Z = E(2 I x6) + (16x5) + (18x5) + (14x8) + (l 8x4) +(4IxJ5)
Sol. Check whether the given problem is balanced or unbalanced transportation Z =Rs. 1095.
problem. Here,
L Supply = 11 + 13 + 19 = 43 No. of sources= No. of rows= m = 3
r Demand = 6 + I0 + 12 + 15 = 43 No. of destinations= No. of columns= n = 4,. then
Since L Supply = L Demand, the given problem is a balanced/ self contained/ (m + n-1) = (3 +4- I)= 6
standard transportation problem. x.. =total number of positive allocated I filled cells= 6
a) North - West Corner Method (NWCM) : s'ince x.I) = (m + n - I), the obtained initial basic feasible solution is non - degenerate
Table below shows the transportation matrix in nature.
b) Penalty method or Vogel's Approximation Method (VAM) or Regret method:
Destinations Write down the cost matrix as shown below
D, D2 Di 04 I Supply
s, I Ci¥-Rf)llif ~ I II
,;,.
"'µ
'1)
5 s2 I I ~s J-..-1-( 8 JI I 13
0
(/)
Si
Demand I 6
:J I 10
©!9-((5)9
12 15
19
i) Stait from left top (North - West) corner (S 1,DJ Compare the number of units
available at source S1 (i.e. 11) with number of units required at destination 0 1
(i .. e, 6). As 6 is less than 11, allocate 6 to it to meet demand of D1 and move
horizontally to cell (S 1,02). i) Take the difference between smallest and second smallest element in each row
ii) Now, compare the number of units still available at source S1 (i.e. 5) and number and write it to the right of that row under the column "Row Penalties". Similarly,
of units needed at D2(i.e. I0) Allocate 5 to cell (S 1,D 2) and move vertically down enter the difference between smallest and next smallest element in each column
to cell (S 2,02). as supply at S1 is exhausted. and write it below the corresponding column under the row ''Column Penalties".
f;''
- ·oi>E:kA:¥ioi~:REsEAiii:a
ii) Select a row/column with highest penalty and allocate as much as possible to a
cell with least cost in that row/column within restrictions of rim conditions. In
this problem, two smallest elements in row I are 3 and 15 and difference is 12,
TAANSPORTATI#if _iq~i~~}~.·i~'.?{j;~f~>JS
Sol.
1
• •• • : , •
Check whether the given problem is balanced transportation problem or not

L Supply= 6 + I + I0 = 17
L Demand= 7 + 5 + 3 + 2 =17
·, ) ·)·;~~tW
which is entered as' [12) right to that row I. Similarly, the two smallest elements --,·:< Since L Supply = L Demand, the given problem is a balanced I self contained/
in column I are 17 and 21 and difference is 4, which is entered as [4] below the standard transportation problem. \
column I. Among all row a:nd column penalties, column 4 (i.e. D4) has highest a) North - West Corner Method (NWCM) :
penalty of 20. Select cell (S 1,D4) with minimum cost of 3 and the maximum Write the transportation matrix as shown below
possible allocation is 11, as the supply of S 1 is 11 and demand of D4is 15. Destination
· iii) Cross out the row S1 completely, as source S1 is exhausted.
iv) Repeat the process of determination of row penalties and column penalties and DI D2 Di D4 Supply
select column D4 with highest penalty of 18 and cell (S 2,04) with least cost of SI I CW-I LlJ m1 u1 6
23 in that column and allocate 4. Since the demand of column 0 4 is completely Source
(.
!':
satisfied, strike out that column.
s2
v) Choose column D1 with penalty of 15 and adjust maximum allocation of 6 to SJ I ~ll»=fQJ=tWI IO
the cell (S 2,D 1) with least cost. Cross out the column 0 1 as its requirements are Demand 7 5 3 2
I
fulfilled.
-
"·""'
·..
!
~;.
~ ~
vi) There is a tie in penalties (i.e. 9) of column D2 and row S,. To break the tie, select
a cell with minimum cost among above said column and row. Again, tie occurs
i) Start from left top comer cell (S 1,D 1) and allocate maximum of 6 to exhaust the
source S1, as number of units available at source S1 is less than the demand of
lr<:.:
t;.{. .,
·among the minimum cost value 18 between cells (S 3,D,) of row S3 and (S 2,D 2) of destination (i.e. 7) and move vertically down to cell (S 2,D 1)
~.! ii) Allocate I to cell (S 2,D 1), as the number of units available at source S (i.e. I)
~LI
column 0 2• This tie can be broken by choosing a cell (SJ,D,) to adjust maximum 2
,.,.,_;
~:~
~I
possible allocation of 12 compared to a cell (S,,D,) with allocation of3. Cross equals the number of units needed at destination (i.e. I) and move diagonally to
cell(SJ,D)
11:
tt(-·
out the column DJ, as its requirements are fully satisfied.
vii) Finally, as a cell (S2,02) has minimum cost of 18, maximum possible allocation iii) Now compare the number of units available (i.e. I) at source SJ (i.e. 10) with
~c,.
of3 is made followed by a cell (S 3,D) of least cost 27 with an allocation of?. number of units needed at destination D2 (i.e. 5). Now allocate 5 and move
I: The total positive allocations made in this method are 6 (i.e. xIJ..) and cost of horizontally to cell (SJ,D 3), as the demand ofD 2 is met.
ii
~·
transportation associated with this method. iv) Finally, 'al.locate 3 and 2 to cells {S 3,DJ) and (SJ,04) to complete allocation as
shown in fransportation problem.
Z =I{(3x11) + (!7x 6) + (18x3) + (23 x 4) + (27 x 7) + (18x 12))
It···' Z=Rs.686
Here m = 3 i.e. No. of row/sources
E
I;. Since( m + n -1) = xij = 6, the obtained initial basic feasible solution is non-degenerate
n = 4 i.e. No. of columns/ destinations
x = 6 i.e. No. of filled cells
~ in nature. The cost oftransportation Z=I(2 x 6) + (1x1) + (8 x 5) + (3 x 3) + (2 x 2)
I1: 2. Find the initial basic feasible solution to the following transportation problem
by using following methods.
(a) North-west corner rule and
(b) Vogel's approximation method
Since (m + n - I)> x.,
nature.
Z=Rs.66
IJ the obtained initial basic feasible solution is degenerate in
b) Vogel's Approximation Method (YAM)

If Destination
r
D, D, D, Dj Supply
S, 2 3 11 7 6
Source S, I 0 6 I 1
S. 5 8 3 2 10
i
Demand 7 5 3 2
Ii.
••• Destination
'· ClPEMTIONs'REsEAice TRAssPO!hAnoN PR.o&Ells
Step 1: for an initial basic feasible solution with m+n-1 occupied cells, calculate
am
Supply Row Penalties u+vJ =c\'.. for each occupied cell (i,j). Start with assign zero for
I .
a particular u,orv.J where there
I
s.I are maximum number of allocations in a row/column. If maximum number of allocations

6 [I] [I] [I] [I]
in a row/column is not unique, then choose a particular u. or v.J with maximum number of
Source s2 I (I] • I
sum ofindividual allocations. !fit is not unique again, choose any one arbitrarily.
s 10 [I] [I] [I] (3] Step 2: For unoccupied cells, calculate opportunity cost (the difference that indicates the
Demand 7. 5 3 2 per unit cost reduction that can be achieved by an allocation in the unoccupied cell) by
Column [I] (3Jt (3] [I] using the relation
Penalties [3] [5] [8Jt [5] dii = cii - ( u1+ v) for all i and j
[3] [5] [5]j
Step 3: Examine sign of each dij
(3] (5lj
(i) If all d1?0, the current basic feasible solution is optimum and unique.
i) Although the Columns D, and DJ have maximum penalties, choose column D,
(ii) If any dIJ.. = 0, the current basic feasible solution is optimum, but an alternative solution
to
and select cell (S 2,D 2) to ailocate I, as its unit transpo1tation cost is 0 compared
exists.
cell (S.,D.) with least transportation cost of 3. Cross-out the row S, completely.
ii) Chaos~ c~ll (SJ,D) in the column D3 with maximum penalty of8 and allocate 3 (iii) If any d1(0, then the solution is not optimum. An improved solution can be obtained.
to meet the demand of destination DJ and cross out the column D3 Completely. Step 4: Select an empty cell having largest negative opportunity cost (i.e. d1) as an incoming
iii) Despite maximum penalties of 5 with columns D2 and D4 , choose cell (SJ,0 ) variable. Construct a closed-path (or loop) starting with selected unoccupied cell and mark
4
with least cost of2 and allocate 2 to it to meet the demand of destination D and sign'+' in the cell, trace the path along the rows (columns) to an occupied cell. Mark the
4
hence cross out the column D4 completely. corner occupied cells'+' and '-'alternately and close the path at the selected unoccupied
iv) Choose column D, with maximum penalty of 5 and allocate maximum possible cell.
value of 4 and cros~ out the column 02. Step 5: Select the smallest allocation amongst the cells marked with - (minus) sign on the
v) Finally, allocate 2 and 5 to cells (S 1,D 1) and (SJ,0 1) respectively. corners of the closed loop. Allocate this value to the selected unoccupied cell and add it to
x =6 other occupied cells with '+'sign, subtract it from the occupied cells with '- ·sign .
•J
(m+n-1)=6
Step 6: Obtain a new improved solution by allocating units to the unoccupied cell and test
The cost o transportation Z=I{2 x 2) + (3 x 4) + (Ox 1) + (5 x 5)+ (3x 3) + (2x 2) the revised solution further for optimality. The procedure terminates when.all d,j2'.0, for
Z=Rs.54 unoccupied cells, and then calculate total transportation cost.
Since\= (m + n - I), the obtained initial basic feasible solution is non - degenerate
in nature. 3.6 CLOSED LOOP AND ITS PROPERTIES
A loop is an ordered set of at least four cells in a transportation table.
3.5 TEST FOR OPTIMALITY i) Closed path starts and ends at the selected unoccupied cell, and it contains only
Once an initial solution is obtained, the next step is to check its optimality. An optimal horizontal and vertical lines.
solution is one where there is no other set of transportation routes (allocations) that will ii) Every corner element of the loop must be an occupied cell.
further reduce !he total transportation cost. We have to check each unoccupied cell in the iii) Only one loop can be constructed for each unoccupied eel I.
transportation table in terms of an opportunity of reducing total transpmtation cost. iv) Loop can be drawn either in clockwise or anti-clockwise direction.
4
v) There can be only one'+' ve and '-'ve sign in any row or column.
To perform this optimality test, Modified Distribution method is used.
vi) Closed loops may/ may not be square in shape.
3.5.1 Modified Distribution (MODI) Method/ U-V Method/Method
3.7 KEY POINTS FOR SOLVING THE PROBLEMS
of Multipliers
i) In YAM, ifthere is a tie in the values of the penalties, it can be broken by selecting the
The MODI method makes use of the concept of duality. cell has least transportation cost or by selecting the cell where maximum allocation
The steps involved in MODI method' are can be m'ade.
IW! .
-i~- ..l
... OPERATIONS REsEAR,CH
ii) In MODI method, start with assign zero for a particular U or V where there are
maximum number of allocations in a row/column. If maximu~ num ber ofallocations
1
TlWtSPORTATIOl'f PROBLEMS
3.
·SOLVED -PRO.ii'i!EMS·: .
- ·- .-.:..::'.:r_-•.. : -.,-..i:•; ......... -.
Find the optimality for given problem and initial solution by VAM method.
, : _... .
..
in a row/column is •not unique, then choose a particular U' or VJ with maximum D, D, _Supply
D, D.
number of sum of individual allocations. If it is not unique again, choose any one
0 2 2 2 I 3
arbitrarily.
iii) If any du<O, then the solution .
is not optimum, construct a closed-path (or loop)
starting with unoccupied cell having largest negative opportunity cost. If there is a
'IB: 0,
0,
10
7
8
3
5
6
4
8
7
5 .
tie, it can be broken by selecting the cell with least transportation cost. ~~: Demand 4 3 4 4
iv) Jf there is an empty cell with minimum cost from where a closed loop can be Jan 2014 (lOM)
···,
:. ; ~ :
constructed, do not allocate 6 to that cell, then choose an empty cell with next least
cost to allocate~-
v) If 1~umber of positive allocations are less than (m+n-1 ), degeneracy exists at the
•••
~::~lt
Sol. Check whether the given problem, is balanced or not
:E Supply= 3 + 7 + 5 = 15
.:;· ·~~-·~t:·~: :E Demand = 4 + 3 + 4 + 4 = 15
~(!. initial stage. To remove degeneracy, allocate 6 ("" 0) to an unoccupied cell \Vith · Since :E Supply= :E Demand, it is a balanced transportation problem.
; .;·.
minimum cost. If the values of the minimum cost in the cells are not unique, it can be Initial basic feasible solution by VAM.
U: broken by selecting the cell to allocate~ from which a closed loop cannot be formed. Destination
!~,. If there is a tie again, it can be broken by selecting a cell to allocate~ so that number D D, D. D, Supply Row Penalties
8£1. allocations either in a row I column of the selected cell have minimum of2. If there
r:.
~1,..
is a tie again, choose the cell arbitrarily. 0 I .. ··-®~ ··--+··~- ··-···-~- ····+-~ ......J...... -Pl·
!h vi) After the construction ofa closed loop, if two or more occupied cells marked with Source 2
0 ------···-~ --+-~---@~--@Ii. 7 [I] [I] [I] [2.J
0. (!)LL Q)Ll (Dlfi j Ill 5 (3](3)(1] (I]
tJ -(minus) sign on the corners of the closed loop with the same minimum allocation
n.
~-
become unoccupied simultaneously when allocating this value to the selected
unoccupied cell degen7racy at subsequent iterations said to exist. To remove
Demand 4 ~ 4 4
Column [5]i [\] (3] [~]
degeneracy, allocate 6 to the cell with least .cost which has become unoccupied
!f1·•>
..
recently to have m+n-1 number of occupied cells .
Penalties [3] [flt [I] £4]
i [3] \ [I] [4Jt
t
vii) The allocations are said to be in independent position, if it is not possible to increase
or decrease any individual allocation without changing the positions of these
[31 l [I] l
~-· allocations, or violating the rim conditions and closed loop cannot be formed. through x, =6 • ie
• · x(o,o,) x(o,o,) x(0 20,) x(o,o,) x(o,o,) x(o,o,)
1
~·~· these allocations.
~- viii) The maximization problem can be converted into equivalent minimization
m=3
~ problem by subtracting all the elements from the highest element in the given n=4
Ji;.'.
.I•·.
transpm1ation table and solved as usual, but calculating the profit/payoff (i.e. Z), use (m+n-1)=(3+4-1)=6
~~;. the values-in the maximited table. The cost of transportation Z=L.(2 x 3) + (5 x 3) + ( 4 x 4) + (7 x I)+ (3 x 3) + ( 6 x 1)
. ix) The existence of alternative optimal solutions can be determined by an inspection
of the opportunity costs 'dJj..' for the unoccupied cells. If an unoccupied cell in an Z=Rs.59
optimal solution has opportunity cost of zero, an alternative optimal solution can be Since( 111 + n - I)= xii'obtainedbasicfeasiblesolution is non -degenerate in nature.
m.~
la.· obtained with another set of allocations without increasing the total transportation
~ Optimal solution by MODI method 0
~
cost by drawing a closed loop from a cell with 'd,i 'value zero.
..
;;;;: Let u, and vi be the dual variables corresponding to the supply and demand constraints.
~
;&·, In the given problem, there are m = 3 origins and n = 4 destinations.
~:
Therefore
r:i:
u; (i = 1,2,3) be the dual variables corresponding to supply constraints
v (j = 1.2,3,4) be the dual variables corresponding to demand constraints.
J
IL Calculate u, + vJ = c,j for occupied cells
L.
[_
.
.
... r ·-.::~• -
"
0PERATIQNS REsEARCH
In the given problem, xii = (m + n - I) = 6 lire the occupied cells and the dual
variables are (3 + 4) = 7. Hence take or.: variable arbitrarilv. Enter all u (j = 1,2,3)
TRAllSPORTATION PROBLEMS
Sol. Check for the balance

LSupply=65 +42 +43=150
..
'.!·
,j:,
along right of the matrix and vJ G= 1,2,3,4) across the botto~-ofthe mat~ix. :LDemand=70+ 30+ 50=150
:1 Calculate u + v = c.. fornll occupied cells.
,. I J IJ ' It is a balanced transportation problem.
:1" u1 +v 1 =2
The objective is to minimize the transportation cost. Obtain initial basic feasible
U2 +V 3 =5 solution by YAM.
u 2 +V 4 =4 Markets
;
~) + v, = 7 A
!Ii ll 3 +V~=3 ~ w,
11 ll; + V3 = 6 0
!·'
F:·
~ w2
;.;·
r·..:·•
i":'
Let u3 = 0 chosen arbitrarily, as the no. of positive allocations (i.e. filled cells) is 3
along the row 3.
~ w)
:~-
From above equations, we have Demand

"'
~-,-
u1 =-5,u 2 =-1, u3 =0,v 1 =7,v 2 =3,v 3 =6 andv 4 =5 Column [2] [I]
~- _:
For unoccupied cells, calculate opportunity cost using the relation Penalties [2] i [I]
[1] [OJ
d.IJ =c.IJ -(u I + v)
;i: ..
.... J
i;
~:~ where C;i = Actualcostofthecell
X· =5
tL ( u; + vJ = lmplicitcostofthecell
~
~1·~;'.
(m+n-1)=(3+3-l)
" uI·
Total cost Z={ 5 x 65) + (7 x 5) + (4 x30) +(7x 7) + (7 x 43)
.~
Z=Rs.830
~·
ir
u I =-5•
Since x ..IJ = (m + n - I), obtained initial basic feasible solution is non - degenerate in
u =-1
::n·
~\: I I- ~ - ~ - ~ ~ u: =a
nature.
Optimal solution by MODI method
Let assume u2 = 0
vi v1 =7 v2 =3 v3 =6 v4 '=5
::;.; A B c u. I
~
Since all d;j ;;:: 0 for all unoccupied cells, the current basic feasible is optimal.
~
:!:!::
w, u, =-2
:. The optimal cost of transportation Z= Rs.59.
it·:' w2 u2 = 0
~-~ 4. Obtain the initial solution by VAM and optimal solution by MODI method for
W, +I u, = 0
i·: the transportation problem shown below:
~L:
J. Unit transportation cost (Rs.) to markets
V.
J
I v, = 7 v, = 4
-
V.
'
= 7
[::" ~
i: A B c Supply Since d.IJ > 0 for all unoccupied cells, current solution (i.e. IBFS) is optimal.
5 The .optimal cost of transportation.
-~-·
;-: W, 4 6 65
i' Z= Rs. 830
~:.
L
Warehouses W, 7 4 7 42
~.:
w, 8 6 7 43
Demand 70 30 50
July 2011 (08M)
,;.,.
t__
r
! ; : ~·
-i
S. Solve the following transportation problem (minimization)
,.._p, D, D,
' ,: '0PEJtATiblfS REsEARCH
D, Supply
TiwlsPORTATIOl'l PRo~EMs
Since dij > 0 for all unoccupied cells, current sol~tion is optimal.
The optimal cost of transportation Z =Rs 796
..
s
. I
21 16 2S 13 II 6. Larsen and Toubro company needs 3, 3, 4 and S million cubic feet of fill at four
s2 11 18 14 23 13 earthen dam sites I, II, III and IV in Karnataka. It can transfer the fill from
three mounds A, B and C where 2, 6 and 7 million cubic feet offill is available
S3 32 2f 18 41 19
respectively. Costs of transportation of one million cubic feet offill from mounds
Demand '- to the four sites in lakhs of rupees arc given in the following table.
Find i) IBFS by VAM method '.
).:- . To
. ii) Check for optimality by MODI method July 2017 (14M)
II Ill IV
ISupply=l I+ 13+19=43 A IS 10 17 18
From 8 16 13 12 13
IDemand=6+ 10+12+15=43
C 12 17 20 II
It is a balanced transportation problem
Determine the optimal transportation plan which minimizes the total
Initial basic feasible solution by VAM
transportation cost to the company. Jan 2018 (12M)
o. o_ o_ Supply I Row Penalties Sol. Check for the balance
-~- i
~ ~; s, :E Requirement= 3 + 3 + 4 + S = 15
~.:
:E Availability= 2 + 6 + 7 = IS ·
~~- s2 13
~ -.j
H s3 19 [9][9][9][9] Initial basic feasible solution by VAM

<-
I~ Dam sites
~·iL Demand <>
10
II III
itif:.
~-·
Column [1J [2) [IO]j
rIl5l
1$;."c:
Penalties [9]
f9] [111 "'
:s!
A
1~--'
::i
'.", ~
0 8
¥•; ·' [9] ~
i x.IJ =6 c
(m + n - I)= (3 + 4 - I)= 6 Requirement ~ 3 1 5
~-
~:
Total cost of transportation
Z = (13x 1l)+(l7x6)+(18~3)+(23x4)+(27x 7)+ (18xl2)
Z=Rs.796
Column
Penalties ·
OJ
r41
[3]
[4]
[4]
[r
[$] [2]
[2]
[2]
ItJi:
.~,, [4] [2]
Since x IJ = (m + n - l ), obtained initial basic feasible solution is non - degenerate in
nature. xIJ. =6
Check for optimality by MODI method (m + n -1) = (3 + 4-1) = 6
Letu 2 =0 Total cost of transportation
m;
~
=C:
u. Z={f Ox 2) + {13 x ~ + {12 x 4)+ (13 x I) +{12x 3) +(11 x4)
......... s, Z= Rs.174 Lakhs
tF'
~- Check for optimality by MODI method
s2 -
~··
Letu2 =0
;; s, +6 u, = 9
;·
,,,.. v v,=17 v,=18 v3 =9 v4 =23
!j;L 1
llH•r
!ii
~l
~··
......
L_
... III IV
-0PEAATIOlfS REsEARCH TRAra.;ollTATION PaoBLEMS
" ~T ':-r '-'-·---·
xv=7
' • • •
,,.
(m+n-1)=(4+4-1)=7
A +4 Total cost
B Z=( 60 x 60) + (30 x 56) + ( 50 x 58) + (260x 55) +(200x 50)+ (160x62)+(220x 55)
+2
Z=Rs.54500
c 1®.
The obtained initial basic feasible solution is non - degenerate in nature
Vi 1v 1 =14 v;=t3 v3 =12 v~=l3
Check for optimality by MODI method
.Sine~ d,J > 0 for all unoccupied cells, current solution is optimal Let u1 = 0, then
The optimal cost of transportation Z =Rs 174 Lakhs
7. A .company has four factories from which it ships its product units to four
warehouses.W 1, W 2, W 3 and W 4 which arethedistributioncenters. Transportation F, I +2
costs per unit between various combinations of factories and warehouses are as
follows:
To
w w_ w ~Available
58 140 vi jv,=46 v2 =60 v3 =56 v4 =58
F, 48 60 56
45 55 53 60 260 Since diJ '.:: 0 for all unoccupied cells, current solution is optimal, but alternate solution
Fi
From also exists. The optimal cost of transportation Z =Rs. 54500
F3 50 65 60 62 360
F I 52S) I 64 I 55 I 61 I 220
8. Find an initial basic feasible solution using YAM and determine an optimal
4
solution by MODI method for the following transportation -problem.
Required ' -200 320 250 210
----'----'---- Warehouse Supply
Find the transportation schedule which minimizes the distribution cost by using
MODI method. Find the initial basic feasible solution by VAM.April 2018 (lOM) w W, W, W,
Sol. Check for the balance Factory F, 19 30 50 LO 7
l:Supply = 2: Avaialbility = 140 + 260 + 360+ 220=980 F, 70 30 40 60 9
l:Demand = 2: Requirement =200 +320+ 250+ 210=980 F, 40 8 70 20 18
It isa balanced transportation problem Demand 5 8 7 14
Initial basic feasible solution YAM Sol. Check for the balance
To
l: Supply= 7+ 9 + 18 = 34
Available I Row Penalties l: Demand= 5 + 8 + 7 + 14 = 34
F, Since l: Supply = l: Demand , it is a balanced transportation problem.
Initial basic feasible solution by YAM
E Fi Warehouse
0
....
ti. Fi w w Supply Row Penalties
F,
F4
s()
c 7 f9] [9] [40] [40]
Required 2QO JiO Fi 9 [ Hl] [20] [20] [20]
ell
Column [tJ {~] L:... F · 18 [12] [20] [5,.Q_J
Penalties m Demand 5 8 7 14
m Column [2 l l [22]j [10] [I OJ
[fl i Penalties [21] [ l O] [I OJ
[ l OJ [l OJ
{JO] [501
f
r
!~;
.
.
'
-.,
x[RI• wIl = 5, x(RI· w<I l = 2, x(F2· w) I = 7, x[F2• w4I = 2, x[F1• w2l
0fERATIQR$ msEARcH
= 8 and x(FJ• w-4 I = I 0

TRARSPORTATIOll · P.JtoBLEMS
Note: In the transportation matrix with closed loop, a cell (F2,Wz) has dii =-18. It
clearly indicates that there is a possibility of reduced Rs 18/unit of transportation by
..
:. x,1 =6 allocating to this cell.
I·;_:· (m + n-1)=(3+4-1)=6 9. Goods are to be shipped from three warehouses W 1, W 2 and W3 to six customers
:1: C 1, C2, C3.. ,.C6• The availabilities at the warehouses are 100, 120 an_d lSO units
Totalcostof transportation Z~ I(L9 x 5) + (1ox2) + (40 x 7) + ( 60x 2)+ (8x 8) + (20x10) respectively, while the demands of customers are SO, 40, SO, 90, 60 and 80
i
Z=Rs.779 respectively. The unit costs of transportation are as given in the following table.
Since X;j = ( m + n - I), the initial basic feasible solution is non -degenerate in nature. Is it possible to have more than one optimal solution?
Customers
Optimal solution by YAM
~-'. c,
,,
j;
Assume v4 = 0, as the maximum no. of positive allocations along column W4 is 3. C, C, c. C, C,.
W, ·IS 25 18 35 40 23
,.. w. u
'
Warehouses
W, 22 36 40 38
F
!,
60 50
F, w.
~ .
CD u, = 10 26 38 45 52 45 48
Fz u2 = 60 June 2012 (ISM)
j."
··-
Ii.
,...;,.
;
FJ u3 = 20 IAvailability=IOO+ 120+ 150=370
=- I Demand=50 + 40 + 50 +90 + 60 + 80=370
v.J Iv, =9 v1 =-12 v!=-20 v4 = 0
L
..jw•• Since d F,. w,J = -18, the current feasible solution is not optimal. Now construct a
1
i,:
2'''
;;...
closed loop ·starting from a cell [F2, W2] with largest negative dij value (i.e. -~8) by
assigning'+' sign to it.
Customers
i[
;;;:; The closed loop has alternate '-'ve and '+' ve signs with the allocations of 8, I 0 and
w
~·f.~
2 respectively. 1A
~-~- Now, select smallest allocation of2 in the corner cell(F 2, W4) of the loop with'-' ve g I I :,AJ 1.-l "--:1 ...I '-',_J •.. I 1-I
sign and transfer it to selected unoccupied cell. Add it to other corner cells with '+'
~ w
;; } I ;,~,I l•nl '1,.I I-Al 1. .I '-'I -1
a.::~
~J
::;~--
sign and subtract it from occupied corner cells with '-' sign. Obtain a new improved :s w,
solution by allocating units to an unoccupied cell and test the revised solution further
Demand
$:4
...,.r,-· for optimally.
Let u) = 0, as the summation of all positive allocations is more. Column
r;; Penalties
!?-·~
t":l
~:.:
w2 w4 LI.
I
iU F, u, =-10
~;. x = 8
=· Fi u2 = 22
IJ
l~ (m i 11- I)= (3+ 6 - I)= 8
.!!.;~
~-- Total costpftransportation

:::.. F3 u3 = 0
i;.~
t ~<
v.J v, = 18 v,=20
·~ Z= (18 x 50) +(35x 50)+(22x50) + (38 x 70) + (38 x 40) + (52 x 40) + ( 45 x GO)
r;·~
11..:..:
v, =29 v, = 8 +( 48x I0)
!::·:
~ Since d.. > 0 for all unoccupied cells, the obtained solution is optimal. Z=Rs.13190
'J
"
i.~.
L
The optimal ·cost of transportation Sincex,1 = {m + n - !),obtained initial basic feasible solution is non -degenerate
L Z=I(I9x 5) +(IO x 2) + (30 x 2) + ( 40 x 7),+(8x 6)+ (20x 12)
in nature
c_ Z=Rs.743
t:
f;;
F
... Check for optimality by MODI method
Letu 3 =0
:·,.\-
.•" o~iftq.~'JbsEARcli TRANsPORTA110l'l
Sol.
.PahiltU:& :so'
Check for the balance
I Capacity= I00 + 125 + 175 =400
•.
~<-
c6 uI I;Requirement=60+80+85+105 + 70=400
Since I Capacity= L Requirement, it is a balanced transportation problem.
WI
I .::-....ml · .ni;I · 1.10r-'I ii;ol. ·~ 1~111 Al'lill
7
Construct new total cost table which comprises of transportation cost and production
w2 cost as shown below.
I bi;I ;:::11sil -- id~I ;I::1d ;.::..1.t~I Al.tsil Initial basic feasible solution by VAM
wi Warehouse
v I v = 32 v = 38 v = 35 v = 52 v = 45 v = 48
J I l l ~ 5 G
II III IV V I Caoacitv I Row Penalties
Since dii ,l 0 for all unoccupied cells, the obtained current solution is not optimal. A
. --
1.00 [0][1 ][I ][I]
Construct a closed loop from cell (W 1, C6) with d,J = -8 and check for optimality. 0.
8 B 125 [1][1][1][2]
Let us take u, = 0 U5 <-
u.I 175 [O][O]{O][O]
w, - - - Requirement 6p 89 70
w2
Column [~] ro [OJ
t-::::...:-+..:~d-:...1-r~~~~,.--r;-;:f-.=.,r=f Penalties [~] [ ~] [O]
wi [!] i [~J [OJ
Vj I v,=24 v,=38 v,=35 v,=52 v,=45 v6 =40 [ ~] [O]
Since dii ~ 0 for all unoccupied cells, the current solution is optimal. The initial basic feasible solution
The optimal cost of transportation Z = (l8x 85) +(19x 15)+(22x80)+(24 x 45) + (18 x 60) + (18x 105)+{19x 10)
Z=Rs.[(18 x 50) + (35 x 40)+ (23x10) + (22 x 50) + (38 x 70) + (38x 40)] Z=Rs.7815
+(52x 50) + (45x60) xIJ.. = 7 (i.e. Number of positive allocations)
Z=Rs.13110 m + n - I = (3 + 5 -1) = 7
Since xIJ = (m + n -1), the obtained initial basic feasible solution is non - degenerate
Since dIJ.. = 0 for cell (W,,C?) , an alternate optimal solution exists which can be
- - in nature.
obtained by constructing a closed loop from cell (W2,C 2).
Optimal solution by MODI method
10. ABC limited has three production shops supplying a product to 5 warehouses. Let us assume u3 = 0 ·
The cost of production varies from shop to shop, cost of transportation from II III IV u.
shop to shop, cost of transportation from shop to warehouses also varies. Each
A '+2
u, = 0
shop has a specific production capacity of each warehouse has certain amount
of requirement. The cost of transportation is as given below: B I ~ 9{80) =t n 1£11<+~ ~ u2 = 5
Warehouse Cost of
Shop
I II Ift IV v
Capacity
production C 1(60)"4 .n "4+3 'l~~ u3 =0
A 6 4 4 7 5 100 14 vj 1v=l8
I
v=l7
2
v=l8
l
v=l8
4
v=l9
5
B 5 6 7 4 8 125 16 Since dIJ.. "t. 0 for all unoccupied cells, solution is not optimal. Construct a closed loop
c 3 4 6 3 4 175 15 starting from a cell with highest negatived fJ.. value i.e. d IJ = -3 in cell(B,lV).
Requirement 60 80 85 105 70 Let u3 = 0
Find the optimum quantity to be supplied from each shop to different warehouse
at minimum cost. Dec 2012 (12M) and Jan 2015 (12M)
.' -
.r
. ,O~RATIQNS REsE,\RCl:I TRANSPORTATION PROBLEMS
48
I
~.·
~
. II III IV v u Check if this allocation is optimum, if not, find the optimum schedule•
ii) Obtain a basic feasible solution by any one method, if transportation cost
~
A~ u, =O
from A to G is reduced to 10. Jan 2010 (15 M)
; B u2 = 2 Sol. Construct the transportation table as per the data and check for the optimality of the
~l c ~=O '--:·
given allocation ·usingMODI method.
11•·
:: ..(•
Demand Points
vj I v1=18 v2=20 v=18
3
v4=18 v5=19 E .F
G H
l!1t·.
~ J:
LI.
Construct closed loop from cell (A,II) with dIJ.. = -2 I ---... '
I;~ .
•
Let u3 = 0 A u1 =-10
Cll
I I :.'I l ~~'I ; _",I ;r.G• j -ru.1
II III IV v U. 'E 1 1
·oc.. 8
A +4 u 1 =-2
b
~f 0..
0..
c
B .. u2 = 2 ::l
n r:/l
D = -1
l u, = 0
v. fv =18
-., VI ..,.~, ~ I '--" t-J! u4
vi v1=l8 v2=17 v3=20 v,=18 v5=19 J I v2 =20 v3 =6 v4 =6 vs= 13
As d,J =-I for cell (C,11), construct closed loop Since du~.. 'I. 0 for all unoccupied cells, solution is not optimal. Here, d for cells (C,E) ij
·a _ Let u, = 0 and (D,E) is -4 , i.e. tie occurs in the most negatived.IJ values. To break this tie, select
r IV v LI cell (D,E) with dii = -4 with least transportation cost of Rs. 13 to construct closed loop
A u 1 =-I
compared to that of cell (C, E) with dIJ.. = -4 with least transportation cost of Rs. 14.
+3 Shift the allocation {I 0) of corner cell (C, F) of the loop with -ve sign to cell (D,E)
.::. B u2 = 3 from where loop is constructed and check for the optimality by calculating diJ values
for empty cells.
c u3 =O Let L14 = 0
' vi I v,=18 v,=19 v3=19 v4=17 v,=19

Since d..IJ ::'.'. 0, for all. unoccupied.cells, solution is optimal. As d.IJ = 0 for cell (8,1), an
E F G H I LI
'
I
~-..---
~-
alternate optimal solution exists.
The op.timal cost of transportation
Z = (18x 15)+ (18x 85) +(22x20)+ (20x 105) + (18x 60) + (19 x 45) + (19x 70)
A
8
+17
fl
+8
u, =-5
ll2 = -2
i
•n
Z=Rs.7605 c
-
'
11. The following table gives cost of transporting materials from supply points A, D
'
B, C and D to demand points E, F, G, Hand I. The present allocation is: A to E
=!1
- = 90; A to F = 10; B to F = 150; C to F = 10; C to G = 50; C to I= 120; D to H = vj I v 1 =13 v2 =15 v3 =5 v4 =5 v5 =12
s;; 210; D to I= 70.
r;:.;::: Again d1i for cell (8,1) is -I (i.e. negative), the current solution is not optimal.
lL..
•To Construct a closed loop starting from cell (8,1).
(;;'.
Jll{ E F G H I Since corner cell (D,I) with -ve sign with minimum allocation of 60; shift this
jR__
1£ A 8 10 12 17 15 allocation to cell {B,I) and check for the optimality. Let u4 = 0.
i. From
8 15 13 18 II 9
'
c 14 20 6 10 13
t '
D 13 19 7 5 12
... ~- ··t ,~. <>~-?::~;!;fl;~~~~~~~·-~~~J~;~fr~!f~~i}F:~~~--;~ p~~Q~.-~ ~iaRCH
E F G H u.I
TRANSPORTATION PROBLEMS
A
G H ·1 Supply
100
.-Cili
Row Penalties
[2] [2] [2] f 5] [5]
A B 150 [2] [4] [4] [4] [4]
B c 180 [4] [7] [l] [7] [7]
<- <-
c D
D Demand 9,o 170 SP

vJ I v I = 13 v2 = 15 vJ = 4 v4 =5 v5 = Ii
Column [fl [3] [il
Penalties [~] [3]
Since d.•J = - I for cell {C,E), the current solution is not optimal. Construct closed loop
from cell (C,E) · r1 [3]
[3]
[3]
T
G H I u.I
A Cost of transportation
Z = (8 x 90) + (10x10)+(13x 150)+(20x 10)+( 6 x 50) + (13x120) + (s x 210)
B u2 =-4 +(12x70)
c1@ u, = 0 Z Rs.6720
.~
·~
~ ~
·~
DI@) 3;8 'UNBALANCED TRANSPORTATION PROBLEM·

-
vJ I v 1 =14 v2 = 17 V =6
3
v4 = 6 vs= 13 For a feasible solution to exist, the total supply must equal to total demand. ie.
Since d,i?: 0 for unoccupied cells, current solution is optimal, but an alternate solution Total supply= Total demand.
also exists, as d.IJ = 0 for cell (D,I) m=n
The optimal cost of transportation Ia,= Ibj
Z= L(IOx 100)+ (13x70)+(9x80) +(14x20) +(6x 50) + (13x110) + (13x 70) i=l j=I
The given problem is said to be unbalanced in), f. ~)i ie the total supply is not equal
+(5x210)
to total demand.
Z=Rs.6600 There are two possible cases
ii) Initial basic feasible solution by VAM, when cost of transportation from A to G Case (i):
reduced to I0. m n
L:a, < Ibj
• i=I j=I
If the total demand exceeds total supply, a dummy row (called dummy supply center)
can be added to the transportation table with zero cost. Hence, the unbalanced transportation
problem can be converted into a balanced transportation problem.
Case{ii):
1·
!ru a, OPdATHJNSlbsEARCB TUBSPoRTATIO• PROBLEMS
4IJI
lf~ m n
·!,/
I :.~·
Check for optimality using MODI method
~::ai > .lbj Let u2 = 0, then
i=l j=l 2 3 u
If total supply exceeds total demand, a dummy column (called dummy demand center) ~=~
.../
I'
can be added to the transportation table to absorb the excess supply. The unit transportation 02
~,.-,..,,..r;~~t-;.!:-...,...,,~\
~=O
: cost for the cells in the column is zero, because these represent product items that are not
f~ ~ ~=~
being made and being sent. ·
f~·; 12. Fqr the following unbalanced transportation problem, penalty costs per unit
D ~=4
1 v; I v1 =6 v2 =4 v 3 ~6
f
1l·
~.
of unsatisfied demand are Rs.5, 3 and 2 for destinations 1, 2 and 3 respectively.
Find the optimum solution.
Destination
Since d1j > 0 for all unoccupied cells, current solution is optimal.
The optimal cost of transportation Z =Rs 595
iiif! 2 3
13. A-product is produced by four factories A, BC and D. The unit production costs
in them arc Rs. 2, Rs. 3, Rs. l and Rs. 5 respectively. Their production capacities
t~ 01
02
5
6
I
4
7
6
10
80
are A - SO units; B - 70 units; C - 30 units; and D - SO units. These factories
supply the product to four stores, demands of which are 2S, 3S, IOS and 20 units
&,1
3 2 5 15 respectively. Unit transportation cost in Rupees from each factory to each store
~-
~
03
~ 75 20 50 is given below.
lb. July 2018 (l2M) 1 2 3 4
fi Sol. From data, it is an unbalanced transportation problem
L Supply = I 0 + 80 + 15 = 105
A 2 4 6 II
i L Demand = 75 + 20 + 50 = 145
B
c
IO
13 3
8 7 5
Add dummy row (i.e. origin) with a supply of 40 with unit transportation cost of 9 12
Rs. 5, 3 and 2 for destinations I, 2 and 3 respectively to make it a balanced problem. 4 ·6 ~
D j 8
Initial basic feasible solution by VAM Determine the extent of deliveries from each factory to each of the stores so that
n
'": I 2 3 Supply I Row Penalties the total production and transportation cost is minimum.
June 2010 (14M), Jan 2016 (12 M) and July 2016 (l2M)
•· · · t0-· · 1tl·]f
·~·-· · · · · · · · · · ·
s::
~-
:::.:::
'bii
·;: 80 [2][2][2]
:!.!~·:~
t.P-- 0 I Capacity= l;Supply=SO + 70 + 30 + 50=200
~~: · ······t5····· ttt+J············
I Demand =25 + 35 +I 05+20=185
Ii[" ..... 40-..... ·f1-]fll-···············
!!:::-.:~
Since I Capacity> L Demand, it is an unbalanced transportation problem
~ Demand I 75 20 50
!tt Add dummy column 'Oum' with (200 - 185) = 15 demand with zero (transportation
I [I)
&1.:.
~
(2) [3]
+ production) cost in each cell to make it balanced transportation problem.
~~.
Column [2] [I] [3Jr
Penalties [I] Construct new transportation matrix that includes both production and transportation
~t: [3]j [2]
M:::. costs as shown below and obtain initial basic feasible solution by VAM.
~~·
ai2_ x..IJ =6
....
~-- • (m+n-1)=(4+3-1)=6
~~.
Ji~ Total cost Z={l 0x1) + ( 60 x 6) + (10 x 4) +(!Ox 6)+ (15 x3) + ( 40 x 2)
4~ .
~_:
a~· Z=Rs.595
i-f,-1
Iii.! Since X;j = ( m + n - I), obtained intial basic feasible solution is non -degenerate in nature.
tl<'"I
I IL_
"""' Store
OPERATIONS REsEARCH TRANSPORTATION PROBLEMS
2 3 4 Dum
------
u.I
...
4 Oum Supply Row Penalties
A 50 [4)[2)[2][2]{5] A I@
c0 B 70 [8][2)[2][2)[2] . B
0
"' c 30 [4][6]
~
c
"'"' [8)[1][1)[3][S)
D 50 ,. ..
I
;
~ ~
De1pand
Column
~5
[$]
3~
[~]
105
[2)
20
[O]
I~
[91
D
OI OI = I= I= I •• = IJ
Penalties [2J [OJ vv=.-4 v=-2 v=O v=-5 v=-13
[$J [iJ J I 2 3 4 S
[2J [O]
[!11 [$J
[\]l [2] [OJ
Since all dii 2: 0 , for all unoccupied cells, the initial basic feasible soiittion is an
optimal solution.
[2] [O] The optimal cost of transportation Z =Rs. 1465
In this problem, tie occurs between row Band D in maximum penalties and cell with Note: Suppose if we make allocation to cell during VAM, we would not get optimal
minimum cost of zero. Moreover, maximum possible allocation is l S in both cells; solution in the initial stage that could need closed loop in the additional matrix in
hence choose either row B or D for allocation arbitrarily. But better choosing row D MODI method to reach optimally condition.
with minimum supply capacity of SO compared to that of row B with 70.
The positive allocations are 3.9 MAXIMIZATION TRANSPORTJ,'.'flPtfp({pBL,EM
x(A.I) = 2S, x(A.z) = S, x(A.J) = 20, x(B.3) = 70, x(c.z) = 30, x(D.J) = 15, x(o. 4) = 20 In general, transportation model (technique) is used for cost minimization problems. If
the objective of the transportation problem is to maximize total value or benefit (profit) i.e.
and x1o.s) =l S
instead of unit cost cij' the unit profit or payoff P;i associated with each route (i, j) is given,
xIJ =8 then the objective function in terms of total profit or payoff is given by
(m+n-1)=(4+5-1)=8 m n
Total cost of trnnsportation Maximize. Z ='l.J 'p
L.t IJ x.LJ
Z=l:( 4x 25) + ( 6x S) + (8x 20) + (10 x 70)+ ( 4x30) + (13x IS)+ (8 x 20) + (0 x IS) i=I j=l
Z=Rs.1465 For finding initial solution by VAM, the penalties are computed as difference between
the largest and next largest payoff in each row or column. In this case, row and column
Since( m + n - 1) = X;; = 8, obtained initial basic feasible solution is non -degenerate in
differences represent payoffs and allocations are made in those cells where the payoff is
nature. largest corresponding to highest row and column difference.
Optimal solution by MODI method A solution is optimal, if all opportunity costs 'd;/ for the unoccupied cells are zero or
negative.
Let v3 = 0,calculate u, + vj = c;i for occupied cells and du= cu -( U; + v.i)forunoccupied
cells
4
m1r+:~~~~F:"'i~~1f::40sij-~c;;:~J't~·''.'t£'" '-·t ;_•'.c··-p ·•'---- Q~RA_1Jo~s'REsEARCH
,_
TRA11sPORTAnoit PJtonEHs , '_' - • ·-
14. A company has four factories F1,-F2, F3 and F 4 manufacturing the same product. s
-Production and raw-Diateriiif eosts differ from factory to factory and are given
in the following table-in the first two rows. The transportation costl from the F1
factories to sales depots's1, S2 and 83 are also given. The last two columns in F~
the table give the sales price and the total requirements at each depot. The \
production capacity of each_ factory is given in the last row. Fl
Sales F4
F1 F2 FJ F<i Requirement
price/unit
~; firoduction cost/unit 15 18 14 13 Dummy
it
r Raw material cost/unit 10 9 12 9 Requirement 8P 120 150
L
Transportation cost/unit S, 3 9 5 4 34 80 Column [I] [1]
L r11
~ s? 1 7 4 5 32 120 Penalties [I] [I]
t
ii
S, 5 8 3 6 31 150 fJH [I]
{2] [2]i
Availability 10 150 50 100
~· [2] [4]l
.1--~-- Determine the most profitable production and distribution schedule and the
Total ~rofit Z={ 6x 10)+ (-2x 90)+ {-4 x 60) + (2 x 50) + {8 x 80) +{5 x 20) +(Ox 40)
.,'f-__ corresponding profit. The surplus production should be taken to yield zero
~ profit. Dec 2011 (ISM) Z=RsA80
:: Sol. Here, the objective of the company is to maximize the profit
I;_ Xii =7
1~ Check for the balance
(m + n-1) =(S +3-1)=7
i;; 2:Availability=IO+ 150+50+ 100=3 I 0
P.'. 2:Requirement=80+ 120+ 150=350 Sincex;i = ( m + n -1),obtainedinitial basicfeasiblesolution is non -degenerate in nature
t SinceI:Avaialbiliuty;.: I: Requirement, it is an unbalanced transportation problem. Check for optimality by MODI method
rIlk
~
"'--
To make it a balanced problem, add dummy row (factory) of zero profit in each cell
with the availability of 40.
Profit= Sales price - Production cost - Row material cost - Transportation cost_
Sales depots -
Let us take v3 = 0
F1 +3
s
u1 =4
u.
tL
s, s, S, Availability Fi +3
u2 = 12
iJ
iii- Cll
34-15-10-3 = 6 32-15-10-1 = 6 31-15-10-5=1 10
ra: <l)
·;::: F1 Fi UJ =6
~· 0
F2 34-18-9-9=-2 32-1-8-9-7=-2 31-18-9-8=-4 150
... 'O:li3
F4 u4 =S
a." L.L. F, 34-14-12-5=3 32-14-12-4=2 31-14-12-3=2 50 -(I)
""
;j~
F• 34-13-9-4=8 32-13-9-5=5 31-13-9-6=3 100 Dummy +5 u5 = 8
.Ii
~:
+2
~r Oum 0 0 0 400 v. vI =-5 vl =-2 v, = 0
I
Requirement 80 120 150 Since dii 2: 0 for all unoccupied cells, the current solution is optimal, but an alternate
Choose largest element (i.e. Profit) 8 from the table and subtract all elements from optimal solution also exists as dij = 0 for cell (F4,S 2)
it to convert maximization problem into minimization type and obtain initial basic The optimal profit Z = Rs. 480
feasible solution by YAM.
..
15.
OPERATIONS REsEARCH
A co~pany bas plants A, Band C which have capacity to produce 300, 200
and 500 k~ respectively of a particular chemical/ day. The production cost per
III IV Capacity I Row Penalties

..
kg in these plants are·R~. 0.70. Re. 0.60 and Re. 0.66 respectively. Four bulk A
consumers have placed orders for the products on (he following basis;
300 I [ 1][0](0][0][2]
~
Lonsumcrs Kg required/day Price offered Rs/kg B

I 400: 1.00
II 250 1.00
c
III 350 1.02 D 150
IV 150 1.03
Requirement 400 250 3$0 1$D
Shipping costs in paise/kg from plants to consumers are given below:
To consumers
Column m [ 1] cp li]
Penalties [l]l [ 1] [~]
1 II ' Ill IV [j] i [3] li1
From A 3 5 4 6 [2~] [25] [2:] i
Plants B 8 11 9 12 c2r]i (25]
c 4 6 2 8 x. = 7
'l
Workout the optimum schedule for the above situation considering all the data (m + n - I)= (4 + 4- I)= 7
given. June 2010 (16M) and July 2014 (12M) Use profit values in table l to determine profit
Total profit
Sol. In this problem, objective is to maximize the profit.
Z=(27 x 50) + (25 x I 00) + (27x150) + (32 x 200) + (30x150) + (34 x 350) +(Ox 150)
Profit= Selling price - Production cost - Shipping cost
Check for the balance Z = 30700 paises
l: Capacity= 300 + 200 +500 = I 000 Z=Rs.307
l: RequiremeQt = 400 + 250 + 350 + 150 = 1150 Since xii = ( m + n ~I), the obtained initial basic feasible solution is non -degenerate
Since l: Capacity :f:. l: Requirement, it is an unbalanced transpo11ation problem. Add
dummy row (i.e. Plant D) with capacity of 150 & profit ofO paise in each cell. in nature.
Prepare profit table
Consumers
• Optimal solution by MODI method
Let us assume v1 = 0
II III IV II 111 IV Capacity
~ A I 00 - 70 - 3 = 27 100- 70 - 5 = 25 I 02 - 70 - 4 = 28 I 03 - 70 - 6 = 27 A Lii = 7
«l
0:: B I 00 - 60 - 8 = 32 100-60- II =29 102 - 60 - 9 = 33 103-60-12=31 -(1)
c I 00 - 66 - 4 = 30 I 00 - 66 - 6 = 28 102-66-2 = 34 I 03 - 66 - 8 = 29 B ll2 =2
D
(Dummy)
0 0 0 0 c LIJ = 4
'--~~~~--''--~~~~~....._~~
Convert this maxm11zation problem into minimization type by subtracting all D +2 +6 +2 u. = 32

elements from highest element in the table i.e. 34 and obtai_n initial basic feasible
solution by VAM. \I
J
I \I
I
=O v c =2 v 3 =-4 v5 =O
Since di1 ::: 0 for all unoccupied cells, the current solution is optimal, but an alternate
optimal solution also exists as d'I = 0 for (CJ!)
•
Z =Rs. 307
r,
"
"'.
~
l:
c::
~-
'
I
;
....
16.
OPERATIONS R£5EARCH
A Canning company operates 2 Canning plants. 3 growers are willing to supply

fresh fruits in the following amounts:
TR.usPORTATION PRoBLEMS
G,
Supply I Row Penalties
.-
(45] (130] (130]
Grower 1 - 200 quintals.atRs.100/quintal
Ir Grower 2 - 300 quintals at Rs. 90/quintal

Grower 3 - 400 quintals at Rs. 80/quintal
The shipping cost in rupees per quintal are
G2
G,
~
400
,-~
r
-
A B ..- · · · -
Demand 3$0 100

j·
G 20 25 [$] [O]
f!
G, 10 15 Column
iif'
Penalties
i [O]
i G, 50 30 i [O]
i. The plant A and B capacity and labour costs are x.IJ = 5
"' Plant A capacity- 450 quintals; Labour.cost-Rs. 250/quintal
fl;- (m + n -1) = (3 + 3 - I)= 5
~ Plant B capacity- 350 quintals; Labour cost-Rs. 200/quintal
~-:.
;:!
Total profit
'1 The Canned fruits are sold at Rs. 500/quintal to the distributor. How should the
~;
Total profit Z =(130x150) +(Ox 50) + (150 x 300) + (190 x 350) + ( 0 x 50)
company plan its two plants so as to maximize its profit? Jan 2008 (16M)
~[ Z=Rs.131000
~; Sol. Here, the objective of the company is to maximize the profit, which is calculated
l- using the relation. · Since x,i = ( m + n - I), the obtained in ital basic feasible solution is non degenerate in nature
1' Profit= Selling cost - Labour cost- Shipping cost - Fruit cost
Check for optimality using MODI method
l Check for the balance
"'· 2.:Supply =200 + 300 + 400=900 Let us take v1 = 0
~·
~·
Supply
L:Demand=450+350=800
Since L Supply f. L Demand, It is an unbalanced transportation problem. Add dumy G,
~ plant of zero profit in each cell with a demand of I 00.
~
m
111· A
Plants
B Dummy Supply
Gz u2 = 45
UJ = 65
:!'-'" "'11)..... GJ
~
:rt·
::: G, 500-250-20-100 = 130 50Qc200-25c 100 = 175 0 200
I vI ·= o
t
;:-:
ll!,
!£ .
.
0
e Gz 500-250-10-90 = 150
G. 500-250-50-80 = 120
500-200-15-90 = 195
500~200-30-80 = 190
0
0
300 -(I)
400
v.J v2 = -60 v3 = 130
Since dIJ > 0 for all unoccupied cells, the current solution is optimal
The optimal profit Z =Rs. 1,31,000
~·
Demand 450 350 100
!"
l~~
17. Solve the following transportation problem to maximize profit and give criteria
k Choose largest element iri the table (i.e. 195) subtract all elements from it to convert for optimality
r:"
•·· this maximization problem into minimization type & obtain initial basic feasible Destinations
~
~~ solution by YAM.
I 2 3 4 Supply
n'
!.!.:
A 42 27 '24 35 20Q
i:. Origins.
I
B 46 37 32 32 60
'
c 40 40 30 32 140
Demand 80 40 120 60
August 2005 (16M)
....
L:Supply =200+60+140=400
OPERATIONS REsEARCH TRANSPORTATION PROBLEMS
2 3
.
4 5
411
A u, =O
L: Demand = 80 +.40 + 120 +. 60 = 300
It is ~n unbalanced transpo11ation problem. Add a dummy column (i.e. destination) B uz =-12
with a demand of I00 and zero profit in each cell to make it a balanced problem.
Destination c UJ =-{)
2 3 4 Dum I Supply v, = 12 v, = 12 v, = 22 v, = 11 v, =46
A I ~ Int ·~ ~ LJLj 200 Since d,j t 0 for all unoccupied cells, the solution is not optimal.
c 0 Construct a closed loop from a cell (A, I) which has highest negatived.•J value i.e. -8
:§ B 60 Since corner cell (C, 1) in the closed loop has -ve sin with minimum allocation of
0 0 20, shift this allocation to cell (A, I) and check for the optimality.
c 140 Let u, = 0
Demand I 80 40 120 60 100 3 5
Convert this maximization problem into minimization type by subtracting all the A u, = 0
clements from largest element i.e. 46 and obtain initial basic feasible solution by
VAM. B
3 4 Supply I Row Penalties
.. - c
A 200 I [7][7][7J[l 1][24J
v,=4 v,= 12 v,=22 v,= II v,=46
B
Since d.IJ = -4 for cell (B, 3) the solution is not aptimal
c Construct a closed loop from cell (B, 3)
'a The corner cell (A, 3) in the closed loop has-ve sign with minimum allocation of20.
- ~ <-
Demand so 4o f20 60 JOO Shift this allocation to cell (B, 3) and check for the optimality.
Let u, = 0
Colmim [~J OJ [2] m [OJ
2
Penalties [~J [1\3Ji [6] [l] [QJ 3 4 5
(f] [6]
[6]
m . [OJ
[OJ
A u, = 0
riJ
[6] [OJ B
x = 7
'l
(m + n - I)= (3 + 5 - I)= 7 c +4 +S +2
u,=-2
Total profit v, =4 v,=8 v,=18 v,=11 v,=46
Z = (24 x 40) + (35x60)+(0x100)+( 46x60)+( 40x 20) + ( 40 x 40) + (30x80)
Since d;; :'.: : 0 for all unoccupied cells, the current solution is optimal.
Z= Rs.10620/- "' Total cost Z = (4-0 x 42) + (60x 35) +(JOO xO) +(40x 46) + (20 x 32) + (40 x 40) + (100 x 30)
Check for optimality by MODI method Z = Rs.10860
Let us assume u, = 0
...
18.
0PERATI01'S REsEARCH
A company has received a contract to supply gravel for three new construction
TIWrSPORTATIOlf·
- -·, .. :
~ . - . PROBLEMS
In this problem, while calculating the penalties take into account the values of cells
·,41
'
~
J
t
!·
projects located in towns A, Band C. Construction engineers have estimated ·the~• ·
required amounts of gravel which will be needed at these construction projects:
'
Project location
A
B
Weekly Requirement (Truckloads)
72
102
·''-t
in the dummy column also.
In the second step, there is tie among the 2 columns (i.e. A & 8) and a row (i.e.
Z) for maximum penalties. To break the tie, look at the cell with minimum .unit
transportation cost. Again tie occurs among the cells (X,B), {X,C) and (Z,A), that
can be broken by selecting a cell (X,B) with minimum unit transportation cost where
c 41 maximum allocations of 76 can be made.
I.
. j
I. I T~e company z.
has 3 gravel pits located in. towns X, Y and The gravel required Xrx.e] = 76, x[Y,B) = -21, x[Y.C) = 41, X[Y.Dwn] = 20, x[Z.A] =- 72 & X[z.e) = 5 :.xii= 6
~ by the eonstruction projects can be supplied by three pits. The amount of gravel Cost of transportation Z = L:{8 x 76) + {24 x 21) +(16x 41) + {20x 0) +(8x 72) + {16 x 5)
8 which can be supplied by each pit is as follows:
Ii
[~.
d
Plant : X Y Z
Z=Rs.2424
Amount available (truckloads) : 76 82 77 (m+n-1)=(3+4-1)=6
~ The company has computed the delivery cost from each pit to each project site.
Since xii= (m + n - I), obtained basic feasible solution is non - degenerate in nature.
~ The~e costs (in Rs) arc shown in the following table:
* Optimal solution by MODI method
~; Project Location Let v2 = 0, as the summation of positive allocations is maximum (i.e. 102)
~t
't.f- A B c A B c
•·
I Pit x 4 8 8
L
y 16 24 16 x 41® 8 8
~
+8
z 8 16 24
~,~.
Schedule the shipment from each pit to each project in such a manner so as to y
minimize the total transportation cost within the constraints imposed by pit
capacities and project requirements. Also find the minimum cost.
z @ +16
LSupply = 76 + 82 + 77 =235 v. v, =-8 v2 = 0 VJ =-8 v4 =-24
J
LRequirement=72+ I 02+41 =215
~· SinceLSupply >I Requirement, it is an unbalanced transportation problem.
Since d.?: 0 for all unoccupied cells, the current basic feasible solution is optimal,
~
but alternate solution also exists as d(Y.AI = 0 .

.
~
~;
Add dummy column (i.e. project location) 'Dum' with the requirement of235-215=20 :. Optimal cost of transportation Z is Rs 2424
with zero transportation cost in each cell to ma~e it a balanced transportation problem. To find the alternate solution, draw a closed loop starting from a cell with dii = 0
E
~~ Construct the transportation matrix and obtain basic feasible solution by YAM. i.e. cell (Y, A)
,,.. 4 I r::;;-., I 8 8 0
Projection location
l~
t-· ®
!:-~ A B c Dum Availability
(loads)
Row Penalties 0
;~·.
~
u•. @ =>
x ··-+·\'.-_ ·--®~ ---+~ ---+~ 76 [4] [4]
-
u
@l'!. 0
;~ ®~
~
!!.. ~
y 82 [ 16] [8] [O] [8] 0
.0...
z @~ ®!!!> j ll! j l'!. 77 [8] [8] [8] [8]
Requirement Letu 2 =0
e. 72 102 41 20
~-
(loads)
Column [4] [8] [8] [O]
Penalties [4] [8] i [8]
[8]f [8] [8]
[8] [8Jt
.... A B c
0PERATIOJJ8 REsEARCH
Dum u,
TRilsl>oRTATION PROBLEMS
The positive allocations x..IJ = 7

{m+n-1)=(4+4-1)=7
...
,. .
8 The total cost of transportation

l-1
0
x I L.!i@ +8 +(6
u =-16
I
Z = L(I x 35) + (3 x 35) + (11x5)+ (2 x 50) +(!Ox 60)+(7x10) +(Ox 20)
0 Z=Rs.965
y 1@ u2 = 0
Since (m + n - I) = xii = 7, the obtained initial basic feasible solution is non -
0 degenerate in nature
z 1@ +16 +8
u =-8
3 Optimal solution by MODI method
Let v1 =0
vJ · I v I = 16 v,=24 v3 = 16 v4 = 0
D, , 02 -Di 04 u.
Cost of transportation I I,; > < I . I I - I
,_] I
Z=L(8 x 76) + {16x 21)+ (16x4 l)+ (Ox 20)+ (8 x 51) + {l 6x 26) o,
Z=Rs.2424 02
19. Solve the following transportation problem to minimize the total transportation o_ u_ = 10
' '
cost Oum u4 = 0
D, D, D, D, Supply
0 6 I 9 3 70 V.
J
Iv =o 1
v2 =-5 v3 =-9 v4 =-3
0, II -·5 2 8 55 Since d10,.ov = -1, the current solution is not optimal. Construct a closed loop from
·o, 10 12 4 7 70 cell (0,,.:. D,)with
-
d.IJ = -1.
Demand 85 35 50 45 Select the allocation of 5 in the cell (02, D 1) with-ve sign in the corner of the loop
and transfer it to the vacant cell where loop starts and terminates, then the revised
Sol. Check for the balance transportation matrix is
2:Supply=70 + 55+70=195 Let v1 = 0
2:Demand=85 + 35 + 50 + 45=215 o, 02 Ul LJ4 uI
Since I: Supply 7:- L Demand, it is an unbalanced transportation problem. 01 uI =6

.
Add dummy row with (215 - 195) = 20 capacity with zero transportation cost in each o, u2 = 10
cell to make it a balanced transportation problem.
Construct the transportation matrix and obtain initial basic feasible solution by YAM. 01 ® u3 = 10
D. D, D, 0, Supply I Row Penalties I Oum @) u4 =0
vJ I vi= o v, =-5 v) =-8 v4 =-3
Since all dii '.:'. 0, the current solution is an optimal solution, but alternate solution also
exists as d<0 I· 0 I J = 0. ,
The optimal value of transportation
Demand 85 3~ Z =I(! x 30) + (3 x 40) + (5 x 5) +(2x 50) +(!Ox 65) +(7x 5)+ (Ox 20)
Column
Penalties
I {6]i
[4]
IO [+1
[4] j [i]
m
[~]
z,,Rs.960
{4] \ [iJ [4]

(4] \ i [1li
[I] i l OJ
'1"
....
20.
.0PERATIOllS REsEARCH
The transportation costs per truck load of cement (in hundreds of rupees) from
each plant to each project site are as follows:
Tru.NsPORTAT1011 PRoaLEMs
3 4 u.
..
Project sites ,- 1- a I' I -
1 '• . I u-3
I - -
Supply
I 2 ~ 4 u2 = -8
I 2 3 II 7 6
tj' Factories
2 I . 0 6 I. I
tl
1
'i
3 5 8 15 9
...
IO
.~l Demand 7 5 .) 2 As dii = -1 for cells (1.3) and (2.3), the current solution is not optimal. Construct a
l Determine the optimal distribution for the company so as to minimize.the total closed loop from cell (2,3) with dii =-I with minimum unit transportation cost of
t transportation cost. 06CS661 (12M) Rs.6 (as compared to cell (I, 3) with d IJ.. =-I and minimum transportation cost of
J
;. Sol. Check for the balance ·•. ·Rs.1-1 ),and check for the optimality.
¥. r Supply = 6 + I + IO= 17 I 2 3 4 I u
r Demand = 7 + 5 + 3 + 2 = 17
f Since r Supply = r Demand , it is a balanced transportation problem. 0~\ '1+1 !u,=-3
IiJi: Initial basic feasible solution by VAM
2
I . ' ' - I u~ = -9
Project sites
I .f I. I r.
I
I J I . I .
t.
Supply I Row Penalties
~
2 3 4 3 ll'C t • ~ I \.' I I U," = 0
I _ (.,I _!I~ I I 11 I r.,
f C> vj 1v=5 v=6 v=15 v=9
[ .8
I 2 3 4
t Since d,1 ;to for all unoccupied cell (I ;3) the current solution is not optimal. Construct
0
u.."' 2
a closed loop from cell ( 1,3) with dii =-I and check for optimality.
l.r;: 3 10 Let u3 = 0
2 3 4 I -l-- u
!f"
Demand 7
~ 3 2
+I \:!..! \..!_} +2 u, = -4
!!fr·
t::· .
Column
Penalties
[I]
[3]
m [5]
[4]
[6]
[2)j 2 +2 u2 = -9
lfli
~~
11,.
[3] [4] [2]
3 +I u3 = 0
=6
X ..
1= . IJ
v. I v1 =s v2 =7· v3=15
~~ (m + n - I)= (3 + 4 - I)= 6 J "• = 9
~- Total cost of transportation
•·~~. Since dii ~ 0 for all unoccupied cells, the current solution is optimal. But, an alternate
C,..;..
G:: Z = {(2x 1)+{3x5)+ {Ix 1)+{5 x 6) + {15x3) + (9x !)} x 100 solution also exists as d..IJ= 0 for cell (2,4)
Ii-~
Z=Rs.10200 The optimal cost of transportation

ITT
Si: Z = {( 3 x 5) + { 11 x I) + ( 6 x I) + ( 5 x 7) + ( 15 x I) + ( 9 x 2) j x ·100
:s· Since( m + n -1) =xii• the obtained_ initial basic feasible solution is non-degenerate
.......
[
in nature
.. Z=Rs.10000
Check for optimailty by MODI method

i: Let us take, u3 = 0
F
!•·
L
I..
t
....
3.1 O DEGENERACY IN TRANSPORTATION PROBLEM AND_iTSRESOLUTlON
- • . •• . .• - ;.;:,.~;-,:
·: -;- • '· ••• : . "t - - . : , _.:-: - .
A basic feasible solution for the general transportation problem must 1::onsist of exactly
• •
0PERATI0118
. - ' ' o:..c·
-· _. - : . - ••-
~·-
REsEARCH
....: ,;_ ...• ·: ., - -- ·--; ,.
'.'.'." - ,_ . ·- . •
TRAllSPORTATJOll PROBLEMS
-·-·:..-
Destination Row
Penalties
..
(m+n-1) positive allocations in ind.ependent positions in the transportation table. Asolution
will be called degenerate (degeneracy exists) when number of occupied cells is less than II)
A
~
m+n-1. In such cases, the current solution cannot be improved, because it is not possible ::;
0
B
to draw a closed path for occupied cells. Also, the values -Of the dual variables ui and vi VJ
which are used to test the optimality cannot"be computed. There is a need to remove the c
·· degeneracy to improve the given solution. Demand I so ·~
~o 80
The degeneracy in the transportation problems may occur at two stages.
a) When obtaining an initial basic feasible solution, we may have less than m+n-l
Column
Penalties
I [5]
[5]
[f] i [2]
[6] i
allocations.
b) At any stage while moving towards optimal solution when two or more occupied xii=4
cells with the same minimum allocation become unoccupied simultaneously. Cost of transportation l=L(3 x 60) + (3 x SO)+ (9 x 20) + (3 x 80)
Case (i): Degeneracy at the initia~ solution: Z=Rs.750
To resolve degeneracy at the initial solution, we have to allocate a very small quantity m=3
tJ. (delta) close to zero to one or more unoccupied cells (if necessary) so as to get m+n-1
n=3
number of occupied cells. This b would not affect the total cost as well as supply and
(m+n-1)=(3+3-1)=5
demand values.
In a minimization transportation problem, we have to allocate tJ. to unoccupied cells that Since xii < (m + n -I), the initial basic feasible solution is degenerate in nature.
have lowest transportation costs, whereas in maximization problems, it is allocated to a cell To remove degeneracy, add b to a cell with minimum transportation, where closed
that has highest payoff value. loop cannot be constructed. Add b to a cell (C,Z) with unit transportation cost of Rs. S,
Case (ii): Degeneracy at subsequent iterations: where closed loop cannot be constructed and obtain optimal solution by MODI
method.
To resolve degeneracy which occurs during optimality test, the quantity b may be
allocated to one or more cells which have become unoccupied recently to have m+n-1 Let v3= 0
number of occupied cells in the new solution. ui
21. Solve the following transportation problem to minimize the total transportation 11 1 =3
cost.
z Supply "2 = 9
3 60 u3 = 5
A 8 7
8 3 8 9 70 Vd v,=-{i v2 =-2 v3 =0
c II 3 s 80 Since d'l > 0 all unoccupied cells, the initial basic feasible solution is optimal.
Demand so 80 80 The optimal cost of transportation Z =Rs. 750.
22. Solve the following transportation problem to minimize the total transportation
Sol. Gheck for the balance cost.
LSupply,,,;60 + 70+ 80=210
A B c D E Available
L Demand=50 + 80 + 80=210 I 4 3 I 2 6 80
Since L Supply= I Demand, it is a balanced transportation problem.
2 5 2 3 4 5 60
Initial basic feasible solutiou by VAM ,.,
.) 3 5 6 3 2 40
,.,
4 2 4 4 5 .) 2-0
Required 60 60 30 40 10
·'
.EAvailability = 80 + 60 + 40 + 20 = 200
L Requirement = 60 + 60. + 30 + 40 + 10 = 200
OPERATIONS REsEARCH
~·:
...
even if we allocate L'l to either of these two; allocate .1 to cell (I ,B) , then the number
of allocations in that column is 2. and row is 4, if we allocate to cell (2,C), the no. of
!l·if allocations in that column as well as in that row is 2. Since no. of allocations along
Since L Availability= .E Requirement, it is a balanced transportation problem. the row of ( l ,B) is more, allocate L'l to it to get the optimal solution easily and check
.•·d Initial basic feasible solution by VAM for the optimality. \
.! A 8 C D E Availability Row Penalties Since dii > 0 for all unoccupied cells, it is an optimal solution and the optimal cost of
21.:..... W ......... so ......... !.[-1.Jf 1-lf2jpJ..................... transportation Z = Rs. 420. ·
,__,__
23. Solve the following transportation problem to minimize the cost.
' 2
llf Destination Supply
3 40 .I 2 3 4 5 6
lfi'
.[.I.][.l]tlJ[.L][.l]................ .
~i
'• ,__ I 9 12 9 6 9 10 5
i~ ~o ~o ~o 4~ IO Warehouse 2 7 3 7 7 5 5 6
r
11:
~ [µ l [IJ 3 6 5 9 II 3 II 2
-10.:
Column PJ DJ
I Penalties OJ [hJ i (j!J [I J 4 6 8 II 2 2 10 9
OJ [I] .Demand 4 4 6 2 4 2
1'1
[r]j
01 [I]
[I]
[ l]
L:Supply=5+6+2+9=22
C=7 L Demand=4 + 4 + 6 + 2+ 4+ 2=22
"
(m+n-1)=(4+5-1)=8 Since L: Supply= L: Demand, it isa balanced transportation problem
Cost of transportation
.
Z=I( 4 x I0) +{Ix 30)+ (2 x 40) +{2 x 60) + (3 x 30) + (2 x I0) + (2 x 2)
Z=Rs.420
Destination
3 4 5 6 Row Penalties
· Sincex,J <( m + n - I), the obtained initial basic feasible solution is degenerate.
<!)
5 (3) [3] [O)[O](O][O]
To remove degeneracy;add L'l to a cell with minimum unit transportation cost where "'
::l
closed loop cannot be constructed and check for optimality using MODI method _g
e 2
~; A 8 c D E ui ~
1·
ti;;''
@ '.11=0
3
~· ·4
I 2 u2 =-I
Demand
~~ 3 .1@ u, = -1 Column
Penalties
m'~.:~ 4 I@ +3 +5 +5
u. = -2
+2
r
ll~
J I v, =4
v v2 = 3
'
v. =I v. = 2 vs= 3
Although cells ( 1,8), (2,C), (3,D) and (4.E) have minimum transportation cost of
li
Rs.3, but closed loop can be constructed from (3.D) and (4.E). Hence dont allocate L'l
l
Total number of positive allocations xIJ = 8
to either of these two cells. Among ( 1,8) and (2.C), although loop cannot be formed (m+n-1)=(4+6-1)=9
'
'
.... OPERATIONS lbs~CH
Since(m + n -1):;:. xii' the obtained intial basic feasible solution is degenerate in nature.
The total cost of transportation
:LCapacity=200+300=300
L Demand= 7S +I 00+ 100+ 30=30S
4F'
Z=(9x S)+(3x4)+ (Sx2)+( 6x I)+ (9x I)+ ( 6x 3) + (2 x 2) +(2x 4) It is an unbJlanced transportation problem. Add dummy row (i.e. Plant) capacity of
S with zero profit in each cell to make it a balanced p'roblem.
Z=Rs.112 ·
Showrooms
Note : If the least and second least cost are same in two different cells in a row/
Ronchi Delhi Lucknow Kanpur Capacity
column, then the row/column penalty is zero.·
To remove degenracy, Add /1. to a cell with minimum transportation cost, where Bon) bay 90 90 100 110 200
E"'
closed loop cannot be constructed and then obtain optimal solution by MODI inethod. ...::::! Calcutta so 70 130 8S 100
0...
Take U4 = 0. Allocate /1. to either a cell (2,5) or (3,2) with minimum transportation Dummy 0 0 0 0 5
cost, where closed loop cannot be constructed. Although, a cell (3.5) has minimum Demand 75 100 100 30
transportation of 3, do not allocate t:i. to it, as closed loop is formed from that cell. Convert this maximization problem into minimization type by subtracting all elements
I 2 3 4 5 6lu from largest element i.e, 130 and obtain initial basic feasible solution by VAM.
9 Showrooms
+3
@I . I _I ,I ul =o Luk Kan I Capacity I Row Penalties
Bombay
2 u2 =-2 200 I [10 [10] (O]
"'
E
~
3 ui = 0 0...
4 u4 = 0 Demand 75 100 l~O 3p

+3 +2 +3
v1 I v,=6 v,=5 v3 =9 v,=2 vi=2 v6 =7 Column [40] [20] [3PJ [2~]
Penalties [90] [9p] [160] [I ~O]j
Since dIJ-> 0 for all unoccupied cells, the current solution is optimal. But dIJ = 0 for [90] [90]j
cell (2,3) , an alternate solution exist.
x IJ = 5
To obtain an alternate optimal solution, construct a closed loop from cell (2,3)
(m + n - I)= (3 + 4- I)= 6
The optimal solution
Total profit
Z = (9x S) +(3x4)+(Sx2}+(6x 1)±(9x 1) + ( 6x 3) + (2x 2)+(2x4)
Z = (90 x 70) t (90x IOO)+(I 10x30) + (!30x100) +(Ox 5)
Z=Rs. 112
Z=Rs.31600
24. A company manufacturing air-coolers has two plants located at Bombay and
Since x 'J f (m + n - I), the obtained initial basic feasible solution is degenerate in nature.
Calcutta with a capacity of 200 units and 100 units per week respectively. The
Add 't..' to a cell with minimum cost from where closed loop cannot be constructed
company supplies the air-coolers to its four showrooms situated at Ranchi, Delhi,
and check for optimality.
Lucknow and Kanpur which have a maximum demand of 75, 100, 100 and
Let us assume u1 "'0
30 units respectively. Due to variation in raw material cost and transportation
Ran Del Luk Kan u
cost, the profit per unit in rupees differ with places which is shown l>cl-0w:
Ranchi
Delhi Lucknow K_anpur Ban I \!:!)
Q 40
-~
w
40 (;:_\, 30 ht)\ 20
~ ®u = 0 1
Bombay 90 90 100 110

so Cal I 9 9 (IOOL.::....t ---r45J u, =-30
Calcutta 70 130 85 +ss I -
Find the optimum production capacity schedule to maximize the profit.
Feb 2006 (20M)
Dummy I()
5 ~1
0
I +10
~~130
.
·
+20
lL = 90
·'
Sol. Check fo1· the balance vJ I vI = 4U v2 = 40 v3 = 30 v~ = -?O
... OPERATIONS REsEARCH
Since d;J 2.': 0 for all unoccupied cells, the current solution is optimal, but a_n ~Jte~nate
solution also exists.
'lk
TiwiSPORTATION PROBLEMS
du_e to the requirement of two~· (i.e. two negligible allocations).

x:·IJ == 7
(m + n -1) == (4 + 5 - I)== 8
..
!~'
;1
The optimal profit
i:.;
;i Z=(90x 70) + (90 x I00) +(I IOx 30) + (130x I 00) + ( 0 x 5) Cost of transportation
'l',
:!"
l ~
Z=Rs.31600
Z=L(3x 8) +(If x 4) + ( 6 x I)+ (4 x 4) + ( 6 x 2) + ( 6x3)+(0x3)
T Z=l0x92=Rs.920
:1. 25. A manufacturer wants to ship 22 loads of his product as shown below. The
ma~i'ix gives the kilometer from source of supply to the destination. Sincex;i :t. ( m + n -1), the obtained basic feasible solution isdegeneratein nature.
J.
i Destination To remove degeneracy, Add~ to a cell with minimum unit transportation cost, where
~: Supply closed loop cannot be constructed.
0, 0, ·D, D, D,
I Although 4 unoccupied cells of dummy row have minimum unit transportation cost
J
Source s, 5 8 6 6 3 8
I: of zero, select cell (Duin,05) to add~. where closed loop cannot be constructed.
I
S, 4 7 7 6 5 5 Optimal solution by MODI method
.
'
S, 8 4 6 6 4 9 Let u3 == 0
Demand 4 4 5 4 8
~.
Shipping cost is Rs IO per load per kilometer. What shipping schedule should DI 02 DJ D4 Ds uI
be used to minimize the total transportation cost?· Jan 2007 (ISM) 5 8 6 6 3
SI I ® u1 =-3
LSUpply= 8+ 5 +9=22 s2 © u2== 0
LDemand=4+4 +5 + 4 +8=25
Since E Demand > E Supply, it is an unbalanced transportation problem
s, u3 =0
r· Add dummy row/source 'Oum' with supply of3 (i.e. 25 - 22) with zero transportation
Oum u4 =-6
in each cell to make it balanced transportation problem.
Construct a transportation matrix and obtain initial basic feasible solution by VAM.
v I vi =4 v~ == +4 VJ =+6 v 4== 6 v 5 =6
~·
Destination J
Row Penalties
Since all d;i,i 0, the solution is not optimal. To obtain an improved solution, construct
~·
ii•
!!~
~~·
' 8
g
C/l
SI
s2
SJ
a closed loop starting from cell (S 3, 0 5) with d;i == -2
Select an allocation '.1' in the cell with -ve sign in the corner cell of the closed loop
and shift it to a selected unoccupied cell, where closed loop starts and terminates and
~-
check for the optimality condition.
s
o,
D,~
Demand DI Dz D4
""
~iE Column
Penalties SI I ww~ _LC ~® 3
"
u1 =-1
tr
~;
s2 I©~ '+~I LfilCD ~~+I u2 -
- 0
L -
~::
,, While choosing the higher penalties, columns DJ & 0 4 both have penalty of 6 with s; I ~(4) ~(2) ~(3) ~@ li_ju 3 =0
~ cells of zero transportation cost each. To break this tie, look at the maximum possible
allocation in those two cells. Again tie occurs among two cells (Oum, DJ) and (Dum,
D), with maximum allocation of3. Now, select a column DJ with higher demand to
Dum I
~ ~(2) I ~ ~u4 =-6
make an allocation of3 in the cell (Oum, 0 3). lf column D4 is selected for allocation in v
J I vi =4 V, =4 v, == 6 V
4== 6 vs =4
cell (Dum,04), that give rise to extend the steps in reaching the optimality condition
·1:
''
i
... OPERATIONS REsEARCH
Since d,i 2: 0 for aH uhoccupied cell; current solution is an optimal solution, but an
alternate solution exists. The optimal cost of transportation Z =Rs. 920.
TRANSPORTATION PROBLEMS cg
26. The problem of schedulipg the weekly production of certain items for the next
u.
four weeks is to be solved. The production cost of the item is Rs 10 (or the first
two weeks and Rs 15 for the last two weeks. The weekly demands are 500, 800, R, @ u1 =16
1000 and 900, which must be met. The plant can produce a maximum of 700 u2 =13
Rz OCJ
units per we~k. In addition, the coinpany can use overtime during second and
th_ird week. This increases the weekly production by an additional 200 units, - 02 OCJ ~= 18
but the· production cost increases by Rs 5. Excess production can be stored at
a unit cost of Rs 3 per week. How should the production be scheduled so as to ~ OCJ u4= 15
minilnize the total cost? July 2007 (20M) and Jan 2010 (20M) 04 OCJ us =20
Sol. Check for the balance R4 OCJ u.= 12
0
I Production= 700 + 700+200 +700 +200 +700 = 3200
I Demand= 500 + 800 + I 000 + 900 = 3200 vj I v I = -6 v2 = -3 vJ = o v4 = 3
It is a balanced transportation problem. Follow the steps used in problem No. 22 Since div 2: 0, for all unoccupied cells, the current solution is optimal, but alternate ·
to construct transportation table shown below and obtain basic feasible solution by solutions are also exist. The optical total cost Z = Rs. 44100
YAM. 27. The following information is available concerning the operation of a
w Row Penalties
manufacturing company:
~-
R, The production cost of the company is estimated to be Rs. 5.unit.
Production capacity Excess over Storage cost
Ri Units in cost per unit OT per unit (Rs.)
~ Period Regular
<!)
02 order Overtime (Rs.)
~ time
Ri Month I 800 920 920 1.25 0.5
04 Month2 1400 250 250 1.25 0.5
Formulate the problem as a transportation problem and determine the optimal
R4
solution. Dec 2010 (ISM)
Demand
---
Column [~]
801. Check for the balance
IProduction=920+ 920 + 250=2340
Penalties [~]
IDemand=800+ 1400=2200
[~Jr
[~] It is an unbalanced transportation problem. Add dummy column of zero cost in each
[~] cell with ademand of 14-0.'
The resultant transportation table is shown below. Obtain initial basic feasible
solution by VAM.
xIJ = 8 0
(m + n - I)= (6 + 4 - I)= 9
Total cost
Z=(IOx 500) + (13x100) + (16x 100) +(Wx 700) +(18x 200) + (l5x 700)
+(23 x 200) + (15 x 700)
Z = Rs.44100
~
:\
;
j
I
:;.
..... OPERATIONS REsEARCH
Dummy I Capacity I Row Penalties

__y_
TRANsP<>RTATION PRoBLEMS
Since d :;:-·"·Qfo(
-:..·.~JJ- --
..
all unoccupied cells, the current solution is optimal. Since dIJ = 0 for
cell (01' M 3), an alternate optimal solution exists.
i R, 920 I [5][0.5J[0.5J[0.5J The optimal cost Z =(5x800) +(5.5x120) + (6.75 x 780) +(Ox 140) + (5x 250) + (6.2Sx 250)
r Ill
..c Z=Rs.12737.S
·~
.r c0 01
920 I [6.25][0.5][0.5][0.5]
~ 28. Consider the problem of scheduling the weekly production of certain items for
R1 the next four weeks is to be solved. The production cost of the item is Rs 10 for
;
..
l
02
Demand - the first two weeks and Rs 15 for the last two weeks. The weekly demands are
300, 700, 900 and 800, which must be met. The plant can produce a maximum
of700 units per week. In addition, the company can use overtime during second
l
I ·Column [qs1 [0.5] [:] and third week. This increases the weekly production by an additional 200 units,
'
;, Penalties [ l.~5] [0.5] but the 11rod11ction cost increases by Rs 5. Excess production can be stored at
1
[1.~5] [0.75] a unit cost cir Rs 3 per week. How should the production be scheduled so as to
l [1.~5] i [0.75]
I minimize the total cost?
F x=6 Sol. Here, objective of the company is to minim izc the total cost comprising of production
"~ IJ
(m+n-1)=(4+3-1)=6
Total cost
cost (regular), overtime cost and storage cost
Check for the balance
iiJ;.
Z=(5x800)+(5.5x120) + (6.75 x 920) +(5 x 250) + ( 6.25x110) I: Production = 700 + 700 +200 +700 +200 + 700 = 3200
~h
t'~ I: Demand= 300 + 700 + 900 +800 = 2700
j Z=Rs.12807.5
1c~ Since I: production 'f:. E Demand, it is an unbalanced transportation problem
Check for optimality by MODI method
~..fi':. Let us assume v2 = 0
Add _a dummy column of zero cost in each cell with a demand of500
Using the available data, transportation table is constructed as shown below. The cost
fi-
M1 M2 M~ u; in each cell is obtained by considering production cost, overtime cost( if required) of
E
l@~([2Q)liii+o7'i 0 Rs. 5 per week and storage cost (if required) of Rs. 3 per week I unit.
( Ilic
R1
o, 0
u1 =5.5 · Since the output of any week cannot be consumed in a week proceeding it and also
no entire output is used in the same week, part of it will be stored at cost of Rs .3 I
week/unit for succeeding weeks.
u3 = 5
lli-
E~-~
R, (f)
Total cost I week
~j ' u4 = 6.25 (Production cost + Overtime cost + Storage - cost)
µ;; 02 00
w, w, w, w, Dummy Capacity
rr
!E..'
vi I v,=-0.5 v,=O v3 =-6.25 R, 10
JO+ 3=13 10+3+3=16 10+3+3+3=19 0 700
70~t 900+400= 1300

400
t·
i.•
1-,~
Since d;, :S 0 (i.e. - 0.5) for the cell (0 1, M), the current solution is not optimal, R, IO - ro+3=13 10+3+3=16 0
r.;~
construct a closed loop starting from a cell (0 1• M 3). ""' 01
0) - 15 15+3 = 18 15+3+3=21 0 200 r·600
l.:i-
;;. Let v2 =- 0 ~ ~ - -15 15+3 =18 0 700 900+600= 1500
1;;'
L
,. M1 Mj u I o, - -20 20+3=23 0 200 600
RI @
5 u1= 5.5 R, - - - 15 0 700
•
700+600= 1300
·- Demand 300 700 900 800 500
1:- u2 = 6.75
!f 01 Initial basic feasible solution by VAM
R, O'.J u, = 5
02 [f) u4 = 6.25
v v, =-0.5 v, = () "i=-6.75
J
... 0PERATlollS REsEARCH
TR4isPORT1noli .§:«?~[Ells·
Since dii "I:. 0 for unoccupied cells, current solution is not optimal.
Construct a closed loop from cell (02, Dummy) with d lj.. = -3 shift the allocation to it
:_ ...
and check for the optimality.
R,
·····-10fr····"f"[t0](-10jfl~f3")[:'Jt·--··-···· u,
fl,
VJ I i l!1.J~1,;,l_11,I i1nl R, u, =I
.!<!
.... 02 200
~ fl, u, =O
RJ
02 u,=o
01
Ri
R-4
1po OJ u, =O
Demand 3¢0
Column
Penalties
r [~]
!Pl
[~]
[~]
lll r
[2]
[2]
[21
[2]
[2]
[I]
[I]
[IJ
fl]
(I]
[2]
[I]
[$]
[Q]
[$]
R4
V.
J
I I
v2 =iO
I
v,=IS
I'---"
v,=21
I TO
v,=O
I u, =--<i
. [2] [2] R, u, = 22
x.
'!
=9 R, u,= 16
(m + 11 -I)= (6 + 5 - I)= 10
Total cost 02 r:tJ u, = 21
Z=(IOx 300) + (16x 400) + (1Ox700) + (18 x I 00) + (21x100) + (15 x 400) +(Ox 300)
~ (jJ u, =21
+ (0 x 200) + ( 15 x 700)
Z=Rs.36800
OJ I 00
I 00 I_,_. ( _,_., 1~00) I u,=21
Sincex.,J <( m + n -1), the obtained solution iosdegeneratein nature. R4 00 00 00

+6 ju,=15
To remove degenerate, add 6 to a cell with least cost and where no closed loop is v v, =-12 v, = -6 v, =-6 v, =O v, = -21
J
constructed and check for optimality using MODI method.
Let v, = 0
w w Dummy ll
19
w W, W, w u
' RI (\ _, (+) 0
, / u1 =O
u, = 16
RI R2 I 00 1~600)1 nl (\I Oo/J d ju,=-3
u, = 15
Rz 00
o, I 00 l+1 I J (.,. 1 (~OQ»ju 3 =-l
0, 00 u, = 18 "'
+2 ~I 00
I r:tJ 1\.60.<!J,'=-:1 0 9000) ';""";1 u, =-I
u, = 15
R, r:tJ
OJ I 00 00 I_,_, ( _,_, l~DOJ I u, =-1
I
o, 00 u, = 15
R4 00 (jJ Cl)
+3 I u =-4
u, = 12
'
RJ (fJ
v. v, = 10 v1 =13 v, = 16 v, = 19 v, =I
J
v ,, ~ -6 ,, ~ -5 v =0 v, = 3 v, = -15
J '
r~
r.n .,;.;
;
"
.. OPERATIONS REsEARCH
uI
To convert this maximization problem into .minimization type, choose highest

element in the cell arid subtract all elements from it.
..
*l~. ~·v~,~~•v u ,. I 2 3 D Availability
hi;
.:
i
RI
Ri 00 @10
u1 =O
u2 =-3
I"
:·
~
r~-
(:' l
2
700 400
500 600 700 1900
0 1900 160
160
11, ~i
u, = 0 3 300 500 400 1900 160
02 00
+2
j1
i Requirement 130 140 160 50
~ 00 00 u,=-1 Initial basic feasible solution by VAM
I 2 3 D
'i..l 03 00 00
+4
u, =O
,,,
j, R4 00 00 u, =-4
160 [I 00)[ I00][ 1300]
v. vJ 1v=JO
I
v=13
. 2
v=16
J
v=19
4
v·=o
5
2
1~! Since d,J 2: 0, for all unoccupied cells, the current solution is optimal, but an alternate 3
solutions are also exist
The optimal cost Requirement
Z=(I 0 x 300) +(13x 100) +(16x200)+ {10x600) +{l6x I 00) + (15 x 700) +(15 x700) Column
Z=Rs.36100 Penalties
29. A leading firm has three auditors. Each auditor can work up to 160 hours x ..=5
i
•J
during the next month, during which three projects must be completed. Project m + n - I = (3 + 4 - I)= 6
:_, 1 will take 130 hours, pnlject 2 will take 140 hours and the project 3 will take Total billing Z=(160x1900)+ (110x1300) + (50 x 0) + (130x1600) + (30x1400)
160 hours. The amount per hour that can be billed for assigning each auditor to
each project is given in the table below: Z=Rs.697000 (Using table l)
n.g{.'·. .;·
'.
·Auditor
I (Rs)
Project
2 (Rs) 3 (Rs)
Since x•J < m + n - I, ipitial basic feasible solution obtained is degenerate in nature.
To remove degeneracy, add ~ to either a cell ( 1,2) or (3,3) with least cost of 400,
It:
it
I 1100 1500 1900
where closed loop cannot be constructed. Use MODI method to check for optimality
Let u3 = 0, then
;1 2 i4oo 1300 1200
~1<mol
@:.' ll
I
~: 3 1600 1400 1500

!!:~ .
Formulate this as a transportation problem and find optimal solution. Also, find lll =-400
~~
c;·
I{ out the maximum total billings during next month. May 2017 (lOM)
2 I __"ICllOrl ___l(50Jlu 1 = 100
U:' Sol. Check for the balance
~ 2:Availability= 160+ 160+ 160=480
~~ 3 IC130r1(30fl( ~)I ....:--l u3 = o
IL 2: Requirement= 130 + 140 + 160 = 430
~ I
I>....
It is an unbalanced transportation problem.
Add dummy project with duration of50 hours with zero profit/ amount in each cell.
' ..v. v1=300 v2=500 v3=400 v,=1800
Since d. > 0 for all unoccupied cells, current solution is optimal
i~ The effective profit matrix is shown below. •J
p;· The optimal profit I billing Z = Rs . 697000
!~ Project
,,
I•·
r: ... I 2 3 D Availability
..."'" .~
'~ !
"O
::I
I 1200 1500 1900 0
t <: 2 1400 1300 1200 0 -(1)
'
3 1600 1400 1500 0
i. Requirement 130 140 160 50
""
...
30.
()p£RATI011S
Obtain initial basic feasible solution !>Y NWCM and optimal solution by MODI
method.
REszilcir. TRAllSPORTATIOll PROBLEMS ..
Since d.)~: 0 for all unoccupied cells, the current solution is not optimal. Although
cells ( l ,D) and (3,B) have highest negative dii = -2, construct a closed loop from cell
(3,B) with least transportation cost of2 and again check for optimality.
A B c D Supply Letv,=0 ·
1 1 5 3 3 34 A B c D u
2 3 3 I 2 15 I
3 0 .2 2 3 12
® u1 = 5
7 2 4 19 2 0 u2 =I
4 2
Demand 21 25 17 17 3 +2 u3 =?-
Sol. Check. for the balance 4 I o u4 = 2

E Supply= 34 +IS+ 12 + 19='80 vi I v1 = -4 v2 = 0 vJ = 0 v4 = 2
E Demand = 21 + 25 + 17+ 17 = 80 The corner cells (2,B) and (3,C) in the closed loop have minimum positive allocation
Since 2: Supply= L Demand , it is a balanced transportation problem.
of 12 with -ve sign. These. two cells becomes empty/ unoccupied simultaneously
Initial basic feasible solution by North West corner method destinations.
while allocating the value 12 to the selected unoccupied cell. (i.e. from where the loop
Destination started and terminated) (3, B). This results in degeneracy at subsequent iterations.
c D I Supply To remove degeneracy , add d to a cell with least unit transportation cost which has
34 become unoccupied recently (i.e. Cell (3, C))
....., Since d;1 t 0, for all unoccupied cells, the current solution is not optimal. Construct a
Q)
2 I L.:!..!117~31......., 15
...::s0 closed loop from cell ( \ ,D) with d1; = -4 & check for optimality.
0 3 12 Assume u1 = 0
(/}
A B c u
4 19
Demand 21 25 17 ®
2 +2 u, == 0
x.=7
IJ
~ ·l . (m+n-1)=(4+4-1)=7 3 +2 U =-3
3
i....i
Since x. = (rn + n -1), initial basic feasible solution obtained is non - degenerate in
IJ
4 0 u4 = \
,_, .. nature.
.j.:
!
Cost of transportation vJ I v=l
I
v=S
2
v=J
J
v4 == 3
. Z =(21x1}+{13x5)+(12x3)+(3x 1) +(12x 2) +(2 x2) +(17 x4) Again, construct a closed loop from cell (2, B) with dij = -2 and test for optimality
Z=Rs.221 Let u1 == 0
Check for optimality b11y MODI method : A 8 c u u
I
Let us assume vJ = 0
c D u
® u1=O
A
• 2 +2 u2 == 0
@ u1=3
3 u3 =-1
u2 =I 0
2 1+4
uJ =?-
4 I o u4 = l
3 I o vJ I v=l v=3 v=l v="
I 2 J 4 J
4 1+2 u4 = 2
Again, construct a closed loop from cell (2, D) with d,1 = -1 and check for optimality
vi I v1 =-2 v2 = 2 VJ =t) v4 =2 Letv,=O
-.
'
'
.
OPERATIONS REsEARCH
I
'
~
t
.
;liI.
j;•
f:
2 1+3
®
A
I
B c u.
~I= 3
uz =2
·. ·. . . · .E~~ff~··
.·. .MSIGNMEbHU!iF~.
·.·)1'
-/: u3= 1
r 3 1+1
~
u4 =4
4 Io .·if....·:;~.
rI vj I v I = -2 v2 = I v3 = -2 v4 = 0
-_ ·: . . ·-: -'; ·.,: /. .;.: ;:7 ..;: :•. -.• -::_~,~-.- ·~1.',:1':-'f·::-.-.,
f
Since dii 2: 0 for all unoccupied cells, the current solution is optimal, but an alternate
t
~. solution also exists.
I':
~:.·
The optimal cost of transportation
~
.;
Z=(lx21) + (3x13) +(3x13)+(2 x 2) +(2x 12)+(2x 17)+(4 x 2) An assignment problem is a particular case of transportation problem where the objective
~ is to assign a number of resources (such as men, machines etc.) to an equal number of
Z=Rs.169
activities Gobs or origins) so as to minimize total cost or maximize total profit.
The areas where the assignment technique may be useful are
I. Assignment of workers to machines.
r:.:. 2. Assignment of salesmen to different sales areas.
;,
~ 3. Assignment of classes to rooms.

i:.: 4. Assignment of vehicles to routes etc.
~··
~:
r,:.:
In assignment problem, each resource is assigned to only one job and each job requires
lili;. only one resource of varying degree of efficiency.
lli
·~
n-- 4.1 -ASSIGNMENT PROBLEMAS.AMATHEMATICALMODEL/ LPP
ff
1~: Let
- ·! ·· ... _. - ·- ''~.' •
!~
!~:· n be the number of resources (such as men, machine) available.
;~.
;µ.;._.-
n be the number of jobs (activities) to be performed.
J;L_ cu be the cost ifthe i'h resource is assigned to jlh job.
!~:
u;:
Jobs
iI ·
!.::
I 2 3 4 ... ...... J ..... ...... 11 Available (Supply)
!"1'
;-1•
~!
I c11 c12 c1, c" c,n I
..;,
2 C:!I c22 c2 .. I
'.I
J.. 3 c3, en c)n I
• Workers 4 "
(resources) "
i "
"
'· n cn11 I
cnl en., •'
~.
'· Demand
I I I I .... .... .... I n
(required)
'!W·· · · :t:~lf~~~i:t;S: ·~-1~:=i: ::oikfio11s'REswcu ASSl01111E11T PROBLEMS
~
~
Now this assignment problem is expressed as (n x n) cost matrix. 4..~ HVNGARIAN r.1ETHOD11!i:Q'i.@i~'gfiJifill~lst~ob I FLOOD'S
Let .···:·Tt5CliNIQU~ TO· s9LVE,.~·;j&fi'$$'tt"if
r, ·• . • ., . • ... :. ••.
0ii:il;f~'jjd"'J;EM
,.._.r..-.,_,,,,.~.-~:"""''"·Jl~~)r.t'~::.-.;-'t,~, ·-:· . .·
x.. be the assignment of resource 'i' to job 'j'. Step 1. Prepare a cost table (matrix) from the given probiem. If the number of rows '6 not
u
Z is the total cost of a II jobs being carried out. equal to the number of columns, then add dummy row or_ dummy column with zero cost in
The objective is to minimize tbe total cost. each dummy cell. ·
The objective function is given by Step 2. Identify the smallest element in each row of the given cost table and then subtract
n n it from each element of that row to get reduced matrix.
Minimize Z =·"£- "~ cIJ xIJ Step 3. Identify the smallest element in each column of the given cost table and then
i=l j=I subtract it from each element of that column to get reduced matrix to get an opportunity
The constraints are on the a\/ailability of resource and job requirement cost table (matrix) with at least one zero element in each and column .
n
• Step 4. Search the rows successively from top to bottom until a row with exactly one
zero element is found. Make an assignment to that zero by making a square (o) around
I \=I, for all i (resource availabilit)' constraint)
it and cross off (x,) all other zeroes in the corresponding column. Similarly search the
j=l columns successively from left to right until column with one zero element that has not
n been assigned is found. Make an assignment to that single zero by making a square (o)
I xii= I. for all j (job requirement constraint) around it and crossed off (x,) all other zero elements in the corresponding row.
Step 5. !fa row and /or column has two or more unmarked zeros and one cannot be chosen
i=l
by inspection, then choose the zero cell arbitrarily for assignment. Repeat step 3 and or step
xii= 1 if facility (resource) 'i' is assigned to job 'j'
4 until all zeros are marked.
= 0 otherwise Step 6. If all zero elements in the matrix are either marked with square (o) or cross off (x,)
Where c. represents the cost of assignment of resource 'i' (person) to activity (machine I
IJ and there is exactly one assignment in each row and column, then it is an optimal solution.
job) 'j'. The total cost associated with this solution is obtained by adding original cost figures in the
occupied cell.
4.2 DIFFERENCE BETWEEN :l'RANS.PORTATION PROBLEM AND
Step 7. If a zero element in a row or a column was chosen arbitrarily for assignment in step
"i
~; ! ASSIGNMENT PROBLEM 5, there exists an alternative optimal solution.
i......!;.·_
Transportation problem Assignment problem Step 8. lfthere is no assignment in a row (or a column), then it indicates that total number
~L
SI No
of assignments are less than the number of rows/ columns in the square matrix. Go to step
::J. Number of sources and number of Number of sources and number of
destinations need not be equal. Hence, ~-
destinations are equal. Hence, the cost
the cost matrix is not necessarily a Step 9. Now draw a minimum number of horizontal and vertical lines to cover all zeroes
matrix must be a square matrix.
square matrix. in the resulting matrix. If the number of lines drawn (or total assignments) is equal to the
'x,/, the quantity to be transported number of rows (or columns), the current solution is optimal solution, otherwise go to step
\/, the jth job is to be assigned to the
from i'h origin to j"' destination can 10.
i'h person and can take either the value
2 take any positive values and satisfies Step 10. Among the cells not covered by any line, chose the smallest element and call it
1 or zero
rim requiremeifts as say k.
The capacity and the requirement The capacity and requirement value Step 11. Subtract k from every element in the cell not covered by a line.
value is equal to a and b.J for the ith is exactly one ie for each source and Step 12. Add k to every element in the cell covered by the ~wo lines, i.e. intersection of
I
3 source and j<h destination (i-1,2, ... m, each destination, the capacity and two lines.
requirement value is exactly one
j= 1.2 ..... n) Step 13 Elements in those cells covered by one line remain unchanged.
The problem is unbalanced if the total The problem is unbalanced if the cost Step 14. Repeat steps 4 to 13 until an optimal solution is obtained.
4 supply and total demand are not equal matrix is not a square matrix.
.-z;
'!
-·--·'!::·.·:..~-·...t
1.
·•.· ·';'-,':: -~::. ,,,~~q~V~IJ,fc'-IJQ.@LE._"''··
OPERATIONS-RESEARCH.
. .
A departmental head has four subordinates and four tasks to be performed. The
- ...
subordinates differ in e16Qency and the tasks differ in their intrinsic difficulty.
-~~--- ~.· '
_,;
Ass10NMENT PRoeLEi.ts
II III IV
A . ···-{)···· ··+4··· ···-9···· ···J····L··
8 . ···-9···· ···20··· ···-0···· ···21!···t··
·'-~
~
His estimates of the times- that each man would take to perform each task is C · ···H·· ···-0···· ····3···· ----0----f---
given in the matrix below:
D · ----9---· ---1-2--- ---1-4--- ----0----j---
Tasks
~~.
v) Check whether the assignment stage is reached or not;
II III IV
"'
. ~' Here, N = number of lines= 4
!t:'
~"' A 8 26 17 II (m x n) =Order of the matrix= 4
" ""'c 8 IJ 28 4 26 Since N = (m x n), Now make the assignments
~0
..0 c 38 19 18 15 vi) Examine each row from the top till a row with single zero is obtained, make an
::J
D 19
r/)
26 24 10 assignment to thai zeroii1id cross off all zeroes, if any, in that column. If any row
How should the tasks be allocated to subordinates so as to minimize the total has more than one zero, skip that row, move to next row. If no row has single zero,
man-hours? check column wise.
Sol; i) Check for the balance · vii) Examine each column from the left till a column with single zero is obtained,
Herem= number of rows= number of sub-ordinates= 4 make an assignment to that zero and cross off all zeroes, if any, in that row. If any
n =number of columns.= number of tasks = 4 column has more than one zero, skip that column, move to next column for the
Since m = n, it is a balance assignment problem. assignment.
ii) Obtain reduced time matrix viii) Repeat steps (vi) and (vii) till zeroes in the matrix are assigned and I or crossed
Select a smallest element including zero in each row of an effective time matrix, off to obtain optimal assignment.
subtract it from all elements of that row to get reduce time matrix. II Ill IV
I If III IV A []] 14 9 3
A. 0 18 9 3 8 9 20 [Q] 22
8 9 24 0 22 c 23 [[] 3 )(
:~ c 23 4 3 0 D 9 12 14 [[]
ii;":
D 9 16 14 '"'o The optimal assignment of sub-ordinates to different tasks is
ire-· (Reduce time matrix) Sub-odrinate Tasks Time
;;__; _-
iii) Obtain opportunity tillle matrix;
t' : A -> I 8
t; ' Select a smallest element including zero in each column of a reduced time matrix,
r· B -> 111 4
subtract it from all element of that column to get an opportunity time matrix.
" c -> II 19
~.
I II III IV
L D -> IV 10
" A 0 14 9 3
Total 41 man- hours
8 9 20 0 22
c 23 0 ...J 0 2. Four jobs are to be done on four different machines. The cost (in rupees) of
producing ith job on the jth machine is given below:
D . 9 12 14 0
Machines
(Opportunity time matdx)
iv) Draw minimum number of lines (either horizontal or vertical) to cover all M M. M M
zeroes of an opportunity time matrix. J, 15 11 13 15
Jobs 12 17 12 12 13
J) 14 15 10 14
J4 16 13 11 17
.., ..
Assign the jobs to ditJ;erent machines so as to minimize the total cost.

OPERATIONS
·: . - ' -· -'.;':""_._ '.
~
REsEARCH
·- . . ·-
I~~
3.
AsSIGNMENT PRoBLEMS
_..,; > ,._. ·,,:£."'£'.
,~-:
Find the optimal assignment cost for following assignment problem. ·

:'d~ab~.a
06CS661July2009 (08 M) July2017 (6M)
Sol. .It is a baland:d assignm.e!lt problem, as m = n = 4; Operators
i) Obtain reduced cost matrix II III IV
M. M_ M_ M i
~
c
A 10 s 13 JS
J, 4 0 2 4 3
'.§ 8 9 18 3
J2 s 0 0 I
~ c 10 7 3 2
JJ 4 s 0 4 D s 11 9 7
J4 s 2 0 6 Sol. Here, m = n =4; it is a balanced assignment problem
(Reduced cost matrix) i) Obtain reduced cost matrix
ii) Obtain opportunity cost matrix II III IV
M. M_ M_ M A s 0 8 10
JI 0 0 2 3
80 6 IS 0
I 0 0 0
J2 c 8 s I 0
JJ 0 5 0 3
D 0 6 4 2
J4 I 2 0 s (Reduced cost matrix)
(Opportunity cost matrix) ii) Obtain opportunity cost matrix
iii) Draw minimum no. of lines to cover all zeroes I II Ill IV
M. M_ M_ M
. A 0 s 7 10
JI ) ( 3
h
8
0 6 14 0
J2 v
·c 8 s 0 0
JJ ~ ' I 3
D 0 6 3 2
J4 I s (Opportunify cost matrix)
I I '
Here, N = 4; (m x n) = 4; since N = (m x n),.optimal assignment stage is reached. iii). Draw minimum number of lines to cover all zeroes
Now, make optimal assignments. I II Ill IY
M. M_ M_ M A $ q 7 ti<>
J, )( 0 2 3 8 ~ ~ I~ ~
J2 I x x [ill c 5. Q e
J) [[] s x 3 D *
~ e. j 2
J4 I 2 []] s Here, N = 4; (mxn) =4, an optimal assignment stage is reached. Now, make optimal
The optimal assignment of jobs to different machines is as follows . assignments.
Jobs · Machines Cost II lll IV
J, -+ M2 -+ II A s llil 7 10
J2 -+ M4 -+ 13 B 6x 14 ffiJ
JJ -+ M, -+ 14 c 8 5 [fil )(
Mi -+ II D [Q] 6 3 2
J. -+
Total
-- Rs.49
I
The optimal assignment of machines to different operators with minimized cost is

as follows.
-- : ,.,,._,s,,:,,.
.c~''"'•"/e-:,.;yc
0-· PERATIORS REsEARCH

7
_;
Ass10NM£RT PRoBL~~
...
Machines
A
g --
Operators
II
--
Cost
5
~j
A 30
a b c
~ 35
d
30
e
15
B -+5·- ... {).... ----0---- ----1-0--- -----0---- -
c
D
--
lV
Ill
I -+
-
3
3
5
c 30
D ---0----
~'
----0--·-
35 30 20
-10--- ----0--·- -----5----.
j Total Rs. 16 E 20 ~ 25 15 15
I, 4. A car hire company has one car at each of 5 depots a, b, c, d and e. A customer
require~ a car in each town namely, A, B, C, D and E. Distance (in kms) between
Here, N = 3
l (m x n) = 5
;·
depots (origins) and towns (destinations) are given in the following distance Since N < (m x n), assignment stage is not reached
j matrix. Select a smallest element not ~overed either by horizontal or vertical line i.e. K= 15,
i Depots
,;: subtract it from the elements which are not covered by lines and add it to elements of
a b c d e intersection of two perpendicular lines. Check for the assignment stage that rel!,Ched
A 160 130 175 190 200 or not by drawing lines again.
130 160 a b c d e
Towns B 135 120 175
A
c 140 110 155 170 185_
B
D 50 50 80 80 110
I E 55 35 70 80 105 c
'
(Effective distance matrix) D
-:: l
!":
How should cars be assigned so as to minimize the distance travelled. E
Sol. Since m = n = 5, it is a balanced assignment problem. Here, N = 5
i) Obtain reduced distance matrix ·cmx n)=5
\
I•·
·a b c d e Since N = (m x n) = 5, make assignments to get optimal solution
·-I·
:.l
-~-f1· A 30 0 45 60 70 a b c d e
!t;
I+ B 15 0 IO 40 55 A 15 x
20 15 [Q]
Iif.:j'
c 30 0 45 60 75 8 15 15 [Q] 10 )(
.,,.
-:--:.:
. D 0 0 30 30 60 c 15 ill] 20 15 5
E 20 0 35 45 70 D [[! 15 20 )( 5
!;.::
1::
ii. i -
(Reduced distance matrix)
ii) Obtain opportunity distance matrix
E 5 x 10 [Q] )(
r
The optimal assignment Of cars to the town is
a b c d e
A 30 0 35 30 15
t' .:
ii_ -
~·
B
c
15 0
30 ' 0
0
35
IO
30
0
20
Car
a
- -- Town
D
c
Distance
50
b
-- - 110
--+
D 0 0 20 0 5 c 8 -+ 130
E 20 0 25 15 15 d E 80
(Opportunity distance matrix)
iii) Draw minimum number oflines to cover all zeroes
e
- - A
Total
200
570 Kms
-... ·:O~E~Tj:(°jJii:Rii~H AsSIGIOIMT PROBLEMS
.... ,.~;~~-·,, ~
:~
5. A ABC company has 5 tasks and 5 persons to perform. Determine the optimal A s c ID E
assignment that minimizes the total cost. p .• --+-- --+-- ----0--- ----i--- ----0---~-
Machines Q I ~ 4 I 1
A B c D E R -2-- ----i--- ----0--- ----i---- ---J----~-
p. 6" 7 5 -9 4 S 4 Q I 9 I
VJ Q 7 5 10 9 6 T · --6--- ----4---- ----I---- ---~--- ---3----~-
..0
...,0 R 5 4 3 6 5
Since N=(mxn); optimal assignment stage is reached. Now, make optimal assignments.
s 8 3 5 6 4
A B C D E
T 4 7 5 6 6
·~::--~~~~F.\I\~:~ p I 3 )( 2 - [QJ
Jan 2014 (10 M)&Jan 2015 (08 M)
Sol. Herc, m = 5 = n; it is a balanced assignment problem. Q I [QJ 4 1 I
i) Obtain reduced cost matrix R 2 2 [QJ I 3
A B c D E s 4 )( I []] I
p 2 3 5 I 0 T [[] 4 I x 3
Q 2 0 5 4 I The optimal assignment of Jobs to machines is as follows
R 2 I 0 3 2 Jobs Machines Cost
s 5 0 2 3 I p -+ E -+ 4
T 0 3 I 2 2 Q -+ B -+ 5-
(Reduced cost matrix) R -+ c -+ 3
ii) Obtain opportunity cost matrix s -+ D -+ 6
A B C D E T -+ A -+ 4
p 2 3 1 3 0 Total
--
Rs.22
Q 2 0 5 2 I 6. A batch of 4 jobs can be.a~igned to 5 different machines. The following table
R 2 I 0 1 2 shows the installation tim.e in hours for each job on various machines. Find the
s 5 0 2 I 1 optimal assignment of jobs to machines which will minimize the total installation
T 0 3 1 0 2 time. Jan 2018 (08 M)
(Opportunity cost matrix) Machine
iii) Draw minimum number of lines to cover all zeroes M. M. M. M. M
A ·e C D i
-g-,
J, 10 11 4 2 8
P 2 ~ I 3 Q J,
- 7 II 10 14 12
Q 2 Q 5 2 i J3 5 6 9 12 14 ~
R - -·-·:Z···· ----+--- ----0---- ·--+--- ----~----r-- 14 13 15 II IO 7

S 5 Q 2 I ~ So-I. In the given time matrix,
T · ----o---- ---·t·-- -----i---- ----o---- ----~----·-- m=4
n= 5
Here, N = 4; (m x n) = 5; Since m :/; n; it is an unbalanced assignment problem
Since N < (m x n), assignment stage is not reached. Add dummy row with zero time element in each cell to make it a balanced problem.
Select smallest element K = 1, then
- J, 10 II 4
Machine
M. M. M. M. M
2 8
O~og9KS ~~CH
.AS&loiiMENT PRoeLEMs
Machine
M. M. M. M. M
-
~
7 11 10 14 12 J, 8 8 I LoJ 6
..0 J2
.Q s 6 9 12 14 Job J2 [QJ 3 2 7 5
JJ
J4 13· 15 11 ·JO 7 JJ x[[] 3 7 9
D 0 0 0 0 0 J4 6 7 3 3 []]
(Effective time matrix) D I )( [Q] 1 I
i) Obtain reduced time matrix The optimal assignment of jobs to different machines with minimized installation
M. M. M. M.. M' time is show below. ·
J, 8 9 2 0 6 Jobs Machines Time
12 0 4 3 7 5 J, --> M4 --> 2
JJ 0 1 4 7 9 J2 --> M, --+ 7
14 6 8 4 ".) 0 13 --> ~ --> 6
D 0 0 0 0 0 14 --> Ms --> 7
(Reduced time I opportunity time matrix) D --> MJ --> 0
ii) Draw minimum number oflines to cover all zeroes Total 22 hours
Machine 7. A city corporation has decided to carry out road repairs on main four arteries
M. M. M. M. M of the city. The government has agreed to make a special grant of Rs. 50 lakhs
J, $ 9 2 Q ~ towards the cost with a condition that the repairs must be done at the lowest
Job J2 0 4. 3 7 5 cost. If conditions warrant, then the supplementary token grant will also be
considered favorably. The corporation has Uoated tenders and five contractors
JJ 0 I 4 7 9
have sent their bids. In order to expedite work, one road will be awarded to only
l· J4 .~ 8 4 j 0 one contractor. The cost given in matrix is in lakhs of Rs in table
·_j D .. ····~:: ..:o... ...o. ... ....q.... ··-~··- i) Find the best way of assigning th~ repair work to the contractors and the
costs.
Here N = 4; (mxn) = 5;
Since N< (mxn); an optimal assignment stage is not reached yet. Select a smallest ii) •. Is it necessary to seek supplementary grants, then what should be the amount
sought?
element i.e. K=_l uncovered by the line.
Machine iii). Which of the five contractors will be unsuccessful in his bid?
M M, M, M, M. Road
J, *. 8 l ~ 6
c,
R.
9
R.
14
R.
19
R
-
15
Job
J2 q 3 2 t 5 0
JJ · ,..A... ··-0··· ...3-.......'.i... ·9····1~·· u c2 7 17 20 19
Y . r !:!
cl 9 18 21 18 •
J4 • ···~·· •••'J... ...J.......J... .o....;... E
0
'j
D ....f··· ··-0-·· ...0-··· ""T'" .. +... ,. .. u c4 10 1218 19
cs 10 1521 16
Here, N = 5; (mxn) = 5; an optimal assignment stage is reached Now, make optimal Jan 2010 (10 M) and June 2010 (16 M)
assignments. Sol. In this problem, m = 5, n = 4, it is an unbalanced assignment problem.
Add dummy column Rs with zero cost element in each cell to make it balanced.
...., -',··
0PE~TI01'S REsEARCB · Ass1GRMENT PRoBLEMs
:·.'.?~<t::~;~i.\~~~.:7_~~~;~{.~tL~~~ :~~ =~ - ..
Road
!{., R., Jl. R. R,
R. R, R. R. R c i.... .......... ...{)... ....()....
I •. . ... ····l····t··
c, 9 14 19 15 0
I
c ~ s 2 s 2
2
Contractor
c.- 17 20
,"'
19 0 c .. ...,g,. ... ····4···· ···+···· ····2····
) ···{'.>···•··
CJ 9 18 21 18 0
c4 •• ···J···· ····&··· -·-0··· ····5···· ···1····•··
10 12 18 c. 19 0
····t····
cs 10 JS 21 16 0
C5 ••
.. -····!···· ···+···· ····O···· ···G···r··
(Effective cost matrix I Reduced cost matrix) Since N == (m x n) == 5; an optimal assignment stage is reached. Now, make optimal
i) Obtain opportunity cost matrix assignments.
.
2 c, 2 I 0 0 c,
c2 [Q]
I I
5
ill
2
x I
c2 0 5 2 4 0 5 2
CJ 2 6 3 3 0 cl
c.
)(
;·
4
[Q]
I
)(
2
5
rn2
c. 3 0 0 4 0 .)
cs 3 3 3 I 0 cs I I .I . [[] )(
(Opportunity cost matrix) The optima I assignment of roads to contractors with associated cost is as follow.
ii) Draw minimum number of lines to cover all zeroes " Contractor Road Cost
R, R1 R., ij.. Re c, ~ 19
-+ -+
C1 2 2 1 $ Q c _...
R, -+ 7
· c2 ·· ····tl···· ····~···· ····2···· ····4·····
• ····6········
• c, -+ R5{Dummy) -+ 0
CJ ·2 6 3 ~ Q c. ~
-+ -+ 12
c 4
. ···-J···· ····(}-··· ····(}-··· ····•···· ····Q····•··· cs -+
R. -+ 16
cs 3 3 3 ! o Total Rs. 54 Lakhs
Since N < (m x n); an optimal assignment stage is not reached. Yes, it is necessary to seek supplementary grants.
Choose smallest element K = I not covered by lines. The amount to be sought = 54 - SO= 4 Lakhs
Here, contractor CJ is unsuccessful in his bid.
R, R., R., R, ~.
CI .. ····+···· .....!-···· ····-0···· ····-0···· ····~·-··•····
•
c2 :. ···-0···· ·····S.···· ·-·~·-·· ·····S.···· ····+····r····
Cl I 5 2 3 Q
C• .. ····3···· ····-0···· ····-0···· ·····S.···· ····-l-···T···
C5 2 2 2 I 0
0
Again, select smallest element K = I

~~; -:.;'~':/'t~r!.0~';}J;;}, _-:QhRATit>~aibt&&utca .,~~,9~~ ~o~n.r•-- ~ 1( ~\·~~~~:·~~~; _- _,-_-.,
i) Obtain reduced cost matrix
4~4,{MW~t,z~TJ~~,:~~l~':J:f!tl,)litI¥1l!i,1.IR@',bm;,M,2~,:;'- _-
II III IV
sometimes, assignment problem involves the maximization of the profit, revenue, etc as
the objective function. Such probiems can be solved by converting the given maximization
A 0 6 2 5
problem into a minimization problem. This can be don' in two ways B I 4 0 ·O
I. Put a negative sign before each -of the payoff elements in the assignment table so as c 0
2 3 0
to convert the profit values into the cost values. or D 3 2I 0
2. Select the largest payoff element in the assignment table and then subtract all the (Reduced cost matrix I Opportunity cost matrix)
elements of the table from the largest element. The transformed assignment problem ii) Draw minimum number of lines to cover all zeroes
so obtained can be solved by using the Hungarian method. I II Ill IV
8. A company has a team of four salesmen and there arc four districts where the A . -···-0···· ····6···· ····2-···· ····f···r·
company wants to start its business. The company estimates that the profit/
B . ·-··+···· -···4-···· ····-0···· ····~··+·
day is given below. Find the assignment of salesmen to districts which gives
maximum profit. c . -·-·-0-··· ····-0···· ····2"···· ····t-··+·
Districts D 2 3 I ~
II III IV Here, N =4; (m x n) = 4; an optimal assignment stage is reached. Now make optimal
A 16 IO 14 II assignments.
r::
""E B 14 II IS IS ii IU IV
"' c
Q)
-;; IS IS 13 12 A [[) 6 2 5
if)
D 13 12 14 15 B I 4 []] )(
July 2014 (08 M) c )( [[] 2 3
Data: D 2 3 I [fil
Districts The optimal assignment of salesman to different districts with maximized profit is
II III IV as shown below;
Salesman
s::
Ol
E
"'
Q)
A
B
c
16
14
10
II
14
15
II
15 A
B
Districts
-- I
Profit
-- J
--
Ill
--
<ii 15 15 13 12 15
16
if)
c From profit table
D 13 12 14 15 II 15
(Profit matrix) D IV 15
Sol. Here, m = 4, n = 4, it is a balanced maximization assignment problem. Total Rs.61
Select a largest element in the profit matrix i.e. 16 and subtract all elements from it
to convert it into minimization problem. 9. Solve the following assignment problem for maximization. July 2018 (8M)
I 11 Ill IV . Area
A 0 6 2 5 A A ? A A
c
B 2 5 I I O<l SI 2Uf> 150 170 220
c I I 3 4 ~
QJ s2 160 120 150 140
-;;
D 3 4 2 I fl)
SJ 190 195 190 200
(Effective cost matrix) s4 180 175 160 190
- Data:-
A A A A
220
Area
}t)~no1'8 REsEARCH ~9rirEKT PROBLEMS
K=IO, which is not covered by any line, then
s, IP ~5 JP
.,;;··
As N < (mxn); an optimal assignment stage ~s not yet reached. Select an element
Q
.
.: _;:_ .. ~
c: s, 200 150 170

sz 0 js .d 30
"'E .s2 160 120 150 140
IP p q
rn
0
-.; SJ 190 195 190 200 S1 IP
en
180 17S 160 190 s. 0 b lb 0
s4
(Profit matrix) Since N= (mxn); an optimal assignment stage is reached. Now, make optimal
Sol. Here, m = 4 assignments.
n=4 A. A_ A_. A
Since m = n; it is a balanced assignment problem: The given problem is maximization "
type, subtract all its elements by the largest element i.e. 220 in the matrix to convert
s, 10 55 30 []]
it into minimization type. s2
s,
!ill 35 x 30
A. A_ A. A 10 ~ .{ill 10
s, 20 70 so 0 s. )( ,!]] 10 x
s2 60 100 70 80 The optimal assignment of salesman to different areas with associated profit is as
follows.
S1 30 2S 30 20
Salesman Area Profit
s. .40 4S 60 30
s, -> A. -> 220
(Effective cost matrix)
i) Obtain reduced cost matrix S, -> A, -> 160
__, ~ (From profit matrix)
A. A_ A_ A Si -> Ai 190
s, 20 70 so 0 s. ->
A" ->
-Rs.175
-745
10 20 Total
s2 0 40
Si 10 5 10 0 . But an alternate optimal solution also exists and is given by
s. 10 15 30 0 Salesman Area Profit
(Reduced cost matrix) s, -> A4 __, 220
ii) Obtain opportunity cost matrix s: -> A) __, 150
A. A_ A_ A __, __,
Si A1 195
s, 20 6S 40 0 s. -> A, __, 180
s2 0 3S 0 20 Total
-Rs.
-
Si 10 0 0 0 745
s. 10 10 20 0 0
10. The owner of a small machine has four machinists available to assign to jobs for
{Opportunity cost matrix) the day. Five jobs arc offered with expected profit for each machinist on each
iii) Draw minimum number oflines to cover all zeroes job as follows: April 2018 (10 M)
A, A, A, A, Jobs
s, 20 6S 40 0 A B C D E
.i) -
S, ··· ····&··· ··-3-5··· ····&···: ···$·+ -~ I 62 78 50 IOI 82
s,- ... ··+O.·· ···-0···· ····O.···. ····G-···4·
. I
'.)
2 71 84 61 73 59
s. "'
~ 3 87 92 Ill 71 81
4 48 64 87 77 80
..
.,,.,
Sol. Here, m = 4
·, 9~RATIORB.J9.:s~~
AssioriluT PRoM;tit& ..'.~-
n=5 A B <;; Q E
Since m -:f n; it is an unbalanced problem. Add dummy row I machinist with zero 32 16 ~I d 12
profit in each cell to make it"a balanced maximization problem. 2 ··ll· ·--0--· -·~· ·--1.ji .. -·25-··r·
Jobs 3 17 12 (J) 40 23
A B C D E 4 ·32·· ··1·6·· ···~··· ·-·l.P·· ... (). .....
..... 62 78 50 IOI 82
Oum ···O··· ··-0-·· ··-1···· ··+·· ···O.···•·
:g"' 71 84 61 73 59
2
u«I 87 92 111 71 81
3
Since N = (mx;;); an optimal assignment stage is reached. Now, make optimal
::;! assignments.
48 64 87 77 80
4
A B C D E
0 0 0 0 0
Oum L---''---1,..----1~--''----' l 32 16 51 [QJ 12
Choose largest element i.e. 111 in the' matrix and subtract all elements from it to
2 13 [QJ 30 18 25
obtain effective cost matrix.
A B C D E 3 17 12 []] 40 23
I 49 33 10 29 61 4 32 16 )( 10 [QJ
2 40 27 38 52 50 Dum []] 7 x 7 )(
3 24 19 40 30 0 The optimal assignment of machinist to different jobs with associated profit is as
34 31 24 follows:
4 63 47
111 Machinist Job Profit
Oum 11 l Ill Ill 111
(Effective cost matrix) I --+ D --+ IOI
i) Obtain reduced cost matrix 2 --+ B 84
--+
A B C D E 3 --+ c 111
--+ ~ (From profit matrix)
39 23 51 0 19 4 --+ E -> 80
13 0 23 1l 25 Dummy --+ A --+ 0
2 - -
Total Rs. 376
3 24 19 0 40 30
4 39 23 0 10 7 11. The owner of a small machine shop has four machinists available to do jobs
Oum 0 o. 0
L----L~.,.._~..._~.___
0 0 for the day. Five jobs are offered with the expected profit in rupees for each
(Reduced cost matrix) I opportunity cost matrix) machinist on each jobs as follows:
ii) Draw minimum number oflines to cover all zeroes l 2 3 4
A B <;:: Q E A 32 41 57 18
I 39 23 ~I ~ 19 B 48 54 62 34
2 ··IJ·· ···0-·· --~3·- ·'·ti+-- ·;25·-+-- c 20 31 81 57
4
3
39
24 19
23
0 4b
0 IP
30
7
.. D 71 43 41 47
E 52 29 51 50
Oum ·--0-·· ---0--- -~~--- ·--~--- -·-0-·-·-- Find by using assignment method, the assignment of machi11ist to jobs that will
result in a maximum profit. June 2010 (10 M)
As N< (mxn); optimal assignment stage is not yet reached. Select an element K = 7,
Sol. In the given matrix, m = 5, n = 4, it is an unbalanced assignment problem.
which is not covered by any line. ~
..
maximization assignment problem.
o..~Tloie
... lbswca
·, .. .._.· "
Add dummy column with zero profit element in each cell to make it a balanced
. Ass10NMENT PRoaLEi.is
2
·.:··
~ 4 5
.·.-
I 2 3 4 5 A 25 8 Q 37 5
A 32 41 57 18 0 B · -t-t·· ····&··· ····fi-··· ···z&·· ···to-····
B 48 54 62 34 0 c 61 42 0 22 29
c 20 31 -81 57 0 D · ····O.··· ···iW-·· ···3lf·· ···22··· ···f9'····
D 71 43 41 47 0 E - ....(}.... ···l)... ···+·· . . ().. . .. .()......
E 52 29 5l 50 0 Here, N = 4; (m x n) = 5;
(Profit matrix) Since N < {m x n); an optimal assignment stage is not reached.
Select' a largest element i.e. 81 from the profit matrix to convert this maximization Choose smallest element i.e. K =5 not covered by lines, then
problem into minimization type.
I 4 ~ 4 5
I 2 3 4 5
A · ... w... ····t···· ···-~·-·· ···32··· ····0.··· 4 ••
A 49 40 24 63 81
B 14 ~ $ 26 10
B 33 27 19 47 81
c 56 3'rl 0 17 24
c 61 50 0 24 81 D · ····tt···· ···$··· ···3~---· ···22··· ···w··~--
D 10 38 40 34 81 E .....o. ........Jjs. ... ···-~---· .... o. ........ 0. ....•..
E 29 52 30 31 81
(Effective cost matrix) Here, N = 5; (m x n) = S; an optimal assignment is reached. Now, make optimal
i) Obtain reduced cost matrix assignments.
2 3 4 5 2 3 4 5
A. 25 16 0 39 57 A 23 3 )( 32 [[]
B 14 8 0 28 62 B 14 [[J 5 26 10
c 61 50 0 24 81 . c 56 37 lO.J 17 24
D 0 28 30 24 71 D [Q] 20 35 22 19
E 0 23 1 2 52 E x 15 6 [Q] )(
(Reduced cost matrix) The optimal assignment of machinist to various Jobs associate with maximized profit
ii) Obtain an opportunity cost matrix is as shown below
Machinist Jobs
--
l 2 3 4 5 Profit
A 25 8 0 37 5 I -+ D 71
B 14 0 0 26 10 2 -+ B 54
c 61 42 0 22 29 ~
From profit
.) -+
c - 81
matrix
D 0 ~ 30 22 19 4 -+ 50
E -
E 0 15 1 0 0 S(Dummy) -+ 0
(Opportunity cost matrix)
A -
Total Rs. 256
iii) Draw minimum number oflines to cover all zeroes
....
12.
oi>~iJ.Ti(jN&
The owner of a machine shop has four machines available to assign the jobs
lbsEA.tail·
for the day. Five jobs. are offered with the expected profit in. rupees for each
AssIGl'UdENT PROBLEMS
ii) Draw minimum number oflines to cover all zeroes

A B G
.'··
0 E
..
. ...3g... ...;n.. ...s~... ....o.... ..i.9.....
machine on each job is as follows. Find the assignment of the machines to the
jobs that will result in a maximum profit, which job to be declined. 2 .... +3.......f) .......2~.......J+... -2-s ... +
A. B C 0 E 3 24 19 0 40 30
l 62 :78 50 101 82 4 39 23 Q 10 7
2 71 84 61 73 59 Oum · ....-0........ -0 ........ ~ ........-0 ..... ()....... T
3 87 92 Ill 71 81 Here, N = 4; but (m x n) = 5;
4 48 64 87 77 80 Since N < (m x n); an optimal assignment stage is not reached yet. Select a smallest
July 2015 (lOM) element i.e. K = 7 uncovered by the line.
Sol. In the given matrix, A B c; 0 E
Here, m = 4, n = 5, it is an unbalanced assignment problem. Add a dummy row with
...39......;iJ. .... .s,g ....... Q.... -t-9 .... + ..
zero profit element in each cell to make it balanced maximization problem.
2 ...n ....... <7.....J-p ...... tt .. · ·z.s. .... + ..
A ·B C 0 E
I 62 78 50 101 82
3 17 12 d . 33 23
4 ...32... "'itr" ...~ .... ...+.: ..... 6 ... + ..
2 71 84 61 73 59
Oum ...-0........ & ..· ... 4........ o-....... 6 ... + ..
3 87 92 111 71 81
4 48 64. 87 77 80 Here, N = 5; (mxn) = 5; an optimal assignment stage is reached. Now, make optimal
Oum 0 0 0 0 0 assignments.
+..
(Profit matrix) A B c 0 E
,,' Convert this maximization problem into minimization type, choose the highest 39 23 58 [[] 19
' element in the profit matrix i.e. 111 and subtract all the element of the profit matrix 2 13 LilJ 30 II 25
h from it to get effective cost matrix. 3 17 12 [Q] 33 23
.. A B C 0 E 4 32 16 x 3 !]]
...
i::
I
2
49
40
33
27
61
50
10
38
29
52
Oum [Q] x 7 )( )(
The optimal assignment of machines to different jobs with maximized profit is as
3 24 19 0 40 30 shown below;
4 63 47 24 34 31 Machines Jobs Profit
Oum Ill III Ill Ill Ill -+ D -+ IOI
'·
(Effective cost matrix) 2 -+ B -+ 84
3 -+ c -+ I I I } From p~ofit
A B c 0 E matrix
4 -+ E -+ 80
39 23 SJ 0 19 Oum A -+
-+ 0
2 13 0 23 II ")" _)
Total Rs. 376
--
3 24 19 0 40 30
4 39 23 0 10 7
Oum 0 0 0 0 0
(Reduced cost matrix I opportunity cost matrix)
...
13.
co-efficient are given below
OPERATIONS.
Find the minimum cost sol~tion for the 5 x 5 assignment problem whose cost
REs.EUCH .Aas1G•ME!fT PR.oar.EMS
iii) Draw minimum no. of lines to cover all iemes

l ~ ~ 4 5
..
B 6 4 ~ 2 6
2 3 4 5 2 9 ··q ~' 4 4
1 -2 -4 -8 -6 -1 3 5 0. 8 fi 1
2 O· -9 -5 -5 -4 4 . ···-0···· ..:+:.~ ...f .. ···-4···· -···G-···+·
< 3 -3 -8 0 -2 -6 5 . ···-0···· :..
-
+·· ~-+··· ···-0···· ····3····+··
... ,; ...
4 -4 -3 -I 0 -3
Here, N = 4; (m x n) = S; since N <{m x n) optimal assignment stage is not reached
5 -9 -5 -8 -9 -5
yet
. . Select smallest element uncovereg by a line i.e. K = l, then the resultant matrix
Sol. Since all elements in the matrix are :S 0, add +9 to all element to make them~ 0 and IS
-
apply Hungai-ian technique. 2 3 4 5

B . ... $ .... ···A···· ... ~~--- .... i .... .... 5.... + •.
2 3 4 5 2 .... .g ........ Q...•....4 ...... .] ........ ] .... +.
7 5 1 3 8
3 · ···4···· ····0-··· ···-&··· ····S···· ·--·G-···+·
2 9 0 4 4 5
4 . ···-{)···· ····2···· ···-4-··· ···-4···· ····0-···+··
< 3 6 1 9 7 3
5 · ···-0···· ····5···· ····2-··· ····O···· ····3···-+-·
4 5 6 8 9 6
Here N = 5; (m x n) = 5; since N = (m x n) = 5; an optimal assignment stage is
5 0 4 1 0 4 reached. Now, make optimal assignments.
{Effective cost matrix)
1 2 3 4 5
Here, m = 5 = n: it is a b~lanced assignment problem. 5 4 @] I 5
2 8 _[]] 4 3 .)
"I
B
4 5
3 4 )( 8 5 IQ]
2 3
6 4 0 2 7
4 [[] 2 4 4 x
5 5 )( 5 2 ill 3
2 9 0 4 4
6 2 The optimal assignment with associated cost obtained using given matrix 1s as
< 3 5 0 8 follows
4 0 1 3 4 l
1 --> 3 --> -8
' 5 0 4 1 0 4
(Reduced cost matrix) 2 --> 2 --> -9
ii) Obtain opportunity cost matrix · 3 --> 5 --> -6
B 4 --> 1 --> -4
2 3 4 5 5 --> 4 --> -9
• -
6 4 0 2 6 Total -36
2 9 . 0 4 4 4
.6 I
< 3 5 0 8
4 0 1 3 4 0
5 0 4 1 0 3
{Oppo1tunity cost matrix)
14.
· ~ridx$;REsEARCH
An airfreight company picks up and delivers freight where customers require.
Company bas two types of aircrafts X and Y with equal loading capacity but
AssioirilnT
·:·.
.:,
PaoBLEHS
a b c
.~~.)1~:~~7~~?~~~·;t~ltp~
d
,.
different operating cost as i;iven below: J
1500 800 2400 HOO
Type of Cost/km in Rs. K
2250 1050 3450 1950
aircraft .Empty Loaded L
2400 1050 3150 ~2250
x . 1 2 M
1400 800 2400 1200
y 1.5 3 (Effective cost matrix)
The.present four locations of the aircrafts are, J-.X, K->Y, L->Y, M->X. Four
customers of the company at A, B, C and D want to transport the same size a b c d
of the load to their final destinations at a distance of 600, 300, 1000 and 500 700J 0 1600 300
kms respectively. Distance in kms between the locations of the aircraft and the K
1200 0 2400 900
loading points are as follows: L 1350 0 2100 1200
Loading points 600
M ......_ 0 1600 400
a b c d (Reduced cost matrix)
J 300 200 400 100 ii) Obtain opportunity cost matrix
..... c::
c:: 0
~ ·;:: K 300 100 300 300 b a c d
ii) o:I
ci:: _g L 400 JOO 100 500 J 0 100 0 0
M 200 200 400 200 600 K 0 800 600
Determine the location, which minimizes the total cost of transportation. 750 L 0 500 900
Jan 2009 (17 M)
M .__ 0 0 0 100
Sol. In this problem, m = 4, n = 4, It is a balanced assignment problem.
Let a, b, c , and d be the final locations to where the loads are to be carried from the iii) Draw minimum number of lines to cover all zeroes
loading points A, B, C, and D respectively.
X and Y be the two types of air crafts located at (J & M) and (K & L) respectively.
a b c d
These air crafts move empty to the loading points and carry loads to the final J -·lOO--- ----(). ......... ()..... ----0 ....r..
destinations. K 600 0 800 600
Prepare an effective cost matrix. L 750 p 500 900
Destinations M -----0 .........~ .........(). ...... J-0()... ..
a b c d
Here, N = 3, (m x n) = 4, optimal assignment stage is not reached. Choose smallest
1->X 300 x I 200 x I 400 x 1 100 x I element K = 500, which is not covered by a line.
+ + + + a b c d
6oox.2 300 x 2 1000 x 2 500 x 2
1 . ---1-00-.. --~o .......~ ........o.......
K->Y 300 x 1.5 100 x 1.5 300 x 1.5 300 x 1.5
+ + + + K 100 0 3$0 100
• Locations 600 x 3 300 x3 1000 x 3 500 x 3 L 250 ~ 9 400
L--+Y 400 x 1.5 100x1.5 100 x 1.5 500 x 1.5 M · -----0----- .. 5-(>0....... ~ ..... ·+O<tr
+ + + +
600 x 3 300 x 3 1000 x 3 500 x 3 Since N = (m x n); an optimal assignment stage is reached. Now, make optimal
assignments.
M->X 200 x I 200 x I 400 x I 200 x I
+ + + +
600 x 2 300 x 2 1000 x 2 500 x 2
.. a b
-· c d
Ol'ERATIORS REsEARCH AsslGKMERT PROBLEMS
i) Obtain opportunity cost matrix

,.
J l-00 500 )( [Q] Trucks
IQJ A B C D E F
'K 100 300 100
a 0 5 0 4 3 o·
L 250 )( [[] 400
[QJ )( "' 4 20 2 5 2 0
M L.--=-i
500 100 Iii
.5
3 0 7 3 I 6 0
The optimal assignment of location to loading points with minimum cost as follows E
....
4 3 3 I 2 5 0
Location Destination Cost ~
5 2 I 2 I 0 0
d JIOO
--
J --> -->
6 2 6 4 0 3 0
K b - 1050 (Opportunity cost matrix)
-
L c -->. 3150 ii) Draw minimum number of lines to cover all zeroes
M a --> 1400 i ! ! ! ' ! .
A S <i: Il> E f
Total Rs. 6700
(l $ - ~ 4. 1 t)
15. A truck company on a particular day has 5 truck for sending material to 6
terminals.· The cost of sending material from same destination to different
2 4 Q :! 2 $ ~
trucks will be different as given by the cost inatrix below. Find the assignment
3 (l t ~ ~ l t)
of 4 trucks to 4 terminals out of 6 at the 1itininillm cost. 4 L ~ i . $ ~ 0
Trucks 5 ~ I ~ i q q
A B c D E 6 ~ ~ 4 q 1 ~
3 6 2 6 5 Here N = 6; (m x n) = 6;
2 7 j 4 ·-·· 4 7 Since N = (m x n); an optimal assignment stage is reached. Now, make optimal
"'
Iii
c: 3 3 8 5 8 3 assignments.
'§ 4 6 4 _3 . 7 4 A B ··--· c 0 E F
~
5 5 2 4 3' 2 5 x
[ill 2
[QJ 4 3 )(
6 5 7 6 2 5 2 4 2 5 )(
Sol. In the given cost matrix, 3 []] 7 )_ . 6_' - I )(
m = 6, n = 5; Since m -f:. n: it is an unbalanced assignme11t.
Add dummy column \vith zero cost element iil each cell to make it a balanced
4 3 3 I . ~ - .2 nn
problem.
5 2 I 2 .J.~ j[J )(
Tnicks 6 2 6 4 3 [[]
- x
l'he optimal assignment of 4 trucks to 4 termlrtals wlth miiitnlilJn cost is as follows
A B C D E F
Trucks Terrttinals Cost
3 6 2 6 5 0
·I, A --> 3 --> 3 (Eliminate) 0
"' 2 7 4 4 7 0
~ *B --> 2 --> I
.s 3 3 8 5 II 3 0
E 4 6 43 7 4 0 ~ 4 I --> 2
~ •D --> 6 --> 2
5 5 24 3 2 0
*E --> 5 --> 2
-6 5 7 6 2 5 0
(Effective cost matrix I reduced t:ost matrix) F (Dummy) --+ 4 --> O{Dummy)
Total Rs.7
..
16.
.x~:.:~l~~ ~~;~~~~:-:!~:: 'Oii£RA~gi{$'jES~c8
An organization producing four different products A, B, C and D having four
operators P, Q, R and S, who are capable of producing any of four products
As11~~lDl~-r b~€~&- ··•_'-:?t~%~~~~~~t': ·: -::0~,:~{,r,·v-_. •- --~';di~~t*iR
Select highest element in the matrix i.e. 560 and subtract all elements from it to
convert maximization problem in to minimization type.
A 8 C D
works effectively 7 hou-rs per day. The time in minutes required for each operator ~
for producing each of the product are given in cell of following matrix along p 350 476 440 525
with profit (Rs/unit). Find out assignment of operators which will maximize the Q 380 392 0 455
profit. R 350 440 392 518
Product s 497 476 448 532
A B c D (Effective cost matrix)
p 6 10 14 12 i) Obtain reduced cost matrix
Operator Q 7 5 3 4 A 8 c D
R 6 7 10 IO p 0 126 90 175
s 20 10 15 15 Q 380 392 0 455
Profit R 0 90 42 168
J 2 4
(Rs/unit) s 49 28 0 84
Sol. In this problem, (Reduced cost matrix)
m = n = 4; it is a balanced assignment problem. ii) Obtain opportunity cost matrix
Prepare a profit matrix taking into account the operators and their capability in A B C D
producing different product along with the profit. p 0 98 90 91
Each operator works effectively 7 hours (i.e. 420 minutes) per day.
Suppose operator Pis ass.igned to produce product A, then, Q 380 364 0 371
6 minutes---+ I unit of product A R 0 62 42 84
. 420
420 minutes-+ -=70units
. s 49 0 0 0
6 (Opportunity cost matrix)
I unit of prod4ct A-+ Rs. 3 profit, then iii) Draw minium number of lines to cover all zeroes in the matrix
70 unit ---+ 3 x 70 = Rs. 210 A B C D
Operator 'P' and product '8' p ~ 98 90 91
I0 minutes ---+ I unit Q -.J8G-· ·-364-· ···-0···· ·-3-1-l··
420 minutes---+ 42 units
I unit---+ Rs. 2 profit
R 9 62 42 84
=
42 unit ---+ 2 x 42 Rs. 84 s ..4,9... ... .().... ... .() .... ... .() ....
Same procedure is to be used for all operators with different product to enter the Since N < (m x n); optimal assignment stage is not yet reached. Choose smallest
profit values in the matrix shown below. element uncovered by line i.e. K =42, then
Product A B C D
A B c D p 9 56 ~ 49
p 210 84 120 35 Q 4i2 364 0 371
Operator Q 180 168 560 105 R 9 20 ~ 42
R 210 120 168 42 s ...9,i... ... .() .... ·--~·-·· ·--.0---·
s 63 84 112 28 Again, select K = 20 and draw lines
(Profit matrix)
... A
p . ···-0····
B c D
··J6··· ··48··· ··19···r·
OP~Tioie R.EsEARCH Ass10KMEXT PR.osLEMS
Sol. ..
Construct the tables of layover time for differoot service lines for the crew based at
Chennai and Bangalore.
a) Crew residential (i.e. based) at Cbennai.
'Q . .42i-· -J44-- ... .().... .J.~.i.-J
Route No.
R · ···-O·-·- ···-0·-·· ···-0···- ··z2··l
2 3
S ·....\U~--- ....() .......20 ...--.0---l a 17.50 21
4 5
27 6.5 12
As N = (m x n) = 4; an optimal assignment stage is reached. Now, make optimal ci
z b 16 19.5 25.5 5 10.5
assignm~nts. ~ c 12 r
15.5 21.5 .,.:> u.s
A 8 c D :i
~ d 4.5 8 14 17.5 ?''

p [fil 36 48 29
_
-.J
e ?"_, 26.5 8.5
422 344 []] 351 12 17.5
Q b) Crew based at Bangalore
R )( [[] )( 22
Route No.
s 91 )( 20 [fil
a b c d e
The optimal assignment of operators to produce different products is as follows. I 18.5
0 20 24 7.5 13
Operator Product Profit (Rs.) z 2 15 16.5 20.5
II) 28 9.5
P -> A -> 210 :;
0 3 9 10.5 14.5 22 27.5
Q -> c -> 560 ~
4 5.5 7 II 18.5 24
R -> B -> 120 5 24 25.5 5.5 13 18.5
s -> D -> 28 i) Now prepare a matrix by choosing the minimum layover time from both
Rs. 918 tables by taking the condition that 24 :S waiting time> 4
17. A trip from Chennai to Bangalore takes six hours by bus. A typical time-table of a b c d-- e
the bus service prepared by the transport authorities in both directions is given 17.5* 16* 12* 4.5* 13
below: 2 15 16.5 15.5* 8* 9.5
Departure from Roule Arrival at Arrival at Route Departure from 3 9 10.5 14.5 14* 8.5*
Chcnnai Number Bangalore Chennai Number Bangalore
11.30
4 5.5 5* II 17.5* 12*
06.00 a 12.00 I 05.30
07.30 b 13.30 15.00 2 09.00 5 12* 10 .5*
-- 5.5 13 17.5*
11.30 c 17.30 21.00 3 15.00 (Effective time matrix)
19.00 d 01.00 00.30 4 18.30 Note : * indicates that the values are taken from table (a) i.e. crew based at Chennai
ii) Obtain reduced time matrix
00.30 c 06.30 06.00 5 00.00
The cost of providing this service by the transport company depends upon the a b c d e
time spend by the bus crew (driver and conductor) away from their places in 13 11.5 7.5 0 8.5
addition to service time. There arc five crew. There is, however, a constraint 2 7 8.5 7.5 . 0 1.5
that every crew should be provided with more than four hours of rest -before 3 0.5 2 {j 5.5 0
the return trip again and should not wait for more than 24 hours for the return 4 0.5 0 6 12 7
trip. The company has residential facilities for the crew at Chennai as well as at
Bangalore. Suggest how crew should be assigned with whicb line of service o.r 5 L .6.5
_ 5 0 7.5 12
which service line should be connected with which other line, so as to reduce the (Reduced tune matrix)
iii) Obtain opportunity time matrix
waiting time to the minimum.
. , :;•:··.;~~;P:1L~lmlf~1~·\+.;/f{· ·~:ffolis~filcli ·
2
a
12.5
. 6.5
b
11.5 7.5
8.5 7.5
c d
0
0
e
8.5
1.5
~!~'MP.T fRQ~~§f@
Route No.
2
-+
-+
Route No.
d
e -+
-+
...
Wafting time
4.5
9.5
(Chennai based)
-
•.
(Bangalore based)
.
3 -+ a -+ 9 (Bangalore based)
3 0 2 6 5.5 0
. 0 4 -+ b -+ 5 (Chennai based)
4 0 6 12 7
- 5 5 -+ c -+ 5.5 (Bangalore based)
5 6 0 7.5 12
.____ - Total 33.5 hours
(Opportunity time matrix)
iv) Draw 'minimum number oflines to cover all zeroes 18. An airline operating 7 days a week has a time-table shown below. Crew must
a b c ~ e have a minimum layover time of S hrs between the flights. Obtain the pairing
of flights that minimizes the total layover time. Crew will be placed in that-city
I 12.5 11.5 7.5 8.5 q which results in minimum layover time. For each pair mention the town where
2 6.5 8.5 7.5 0 1.5 the crew should be placed.
3 . ----·-0----· ----1---- ----6---· ..5j5... --·-0----~-
Delhi-Jaipur Jaipur-Delhi
4 · ----·-0----· ----0---- ----6-·-- --·Ill--- ----1----·-
Flight No. Departure Arrival Flight No.
Departure Arrival
5 - ----·-tr----- ....5.... ----o---- --1j5-- ---1-Z--·r·
I 7AM 8AM 101 SAM 9AM
As N < (m x n); no optimal stage is reached. 2 8AM 9AM 102 9AM IOAM
Take K = 1.5, then the resultant matrix is 3 IPM 2PM 103
12 Noon IPM
a b c d e
4 6PM 7PM 104 5PM 6PM
I Iii IP ~ Q t Jan 2007 (12 M)
2 $ t ~ ci 0 Sol. Construct tables of layover time for different service lines for the crew based at Delhi
;, 3 0 i ~ 1 0 and Jaipur.
~
Crew based I residential at Delhi:

4 Q Q ~ l~.5 1 a) The layover/ waiting time for different service lines is
d
5 ~
~-
9 ~ l~
Flight No.
Since N = (m x n), an optimal assignment stage is reached. Now, make optimal 101 102 103 104
assignments. 24 25 28 9
a b c d e z0 2 __, 24 27 8
... ?~
II 10. 6 f01 7 ~ 3 18 19 22 27
2 5 7 6 x [Q]
)(
LL:
4 13 14 17 22
3 [[] 2 6 7 Crew based/ residential at Jaipur:
4 )(' [[I 6 13.5 7 b) The layover I waiting time for different service lines is
5 6 5 [[] 9 12 I 2 3 4
The optimal pairing {)f service lines with associated minimum waiting time is as IOI 22 23 28 •9
follows. 102 21 22 27 8
103 18 19 24 5
104 13 14 19 24
...
i) Prepare minimum layover time table by choosing minimum value among two
~~ .
OPERATIONS REsEARCH AsSIGNMENT PROBLEMS
IOI 102 103 104

-1----z-··- -··-&·.. ----&--- .. --Q--..·-
..
IOI 102 103 104
21 18 9*
2 4 2 12 0
I 22
3 . --··&·-- ----&--- ....6··-- ---r,-2---·-
2 23* 22 19 .8*
3 18* 19* 22* 19
4 - ----2---- ----0.--- ---·0-··· ···¥..•·
4 9 8 5 22* As N = (m >< n); an optimal assignment stage is reached. Now, make optimal
assignments.
(Effective time matrix).
Note : * indicates the values taken from table I i.e. crew based at Delhi IOI 102 103 104
ii) Obtain reduced time matrix 2 [[] )( ·x
101 102 103 104 2 4 2 12 []]
13 12 9 0 3 [[] )( 6 12
2 IS 14 21 0 4 2 )( [Q] 24
3 0 I 4 I The optimal pairing offlights with associated minimum layover time is as follows.
4 4 3 0 17 Flight No. Flight No. Layover time
(Reduced time matrix) I --+ 102 --+ 21
iii) Obtain opportunity time matrix
2 --+ 104 --+ 8
101 102 103 104 3 --+ IOI --+ 18
13 II 9 0 4 --+ 103 --+ 5
2 15 13 21 0
52 hours
3 0 0 4 I Note : Multiple optimal solution exists
4 4 2 0 17 19. A company has four territories open, and four salesmen available for an
(Opportunity time matrix) assignment. The territories are not equally rich in their sales potential. It is
iv) Draw minimum number of lines to cover all zeroes estimated that a typical salesman operating in each territory would bring in the
IOI 102 103 104 following annual sales:
13 11 9 (J Territory : I II Ill IV
2 15 13 21 €l Annual sales (Rs): 1,26,000 1,05,000 84,000 63,000
3 ···-{)···- -·--()·--- ....4.... ----)···-· The four salesmen also differ in their ability. It is estimated that, working under
4 ·---4---- ----2---- ...-0.... ---1j:,z-.... the same conditions, their yearly sales would be proportionately as follows:
Salesmen : A 8 C D
Since N < (m x n), an optimal assignment stage is not yet reached. Annual sales (Rs): 7 5 5 4
Select K = 9, then the resultant matrix obtained is
If the criterion is maximum expected total sales, the intuitive answer is to assign
101 102 IQ3 IQ4 ~ the best salesman to the richest territory, the next best salesman to the second
4 2 d Q richest, and so on; verify this answer by the assignment technique.
2 6 4 I~ Q Sol. Sum of the proportionate annual sales= 7+5+5+4=21
3 - ·---()---- ----o-...· ---4---- -··i·b---i-
4 4 2 q 2~ ,1
Again, select K = 2, as an optimal assignment stage is not yet reached.
r'
r·
- I
!R&?"'.
·-'.>·.
·
.:'~·~:~:~~~-·~l~~~~~f~~P!I .
Annual sales in that zone
Annual sales m each zone by an average salesman::;;------------
Sum of proportionate annual sales
·;~fl~iiji -· - .:;~>tHt111~~~~~,!rfr;: <·~"\~
a 0
II
21
Ill IV
42 63
l
•_
Maximum annual sales in each
::;;
[Annual sales in each] [Proportionate of
zone by an average x
J '""
b
c
0
0
15 30 45
IS 30 45
zone by an average salesman . that salesman
. salesman d 0 12 24 36
(Reduced cost matrix)
i) Prepare effective profit matrix
ii) Obtain opportunity cost matrix
Territory
I II III IV
II III IV
a 0 9 18 27
A (126000x 7) (I05000x7) (84000x 7) (63000x 7) b 0 3 6 9
21 21 21 21 c 0 3 6 9
B 126000x5 (105000x5) (84000 x 5) (63000x5) d 0 0 0 0
21 . 21 (Opportunity cost matrix)
Salesman 21 21
iii) Draw minimum number of lines to cover all zeroes
c (126000x5) (105000x5) (84000 x 5) (63000x5) I II Ill IV
21 21 21 21 a ~ 9 18 27
D b 3 6 9
(126000x4) (105000x4) (84000x 4) (63000x4)
c 3 6 9
21 21 21 21 n n n
d ,.. v v
(Effective profit matrix)
Take (
7
~~0) as common from effective profit matrix, then As N < (m x n); optimal assignment stage is not reached. Select K = 3 not covered
by any line, then
II III IV
II III IV
a I ( 15 24
a 126 105 84 63 (
b ( .. 3 6
b 90 75 60 45
c (
~ . ~
·'
6
c 90 75 60 45 ' n n
d v v
d 72 60 48 36
(Effective profit matrix) Again, select K = 3, then the resultant matrix is
Convert this maximization (profit) problem into minimization type by choosing I II III IV
highest element (i.e. 126) and subtract all elements from it. a D ' I~ 21
I II III IV b D ' 3
a 0 21 42 63 c D '
3
b 36 51 66 81 <a n
d -
c 36 51 66 81
d 54 66 78 90
.. Since N = (m
assignments.
x
U Ill
OPERATJONS REsEARCH
n); an optimal assignment stage is reached. Now, make optimal
IV
~1Itm'.~a~. .· ··.c_.;)'~\i~:<~~fii~t~:h;J..
given games to make it a balanced assignment·problem. It is to be noted that official
4 should not be assigned to game A. Hence, use oo at the junction cell of column 4
and row A in the matrix.
\:-
a []] 6 12 21 OfficiaJs
b )( [ill )( 3 2 3 4 5 6
c )( )( [Ql 3 A 20 40 60 00 70 80
d 6 3 x
[]] B 45 90 7.0 60 15 25
Ttie optimal assignment of salesman to territory with maximized profit is shown Games c 10 70 30 40 50 35
below. A 20 40 60 00 70 80
Salesman Territory Profit I Sales B 45 906.0 70 15 25
c 70 r 40
a
b
---+
---+
I
II
-+
---+
126}
75 From effective
10
(Effective distance matrix)
30 50 35
Ill ---+ 60 profit matrix i) Obtain reduced distance matrix

c ---+
IV ---+ 36 2 ., 3 4 5 6
d ---+
7
A 0 20 40 00 so 60
~~ )
0
( 297x B 30 75 55 45 0 IO
c 0 uO 20 30 40 25
Maximum sales Rs. 99,000. A 0 20 40 00 50 60
B 30 75 55 45 0 10
4.5 MULTIPLE OPTIMAL SOLUTIONS IN ASSIGNMENT PROBLEM
c 0 60 jQ 20 40 25
While making an assignment in the reduced matrix, it is possible to have two or more .(Reduced distance matrix)
ways to strike off a certain number of zeros. Such situation indicates multiple optimal ii) Obtain opportunity distance matrix
solutions with the same optimal value of the objective function. I 2 3 4 5 6
20. A college athletic confc.rencc has 6 basketball officials. It must assign to 3
A 0 -0 20 00 50 50
conference games. Two officials must be assigned to each game. The conference
office desires to assign the ollicials such that the total distance travelled by all B 30 55 35 15 0 0
the six officials will be minimized. The distance each official would have to travel c 0 40 0 0 40 15
to eacli game arc given below: A 0 0 - 20 00 50 5{)
Officials B 30 55 35 15 0 0
6 c 0 40 0 0 40 15
"'
11)
A
2
20
3
40
4 5
60 00 70 80 (Oppo1tunity distance matrix) --
60 15 25 iii) Draw minimum number of lines that must cover all zeroes in the matrix.
0"' B 45 90 70
I 2 3 4 5 -6
c 10 70 30 ~ 40 • 50
A ~ Q 20 oo 50 50
The conference office has decided not to assign the official 4 to game A because
of the previous conflicts with one of the coaches. Determine the optimal B . --JP.-- ...5js. .. ...35......+5... ... -0........Q...•
assignment. Jan 2008 (12M) C · ····()-··· -··4n-·· --..0-··· ····O··.. · ···40-·· ··+5···
Sol. Here, m = 3, n = 6, It is an unbalanced assignment problem. A Q 9 20 50 50
oo
A college athletic-conference has 6 officials and it has to conduct 3 games of which 2 s · ··-J~·- ·--s~---. ·-3s··· ...ts··· ····-0···· ····o····
officials are to be assigned to each game. Add) more rows of games similar to that of
C · .... q-... ···4t··; ··--0··-· "··O···· ···40-·· ··+5···
... - ;-' - 9i~~ij~~-~C}! Ass1aifM:~1' PR68LEM:s
Since N = (m x n) = 6, an optimal assignment stage is reached. Now, make optimal
Examiner
assignments
Officials E E E E-. E
-,
4 5 6 A 20 40 6.0 20 70
- 2 3
A [Q] )( 20 00 50 50 B 45 90 70 60 15
Practical
B 30 55 35 ·15 [QJ )( A 20 40 60 20 -70
Games c· )( 40 [[] x 40 15 B
Dum
45
0
90
0
70
0
60
0 . 0
15
A )( []] 20 00 50 50 '-----'
35 15 )( [Q] (Effective distance matrix)
B 30 55
i) Obtain reduced distance matrix
c )( 40 )( [[] 40 15
E E E E a-
E'
Note : Multiple optimum solution exists A 0 20 40 0 50
The optimal assignment of 6 officials to 3 games with associated distance travelled
8 30 75 55 45 0
is as follows.
Game Distance A 0 20 40 0 50
--
Official
I
2
A
A
-- 20
40
8 30
Dum ...______.
0
75
0
55
0
45.
0
0
0
3
4
c
c
--- -- 30
40
(Reduced I Opportunity distance matrix)
ii) Draw minimum number-of lines that must cover all zeroes in the matrix
. E; E, E, E, E<
5
6
B
B
-
----->
- 15
25
Total 170 Kms(say)
A · .... 0---· ·-·20--· ---40-.. -.. -o.......~0- .. +·
8 30 75 55 45 0
A · .... o-.. - .. -w-- ··AO··· ....0.......5.0-.. +·
21. A university examination panel has five examiners. The examiners are to be 8 30 75 55 45 9
assigned to two practical examinations, two each for each practical exam. Oum· .... o--.. ----o-.......o........o........9.... t.
.;.: University desires to assign examiners such that the total distance travelled by
all the examiners is min-imum. The distance each examiner would have to travel Here, N = 4, (m x n) 5, optimal assignment stage is not reached.
to each practical examinaiion center is given bel()w. Solve the problem. Select a smallest element K = 30 that is not covered by any line in the matrix
·' Examiner E. E_ E_ E." E'
E E, E A 0 zo 40 - 0 SP
Practical A 20 I 40 I 60 8 9 45 25 Ip ~
8 I 45 I 90 I 70 A $ 20 40 ¢ sp
Jan 2010 (lOM) 8 $ 45 25 I~ Q
Sol. In the given matrix, Oum ---+--· ....g.... .... o-... ...~ .... ...3p....
m = 2, n = 5, it is an unbalanced assignment problem. •
There are 5 examiners to conduct 2 practical examinations, two examiners are to Again, select K = 20, then the resultant matrix is
be assigned to each exam. Add 3 more rows of practical exams of which 2 rows are
same as given rows in the matrix and one dummy row with zero distance element in
each cell to make it a balanced problem.
...
%?P
A 0
E
-
0 20
E., E
- E
0 8@
..
· Q~tlei"}~~
E
~ee~J>.hatf.~!
Sol. Herem = 6
n=6
.:<~~:~~~h~c;-:t}; ·{j}!ijjjfi~t~~~+lt~~:~~~~1;:~--;.: -~:Jllllll
Since m = n, it is a balanced assignment problem.

B ~ 2~ s I~ d: i) Obtain reduced cost matrix &
A Q Q 20 Q SQ a -b c d e f
B Q ·2~ 5 I~- d. A 0 13 49 2 10 18
.... (} ... ... .() .... ... 20. .. ·--~-- B 0 35 29 7 20 5
Oum ·--20···
c 13 0 63 9 17 5
As N = (m x n) = 5, an optimal assignment stage is reached. Now, make optimal D 47 15 0 22 12 5
assignments. E 25 0 46 II 14 . 7
E E? E E E
d
F 0 53 50 28 14 25
A )( )(
[[! 20 80 (Reduced cost matrix)
B )(
25 15 5 []] ii) Obtain opportunity cost matrix
A )( )( [QJ 20 80 a b c d e f
B [ill 25 15 5 )l( A 0 13 49 0 0 13
Dum .._20 )( [QJ 2Q 50 B 0 35 29 5 10 0
_ _._;.___.._-==--'-
It is an important point to be noted here that do not assign to a zero in a cell with c 13 0 63 7 7 . 0
more than 2 assigqed zeroes in its row and column including that zero, as it leads to D 47 iS 0 20 2 0
un assignment stage. E 25 0 46 9 4 2
or
The optimal assignµlent examiners to the practical examination with minimized
F 0 53 so 26 4 20
' -
distance to be travelled is as follows. (Opportunity cost matrix)
-- --
Examiner Exam Distance
E, B 45 a b c d e f
-
Ez A 40 A· ·····O··- ···IB·-· ··4&··· ····&··- ···-0···· -··t-B····
Oum -+ 0 B 0 J.:S 2!> 5 10 Q
-
Ei
20 c I~
E4 A -+
~ 6~ 7 7 Q
Es -+ B -+ 15 D 4V I~ Q 20 2 Q
Total 120 Kms(say) E 2~ b 4~ 9 4 ~
Note : Multiple optimal solution also exists here~ F 0 st SP 26 4 20
22. Solve the assignment problem represeqted by the following matrix to minimize
the cost. . . Here, N = 5; (m x n) = 6;
d e f Since N < (m x n); assigr1m;:qt st!lg~ is not reached
a b c
Select smallest element uncovered by a -liqe i.e. K = 2 , then the resultant matrix is
A 9 22 58 II 19 27
• 78 72 50 63 48
ll b c d e f
B 43 A ·· :...F ···l;-S·:. ·--4-1··· ...-{).... ····G-··· ···l!S···r·
c 41 28 91 . 37 45 33
32
B 0 3~ 29 3 8 ~
D 74 42 27 49 39
25 18
c ~r ~ 63 5 s ~
E 36 II 57 22
D ·· ··.ft··· ·--~--- ·-·ft···. ··+8-·- ····0-··· ·--~---~-
F 3 56 53 3! 17 28
E ~S • 46 7 2 i
F ~ siJ 50 24 2 i<J
Again N < (m x n), choose K = 2
oPE:lirt6Rs~'fil:C:&.
'ii':
Ass1011M.ENT PRoBL.Ell•
Since m = n , it is a balanced assignment problem.
.,
i) Obtain reduced time matrix
a b c d e f
A ·· ···t··· ···t:1··· ---4+·· ···-O---- ----Q---- ····lfr··~- I IIIII IV - V
A I 8 I 6 0
8 @ l5 27 I 6 0
8 5 7 6 5 0
C IjJ. ~ 61 3 . ~ Q
D · ....@ .. ·--tl+.: -·-0-·-· ···I-&·· ....rj .... ····i·---~--
c 3 5 4 2 0
D .3 I 6 2 0
E ~5 ~ 44 5 Q i E 4 2 8 4 0
F ~ SJ 48 22 Q 2p
(Reduced time matrix)
Here N = 6; (m x n) = 6; Now, make optimal assignments ii) Obtain opportunity time matrix
a b c d e f I II III IV V
A 4 17 41 [Q] x 17 A 0 7 {) 4 0
8 [QJ 35 27 I 6 x[QJ 8 4 6 5 3 0
c 13 x 61 3 3 c 2 4 3 0 0
D 49 17 [QJ 18 )( 2 D 2 0 5 0 0
E 25 [QJ 44 5 )( 2 E 3 I 7 2 0
F x 53 48 22 [QJ 20 (Opportunity time
iii) Draw minimu_m number of lines to cover all zeroes
matrix)
The optimal assignment is as follows
d --> II
I II III IY Y
A -+
A · ····O···· ....7.... ···-0···· ····4-··· ···-0···4·
8 -+ a -+ 43
8 4 6 5 ~ 0
c -+ f -+ 33
D -+ c -+ 27
c 2 4 3 Q Q
E -> b -+ II
D · ····2···· .... {)....... j ........ q_... ···-*······
F -+ e -+ 17
E 3 I 7 i @
--
Total 142 Here, N = 4 (m x n) = 5
<· Note : Here, multiple optimal solution exists, as few rows I column have two or more Since N < (m x n), assignment stage is not reached, select a smallest element
unassigned zeroes. uncovered by any line i.e. K =I, then the resultant matrix is
23. Five men arc available to do five different jobs. From past records, timing in I ll Ill IV y
hours, each man takes to do the job is known and is given in the following table. A · ···-0···· ··-·1···· ···-0···· ····5···- ····+···
I II ([[ IV V B 3 j 4 3 0
A 2 9 2 7 1 C · ····t···· ···-l··· --··2-···· ····O···· ···-~·-·
B 6 8 7 6 l D 2 Q 5 I !
• c 4 6 5 3 I E 2 q 6 2 Q
D 4 2 7 3 I
I 9 5 Again N < (m x n), select minimum element i.e. K = I
E 5 3
-
Find the assignment of men to jobs that will minimize the time taken.
Sol. Here m = 5
n=S
•1·=
A
.·~,)I$2Z4JlfJZ:~~:rn~fa, , , ~!-~littp;&~:~~6)i
---~---
11 in .IY V
----$--- ----0---- ----!---- ----1----
~·-GllMl!:RT PROIS,l;.pf~ '
24. ·····.·-
A solicitor's firm would like to employ typists on hourly piece-rate basis for
their work. There are five typists and their charges and capability (typing
speed) are different. Ther-e are five jobs available with the firm and one job is to
8 2 ~ 3 i ~ be assignefl to one typist. A fypist is paid for full hours even if be/she works for a
c I 4 2 $ $ fraction of an hour. Find an optimum assignment of typists to jobs to minimize
D . I Q 4 ~ j the total cost to the firm, given the following data:
E i 0 5 l Q Typist Rate/hr, Rs. No. of pages typed/hr. Job Number of pages
A 5 ,..... 12 p 199
Again N < (m x n), select minimum element i.e. K = l B 6 14 Q 175
I ti m IY Y c
A · ···-~--- ---t--- ····G-··· ··+··· ---+-··r D
3
4
8
10
R
s
145
B I $ 2 i 6 298
E 4 II T 178
C ~ 4 I © ©
May 2017 (10 M) &July 2011 (10 M)
D q q 3 Q t Sol. In this problem,
E Q ~ 4 j Q m =number of typist= 5
' ' . n =number of jobs= 5
Since N = (m x n). Now make optimal assignments.
Since m = n; it is a balanced assignment problem.
I II III IV V
Calculate cost elements in each cell by taking into account the typists and jobs
A x 9 [[] 6 3
assigned and amount given to them after the completion of job.
8 I 5 2 2 [QJ If job P is assigned to typist A
c []] 4 I )( x Speed of typing
12 pages -> I hour
D )( )( 3 [QJ I
E x []] 4 I )( 199
199 pages-> - = l 6.5hrs"' I 7hrs
12
'
OR
Cost of typing
II III IV v
I hour -> Rs.5
A x 9 [[] 6 3
[QJ
:. 17 hours-> 17 x 5 =Rs. 85
8 I 5 2 2 If Job Q is assigned to typist A
c x ii ' l [QJ )( 12 pages -> I hour
D [[] x 3 )(
)(
l 175
:. 175 pages-> - = 14.Shrs = 15hrs
E ~ rol 4 I 12
Since few rows I columns have two or more unassigned zeroes (i.e. neither assigned I hour-> Rs. 5
(squared) nor crossed), an alternate optimal solution exists. 15 hours-> 5 x 15 =Rs. 75
The optimal assignment of men to jobs is as follows Similar procedure is used for all typists with different jobs to calculate cost and
entered in the effective cost table shown below.
Men Jobs Time
Jobs
A -> III -> 2
v -> P Q R S T
8 ->
A 85 ' 75 65 125 75
I
c -> I/IV -> 413
3/4 "'
.~ 8 90 78 66 132 78
D -> IV I I -> c..
E -> II -> 3 ~
c 75 66 57 114 69
13 hours
D 80 72 60 120 72
Total
_,. E 76 Q4 56 112 68
-·
(Effective ·cost matrix)
.rF
.· •. :.:.·•.· ··.~;:~~~~'~:~xji'.~,t1,0'.~~~'f~9R!!.·.~~CH· :A&stosli~T PR.OBLEMS -~~~~~~i~~~~~~~;E_·. :~··;_ ·:::'.>-
P Q R S T P Q R S T
A · --···!----· ----<t.... --J-- -2-- ---@-1·
A . 20 IO 0 60 IO
B · ----4---- -----!---- .... (}.... -----7---- -----1---].
B , 24 12 0 66 12
·c 12
\ c -.... (}........ (} ........;z...._-----0- ....J--1.
1,8 9 0 57
D . ----&--.......,.........&.... ----+- ----1---
D 20 12 0 60 12
E ..... :J-.... ----(} ........:J-.... ----(}-- --·-4-4·
E 20 8 0 Sq 12
(Reduced cost matrix) Here, N = 5; (m x n) = 5; an optimal assignment stage is reached. Now, make optimal
assignments.
P Q R S T P Q R S T
A 2 2 0 A 0 A l x I 2 [Q]
8 6 4 0 10 2 B 4 I @] 7 I
c 0 I 0 I 2 c x [Q] 2 x 3
D 2 4 0 4 2 D
E
[]]
3 .·"':X
I x3 I
@]
I
E 2 0 0 0 2 4
(Opportunity cost matrix) The optimal assignment of typists to different Jobs with associated cost is shown
iii) Draw minimum number of lines tQ cover all zeroes below; But multiple optimal solution also exists.
P Q ~ s T Typist Job Cost
A 2 2 q 4 q A ---+ T ---+ 75
8 6 4 0 IO i 8 ---+. R ---+ 66
c -----0-'-- ----!---- ----0---- -----!---- ----2----r-· c ---+ Q/S ---+ 66/114
D 2 4 0 4 2 D ---+ p ---+ 80
E · ----2---- ---~--- ----$---- ----&--- ----~---"-· E ---+ S/Q ---+ 112/64
Total1 Rs.399
Here, N = 4; (m x n) = 5; no optimal assignment stage is not reached.
Select smallest element K = 2 not covered by a line, then
~ Q ~ S T
A ..... ~ ... --.. 0---· .. --~-·- ....t,---- ....0---·
8 4 2 Q 8 2
C Q I l I 4
D 0 i 0 2 2
E - .... 4.......-0..-- ....l .......{) ........4 ..·-1··
Here, N = 4; (m x n) = 5; select smallest element K =I, then
~·
-''.'~ ·.: . ~:-~'~:~~;t;~;:;:~"LJ~Tiq~~~~-.- ···~~~~~:!¥~ .•... >=1i-1fltfti~'J\:;-5.:~ .
4-···:5· ··s"'p' 'A..:c·'ERE. s' TRICTIO"N···\pllo'"~'·a"'&.~'""""Mil~t.:f.;;i;',g!~£.:~ch;f. ,:,• ..
·~··: '::. - .. . . .. ':. ·:·-:·: ... __ .: .. _,~~-:7).'!:.;-~ ·-<·~l?~~~~-~~:·:~~~s-~---: . __ .
.
_,_ .., ii) Draw minimum number of lines to cover all zeroes
.··c9
.>'.9c-
In certain problems, it may not be possible to assign a particular task to a particutar facility A B C D E
;,;.i
due to some reason or restriction. in such cases, the cost element for such combination is M 1 ····0-··· ····2···· ----6-··· ···+·· --2·-··
considered a very big cost say oo. When· oo becomes the cost, it will auto~afically get M2 ....3.... ····0-·-- ···<lE>··· ····l--·· ···-0-·····
excluded in the process of assignment. _
M 1 ----oo--- ... 4 ... ... ::,.... ...4 ... --·-0-·--··
25. Four new machines M 1, M 2, M 3 and:M4 are to be installed in a machine shop.
M4 ....":J.... .... f. .......§ ........().... --··l·-···
There are five vacant places A, B, C, D and E. Because oflimited place, machine
M2 cannot be placed at C and M3 cannot be placed at A. Cii' the assignment cost D ----0---· ·--·0-··· ----0··-- ···-0---· ···-0----··
of machine i to place j in dollars is shown below. Here, N = S; (m x n) = 5, an optimal assignment stage is reached. Now, make optimal
assignments.
A B C D E
4 6 10 5 6 A B C D E
M,
M, [QJ 2 6 I
Mi 7 4 - 5 4 2
Mi 3 [Q] I )(
Mi - 6 9 6 2
(fJ
9 3 7 2 3 M, 00 4 7 4 [Q]
M4
Find the optimum assignment s-chedule. M4 7 I s !]] I
Sol. In the given matrix

Jan 2016 (08 M), July 2016(08 M) & April 2018 (10 M) D x x [[] )( )(
The optimal assignment of machines to vacant places with minimal cost is as follows.
m=4
Machines Vacant place Cost
n=S
Since m f:- n, it is an unbalanced assignment problem. Add dummy row with zero M1 -+ A -+ 4
cost element in each cell. Due to space restrictions, machines M2 and M1 cannot be M1 -+ B -+ 4
assigned to place C and A respectively. Therefore, assign oo as very high assignment M1 -+ E -+ 2
cost in those cells M4 -+ D -+ 2
A B c D E D(Dummy) -+ c -+ 0
M, 4 6 10 s 6 --
Total 12 dollars
M: 7 4 (fJ s 4 26. In the modification of a plant layout of a factory, four new machines M , M , M
1 2 3
M1 6(fJ 6 9 2 and M4 are to be installed in a machine shop. There are five vacant places A, B,
9. 3 M4 7 2 3 C, D and E available. Because of limited space, machine ~ cannot be placed
0 0 D 0 0 0 at C and ~cannot be placed at A. The cost of locating a machine at a place (in
(Effective cost matrix) hundred rupees) is as follows.
i) Obtain reduced cost matrix · Location
A B c D E A l3 C D E
M, 0 2 6 I 2 ~ M, 9 . 11 IS 10 II
Mi 3 0 (fJ I 0 ~ M, 12 .9 - JO 9
<I
"' -
M1 00 4 7 4 0 ::;; M1 - II 14 II 7
M4 7 I s 0 I M4 14 8 12 7 8
D 0 0 0 0 Sol. In the given problem,
0
.n=4
(Reduced cost I Opportunity cost matrix)
m=5
Since n f:- m; it is ~n unbalanced assignment problem. Add a dummy machine M
..,, .F,-·:.~t:··t/:}3~~~2iw.;,9~~6.l!i!ltcij,-
(i.e. row M) with zero cost in each cell. Due to space restrictions, the machines M2
r
As~1bx~-~~;fa~~-(~ : , >·
Machines Locations
.
:.Jt;·:~.:~.~:~f§. ·
Cost
:_ .,_., -·4"
and ~ cannot be placed at places C & A respectively and hence assign oo to those M, -+ A -+ 9xlOO
two cells. The resultant effective cost matrix is shown below. M, -+ B -+ 9xIOO
Location Ml -+ E -+ 7xIOO
A B C D E M4 -+ D -+ 7xJOO
u
MI 9. II 15 10 II M(Durilmy) -+ c -+
.5 M2 12 9 00 IO 9 Total Rs. 3200
..c:
0
II 14 11 7
~ Ml
00 27. An airline company has drawn up a new flight schedule involving five Oights.
M4 14 8 12 7 8 To assist in allocating five pilots to the flights, it has asked them to state their
M 0 0 0 0 0 preference scores by giving each flight a number out of 10. The higher the
(Effective cost matrix) number, the greater is the preference. Certain of these flights are unsuitable
i) Obtain reduced cost matrix I opportunity cost matrix to some pilots owing to domestic reasons. These have been marked with a 'X'.
A B C D E What should be the allocation in order to meet as many preferences as possible?
2 6 I 2 Flight number
M, 0
I 0 2 3 4 5
M1 3 0 00
Ml 00 4 7 4 0
8 2 x 5 4
M4 7 I 5 0 I £ 2 10 9 2 8 4
M 0 0 0 0 0
c: 3 5 4 9 6 x
(Reduced I opportunity cost matrix) 4 3 6 2 8 7
ii) Draw minimum number of lines to cover all zeroes 5 5 6 10 4 3
A B C 11 B Sol. Here, m = n = 5; it is a balanced assignment problem.
M1 Q 2 6 ·j i The objective of the pilots·is to assign higher preference marks for the fight of their
choice. Hence, it is a maximization problem.
M, - ----l-· ···-0··· ···00-·· ····1···· ...{l---1-·
M~, a1. 4 1 r. -·o. To convert this problem into minimization type, choose highest element i.e. I0 in the
matrix and subtract atl elements to get effective cost matrix.
M4 7: I 5 ¢ I I 2 3 4 5
M . -··-0.··· ···-0-·· ···-0··· ··-Q-·-- ...(J. .. ,.. 2 8 00 5 6
Since_N = (mxn), an optimal assignment stage is reached. Now, make optimal 2 0 I 8 2 6
assignments. 3 5 6 I 4 00
A B C D E 4 7 4 8 2 3
M, [QJ 2 6 l 2 5 5 4 0 6 7
M1 3 []] 00 I )( (Effective cost matrix)
Ml 00
7
4
l
7 4 []]
5 [[] I
I 2 3 4 5
..
M4
M )( )( ill] )( x I 0 6 00 3 4
The optimal assignment of machines to different locations with associated cost is as 2 0 I 8 2 6
follows. 3 4 5 0 3 00
4 5 2 6 0 I
5 5 4 0 6 7
..
. ··.
ii) Obtain an opportunity cost matrix

I 2 3
,c;~~;i~~i'.~l-RP'~~·
4 5
~~lfniii~i f: ,,;~f:t~t~~~fi0;;git~~f£"'i~F;~;:
Pilot
-+
Flight No
I -+
§
Preference score
8
X:i;:~'f~!i-
I· 0 5 00 3' 3
2 -+ 2 -+ 9
' 2 0 0 8 2 5
3 -+ 4 -+ 6
3 .4 4 0 3 00
4 -+ s -+ 7
4 5 I 6 0 0
5 -+ 3 -+ 10
5 5 3 0 6 6
Total 40
I 2 3 4 5 4~7 'l]t,: SOLi.Jl'iON TO~SSIGNiVU:NTPROBLEM is INHERENTLY
9 5 ~ 3 3 DEGENERATE . .· .
2 +···$-··· ···-()···· ···t··· ····z-··· ···-j···-r··
Since an assignment problem is a special case of transportation problem. Every basic
3 ~ 4 <) 3 oo I
: ·1--·l. . l. .~. . .,. .l.l--:···r!. . . . . feasible solution of a general assignment problem having a square matrix (payoff matrix)
of order n should have (m+n-1) = (n + n - I) = (2n - l) assignments, but due to special
structure of the assignment problem, no solution has more than 'n' assignments. Thus, the
assignment problem is inherently degenerate.
Here, N = 4; (m x n) = 5; hence an optimal assignment stage not yet reached.
Select a smallest element i.e. K = 3 not covered by a line. 4.8 . TRAVELLING SALESMAN PR08i.EM
l 4 ~ 4 5
The travelling salesman problem is an assignment problem with two additional
· ····O···· ····i···· ·--~-: ..... Q.... ---{}·-· 4
••
conditions on the choice of assignment.
2 3 @ Iii 2 5
In this problem, there are number of cities and the distance I time/ cost between each
3 4 ! ~ Q 00
pair of cities is known: A travelling salesman travel starting from his home city, visiting
4 ....g.... ·····!···· ···-?···· ···-~·-· ···{}···4·· each city only once and returning to his home city, so that the total distance (time/ cost)
5 5 Q Q ~ 3 covered minimum.
'' '' .
'
If the distance I time/ cost between each pair of cities is independent of the direction of
Here, N = 4; (m x n) = 5; an optimal assignment stage is reached. Now, make optimal
travel, the problem is said to be symmetrical. If for one or more pairs of cities the distance
assignments. I time/ cost varies with the direction, the problem is called asymmetrical
Flight number
Example:
2 3 4 5
I. It takes more time to go up a hill between two stations than come down the hill
[QJ 2 00 x )( between them.
2 3 [[] ll 2 5 2. A flight may take more time against the wind direction compared to t11at in the
Pilot
3 4 I x {Q] 00 direction 0f wind.
This type of problems arises in the areas of postal deliveries, Inspection and School
4 8 I 9 )( {Q]
bus routing etc.
s 5 )( IOl 3 3
The optimal assignment of pilots to different flights with preference marks is as 4.9 FORMULATION OF TRAVELLING SALESMAN PROBLEM AS LPP
follows. Given 'n' cities and distance dij (cost cii or time t;) from city i to city j, then there are
(n-1 )! possib:!e ways of his journey
\ = I, if salesman goes directly from city i to city j.
= 0, otherwise
... Since each city can be visited only once, we have
n-1
QP.~Tloiii~'~i(itq~ As_SIGDIENT·-PR08L£li.s)g::,>;A'.t~t~\'.c) >>:k . ~•:
A B C D E -
...
L: xij = I, j = I, 2, ....... n; it j A 00 2 6 12 0
i=l
Again, since the salesman has to leave $Ch city except city n, we have 8 8 00 0 6 0
n c 8 6 00 0 6
L:
xii = I, i = I, 2, ....... n-1; i t j D 16 0 2 00 2
j=l E 0 4 0 14 co
The objective function is then (Opportunity cost matrix)
n-1 n iii) Draw minimum number oflines to cover all zeroes
L: L:dIJ.. x IJ A 8 C D E
i=I j=I
A · ··-oo·· ··.Z··· ···6-··· ·+&·· ···-O··r
Here, we do not require dJI = dJI , therefore, dIJ = oo for i =j
B · ···8··· .. ,,,_.. ···&·· ···6-··· ···-0·+·
28. A travelling salesman has to visit S cities. He wishes to start from a particular
C · ···8··· ··-6·· ··"«>··· ···&... ···6-··-L
city, visit each city once and return to his starting point. Find the least cost
route. D · ··t6-· ·--0 .. ···'2··· --~··· ····2-·--·--
A B C D E I; .: ... (). ....4 ......Q. .. ---14·· ···f.G····--
A 00 4 10 14 2 S ince N = (mxn); an optimal assignment stage is reached. Now, make optimal
8 J2 00 6 JO 4 assignments.
c 16 J4 00 8 14 A 8 C D E
D 24 8 12 00 JO A 00 2 6 12 [[j
E 2 6 4 16 co B
c
8 00 I]] 6 x
Jan 2014 (10 M) 8 6 00 [Q] 6
Data: D 16 roJ 2 C() 2
A 8 C D E E []] 4 )( 14 co
A 00 4 10 14 2 Although, it is an optimal solution to an assignment problem, it is not optimal for
8 12 00 6 lO 4 travelling salesman problem.
c 16 14 00 8 14 Now, make an assignment to a next non zero element i.e. 2 in the matrix and treat it
as zero to complete all assignments.
D 24 8 12 co JO
Case 1 : Make an assignment to cell (A,B)
E 2 6 4 16 co
A t;J C D E
A· ··©-- ·ill· ···6-·· ··E-- ···-0---·
Sol. i) Obtain reduced cost matrix
A B C D E 8 8 cP []] 6 )(
c 8 ~ co [Q] 6
A
B
00
8
2
00
8
2
12
6
0
0
. D 16 9 ).( co m
c 8 6 00 0 6 E [ill 4 ;6:_ 14 00
D 16 0 4 co 2 A~B~C~D~E--2......;A=30
E 0 4 2 14 C1J
Case 2 : Make an assignment to cell (D,C)
:~f
!Pt, . :c:<~ ::~'~:'~l:f~lli~~:f~t.. ··.··9~4~Jl·;~~~f . ~~.IJ~T hP~i#~oo·,·· X'~{~~l8f~~·-~~¥~t~ft:?("< •: : / :.1
A B C D E Sol. i) Obtain reduced cost matrix

······' ..
A 00 ~ ~ 12 )( A B C D E
B· 8 <1J 0 6 ill] A <1J 1 4 6 0
c 8 6 qi []] 6 B 4 <1J I 6 0
D ··Hi·· ··-0··· ~m- ···OO-·· ·:·:2···· c 4 3 <1J 0 3
E [Q] 4· q 14 00 D 8 0 2 00 I
E 0 2 I 7 0()
A~B~E-4A&C-4D~C
Infeasible solution ii) Obtain opportunity cost matrix
Case 3: Make an assignment to cell (D, E) A.. B C- D E
I;.
A
A
<1J llJ
B C
6
D
12 Q
- A
8
<1J
4 <1J
I 3
0
6
6
0
0
8 8 <1J [[] 6 0 c 4
3 00 0 3
c 8 6 <1J [fil ~ D8 0 I 00 I
D ··-Hi-- --~·-· ....2... ••• QG. ••
-ITT- E 0 2 0 7 00
E [[] 4 )( 14 ~ {Opportunity cost matrix)
A~B~C-4D~E-4A=30
A B C D E
It is an optimal solution. J;he least cost associated with optimal route is Rs. 30. A oo I j 6 0
29. A travelling salesman hast~ v!~it five cities. lie wishes to start from a particular B 400€) 6 0
city, visit each city once a!}d th~n re~ur11 ~~his starting point. The travelling cost
(in '000 Rs) of each cify from a Pl!rfi~ul11r city is given below:
c .. .. .( ..:~.j.:. ···¥· ···<t··· ··+···.····
To city
D ·· -~-s-:. :.tF --~y- :..cxr·· ···t··+··
E ·· .. .().:: ---~i~: ::.--0... ···1···· --~-l-·
A B C
........
D E .' '
'
A 00 'T·· ··5 7 I Since N = (m xn) = 5, an optimal assignment stage is reached. Now, make optimal
assignments.
B ~ 3 8 2
·o.0
<1J
E c 8 .7 <1J 4 7 A B C D E
8 12 4 A 00 I 3 6 (]]
~
D 6 00 5
E I8 00 3 2 B 4 00 []] 6 )(
What should be t~e ~cqµe!l~e Qfvi,si~!!fthe !!;!lesman so that the cost is minimum? c 4 3 00 f]] 3
Data: · D 8 !]] I 00 I
To city E J]] 2 )( 7 0()
A B C D E
•
Although, an optimal solution is reached for an assignment, it is not an optimal
A 00 i 5 7 I solution for travelling salesman problem. Asalesman visits E from A and then come .
.0 fl 6 00 3 8 2 back to A. Thus, violates the additional constraint that salesman not to visit a city
"(j twice before completing his visit to all cities.
E c 8 7 <1J 4 7
8 Now make an assignment to riext least non zero element i.e. I and treat it also as zero
~
D 12 46 00 5
...J Case I : Make assignment to cell {A, B) and strike out corresponding row and
E . l 2 8 00 column.
-
if • , ·:.:-
A
·s
r~~~;~~,,JS;:@B~~ri9ir$ RE8£ARCH
A
··<lO··
4
B C D
···l·· ....()... .:.G····
·ITT
~ [QJ 6 )(
E
Ass!~T PROBLEMS
2
00
16
-.:.
2
16
00
3
4
6
.~~:·:~~ft2:~~if~~~i1,;::···
4
12
5
5
00
8
.. ""',·.-
c 4 j 00 IOI 3 3 4 6 00 00 6
D· s· () x 00. ITJ 4 12 5 00 00 20
E ffil . i x 7 00 5 00 8 6 20 00
A~B~C~D~E--2--tA= 15 ii) Obtain reduced cost matrix
2 3 4 5
Case 2 : Make assignment to cell (D.C)
B q
00 12 0 8 00
.A- D E
[I] ) 6 )( 2 II 00 I 0 3
A 00
q 6 [QJ 3 0 2 00 00 2
B 4 00
,., 4 7 0 00 00 15
c 4 3 oiJ [[) .)
5 2 0 14 00
D··· . ···8··· ··-0··· ·ill· ···oo··· ···+··· 00

E [QJ 2 d 7 00
iii) Obtain an opportunity cost matrix
1 2 3 4 5
A--+B--+E--+A and C ->D--+C
Infeasible solution i.e. not optimal 00 12 0 8 00
Case 3 : Make assignm~nt to cell (D,E) 2 11 00 1 0 I

A B C D E 3 0 2 00. 00 0
A 00 [] ~ 6 9 4 7 0 00 00 13
B 4 00 [fil 6 Q 5 00 2
0 14 00
c 4 3 00 llil ~ (Opportunity cost matrix)
D· . ···-8··· ... q ... ····!···· ··-W··· . m.. iv) Draw minimum number of lines to cover all zeroes of an opportunity cost
E NJ 2 x 7 <t.i matrix
2 3 4 5
A--2...+B~C~D~E~A=IS 1 00 12 d 8 I oo
It is an optimal solution The least cost is Rs. 15 2 II ai> n ~
Products 1, 2, 3, 4 and 5 are to be processed on a machine. The set-up costs in 3 .. ... .(). .. .4.. ···~··· ···~·· .()......•..
30.
rupees per change depend upon the product presently on the machine and the 4 7 Q ~ ~ 13
set-up to be made and are given by the following data; cl2 = 16, c,3 = 4, c.4 = 12, 5 00 j d I~ co
c2.l = 6, c24 = 5, c25 = 8, CJS = 6, c45 = 20, c,j= cji and c,r= 00 for i = j and for all
values of i and j not given. Find the optimum sequence of products in order to As N< (mxn); an optimal assignment stage is not yet reached. Select a smallest
minimize the total set-up cost. Jan 2008 (10 ~ positive element i.e. K= I not covered by a line, then
Sol. i) Construct an effective cost matrix using given data. I 4 ~ 4 5
00 12 0 8 co
2 . ··1"0·· .. ...$ .. ··+·· ...().......()...-..
3 · ··i)··· ···l· ··~·· ··w··· ···(}··-·
4 6 Q ~ co 12
5 00 ~ 0 14 co
J;•
·3~
~}·•{.:, _r'-· .- ':·,>~J~~~~~]~Titilis'.~cil ·~~'t'Pao•~P,r$ ~i~if.t{~~~if~;~~l~t~1~-~F- ·;. ~,._:~--~._:

·Again, select K= 6, then the resultant matrix is H the processes each type of item once and ~nly once each week, how should he
I 2 ~ 4 5 sequence the items on his machine in order to minimize the total setup cost.
· I oo 12 ~ 2 oo Feb 2006 (lOM)
2 . --1-0-- --«>-- --·¥··· ··-0-·· -0·----· &ta: '
3 . . ··-0··· ···9-·· ··¥· "·~·· -0---·
To item
4 . ··-0··· ···0-·· ··¢--· ··©·· -6·····-·
A B C 0 E
A 00 4 7 3 4
5 002 9 8 00 E
.~ B 4 00 6 3 4
E
Again, select K=2 as N< (mxn); then
4 5
e c
u...
7 6 00 7 5
l 2 3 D - - J___ 3 7 00 7
~ p 0 c:i>
~o E 4 4 5 7 00
2 IP ~ ?· q q (Effective cost matrix)
3 Q 9 ~ ~ q Sol. i) Obtain reduced cost matrix
4 Q 0 q:, a? ~ A B C D E
5 ~ 0 0 d ii A 00 I 4 0 I
B I 00 3 0 I
Since N= (mxn). an optimal assignment stage is reached. Now, make optimal
assignments.
c 2 2 I 0 00
2 3 4 5 D 0 4 00 0 4
00 []] )( 00
10 E 0 0 I 3 00
2 10 00 9 [Q] )( (Reduced cost matrix)

ii) Obtain opportunity cost matrix ·
3 )( 9 00 00 [QJ
A B C D E
4 [Q] x
00 00 6
A 00 I 3 0 I
5 00 [Q] )( 6 00
B I 00 2 0 I
Note: Multiple optimal solutions also exist c 2 I 00 2 0
The optimal solution to the assignment problem itself is an optimal solution to the set
D 0 3 00 0 4
up problem. The least cost path I sequence is
1~3~5~2~4~1 and corresponding cost is Rs. 35 E 0 0 0 3 00
Opportunity-cost matrix)
31. A machine operator processes five types of items on his machine each week iii) Draw minimum number of lines to cover all zeroes
and must choose a sequence for them. The setup cost per change depends on A B C p E
the item presently on the machine and the setup to be made according to the
following table:
A oo 1 3 9
• To item
B I oo 2 0
A B C D E c --·2-- ···l·· --00-·· ···2--· ···0--·--
D -·-0--· :--0-·· ···3--· ···~-- --·4···-·
4 7 3 4
E A
00
E ---O-- ···O--- ··-{le--··+-- --wT
-~ B 4 00 6 3 4
E c 7 6 00 7 5
2 As N< (mxn); the assignment stage is not yet been reached. Select a smallest element
u... D 3 3 7 00 7 not covered by line i.e. K= I, then the resultant matrix obtained is
E 4 4 . 5 7 00
.... A B C
.-:;X. ::·./.~~~n<!~~~&\Rca
D
A . --~-- ··-0··· ....:;i... ···-0··· ···<f--~-
E
•1;~!-
A8s101'.tEi.t PifoBtiils .·
32. A company has a salesman who should visit 6 cities and the cost would be as
given below.
>··
a . ··-O··· ·--~-- ··+·· ···<+··· ···<t---~-- To city

c 2 I oo 3 Q 2 3 4 5 6
D · .-·-0-·· '··-0··· ····3··· ··-oo-·· ···4···~- 00 20 23 27 29 34
E . ··{)··· ··f)··· ···{)··· ···4-··· ··-oji·--r· .£
0
2 21 00 19 26 31 24
E 3 26 28' 00 IS 36 26
0
Since N .= (mxn); an optimal assignment stage is reached. Now, make optimal Li:: 25 16 25
4 . 00 23 18
assignments.
5 23 40 23 31 00 10
A B D c
[]] 6 27 18 12 35 16 00
A 2
B I x The salesman can visit each of the cities once and only once. Determine the
optimum sequence to minimize the total distance travelled. What is the total
c 00 3 - distance travelled? Jan 2007 (08M)
D 3 00 4 Data:
E [QJ 4 00 To city
Note : Multiple optimal solution also exists 2 3 4 5 6
It is not an optimal solution for the given problem. Choose a smallest positive 00 20 23 27 29 34
element i.e. I and treat it as equivalent to zero and make assignments 0 2 21 00 19 26 31 24
·;:;
Case 1: Make assignment in the cell (B,C) 26
E 3 28 00 15 36 26
A B C D E e 4 25 16 25 _?"_, rs
A 00 x ···-0··· ··-0···
-~ [[] )(
u..
5 23 40 23 31
00
IO
B ···0-·· --r.n
··«:)-··
27 18 12
00
c 2 x <ii 3 [[] 6
(Effective distance matrix)
35 16 00
D )( []] ~ 00 4 Sol. i) Obtain reduced distance matrix

E [Q] x ~ 4 00
I 2 3 4 5 6
00 0 3 7 9 14
A-4D-4B-4C~E~A=21
2 2 00 0 7 12 5
Feasible solption
3 II 13 CXJ Oiii 21 II
Case 2 : Make assignment in the cell (C,B)
A B C D E 4 9 0 9 00 7 2
A 00 ~ 2 )( [QJ 5 13 30 13 21 OCJ 0
B )( cii x [QJ )( 6 15 6
(Reduced distance matrix)
0 23 4 00
c ...2 ... l.Il.I. •••CIJ••• ... 3. ... ....0...

D [Q] ~ 3 00 4
E )( $ [QJ 4 00
A~E~C-4B-4D-4A=21
Feasible i.e. optimal solution
Least cost= Rs. 21
-} l
-
(l()
2
·o
3
3
4
7
5
5
~iiiill~~!l
6
14
Ase,,9-. .E1'!i~iilj~it~~t~~~hi~;~~:t~ .,~w:•••
00
2
[[J )(
3 4
7
5
2
6
12
2 0 00 0 7 8 5 2 lfil lo 00 )( 10 8 6
3 9 13 00 0 17 ti 3 6 13 00 [Q] 14 9
4 7· 0 9 00
21
3 2
0
4 4 x 6 00 [fil )(
5 II 30 13 00 5 IO 32 12 23 00 [Q"]
13 6 0
6 0 00
23 6 13 9 [Q"] 26 'ft( 00
(Opportunity distance matrix) Although, it is an optimal solution to an assignment problem, it is not optimal solution
iii) Drl!w minimum number of lines to cover all zeroes to a salesman problem. Now make assignment to next non zero least element i.e. 2.
I 2 3 4 5 6 Case 1 : Make assignment to cell (i, SJ
00 ~ 3 7 5 14 I 2 3 4 5 6
2 ···0-·· ··¥· ···0-··· ···l··· ---3··· ····S·-· 4
• . ·-00-· ---0··· ---0--- ----1-··· H-l- ·-1-2--
3 9 l~ oo 0 17 11 2 [QJ. 00 )( 10 8 6
4 7 ~ 9 ct> 3 2 3 6 13 f[]
5 --H·· ..j).. --H·· ---ill··· ---oo--- -··-0··· 4
•
4 4 [Q] 6
00
00
*Q x 9
6 ··H· ---~·-· ···O-··· ···$··· ···f}··· ···w·· 4

•
5 IO 32 12 23 q:i @]
. '
As N <(mxn); assignment stage is not yet reached. Select smallest element i.e. K=2
6 13 9 fOJ 26 @ 00
uncovered by any line. 1~5~6-!l....+3-144~2~1=103

4 3 4 5 ~ Total distance travelled is 103 kms.
I (l() q I i 3 I~ 33. Solve the following Travelling Salesman problem given by the following data;
2 . ···0-·· --~-- --~0--·· ···9-··· ·--3'·· ····$-···. c,2 = 20, ell= 4, e,4=10, ell= S;·C34 = 6, els= 10, CJS = 6, e4S = 20 when eij =
3 7 l!3 00 0 IS ·~ C..11 and C..11 value is not given, then tbete is no route between cities i and j.
4' s q 7 ~ I ~ Jan 2010 (10 M), l>ec 2011 (10 M)and July 2015 (10 M)
II 3~ 13 2~ 00 $ Sol. i) Construct effective cost matrix using given data
5
6 ---U- --~--- ... (). .. --2}·· ----0··· ···tti··· To city
2 3 4 5
Again, select K = 1, then the resultant matrix is 20 4 10
I 2
. 4 5- 6- .0
00 00
'o 2 20 5 10
I -
n
'
.., 1,, I D
E
e 3 4
00
5
00
6 6
2 . n
"'-
'IV- In
,.
. I ti..
4 10 00 6
00
00 20
3 .
~
·~
·~
n
v
I
5 00 10. 6 20 00
4 4 0. 00 0 I
5 10 32 12 23 IX) ~
6 13 9 l 26 0 OD
Since N = (mxn); an optimal assignment stage is reached. Now, make optimal

assignments.
...
ii) Obtain reduced cost matrix
2 3 4 5
OPERATIONS RES~~
;'jf."j
,r·
l; .
As!i~Ci!QilENT PRoBLJ!:l!!s ., .. ::I; }~t~~~~~.·\11'~'.-
~
2
ii
3
Q
4
Q
5
ii
·-ta
·.1 00 16 0 6 00 \l"c 2 1!2 ~ l ~ 0
2 IS 00 0 00 s 3 ~ q ~ q p
3. ff I 00 2- 2 4 q ~ Q ~ ~
4 4 00 0 00 14 s ~ d { 9. cp
s 00 4 0 14 00
(Reduced cost matrix) Since N= (mxn); an optimal assignment stage is reached. Now, make optimal
assignments.
iii) Obtain opportunity cost matrix
I 2 3 4 S
2 3 4 s
I 00 IS 0 4 00
00 II [[] )( 00
2 12 00 I 00 [[]
2 IS 0 3
x
00
x
00
3 ;:( 00 [[]
3 0 0 00 0 0
4 4 00 0 00 l2
4 Lru 00 )( 00 8
00 s 3 0 12 00
s 00 [QJ I 9 00
(Opportunity cost matrix) An optimal solution (multiple optimal solutions also) exist, but it is not optimal for
iv) Draw minimum number of lines to cover all zeroes salesman problem. To find optimal solution to this salesman problem, choose next
I 2 3 4 S non-zero least element i.e. I to make assig'nment & treat I as zero.
Case 1: Make assignment to a cell (2,3)
00 IS ~ 4 00
I 2 ~ 4 S
2 IS 00 $ 00 3
I oo II ~ ([] oo
3 ---0··- ,--0--- -~-- ----0-·· --·&·--·
4 4 00 0 00 12
2 --n-- --oo-- -ITT ---~-- ---0----r--
3 )()( cb )([[]
s 00 3 ~ 12 00
! 4 oo I 8
As N < (mxn); an assignment stage is not yet reached. Select smallest element in the 5 9 00
matrix not covered by any line i.e. K= 3.
I 2 3 4 5 1-+4-+I and 2-+ 3---+ 5 -+2
Infeasible solution.
oo 12 Q I oo
Case 2: Make assignment-to a cell (5,3)
2 -· --};J-- ···OO·· ---ci--- ·--OO--· ··-<f··r·
3 -· --~0--- ---o-:. ---el>-- ·-·0-·-- ---{}---~---
1 2 ~ s
4 I oo Q oo 9
I I I 11
00 00
2
s - -·<Yi}·-- ---o--- ··-Q--- ---9--·- ---oo···r···
3
•
-1--~-l--=--!.$!---=---1--!......
As N < (mxn); select K=l, then the resultant matrix is
;
1-+4-+ I and 2 ---+ 5 ---+ 3-+ 2
Infeasible solution.
Select next non zero least element i.e. 8 for assignment. Now, both I and 8 equivalent
to zero.
\~:::
. .'· ,·-::·.7~2'.:"i:)~J:> -~f~-~~irA~~~~:'~&~~~?ii·r~~ A8&ioifliiEilf Pif8~~~i':

2 4 ? A B C D E
-
I oo Jl [QJ 1 c*1 A 00 3 .o 4 0
2 12 B i 00 I 0 I
3 [Q] c 0 2 00 3 I
4 :. ···0-·· :·~- ···0-·· ··-00'·· ·t D 3 0 2 00 3
5 OCi [[] x 9 c*1 E
0 2 I 4 00
(Opportunity distance matrix)

1~'4~5~2~3~1:::49 iii) Draw minimum number of lilies to cover a.II zeroes
It is an optimal solution with least cost of Rs. 49. Ji B C D E
34. A salesman has to visit five cities A, B, C, D & E. The distance (in hundred km) A · -·~:· ···3:·; ··'0-·;·: ..:;4.... ···-0···+·
between the five cities are as follows: B -· ... i.. ··<JO·· ....1.... ....g.... ····I····+·
To c qzoo 3 I
A B C D E D · ..._~-- ···Q-·· ... ~·-·· ···oo··· ····3-···+·
A - 7 6 8 4 E Q2 I 4 oo
E B 7 - 8 5 6
£ c 6 8 - 9 7 As N < (mxn); an assignment stage is not yet reached. Select smallest element i.e.
K= I not covered by any line.
D 8 5 9 - 8
A B C D E
E 4 6 7 8 - A · ··oo-· ···3··· ··{)··· ····4··· ···0···+·
If the salesman starts from city A ancl_has to come back to city A, which route
B · ··-3-·· ··®·· ···l···· ···-0··· ···l···+·
should he select so that the total distance travelled id minimum?Aug 2005 (14M)
Data: C · ··-0··· ···l··· ··©·· ····2··· ···O···+·
To D · ··4·:· ··:il··· ····2:··· ···'*>-·· ···3···-·
A B C D E E · -~-6-·· ···f;:· ···-6··· ····3··· ··-rxr·-·
A OCi 7 6 8 4 Since N = (mxn); an optimal stage is reached. Now, make optimal assignments.
E B 7 00 8 5 6 A B C D E
0
~ c 6 8 00 9 7 A 00 3 '(Q] 4 x
D 9 8 00 8 5 B 3 00 I [[] I
E 4 6 7 8 00 c )( I 00 2 fOl
(Effective distance matrix) D 4 .[[] 2 00 3
Sol. i) Obtain reduced distance matrix E [Q] I )( 3 00
A B C D E Though, it is an optimal solution to an assignment problem, not an optimal solution
A 00 3 2 4 0 to a salesma11 problem. 0
2 OCi
B 3 0 I Now make an assignment to next non zero element i.e. I and treat it as equivalent
to zero.
c 0 2 00 3 I
Case 1 : Make an assignment to a cell (B,q
D 3 0 4 00 3
E 0 2 3 4 00
(Reduced -distance matrix)

0
Ei'< ·. < _,, '" ,J~,,~,J:!r~:J.ig11_~~~c11
~~tci~~-PaO~~- ,;~: •,~1·,g11r~~~ai~!ji~Zrn:. .-.·, .:·'?··;·~+111
A B C D E
A 00 3 I Q 4 l[Q] A B C @ E
A 00 3 CID 4 x
8 3 00 x @ IIJ
~ Irill I~ I I I I· I
3 I oo
c
D
. --·-0--· ---+--- ---oo---
4 CID ~ r.fi
-m- --·O-··
3
Infeasible solution E [[] x x j 00
Case 2 : Make an assignment to a cell (B.E) Feasible solution

A 8 C D E A-4C~D~B~E~A=30
A 00 3 [QJ 4 ¢ Case 2 : Make an assignment to cell (D,C)
8 ....3... ···oo·· ···t··· ···G-··· ·ill··
A B C' D E
c )( x 00 2 ~ A 00 3 0 4 [Q]
4 [[] 2
D
x
00 3 8 3 00 ~ [Q] x)(
E [QJ )( 3 <ti c [[] x x ~
Infeasible solution D ... 4 ... ·m·
--·{)--· ---co--· ...3... '
Case 3 : Make an assignment to a cell {C, B)
A B C D E
E x III 0 3 00
A 00 ~ x 4 [fil Feasible solution

A~E~B~D~C~A=30
8 3 oi> x []] :x The optimal distance travelled by a salesman is 30x 100 =30000 kms.
c . ···0-··· ·W ··-€1()··- ····£···· ···-0···
35. Solve the following Travelling Salesman problem given by the following data;
D 4 rj 2 00 3
cl2 = 20, c.3 = 4, cl4 = 20, c23 = 5, c24 = 6, c25 = 10, CJS = 6, c,s = 20 and
E [QJ ~ x 3 00
Cii =C1; and there is no route between cities i and j ifa value ofC; is not given.
1
July 2008 (10 M)
Infeasible solution Sol. i) Construct effective cost matrix using the data.
Case 4 : Make an assignment to a cell (E, B)
To city
A B C D E
A Cx:l. ._ 1 x 4 [[] 2 3 4 5
B 3 <ti x []] x 0
·;:; 2
00
20
20
5
00
4
10
20
6
00
c []] i 00 2 )( E
8 3 4 5 00 00 6
D 4 () 2 00 3 u.
4 20 6 00 00 20
E . ···G-·· ·UJ ···G-··· ···.-3···· ···oc:r
5 00 IO 6 20 00
Infeasible solution (Effective cost matrix)
As feasible solution not yet been reached, make an assignment to next non zero ii) Obtain reduced cost matrix
element i.e. 2 and treat it as equivalent to zero like 1.
Case I : Make an assignment to a cell (C, D)
-··
-~;
wt:.
-· . .,,_ · z~~~~/:-.ft~~~1:~~~;::\~~~9'~ ~~~-. ~~T~O~L~' --~~~(Yt~~~~~~i~~~ . ;=i~~
-.-~-'
2 3 4 5 4 3. 4 5
00 ~6 0 16 cc ~ H cc
2· 15 00 0 I 5 2
3 0 I cc
' ..
cc 2 3
4 . 14 ·o cc cc 14 4 00
5 00 4 0 i4 cc 5 00 9 cc
(Reduce~ cost matrix)
Again, take K=9, then
iii) Obtain opportunity cost matrix
2 3 4 5
I 2 3 4 5
0 15 cc
.. ---oo-- --t2-- --·-O--· .... z.... --o::r·:+ ..
1 00 . 16
2 -- --H-- --w-- ---1-:t-- --'-0·-- ---0---+ ..
2 15 00 0 0 3
3 ..... ()... --l~-- ·--!&-- ··-~-- ---0---+·
3 0 I cc cc 0
4 .....J.......Q...... a;;. ..... a;;... ...Q... + ..
4 14 cc
0 12 cc
s -- ---oo-- --·O·-- ----Q--· ----0--- --~--+..
5 00Q 13 cc
4
(Opport1Jriity cost matrix) Since N= (mxn), an optimal assigomeni stage is reached. Now, make optimal
iv) Draw minimum number of !iqe11 tQ ~qvef all zeroes in the opportunity cost assignments.
matrix 2 3 4 5
2 3 4 5 00 ill] 2 cc
12
oo Hi P IS oo 2 12 00 13 )( [[]
2 .. ··"\"$·· ··;p··· --+--
--·Q---· ·:3-----·+· 3 ill] 13 00 cc )(
3· .. ·--(t'."" ····f: .. .. :.
:~ ~r:: ;~: ...... 4 2 [[J cc 00 )(
4 .. ---f.f· ··-a::..::q;,.:: ·::~::.. :!~--·+· 5 00 )( )( []] cc
5 00 4. "Ii . 13 0 Note : Multiple optimal solutions ~xist
r Although, it is an optimal solutiofl to ap 11ssign111ent problem but not to ·a salesman
Since N < (mxn); an optimal assignment ~~11ge is not reached. problem. Select next non zero least ele111e11t i.e. 2 to make assignment.
Choose a smallest non zero elenwnt i:e: K='4 not c\lVered by a line Case~: Make assignment to cell (1,4)
1 2 3 4 5 I 2
I
3
I
4 5 I,..._... I
00 I
2 2 00 I~
3 3
4 12 4 [[] CXl
5 00 .)(. j]J
00
... , :
00 5 cc
Again, N < (mxn); choose K=3. The resultant m11trj~ is 1~4~2~5~3~1=46

Feasible solution i.e. optimal solqti1>n
Case 2: Make assignment to cell (4,1)
·;Jf:,'
""S:· f~2~J~¥.~1~9".«~~ffi
• 2 3 4 5 I~
.1 ~ 12 [[J :;:( 00
2 l~ 00 13 [QJ )(
3 0 13 00 00 rn
4 -1-Ul ,-(}--- --~-- --~-- ···0-··
5 ~ []] )( x 00
1~3~5~2~4~1=46
Optimal solution
-~Jii:tt@:ttYsf.ie 1*~i~~,Jt~~(B~l¥f~ffiit~:~v~·~·
A product is defined as a combination of interrelated activities (or tasks) which must
be completed in a certain order in a specified time limit with minimum cost and specified
quality using resources s.uch as personnel, money, materials, facilities and or space.
Examples : Construction of a bridge, highway, power plant, research and development
work, etc.
5.1 BASIC RE:Q\;J[~°M~tff~{(>f:.¥,PRQJ ~CT

Each project has three basic requirements, namely :
I. It should be completed without any delay.
2. It should make use ofavailable man power and other resources as small as possible.
3. It should be completed with minimum cost.
5.2 PHASES 0 0F'PRQ.a1Ser~!MANA~EMENT

. . . -·· ···-.· ._·;~ - ._.,,-., '"-··~,···· ~"-"i.:-··J·· "'' ":···.-~-, . ,..;_ ·... ~-:--
The project management involves three phases :

I. Project planning phase.
2. Project scheduling phase and
3. Project controlting phase.
The project planning and scheduling phases must be attained before the start of the
actual project; whereas, controlling phase is done during the execution of the project.
Project Planning Phase
The steps involved in this phase are summarized below:
I. Identification of various tasks/activities to be performed in the project.
2. Determination of requirement of resources suclT as men, materials, money, etc. for
carrying out different tasks.
3. Allocation of resources to work packages (i.e. different tasks within a project).
4. Estimation of cost and time for the completion of work packages.
5. Study of alternative ways of achieving the goals.
•··-:J _:~),~~,~~~1;,~:f~lt~i5t!~ . · ' .' .:Jtlltm~e:u· Nnwo#-M~nls· · :c
Project Scheduling Phase
The steps involved in this phase Includes : 5.4 N~TWORK~.~9G1.ce,2~~1~i~1~~}":};;.:;: ··~/.
I. Identification of people•who will be responsible for each task. Common terms used in the networks are defined below:
~. Estimation of expected durations for each activities in the most economic manner. 1. Activity :
3. ·Draw a network diagram, showi11g the ordered inter-relationship between various
An activity in the network diagram represents project operation/ task to be conducted
activities. ·
that requires resources and certain time for its completion. An activity_~~r~p~e~ented by an
4. Aliocation of resources to each activity.
arrow, the head of which represents the ending and the tail, the starting-of the activity.
5. Calculation of total project duration, floats by taking into account the constraints
The activities are classified into three categories :
imposed by the different resources.
i) Predecessor Activity :
Project Controlling Phase
An activity which must be completed before one or more other activities start is
It refers to the evaluation of the actual status (progress) against the plan. It involves the known as predecessor activity.
determination of deviatioris in actual progress from the scheduled plan by keen monitoring ii) Successor Activity :
and application of corrective measures (i.e. remedial actions) to achieve the targets. .An activity which starts immediately after one or more of the activities are
Work Breakdown Structure (WBS) : completed is known as successor activity.
The process of dividing the project into number of interrelated activities is called work iii) Dummy Activity :
breakdown structure. An activity which does not consume either any resource and I or time is known as
dummy activity.
5.3 NETWORK.TECHNiQUES 2. Event:
A network I network diagram I network technique is a symbolic representation of the An event in the network diagram is the beginning or the endpoint of an activity. ~_event
essential characteristics of a project. PERT and CPM are the most widely used techniques. ~~l~_c_alled l!~ _!l~~e. An event is a point in time, that does not consume any resources. It
is represented by a circle.
5.3.1 CPM ((tl'itiCal,.patlH.'l~tht>(l)/H ,, ;.·. The events can be categorised into two types :
• CPM uses a~iry oriented network.which consists of number of well organised i) Merge Event ii) Burst event.
tasks or activities. i) Merge Event :
• Each activity is represented· by an arrow and activities are joined together by An event which represents the joint completion of more than one activity is
events. known as a•nergeevent.
• It is P.i:_e[err~d fo~~~~~.~Slti!~~§jmpje a~~~. where the activity
time and costs are precisely known.
• Construction of building, road, bridge are the examples of the project handled by
CPM. ... -
ii) Burst Event :
38
An event that represents the beginning of more than one activity is known as a
burst event.
5.3.2 PERT (Prograriune EvalU~tion and Review Techniqu·~) '
• It uses event oriented network_ in which successive events are joined by arrows.
• It is prefe!J~ for ~etitive (i.e. non-one time) where the .. ~
times of completion are uncertain. The numbering of events in the network diagram must start from left (sta1t of the project)
to the right (ending of the project) and top to the bot;om.
• In PERT, three time estimates, viz., The optimistic, pessimistic and most
likely time .estimates are given, which are useful in the cakulation of expected 5.5 FULKERSON'S RULE OF NUMBERING THE EVENTS I NODES
completion time of each activity.
Fulkerson'srnle used for numbering the events ii1volves the following steps:
• Launching a new product into the market by a company, launching of satellite are
the examples for PERT projects. . ------ I. The initial event which has all outgoing arrows with no incoming arrow is
numbered 'I'.
'"';,
OPERATIONS REsEARCH
2. [)_t!lete all the arrows coming out from node 'I'. This will convert some more nodes NE'l'WORK ANALYSIS
).~·t?tf~"·_ :·: (:~'.L:::;~- f£:,: ~·.· ·,,:'~
··~
into initial events. Number these events 2, 3, .....
3. Delete all the arrows going out of these numbered events to create more initial H Concrete fotindation G,F
events. Assign next numbers' to these events. I Erect steel work E
4. Continu~ until the final or terminal node, which has all arrows coming in with no J Paint steel work H, l
arrow going out, is numbered. . K Give finishing touch J
Sol. The sequence of activities together with their predecessor and successor activities
.. 5.6 ACTIVITY • ON • NODE (AON) NETWORK are shown in the table
This diagram represents the activities by nodes or circles, with the arro~s connecting Activity A B c D E F G H I J K
them representing precedence relationship between thein. Preceded by - - A B A B C,D G,F E
~
A B 0--0 Successor activity C,E D,F G G I
!\ ,..._ • .- H H J J
H,I J
K -
e table that the activities Aand B have no predecessor activities
(a) Arrow diagram (b)AON diagram and hence they are the starting/beginning activities. They are originated from a
common node I.
5.7ACTIVITY ·ON· ARROW (AOA) NETWORK
<
This diagram represents the activities by the arrows at each end of which is a node or
circle. These nodes represents points in time, when an activity is starting or ending. The
arrow represents the passage I magnitude of time required for that activity to be performed.
A
~ ii) The activities (C,E) and (D,F) are done concurrently after the completion of
activities A and B respectively. In addition to this, the activities C and Dare merged
5.8 SALIENT FEATURES~OF AP:ROJ°ECt </ at a common node 4, which forms the tail event for an activity G. The activities F and
G are merged at a head event 6, which forms the tail event for an activity H.
I. A project has identifiable beginning and end points.
2. It is usually a non - repetitive task. ~ rs:
3. It can be broken down into number of activities which require time and resources
for their execution.
4. It is scheduled to be completed by a target date.
5. The objectives are clear and the project involves heavy investment.
6. Completion of project is always subject to some uncertainties and risks.
SOlVEQ ~.R9'.8L.~-M~f '. '

1) Draw a network for the simple project of erection of steel works for a shed. The
iii) An activity I is started after the completion of an event E, which is done
various activities of the project are as under:
-
concurrently with an activity Hand merges at a node 7, which acts as a tail node for
Activity Description Preceded by an activity J, which is followed by an activity K. Activity K is a terminating activity
A
B
Erect site workshop
Fence site
--
-- . with no successor activities.
c Bend reinforcement A
D Dig foundation B
,
E Fabricate steel work A
F Install concrete pillars B
G Place reinforcement C,D
en
o~#~n<>~' ~~c::u .
NETWORK .ANALYSIS
~ - iv) Activity G emanates from node 6, after the- completion of activities D and F.
2) An assembly is to be made from two parts X and Y. BotJi parts need to be
worked on a lathe before being asse~bled. The sequence of activities along with Finally, an activity H starts from node 7 after the completion of an activity G. H is a
terminating activity with no successor activities.
their predecessor requil'e~ents, is given below: J).__ I)
Activity Predecessor activity
A --
B A
c A
D B 3) Listed in the table are the activities and sequencing necessary for a maintenance
E B,C job on the heat exchangers in a refinery.
F E Activity· Description Predecessor activity'
G D,F A Dismantle pipe connections --
H G B Dismantle heater, closure and floating front A
Sol. The sequence of activities together with their predecessor and successor activities c Remove tube bundle B
are shown in table D Clean bolts B
Activity A B c D E F G H
E Clean heater and floating head front B
Predecessor activity - A A B B,C E D,F G
F G H - F Clean tube bundle c
Successor activity B,C D,E E G
i) Activity A is a starting activity with no predecessor activity and activities B and C
G Clean shell c
H Replace tube bundle F,G
emanates from it i.e. from node 2.
1 Prepare shell pressure test D,E,H
J Prepare tube pressure test and reassemble I
Draw a network diagram of activities for the project.
Sol. The sequence of activities together with their predecessors and successor activities
are shown in table.
ii) Activity •E starts after the completion of activities B and C, but B and C are Activity A B c D E F G' H I J
not connected. Add a dummy activity to connect the nodes 3 and 4, then a_ctivity Predecessor activity ' - A B B B c c F,G D,E,H I
E commences from the node 4, Activity D emanates from the node 3, after the
Successor activity B C,D,E F,G I I H H I J -
con1pletion of an activity B.
t)Activity A is the beginning activity with no predecessor started from the node 1.
The activity B starts after the completion of an activity A at node 2, from which 3
activities C, D and E emanates.
CD A• 0
~
B D
iii) Activity F originates from node 5 after the ~ompletion of an activity E. The •3~• 0
activities D and F done concurrently and merges at node 6.
- B~O ii)Activities C,D and E originates from node 3 done concurrently and from node 4,
two activities F and G done concurrently. An activity His started after the completion
of activities F and G, which are not connected. A dummy activity D1 is necessary to
connect F and G and then activity H terminates at node 8, which acts as a head event
for activity D. An activity I starts after the completion of three concurrent activities
-- .
I
~--...
o."-
'::'.'.':~ ~it:;y~~fi'a;' ~~CH
D, Hand Eat node 8, but dummy activity is required to connect E to the node 8. An
activity J is terminating one which starts from node 9,°which is a head event for an
activity I.
NE'nfoRK.~'!'81$ ,;
s.9 CRITICiL ~P.ATH '~NA~ys'1_t;, /, 0,c,[~~;;'f¥~l~~~i;F~,.' <
-~
:.:·:~t'jl' ..
The objective of critical path analysis is to estimate the total project duration and to
assign starting and finishing times to all activities involved in the project.
:
Critical Activity :
An activity is said to be critical, if a delay in its commencement wilt result in delay in
the completion of the project.
Critical Path :
The sequence of critical activities with longest path requiring shortest time for the
completion of the project is called critical path.
·A network may have more than one critical path. Following are the notations used in the
4) A project consists of a series of tasks labelled A, B, ..... H, I with the following critical path method.
relationships (W < X, Y means X and Y cannot start until W is completed; X, . i) Earliest occurrence time of an rvent (E)
Y < W means W cannot start until both X and Y are completed). With this This is the earliest time for an event to occur when alt the preceding activities
notation, construct the network diagram having the following constraints: have been completed, without delaying the entire project.
A< D, E; B, D < F; C < G; B < H; F, G <I
ii) Latest allowable time of an event (Li) :
Sol. The sequence of activities together with their predecessors and successor activities
This is the latest time at which an event can occur without causing a delay in
are shown in table project completion time.
Activity A B c D E F G H I , iii) Earliest starting time of an activity (ES ) :
. Preceded by - - - A A B,D c B F,G 11
This is the earliest time an activity can start without affecting the project
Successor activity D,E F,H G F - I I - - completion.
i) Activities A, B and C are the starting activities with no predecessors, whereas, the iv) Earliest finishing time of an activities (EFii) :
activities E, H and I are ending activities with no successor activities. An activity This is the eadiest time an activity can finish without affecting the project
His preceded by B, while F is preceded by Band D, hence a dummy activity 0 1 is completion.
necessary to connect an activity B to F. The complete network is shown below. The earliest finishing time of an activity can be obtained by the relation.
~ q ~ (6 EF.IJ =ES.IJ +duration of activity.
v) Latest starting time of an activity (LSi) :
This is the latest time an activity can start without delayi11g the project completion.
vi) Latest finishing time of an activity (LFii) :
This is the latest time an activity can finish without delaying the project completion.
H The latest finishing time of an activity can be obtained by the relation.
LF.IJ = LS IJ + duration of activity.
vii) LIJ = Duration of an activity.
5.9.1 Determination of Floats and Slack Times

• The float I slack or free time is the length of time through which a non - critical activity
and/or an event can be delayed or extended without delaying the total project completion
time.
fn general, the term float is used/applicable for the activities and slack for the events.
However, these two terms are interchangeabie as well.
Slack:
It is defined as the time by which occurrence of an event can be delayed.
-
earliest occurrence time of an event.
Therefore S = L. - E
Note : For critical ~ven ts, L. = E
1
I I
:]i~!;:~~H
It is denoted by the symbol 'S' and is the difference between the latest occurrence and
·,Jt~iB~~I~"'.:;
5)
are
(·>~4;,s~~~~~~l;1~~:11!J1 1ii
.\Wi.;i,;i~i~~t!!Ql,~@.M~i:Off~\!1~.JDB!all!ldtr~:~~;:w· .
Tasks A, B, ......••.•..., H, I constitute a project. The precedeace relationships
. A<D;A< E; B < F; D <F; C<G; C~R;F<I;G<I.

Draw a network to represent the project and find the miaimum time of
Float: completion of the project when time, in days, of each task as follows:
It is defined as the positive difference between latest times or the positive difference
between the start/occurrence times. Task: A B c D E F G H I
There are t~ree types of floats, namely: Time: 8 JO 8 JO 16 17 18 14 9
i) Total Float (TF;i) : . Also. Identify the critical path.
It .is defined as the difference of latest start and earliest start times Sol. The sequence of activities together with their predecessor and success~rrelationships
OR .,
are shown in the table. =""' · · ·· ·
The difference of latest finish anq ~arliest finish times of an activity (ij) Activity A B c D E F G H I
(TF;) = (LS;( ES;)
= (LF;r EF)
Preceded by - - - A A B,D c c F,G
Total float represents the maximum time within which an activity can be Successor activity D,E F G,H F - I l - -
delayed without affecting the project completion time. Duration (days) 8 10 8 IO 16 17 18 14 9
ii) Free Float (FF1) : As per the given data, A, B and C are the beginning activities, whereas, D, E and F
It is defined as the time by which the completion of an activity can be delayed are the terminating activities. The network diagram corresponding to the different
without causing any delay in its immediate successor activities. activities involved in the project is constructed as shown in figure.An activity name
Free float= Total float - Head event slack is written on/beneath the line representing an activity with its duration inside the
(FF,)= (TF,)- (Lr E) bracket.
iii) Independent Float (IF1i) : · .
It is defined as the time by which the start of any activity (ij) can be delayed
without causing any delay in its preceding activitfos.
Independent float= Free float - Tail event slack
(IF;) = (FF) - (L;- E)
Note:
i) L;2: E;
ii) (IF;) :5 (FF,) :5 (TF;)
iii) The negative value of independent float is considered to be zero. L,=17
Calculate the Earliest start time (E) at each node and enter that value near that node.
5.9.2 Importance of Total float Take the Earliest start time (E) at node I as zero i.e·. E1 = 0.
i) If (L- E) < 0 i.e. negative : At node 2, E2 = E1 + t 1.2' Where t 1_2 , is the duration of the activity 'A' between nodes
The project completion is behind the scheduled date. It implies/indicates that I and2.
resources are not adequate and activities may not finish intime. This requires extra E, = 0 + 8 = 8.
• resources or certain activities need crashing in order to reduce negative float value. The node 3 can occur after the completion of preceding activities Band D.
At node 3,
ii) If (L-E) >O i.e. Positive :
The project completion is advanced/ahead of the scheduled date. It indicates that E3 = E2 + t 1•2 or E3 = E, + t 1.J
resources are surplus and hence resources can be utilised effectively elsewhere or E3 == 8 + I 0 == 18 or E3 = 0 + l 0 = I0
We have to take E3 = 18 (highest value) rather than ){)(lowest value), because an
completion/execution of the activities can be delayed.
event /node 3 is reached after the completion of both activities B and D.
iii) If (L-E) = 0 i.e. Zero : :. E3 =18.
The resources are just suffici~nt for the completion of activities in a project. Any
dday in the execution of activities increase the project cost and time.
.,.._ ..·
Node 4 is reached after the completion of an activity C.

~~ii!i~.·
;f:
~~~~~t~~( ": .. -.. ..
..,.
Therefore E4 = E, + t, ~ ·. The critical path is shown by drawing double lines connecting all those events with
E4 =0+8,;8· same E and L values.
Node 5 is reached after the<:ompletion of the both preceding activities F and G. The critical path of the product is 1-2-3-5-6 and critical activities are A, D, F and I.
The total project duration is 44 days. \
Es=E4+t4 s or Es=E 3 +t1 s
Es = 8 + 18. = 26 or Es = I 8'+ 17 = 35 . Now, construct a table showing each activity and its duration along with EST, EFT,
Node 6 is reached after the completion of the preceding activities E, Hand I. LST, LFT, total float(TF) and free float (FF)
E6 = E2 + t2•6 = 8 + 16 = 24 or Earliest time Latest time Float
"E6 = E4+ t4.6 = 8 + 14 = 22 or Activity Duration Start Finish Start Finish Total Free
E6 =Es+ ts. 6= 35 + 9 = 44 1-2 8 0 8 0 8 0 0
Similarly, calculate the Latest finish time (L) at each node/event starting from the
1-3 10 0 10 8 18 8 8
last/ending node_in_the ,back.war4 din:ctjon.
Assume/take the Latest finish time (L) at node 6 equal to its Earliest start time. 1-4 8 0 8 9 17 9 0
i.e. L6 = E6 2-3 IO 8 18 8 18 0 0
At node 5, Ls is the difference of head event's. Latest finishing time L6and activity 2-6 16 8 24 28 44 20 20
duration ts 6 3-5 17 - 18 35 18 35 0 0
:. Ls =L~-ts6 4-5 18 8 26. 17 35 9 9
=44-9°=35
At node 4, activities G and H emanates. hence, 4-6 14 8 22 30 44 22 22
L4 =Ls -t4.s 5-6 9 35 44 35 44 0 0
6) Draw the network for the following project. Identify the critical path and
= 35-18=17 or
calculate the total slack and free slack.
L4 =L6 -t4,6 Activity A B c D E F G H I J
=44-14=30 Preceded by - - A A B,C B,C E E D,G F.H,I
Enter the lowerof these two values i.e.17 at node4 i.e.L 4 = 17 Duration (weeks) 15 15 3 5 8 12 I 14 3 14
Atnode3, Jan 2010 (lOM) I Dec 2010 (14M)
L3 =Ls-ti.s Sol. The sequence of activities together.with their predecessor and successor relationships
are shown in table.
=35-17=18
Activity A B c D E f G H I J
Atnode2, Preceded by - - A A B.C B,C E E D,G F.H.I
L2 =L 3 -t 2_3 =18-10=8 or Successor activity C.D E,f E,F [ G,H J I J J -
L2 = L6-t 2•6 =44-16=28 Duration (weeks) 15 15 3 5 8 12 I 14 3 14
Thelowervalueis8, :. L2 =8 In this problem, A and Bare the beginning activities and J is the ending activity.
The network diagram corresponding to the given project is constructed as shown in
At node I, figure.
L1 =L,.-t 1•2
=8-8=0 or
L1 =L3 -t,,3
=18-10=8 or
L, =L4-t1.4
=17-8=9
The lowest of three values is zero
:.L1 =0
...... · :, \~:~;0·0~'.t:~p'.fi~tW/;> · ~ .., ·d:~r6J~~·'f.!9it,M~91f ·
·:Jlll',1
Successor activity l B,C I D,E,F,G I F,G I H I - I H

Duration (days) ] 10 I 8 I 7 I 9 I6 I 10 4I I 12
Th;,network diagram corresponding to the given activities involved in the product
is constructed as shown in figure.
A is the starting activity, whereas, E, G and H activities are ending activities. A
dummy activity is drawn between the nodes 3 and 4 to satisfy the given predecessor
and successor relationship.
) J{J4) •(7
E =18 - ,--, E6=40 E,=54
3
L3=18 L 6=40 L 7=54
The critical path for the completion of project is 1-2-3-4-6-7 and corresp[onding
project duration is 54 weeks.
The EST, E)FT, LST, LFT required to calculate the total float/slack and free float/
slack for each activity are shown in the network analysis table. L.=40
Earliest time Latest time Float E4=18

Activity Duration Start Finish Start Finish TF FF L4=18
1-2 15 0 15 0 15 0 0 Calculate Earliest starting time (E) at all nodes in the forward direction starting from
1-3 15 0 15 3 18 3 3 node I.
2-3 18 15 18 0 0 Assume,
3 15
At node I, E1 =0
2-5 5 ,5 20 32 37 17 7
3-4 18 26 0 0 Atnode2, E2 =E 1 +t 1•2
8 18 26
3-6 12 18 30 28 40 10 10 =0+10=10
4-5 l 16 27 36 37 10 0 At node 3, E1 = E2 + t2,J
4-6 14 26 40 26 40 0 0 =10+8=18
5-6 3 27 30 31 40 10 10 Atnode4, E4 =E 2 +t 2•4
6-7 14 40 54 40 54 0 0 = 10+ 7 =17 or
8) A project consists of the followiiig activities with their precedence relationship E4 =E 1 +0
and duration in days:
=18+0=18
i). Draw the network of the project.
ii). Identify the critical path and project duration. E4 =Max(l 7, 18)
iii). Calculate EST, EFT, LST, LFT, TF, FF and IF for each activity E4 =18
Activity: A B c D E F G H At node 5, Es = E1 + t1.s
Precedence: -- A A 8 B B,C B,C D,F =18+9=27 or
Duration (in days): 10 8 7 9 6 10 4 12
Es =E4+t4,s
June 2012 (lOM) :
=18+10=28
Sol. The sequence of activities together with their predecessor and suc-cessor relationships
are shown in the table . E5 =Max[27,28]
Activity A B c D E F
l G I H Es =28
Precedence A A B B B,C i B,C J D,F
- Atnode6, E6 =E3 +t 3,6
=18+6=24 or
E6 =Es +ts.6
~~r1[i~ff~~-'~1~~~i~~~/:fi~ii£~tit>•'t•;m~~~,~;~
NE'.l'WORK ANALYSIS_
Activity
1-2
2-3
2-'\
·..
TF -(L, -E,)= 0
TF-(L,-E,)=O
TF-(L. -EJ= I
~.,-,
FF = TF -head slack
- __ ;4R
IF = FF - tail slack
FF - (L, - E,) = 0
FF - (L? - E,) = 0
FF - (L? - E,) = I
y•
E6 =28+12=40 or 3-4 TF - (L. - E ) = 0 FF - (L, - E,) = 0

E6 =E4 +t4,6 3-5 TF - (L, - E,) = I FF - (L, - E,) = I
=18+4=22 3-6 TF - (L< - E.) = 16 FF - (L, - E,) = 16
E6 =Max(24,40,22) 4-5 TF - (L, - E,) = 0 FF - (L, - E,) = 0
}I, 4-6 TF - (L< - EJ = 18 FF - (L. - E,) = 18
.. E6 =40
~.~6 TF ~ (L, - EJ = 0 · FF - (L< - E,) = 0
Similarly, calculate the latestfinishing time (L) at all nodes in backward direction Where,
starting from the node 6. TF =Total float
Assume, FF= Free float
At node 6, L6 = E6 = 40 IF= Independent float
At nodes 5, 4, 3, 2 and I, calculate latest finishing time using the relation. All floats are zero for critical activities.
L,.,, e,.m = Lhca• e•em - duration. ~9) A small project consists of six activities. The duration (in days) of each activity
:. L 5 = 28
and their immediate -oredecessors are shown bel
L4 = 18 --
L 3 = 18 Activity: A B c D E F
L2 = 10 and Immediate predecessor: -- -- -- A,B B B,C
LI= o. Duration (days): 5 73 8 4 5
The critical path is 1-2-3-4-5-6 and the corresponding project is 40 days. Now, i) Draw the network
construct table showing EST, EFT, LST, LFT, TF, FF and IF for each activity. ii) Find the critical path
Earliest time Latest time TF FF IF iii) Verify the critical path by earliest time and latest time values. July 2011 (9M)
Activity Duration Start Finish Start Finish Sol. The sequence of activities together with their predecessor and successor relationships
1-2 10 0 10 0 IO 0 0 0 are shown in table.
2-3 8 IO 18 IO 18 0 0 0 Activity A 8 c D E F
2-4 7 IO 17 II 18 I I . I Immediate predecessor - - - A,B B B,C
3-4 0 18 18 18 18 0 0 0 Successor activities D D,E,F F - - -
3-5 9 18 27 19 28 I I I Duration (days) 5 3 7 8 4 5
3-6 6 18 24 34 40 16 16 16 The network diagram corresponding to the different activities involved in the
4-5 10 18 28 18 28 0 0 0 project is constructed as shown in figure
4-6 4 18 22 36 40 18 18 18
5-6 12 28 40 28 40 0 0 0
Total float is calculated using the relation TF = (LFT-EFT) = (LST-EST) = +ve
always. Similarly, free float and independent float for different activities is calculated
using the relations.
4rE,=7
L4=8
The Earliest starting time is calculated at each node as shown below.
'1111(
Rf L :~·~)'}.!.U'f~;'~~t~~!~~:ill:r.:::::::, .·c._~f'!f/:(:'f-~¥1~~~-~···· · N~tiRK ANAi.Yilis 411

Atnodel,E 1 =0 r LI =L3 -t,.3
At node 2, E 2= E1 + t 1,2 =9-3=6 or
=0+5=5 or L, =L2-t1.2
Ez =E1 +t,,3 +t3,2 =5-5=0
=0+3+0=3 L1 =Min(l,6,0)
At node 3, E3 = E1+ t 1,3 L1 =0
=0+3=3 Note : The duration of dummy activity is always zero.
Atnode4,E 4 =E 1+t 1.3 +O The critical path is shown by drawing double lines connecting all those events with
=0+3+0=3 or same E and L values.
E4 =E, +t1,4 The critical path of the project is 1-2-5 and the critical activities are A and D. The total
project duration is 13 days.
=0+7=7
Now, construct a table showing each activity and its duration along with EST, EFT,
E4 =Max (3, 7) LSTand LFT.
E4 =7 ') Earliest time Latest time
At node 5, Es = E2+ t 15 Total Float
Activity Duration Start Finish Start Finish
=5+8= 13 or 1-2 5 0 5 0 5 0
Es =E3 +tJ.s 1-3 3 0 3 6 9 6
=3+4=7 or 1-4 7 0 7 I 8 I
Es=E4+t4,s 2-5 8 5 13 5 13 0
" 3-2 0 3 - 3 5 5 2
=7+5=12
Since 3 activities, namely D, Eand Fare converging at node 5, take the maximum
~
l 3-4
3-5
0
4
3
3
3
7
8
9.
8
13
5
6
earliest starting time to enter near node 5,
:. E5 =Max(l3, 7, 12) 4-5 5 7 12 8 13 I
E5 = 13. The activities 1-2 and 2-5 .have zero float and hence are critical.
Similarly, calculate the latest finishing time (L) at each node as shown below in the 10) The maintenance of a machine consists of ten jobs (activities). The precedence
backward direction starting from node 5. relationship of these jobs has been listed with the help of their node numbers.
Assume, at node 5, Ls =Es = 13 ~ob: I 1-2 I 2-1I2-4 I 1-s I 3-6 l 4-6 I 4-1 I s-s l 6-8 I 1-8
At node4, L4=Ls -t 4.s Duration (days): J 2 I 3 I 5 I . 4 J I I 6 I 2 ] 8 I 7 j 4
=13-5=8 Draw an arrow diagram for the project and calculate ES, EF, LS, LF, TS and
FS. April 2018 (14M)
At node 3, L3 = Ls - t 3.s Sol. As per the given data, node I is the starting event an\! node 8 is the ending event.
=13-4=9 An arrow diagram corresponding to the given project is constructed as shown in the
At node 2, L2=Ls -t2.s figure. Duration of the activities are shown along activity arrows.
=13-8=5
At node I, L1 = L4-t 1•4
=8- 7=1 or
... 0PERATIO!f_S '.R£sEARCH
-li~oil A.M.YSIS
i). Draw the network and find the critical path.
..
ii). Compute EST, EFf, LST, LFf, total float for each activity.
Jan 20J7 (14 M)/ July 2016 (12M)/ July 2008 (16M)
Sol.
The network diagram corresponding to the activities in the project is constructed as
shown in figure. Node 1 is the beginning event and node IO is the ending event.
E,=4
L 2=9
2
E9=10
E4=7 E7=9 ) (SJ L=l5
l 1>@) 9
L4=7 L7=16 E1=0
Calculate the Earliest start time (E) from node 1 in the forward pass/direction L,=O
and Latest finish time (L) from node 8 in the backward pass/direction and the
corresponding values are written around the nodes.
The critical path ia 1-2-4-6-8, as the values of E and L along this path are equal. The
project duration is 20 days.
Construct a network analysis table showing the values of EST, EFT, LST, LFT, TS
d FS for each activity
Earliest time Latest time Slack
Activity Duration Start Finish Start Finish Total Free E7=15
1-2 2 0 2 0 2 0 0 L7=1S
Calculate Earliest start time (E) and Latest finishing time (L) for all activities in the
2-3 3 2 s s 8 3 0
forward pass and backward pass starting from node 1 and node I0 respectively and
2-4 s 2 7 2 7 0 0 -\ note down the values around the nodes'.
3-5 4 s 9 8 12 3 "o . The critical path is l-3-S-7-8-10, as the values of E and L for all nodes along this
3-6 1 s 6 12 13 7 7 path are equal.
4-6 ·6 7 13 7 13 0 0 The critical path is shown by double lines in the network diagram. The table showing
4-7 9 14 16 7 0 the values of EST, EFT, LST, LFT and Total float is constructed as shown below.
2 7
Earliest time Latest time Total Float
5-8 8 9 17 12 20 3 3
Activity Duration Start Finish Start
6-8 7 13 20 13 20 0 0 Finish
1-2 4 0 4 5
7-8 4 9 13· 16 20 7 7 9 5
1-3 1 0 I 0
11) A project schedule has the following characteristics. I 0
2-4 I 4 s 9
Activity Time (weeks) Activity Time (weeks) 10 5
3-4 I 1 2 9
1-2 4 5-6 4 10 8
4-9 s s 10 10 15 • 5
1-3 I S-7 8
3-5 6 I 7 I 7
2-4 I 6-8 -1 0
5-6 4 7
3-4 1 7-8 2
11 12 16 s
5-7 8 7 IS 7
3-S 6 8-10 5 IS 0
6-8 I 11
" 4-9 s 9- 10 7
12 16 17 s
7-8 2 IS 17 15 17 0
8-10 s 17 22 17 22 0
9-10 7 10 17 I~
..,, c
pa..-. -- , __ ,~;;;i~~~{;:'.';~~~~~~-~~C:!J- N~9RK AxALYSIS -
. . .~-·t{;~,\~~,$~2&~~~t~;:~~ii~~;~£l~ta
12) A project consists of the following activities with their duration in days and the 5-6 8 15 23 3( 39 16
precedence relationship.
4-6 IQ 29 39 29 39
Activity: A B c D E· F G H I
6-7
0
Precedence: -- A A B,C A D,E c F,G H IQ 39 49 39 49 0
Duration (days): 10 12 5 7 9 10 8 10 9 7-8 9 49 58 49 58 0
i). Draw the network for the above· information 13) A project ~onsists of a series of tasks la_belled A, B, .•... H, I with the ·following
ii). Identify the critical path and duration relationships (W < X, Y means X and Y cannot start until Wis completed). With
iii). Calculate EST, EFT, LST, LFT, TF. July 2015 (lOM) this notation, construct the network diagram having the following constraints:
Sol. The· sequence of activities together with their predecessor and successor relationships A< D, E; B, D < F; C < G; G < H; F, G <I
are shown in table. Find also the minimum time of completion of the project when the time (in
Activity A B c D E F G H I days) of completion of each task is as follows:
Precedence - A A B,C A D,E c F,G H Task: IA IB IC IDIE I F IG IH
Successor activity B,C,E D D,G F F H H I - Time: I 23 I 8 I 20 I 16 I 24 I 18 I 19 IIT"W
Duration (days) IO 12 5 7 9 IO 8 10 9 Further determine ES, EF, LS, LF AND TF, FF, Interference and independent
The network diagram corresponding to the activities involved in the project 1s float. Dec 2011 (lSM)
Sol. The sequence of activities together with their predecessor and successor relationships
constructed as shown in figure.
are shown in table.
The activity D emanates after the completion of tasks 8 and C, hence a dummy
activity of zero duration is drawn to connect an activity C to 8 at node 3. Activity A B c D E F G H I
E,=22
L=22
Preceded by - - - A A B,D c G F,G
__, Successor activity D,E
3
F G F - I H,I - -
Duration (days) 23 8 20 16 24 18 19 4 10
In this problem, A, B and C are the starting activities, whereas, E, H and I are the
ending activities. Since the activities F and G are emanates from activities (B,D) and
(F,G) respectively, draw one dummy activity between node 3 and 5 to connect the
activities 8 and D. Similarly, draw one more dummy activity between node 7 and 8
to connect the activities F and G .•
E5=15
The network diagram corresponding to the given project is constructed as shown in
L5=22 figure.
Calculate the Earliest starting time (E) and Latest finishing time (F) in the forward E,=23
direction and backward direction starting from nodes 1and 8 respectively and noted L,=23
near to the nodes.
The critical path is 1-2-3-4-6-7-8 and the corresponding project duration is 58 days. •1 • v • "'l!J-, E,9i7
Now, calculate the values of EST, EFT, LST, LFT and TF for each activity using the L,9i7
familiar relations and tabulated as shown below. E,=O

Earliest time Latest time Total Float L,=O
~
Activity Duration Start Finish Start Finish G(l9
1-2 10 0 1.0 0 10 0 E,=20

L,=38
2-3 12 10 22 IO 22 0
The Earliest starting times and Latest finishing times are calculated at each node in
2-4 9 10 19 20 29 1-0 the forward and backward direction respectively and entered those values near the
2-5 5 10 15 17 22 7 nodes.
3-4 7 22 29 22 29 0
... The critical path is 1-2-5-7-8 and minimum time required to complete the project
(i.e. project duration) i_s 67 days.
Q~~~'.119!Y~- ~~CH
NETWORK AliALYSrS .
··411
as shown in figure. A dummy activity is drawn between the nodes 6 and 8 to connect
the activities E,F to activity L, as activity M emanates from activities E,F and L.
E4 =21
Now, construct table showing EST, EFT, LST, LFT, TF,FF, IF and interference float L =32
for each activity. . 4 '"
Earliest time Latest time TF FF IF Inf
1-2 23 0 23 0 23 0 0 0 0
1-J 8 0 8 31 39 31 0 0 31
E.=39
1-4 20 0 20 18 38 18 0 0 18 L.=39
2-5 16 ?"
_J 39 23 39 0 0 0 0
3-5 0 8 8 39 39 31 31 0 0 E,=O
4-6 19 20 39 38 57 18 0 -18=0 18 L,=O
5-7 18 39 57 39 57 0 0 0 0
6-7 0 39 39 57 57 18 18 0 0 E3=5 E,=14
L3=9· L,=18
6-8 4 39 43 63 67 24 24 6 0
57 67 Calculate Earliest start time (E) and Latest finish time (L) of all activities in
7-8 10 57 67 0 0 0 0
forward and backward directions starting from nodes I and 9 respectively to identify
14) A project consists of the activities as given in the table below: the critical activities and path.
I Activity I A I B ICI D I E I F IGI H I J I K I L I M The critical path is 1-2-6-8-9 and project duration is 39 days.
Duration(days) I 13 I 5 I8 I 10 I 9 I 7 I 7 I 12 I 8 I 9 I 4 I 17 Construct a network analysis table showing the values of EST, EFT, LST, LFT,
Constraint TF and FF for each activity as shown below.
• A and B are starts Earliest time Latest time Float
• A controls C, D and E Activity Duration Start Finish Start Finish Total Free
• B controls F and K 1-2 13 0 13 0 13 0 0
• G depends on C
1-3 5 0 5 4 9 4 0
• H depends on D
• E and F controls J and M 2-4 8 13 21 24 32 II 0
• L depends on K 2-5 10 13 23 17 27 4 0
• M is also controlled by L 2-6 9 13 22 13 22 0 0
i). Draw the network of the above project 3-6 7 5 12 15 22 10 10
ii). Find the critical path and project duration
3-7 9 5 14 9 18 4 0
iii). Calculate the EST, EFT, LST, LFT, TF and FF for each activity.
Jan 2008 (16M) 4-9 7 21 28 32 39 I I
Sol. The sequence of activities together with their predecessor and successor relationships 5-9 12 23 35 27 39 4 4
are shown in the table · -· 6-8 f 22 22 22 22 0 0
Activity A B c D E F G H J K L M 6-9 8 22 30 31 39 9 9
Preceded by - - A A A B c D E,F D K E,F,L 7-8 4 14 18 18 22 4 4
Successor activity C,D,E F.K G H J,M J.M - - - L M - 8-9 17 22 39 22 39 0 0
Duration (days) 13 5 8 10 9 7 7 12 8 9 4 17
In the given project, A and Bare staitingjobs/activities, whereas, G, H,J and Mare
ending activities. The network diagram corresponding to the activities is constructed
NETWORK
• . . - . . ..
Ai'ALYSIS, ( ... :=
•.. •...!.:-.:: '•-..!. .·· ··-j-4!1
Rik;\;;:;·~ ·. :'~,!~~:;f~f:~z~ff~1d;-ii{~~~:~~~::~1~~,~o/~'."~;~ =:·''.~if~J!~i~i~~
~ ~
The critical path is 1-2-6-8-9 and project duration is 39 days.

Now construct a table showing EST, EFT, LST, LFT and TF for each activity that
15)
A project consists of activities as given in the table below:
J K L are calculated as usual by using the relations familiar to us
Activities I Jobs: IAIB IC 1D I E I F 1G IH II
9 4 17 Earliest time Latest time Total Float
Duration (days): I 13 I S I 8 I 10 I 9 I 7 I 7 I 12 I S (TF)
And the constraints as listed in .the table shown below
Constraint 1-2 13 0 13 0 13 0
SL No;
A and B are starting jobs 1-3 5 0 5 4 9 4
I
A controls C, D and E 2-4 8 13 21 24 32 II
2
B controls F and J 2-5 10 13 23 17 27 4
3
G depends on C 2-6 9 l3 22 13 22 0
4
3-6 7 5 12 15 22 10
s H depends on D
6 E and F controls l and L 3-7 9 s 14 9 18 4
4-9 7 21 28 32 39 II
7 K follows J
L is also controlled by K 5-9 12 23 35 27 39 4
s
G, H, I and Lare last activities 6-9 8 22 30 31 39 9
9
i). Draw activity on arrow (AOA) network for the above project 6-8 0 22 22 0 22 22
ii). Find the critical path and project duration 7-8 4 14 18 4 18 22
iii). Calculate early start time (EST), early finish time (EFT), late start time 8-9 22 17 39 0 22 39
(LST), late finish time (LF'f) and total ftoat (TF) for each activity. 16) A project consists of twelve activities (A to L) with the following precedence:
May 2017 (20M)
i). A, B, C are the first ones and can start simultaneously.
Sol. The sequence of activities together with their predeces~or and successor relationships
ii). A, B < D
-- - hown in the table
-
H I J K L iii). B < E, F, H
Activity A B c D E F G
iv). F, C <G
B c D E,F B J E,F,K
- A A
Preceded by - A
L, - v). E, H <I, J
C,D,E F,J G H I,L 1,L - - - K
vi). C,D, F, J <K
Successor activity 4 17
9 7 7 12 8 9
13 5 8 10 vii). K< L.
Duration (days)
In the given problem, Aand Bare startingjobs, whereas, G, H, land Lare last activities Duration of activities are listed below:.
A dummy activity is drawn to connect the activities E and F converging at node 6 to Activity A B CIDIEIFIGIH K L
activity Kat node 8, as activity Lis started after the completion ofE, F and K activities.
Duration (days) I6I 4 ) IO I I II I 3 I 14 I 6 I 9 I 2 I 7 I5
AOA network corresponding to the above project is constructed as shown in figure. Construct the netw-0rk and find the critical path and also duration of project.
E4=21
July 2018 (12M)
4 L4=32
l.
are shown in the table.
Activity A B c D E F G H I J K L
Preceded by - - - A,B B B F.C B E,H E.H C,D.F,J K
Successor activity D D,E,F.H G K I,J G,K - I,J - K L -
Duration (days) 6 4 10 I I 3 14 6 9 2 7 5
In the given problem, A, B and C are the starting activities and G, l and Lare the
ending activities. Since an activity K is emanates from node 7 after the completion
E,=-0 of activities C, F, D and J, we need to draw a dummy activity to connect the activities
L,=0
-. . -~~~-~~~~--~};Jft~-- ~~;~~£!~~:;· ;?~.:- ·o~Tib"i8''.tfES~bJ{·
C and F to node 7. In addition, an activity J is emanates from node 6 after the
completion of activities E and H, a dummy activity is drawn to connect activities
'.'9l!F
'1!:"!11:··.:.
."..~ ?fJ;TW9RK .AlfALYSIS
.
,, -. ·
(t 0 +tp)/2+2tm t 0 +4tm +tp

1.e,t •• -~---
3 6
":•,, -~
..
--}
E and H. The network diagram corresponding to the given project is constructed as
shown in figure.
.
Vananceo f acttv1tyttmecr;
. . . 2 -tJ]2·
[<tp
= - --
6
'l,
PRoeLi:!Vls:oti PERT
y17) An organization has large number of activities but it is interested in controlling
a part of these activities to 7 number. The following data is available for these
activities.
Time (da 1s)
Activity· - Precedence
t t t
A -- 4 6 8
8 A 6 lO 14
c A 8 15 22
E,=6 D 8 9 9 9
L,=11 E c 10 . 14 18
Calculate Earliest starttime(E) and Latest finish time (L) in forward and backward F A 5 5 5
direction starting from node I and node 9 respectively and enter those values near to G D,E,F 8 10 12
the nodes. i). Draw a PERT network for the activities.
The critical path is 1-3-6-7-8-9, because the values of E and L of nodes along this ii). Identify the critical path and its duration.
path remains equal. The project duration is 24 days. iii). If the organization puts 47 days as dead line to complete, what is the
probability of completion in 47 days. Jan 2018 (12M)
5~1 o··PROGRA1VlME:i.yA'~U'AT1()ij~it:if;>'.~R~Vl~W TECHNl.QUE'(PE.RTf are shown in table.
• PERT is used to handle the projects, where the time duration for each activity is Activi'ty A 8 c D E f. G
not known with certainty. Preceded by - A A B c A D,E,F
• PERT is a random variable which uses the probability (i.e. p distribution) Successor activity B,C,F D E G G G -
distribution to represent the time of activities. From the data, A is the starting activity and G is the ending activity.
The p distribution of activity times is based on three time estimates. They are : The PERT network for the activities is construcied as shown in figure.
:i.) Optimistic' time (t0 or a):
The shortest possible time required to com..pJ~e a.l!J~ctivity if ~verything
g~-~~~I. No. provisions are made for delays while estimating this time.~ · ·
b) Pessimistic time (tP orb):
The longest possible time the activi!Y__~guld take-10. !;Q~ under
extremely bad c~[ldi!lons-:-Ifowevei;s~ch conditions do not include naturakalamities
likeearthcjuakes, floods, etc;
c) Most likely time (t or m) : Calculate the expected completion time (t,) of an activity and variance (cr2 ) using
It refers to th~ nonnal tim~.ill! ~ctivlty_woJJld take ur1ckr i~rating the relations
CQJ!-cli!iml.§.,
Expected time or Mean time (t0 or µ) of an activity is also called weighted average of
three time estimates is the arithmetic mean of(to + tP'V2 and 2tm
..
tc
(t 0 +4tm + tp)
6
and
0PERATI?l'ls RaE.\R.ce NETwORK Arf.Ai.YSJS .•
T. -T 47-45
:. Normal deviate Z =-5--c =--=0.702
a 2.85
'~:. ~:;~{21~l~%fr~::; ~ . :
2 Z= 0.7-02
0
2
~
(
T
t -t
)
areshown in the table From normal distribution table
<'.\t Z = 0. 702, the probability= 75.8%
Activity t0 tm t.
p
tc
(t 0 +4tm + tp)
6
0 2 =( tp ~to J ·'
18) R and D activity has 7 activities for which the three-time estimates are given
below along with its preceding activity.
Optimistic time Most likely time Pessimistic time
1-2 4 6 8 6 0.44 Activity Precedence
(a) (m) (b)
2-3 6 JO 14 10 1.78
2-4 8 15 22 15 5.44
A -- 4 6 8
B A 6 10 12
2-5 5 5 5 5 0
c A 8 18 24
3-5 9 9 9 9 0 D B 9 9 9
4-5 10 14 18 14 1.78 E c 10 14 18
5-6 8 10 12 10 0.44 F A s 5 s
Calculate the Earliest expected completion time (E) and Latest expected G D,E,F 8 12 JO
completion time (L) all activities using expected completion time of each activity i) Draw PERT network.
shown in figure and show those values near the nodes of a network drawn with ii) Find EST, LST and slack for each node.
expected completion time ,as an activity duration. iii) Find critical path and expected project duration.
E3=16 Jan 2015 (14M) I Jan 2007 (08M).
L=26
~3 Sol. The sequence of activities together with their predecessor and successor relationships
3 are shown in table.
Activity A B c D E F G
Prece<ldl by - A A ·B c A D,E,F
Successor activity B,C,F D E G G G .
The network corresponding the given activities is constructed as shown in figure.
E, = 47/3
i J) L3 = 85/3
E4=21 0(9)
L4=21
ii) The critical path is shown by two lines, where the nodes have E and L values
equal. The critical path is 1-2-4-5-6 and the expected completion time for the project
is 45 days
iii) Expected le~th of the project I critical path E, = 70/3
Te =IA +tc +tE +tG=6+15+14+10=45days L, = 70/3
i Variance of the project I Critical path Calculate the expected completion time (t) and variance (cr2 ) for all activities using
the three time estimates given in the table using the relations.
o 2 =o / + o/ +a/+ aG 2 =0.44+5.44 +1.78+ 0.44=8. I days
( t +4t +tp}
0 01
T, =Original schedule time of completing the pmject = 47 days te and
6
Te =45days
0 2=CP ~to J
··r
:.:~,f:q:;~-~--.~~~:~~~~~~lf~-~~t~~1~l9'-~~~~~.
-~~< ,, 'lt~aiir:A.~Y8i&:: . ·;L~~~~~~f~~:
Activity t. tm t. t. (J2 EST LFT LST Slack
1-2 ·4 6 8 6 0.44 0 6 0 0
2-3 6 10 12 29/3 I 6 85/J 18.67 12.67
2-4 8 18 24 5213 7.11 6 70/3 6 0
2-5 5 5 5 ·5 0 6 . 112/3 32.33 26.33
. 3-5 9 9 9 9 0 47/3 '112/3 28.33 12.66
4-5 10 14 18 14 1.78 70/3 112/3 23.33 0
5-6 8 10 12 10 0.44 112/3 142/3 37.33 0 E,=d
L,= 15
11) Since EST and LFT are calculated by taking into account the expected completion
Calculate the expected completion time (t.) and variance (cr2) for all activities using
time of an. activity as a duration of that activity, LST is obtained by using the relation the three time estimates given in the table using the relations.
LST= LFT- te
{t0 +4tm +tp)
iii) The critical path is shown by two lines drawn between the nodes, where E and L t and
e 6
values are equal.
The critical path is 1-2-4-5-6 and expected project duration
T,=tA +tc +tE +t 0 cr2=(1P ~t. J
T = 6 + 52 + 70 + ~ + I 0
e 3 3 3 Activity t_ t_ t_ t_ (J2
142 A 2 4 12 5 2.78
T =-=37.33+ 10=47.33weeks
e 3 B IO 12 26 14 7.11
19) A small -project consists of EIGHT activities has the following characteristics.
c 8 9 JO 9 0.11
Time estimates j weeks) D JO 15 20 15 2.78
Activity Preceding activity E 7 7.5 II
t t t 8 0.44
A -- 2 4 12 F 9 9 9 9 0
B -- 10 12 26 G 3 3.5 7 4 0.44
c A - 8 9 10
H
D JO 15 5 5 5 5 0
A .. 20
E A 7 7.5 II Calculate the Earliest expected completion time (E) and Latest expected
F B,C 9 9 9 completion time (L) of each activity shown in figure and show those values near the
G D 3 3.5 7 _nodes of.a network drawn with expected completion time as an activity duration.
H EFG 5 5 5 ii) The critic;al path is shown by two lines drawn between nodes, where E and L
i) Draw the PERT network for the project. values are equal.
ii) Determine the critical path and prepare the activity schedule for the project. The critical path is 1-2-4-5-6 and the expected completion time of the project is
iii)If a 30-week deadline is imposed, what is the probability that the T,=tA+t 0 +t 0 +tH=5+15+4+5=29weeks (o·
2 2 2 2
project will be complcled within the time limit. July 2014 (ISM) cr =cr / + c; 8 + cr 0 + cr 0 = 2.78 + 2.78 + 0.44 + 0=$Qweeks
Sol. The sequence of activities together with their predecessor and successor relationships • o <Y-M c;. k
var1ancecr- =111.y1wee s
are shown in table. ....h~J.\Oi d d ..
:.cr=~weel<s=stan ar deviation
T, =Originaischedule time of completing the project =30weeks(Bydata)
Preceded by - - A A A B,C D E,F,G
T,=29weeks
Successor activity C.D,E F F G H H H -
The network corresponding to the given activities is constructed as shown in figure
.. -- T. -T 30-29 ·
:.NormaldeviateZ =-5- - " =--=0.3498
2.'fl\.q
<.'.'-
:; O~Tii:>nll R,EsEARCH
•t
NE'J'WORK ANALYSIS
Activity t0 tm tp
t•
{10 +4tm + tp)
a
..J
-----
cp-to
2 = --
. CJ 6 6
From normal distribution-table,
O.'-\O
At Z =<Y.J'4m; the probability of completing the project within the time limit 1-2 I "'° 2
3 2 0.11
iso.65~ i.e.6!.'9ro 2-3 l 2

3 2 0.11
2-4 I 3
5 3 0.44
,20) A project schedule has the following characteristics:
8-10 9- 10
3-5 3 4
5 4 0.11
2-3 2-4 3-S 4-5 4-6 S-7 6-7 7-8 7-9
·Activity 1-2
4-5 2 3 4 3 0.11
s s 7 4 6 2 5
Im 2 2 3 4 3
4-6 ...
.) 5 7 5 0.44
2 3 4 6 2 4 I 3
I I I 3 s~1 4· 5 6 5 0.11
·~ -
6 8 3 7
I 3 3 5 s 4 7 6 8
6-7 6 7 8 7 0.11
' a project work, identify the critical path and its expected duration and
i). Draw 7-8 2 4 6 4 0.44
variance. 7-9 4 6 8 6 0.44
ii). What is the probability of completing the project in 30-day schedule time?
-0{i). What due data has 90% chance of being met? July 2015 (lOM) 8-10 l 2 3 2 0.11
Sol. The network corresponding to the activities given in the problem is constructed as 9-10 3 5 7 5 0.44
shown in the figure. Calculate the Earliest expected completion time (E) and Latest expected
E3=4 completion time (L) of each activity shown in figure and show those values near the
L 3=8 nodes of a network drawn with expected completion time (t) as an activity duration.
i) The criti<;:al path is shown by two lines between nodes, ~here E and L values are
equal. The critical path is 1-2-4-6-7-9- I0 and the expected completion time for the
project is 28 days.
ii) Expected length of the project/critical path.
T.=2+3+5+7+6+5=28days and
Variance of the project I critical path
E, 0=28
cr 2 =0.I I+0.44+0.44+0.l l+0.44+0.44 ,.~
L, 0=28
cr 2 =1.98 days
Q
E6=10 T, =Original schedule time of completing theproject = 3-0days
L6=10 (T5 -T,) 30-28
2 :.NormaldeviateZ l.42
Calculate the expected completion time (t.) and variance (o ) for all activities using CT 1.41
the three time estimates given in the table using the relations. Z=l.42
( t +4tni +tr)
0 From normal distribution table,
t. and
' 6 AtZ=I .42, the probability of completing theprojectis0.9222 i.e. 92.22%
(J
2
= (tr
-- -to)'
6
iii) If the probability is 90% i.e. 0.9
For p = 0.9, Z = I .29 (from table)
Then,
Z= T5 -Te ~ l.l 9= T,-28
(J 1.41
T, =29.82daysi.e,duedate
-
21) The following table gives the activities in
related information:
OPERATIONS REsEArice
a construction project and other
NE'J?()~ 4!!'A:'-'l'~J!,,Jf ,:, ·- ...
ii) The project duration i.e. expected length of fhe project T. = 31+5+2+ 18=56 days.
iii) The critical path is 1-2-3-4-5
"Activity t_ t_ t.. iv) Variance of the project
2
I-2 20 30 46 cr =18.78 + 0.44 + 0.11+4=23.33days
1-3 9 12 21 T, =Original schedule time of coi\ipleting the project= 50days
2-3 3 5 7 T, = 56days
2-4 2 3 4 · T.-T 50-56
3-4 1 2 3 :. NormaldeviateZ =-5- - ' = - - = -1.24
(j 4.83
4-5 12 18 24 From standard normal probability table,
i) D·raw a pert network.
ii) Calculate project duration. At Z = - I .24, the probability that the project will be completed within deadline
iii) Find the critical path. is0.1075 i.e.10.75%
iv) Find the probability that the project will
be completed within 50 days.
Jan 2014 (14M) 22) The activities in a project are defined by three-time estimates - optimistic, most
Sol. The network corresponding to the given activities is constructed as shown in figure. likely and pessimistic, the values of which arc shown below:
E,=31
Activity I - 2 2-3 2-4 3-5 4-5 5-6
2}b=31 t days I I I I 2 2
13) t days 2 4 2 2 3 3
t days 3 7 9 9 4 4
Draw the network and determine,
i). Expected completion time of each activity;
ii), Expected completion time of the project;
E, = 36
L, =36 iii) Probability of completing the project in 14 days (for a Z value of 1.6, area
Calculate the expected completion time (t and variance (a 2} for all activities using
0
) under normal curve is 0.877). July 2011 (9M)
the three time estimates given in the table using the relations. Sol. The network diagram corresponding to the given activities is constructed to the given
activities is constructed as shown in fi~re.
{t +41m+!p)
0
t, and 3
6
cr' =CP ~to J

Activity t" tm tn te (j2
1-2 20 30 46 31 18.78 E, = 5
L, =6
1-3 9 12 21 13 4
Calculate the expected completion time (t,) and variance (cr 2) for all activities using
2-3 3 5 7 5 0.44 the three time estimates given in the table using the relations.
2-4 2 3 4 3 0.11 {t +41m +tp)
0
3-4 1 2 3 2 0.11 t, and

6
4-5 12 18 24 18 4
Calculate the Earliest expected completion time (E) and Latest expected completion
time (L) of each activity shown in figure by taking the expected time (t,) as an activity
(j2 =Cp ~to J
duration and show the values of E and L close to the nodes.
""
OPERATIONS REsEARCH NETWORK ANALYSIS
4111
Activity t
0
tm tp
(t 0 +4t~ +IP)
crz =(tr ~to J
1-2 I 2 3 2 0.11
2-3 I 4 7 -4 I
2-4 I 2 9 3 1.77
~-5 I 2 9 3 . 1.77
4 3 4 'E =8
4-5 2 3 0..11
' = 26.5
L,
5-6 2 3 4 3 0.11
Calculate the expected completion time (t.) and variance (cr2) for all activities using
Calculate the Earliest expected completion time (E) and Latest expected complet1011·
the three time estimates given inthe table usini,r;:he relations.
time (L) of each activity shown in figure by taking the expected completion time (t)
(t 0 +4tm +tp)
as an activity duration and show the values of E and L around each node. ' t. and
The critical path is 1-2-3-5-6. 6
Expected completion time of project
T,=2+4+3+3 = 12 days crz =( tP ~to J
T. -T
Normal deviate Z =-5- -0
cr Activity t_ tm tn t_ crz
The variance of the project 1-2 8 7 9 7.5 O.Q3
cr2=0.l l+l+l.77+0.l I= 2.99 days 1-3 18 16 20 17 0.11
cr = 1. 73 days. 1-4 9 7 11 8 0.11
T,= 14 days (given)
2-5 10 9 11 9.5 0.03
T,= 12 days
3-5 24 20 28 22 0.44
:.Z=l4-12=1.l 6
1.73 4-6 16 14 18 15 0.11
From standard normal probability table 5-6 3 2 4 2.5 0.D3
At Z = 1.16, the probability of completing the project in 14 days is 0.8770 i.e. 87.7% Calculate the Earliest expected completion time (E) and Latest expected completion
23) A project is composed of7 jobs whose time estimates are given below: time (L) of each activity shown in figure by taking the expected completion time (t.)
- -
as an activity duration and show the values of E and L around each node.
Activity I-2 I- 3 1-4 2-5 3- 5 4-6 5-6 The critical path is 1-3-5-6.
Most likely time 7 16 7 9 20 14 2 Expected completion time of project
Optimistic time 8 18 9 10 24 16 3 T,= l 7+22+2.5 = 41.5 days
Pessimistic time 9 20 II 11 28 18 4 The variance of the project
i) Draw the network and calculate the length and variance along the critical path. cr 2=0. I I+0.44+0.03 = 0.58 days
ii) Find the probability of completing the project one day earlier and 2 days Standard deviation cr = 0.76 days.
later. June 2012 (lOM) ii) a) T,= 41.5 days 0
Sol. The network corresponding to the given activities is constructed as shown in the IfT,= 40.5, then,
figure.
. z=
Norma. 1dev1ate T5 -
- T,
- 40.5 - 41.5 - l ..>,., l
cr 0.76
From standard normal probability table,
At Z = -1.31, the probability of completing the project is 0.0951 i.e. 9.51 %.
ii)b) T,= 4l.5 days
... IfT,= 43.5 days then,
z =Ts- T 0 43.5-41.5
2.63
OPERATIONS ~~p~
>
NETWORK ANALYSIS
Activity t0
tm tp
t.
(t +4tm + tp)
0
cr2
-J
=Cp ~t.
cr 0.76 · 6
At Z = 2.63, the pro?ability of completing the project is 0.9957 i.e. 99.57%.
1-2 I I 7 2 I
..t 24) A project consists of activities as given in the table:
1-3 2 2 8 3 I
Time (da"s)
Activity Precedence 2-4 I 4 7 4 I
t t t
A -- I 7 I 2-5 0 0 0 0 0
8 A I 7 4 3-4 0 0 0 0 0
c - 2 8 2 3-5 0 0 0 0 0
D 8,C I I I 3-7 2 5 14 6 4
E c 2 14 5 4-6 I I I 1 0
F A,C 2 8 5
5-7 2 5 8 5 I
G D 3 IS 6
i). Draw the project network. 6-7 3 6 15 7 4
ii). Identify the critical path and determine the expected completion time of project. Calculate the Earliest expected completion time (E) and Latest expected completion
iii). What is the probability that project would be completed in 17 weeks? time (L) for all activities taking expected completion time (t.) of each activity, as.
July 2017 (16M) activity duration by following the procedure used in CPM network.
E0 =7
Sol. The sequence of activities together with their predecessor and successor relationships L =7
are shown in table. ) t i6'
Activity A 8 c D E F G
Predecessor - A. - 8,C c A,C D
E1=0
Successor activity B D D,E,F G - - - L1=0
In the given problem, A and C are the starting activities, whereas, E, F and Gare
ending activities. One dummy activity is drawn between the nodes 3 and 4 to connect,
as an activity D emanates after the completion of both Band C activities. Similarly, 2 E3=3
dummy activities are drawn from nodes 2 and 3 to the node 5 to connect the activities L3=6
A and C to emanate an activity F from it. ii) The critical path is shown by two lines between nodes, where E and L values are·
The network corresponding to activities involved in the project is constructed as equal. The critical path is 1-2-4-6-7 and the expected completion time for the project
shown in ligure. is 14 weeks.
iii) Expected length of the project/critical path.
Tc =tA +tB +to +tG
= 2 + 4 + I + 7 = 14 weeks
Variance of the project or critical path
o"=aA2 +0B2 +002 +crG" •
=I+ I+ O+ 4=6weeks
Calculate the expected completion time (t) and variance (cr2) for all activities
T, =Original schedule time of completing the project= 17 weeks
using the three time estimates given in the table using the relations.
(t +4tm + t ) T, =17weeks
0
te P and
T. -T 17-14
6 :.NormaldeviateZ=-5- - e =--=1.22
cr" =CP ~tu J 0 2.45

... · From nonnal distribution table
At Z = 1.22, the probqbility is 0.8888 i.e, 88.88%
OPERATIONS REsEARCH r:N~~~'~AliiLYsrJiii~tti~f!Jf~~l~~tzi{~:}-,BJ:4_,··:' :;:·<·)~i-
3-5
3-6
5
I
II 29
4 7
13
4
-
16
I
4
1
4-8 7 13 31 15 16 4
25) · The figure shown below indi"1tes the project network along with three time 5-7 5 II 17 II 4 2
estimates for each activity 6-7 2 5 14
2-5--8 6 4 2
7-8 2 2 8 3 I 1
11 Calculate the Earliest expected completion time (E) and Latest expected completion
time (L) of each activity shown in figure by taking the expected time (te) as an activity
duration and shows the values of E and L close to the nodes.
ii} Expected length of project
Te=6+ 13+11+3=33days.
iii) The critical path is 1-3-5-7-8.
iv) Variance of critical path
cr~=4+ 16+4+ I =25days
i) Number the nodes as per Fulkerson's rule.
ii) Value of expected time, standard deviation and variance of each activity. v) T,= 38 days (data)
Te= 33 days
iii) Critical path. cr = 5 days
iv) Variance of critical path.
v) Probability of completion of project in 38 days. Feb 2006 (12M) T -T 38-33
NormaldeviateZ =-s__e =--=I
Sol. The nodes of the project work given are named as shown below. Cj 5
}-9-27
B(ll) )
©
4 7-13-31
C(l5) )
~
S
E,= 16 At Z= I, the probability of completion of project is0.8413 i.e. 84.13%
L, = 18
26) A project has the following characteristics:
Task I-2 I -3 2-3 1-4 3-5 4-5 4-6 5-7 5-6 6-8 7-8
Leasttim<! 4 5 8 2 4 6 8 5 3 5 6
Greatest time 8 10 12 7 IO 15 16 9 7 II 13
Most likely time 5 7 II 3 7 9 12 6 5 8 9.,,
£/E,= 10 Find the earliest and latest expected times for each event. Also, find critical path
. L, = 16 and variance for each event. Aug 2005 (14M)
Calculate the expected completion time (te) and variance ( cr 2) for all activities using Sol. The network corresponding to the given activities is constructed as shown in figure
the three time estimates given in the table using the relations.
(t 0 +4tm +tp)
t, and
6
=Cl'~ to )
2
Cjl
Activity t, t_ t_ t_ cr2 Standard deviation

1-2 2 5 8 5 I I
1-3 2 5 14 6 4 2
2-4 3 9 27 11 16 4
m,, ::l~·:t?~no~•.~~9~ ~~
:r;,~
..
--- :,
·:::fi~~~~v.$~~'~:'\:(·~,·.,: ;m!i~-u~1~tj1:t~~-
Calculate the expected completion time (t.) and variance (a2) for all activities using
the three time estimates given in the table using the relations. e. Find the probability that the project is completed in 36 weeks.
f:~·
f. If the project manager wishes to be 99% sure that the project is completed
{t 0 +4tm +tp) ;:
t. and on June 30, 2007, when should he start project work?
6 i:
July 2007 (20M)
2
Sol. The sequence of activities together with their predecessor and successor-relationships
_(tp
u-
2
--t-
0
J are shown in table.
6
t_ cr2
ACtivity t" t t. Preceded by - - A B D,A B C.E.F G
1-2 4 5 8 . 5.33 OA4 Successor activity C,E D,F G E G G H -
1-3 5 7 10 7.17 0.69 The network corresponding to the given activities is constructed as shown in figure.
' ,,......
2-3 8 II 12 10.67 0.44 2
1-4 2 3 7 3.5 0.69
3-5 4 7 JO 7 l
4-5 . 6 9 15 9.5 2.25
4-6 8 12 16 12 1.78
. 5-7 5 6 9 6.33 0.44
5-6 3 5 7 5 0.44 .l2} E,= 10
L,=10
6-8 5 8 IL 8 I Calculate the expected completion time (tJ and variance {u1) for all activities using
7-8 6 9 13 9.17 1.36 the three time estimates given in the table using the relations.
Calculate the Earliest expected completion time (E) and Latest expected completion (t 0 +4tm+t)
time (L) of each activity shown in figure by taking the expected time (t0 ) as an activity t P and
c 6
duration and shows the values ofE and L close to the nodes. 2
The critical path is 1-2-3-~7-8 and corresponding variance are shown in table for
CJ= (tp-to)
2
--
each activity. The variance for the critical path is a2 = 0.44+0.44+ I +0.44+ l .36=3.68 6
time units.
»~27) Consider a project having the following activities and their time estimates:
Activity t_ t_ t_ t, u2
·:.F Immediate Activity Time (Weeks) 1-2 5 4 6 4.5 0,03
Activity l-3 12 8 16 IO 0.44
Predecessor Most Optimistic Most likely Most Pessimistic
A -- 5 4 6 2-4 0 0 0 0 0
.. 2-5 5 4 12 5.5
B -- 12 8 16 1.36
c A 5 4 12 3-4 3 I 5 2 0.11
D B 3 I 5 3-5 5 4 6 4.5 0.03
E D,A .2 2 2 4-5 2 2 2 ,_ 2 2
F B 5 4 6 5-6 14 LO 18 12 0.44
G C,E,F 14 10 18 6-7 2-0 18 34 21 5.44
H G 20 18 34 Calculate the Earliest expected completion time (E) and Latest expected completion
a. Draw the project network and number the nodes as per Fulkerson 's rule. time(L) of each activity shown in figure by taking the expected time (t.) as an activity
b. Find the expected duration and variance for each activity. duration and shows the values of E and L close to the nodes.
c. Determine the critical path and the mean project completion time. ii) The critical path is 1-3-5-6-7 and mean project completion time is
d. Calculate the variance and standard deviation of the project length.
;);:'
... __
T, =t 8 +tF +ta +tH

,~ _)if:'~i:~!'~:p~~iJ;blWlclJ ·
= 10+ 4.5+12+
- .
21=47.5weeks
Variance of the project length
cr2=cre2 +cr/ +cro2 +a/
E =22
=0.44 + O.o3 + 0.44 + 5.44 =6.35weeks ~=22
St~dard deviation of the project length
E• =8 ~ ,_, J(~
cr=N'='16.35 = 2.52weeks ~=~
~=8 ~=M
. "[ -T
Normal deviate Z =-5- -0 Calculate the expected completion time (t0) and variance (cr2) for all jobs (i.e.activities)
C1
using the three time estimates given in the table using the relations.
butT, =36weeks(given) (t 0 +4tm +tp)
T, =47.5weeks t, and
6
z 36-47.5 =-4.56
2.52
Al'~rthe standard nonnal probability table,
cr2=CP ~to J
Z= -4.56,is not available that is lowest value of proba?ilityequalto zero i.e, 0% Activity ( t t. cr2
t"
iii) If probability= 0.99, then,. 1-2 I 2 9 3 l.78
Z099 = 2.34 from standard normal probability table 2-3 I 4 7 4 I
Z= Ts-T. 2-4 2 4 12 5 2.78
(] 3-4 0 0 0 0 0
T, -47.5 3-5 2 3 4 3 0.11
234
2.52 3-7 6 8 16 9 2.78
. T5 = 53.4 weeks. '< 4-5 4 6 8 6 0.44
_,~,.,
.\~" The original schedule time of completing the project =53.4 weeks. 4-6 3 5 7 5 0.44
tJP- 1 - 5-6 0.5 I 1.5 I 0.03
5-7 5 7 15 8 2.78-
28) T he following table lists the jo~s wit 1 their time estimates: 6-7 3 5 13 6 2.78
'f· Activity I - 2 2-3 2-4 V3-4 3-5 3-7 4-5 4-6 5-6 5-7 6-7
5 3 Calculate the Earliest expected completion time (E) and Latest expected completion
t_ I I 2 0 2 6 4 3 0.5
8 6 5 I 7 5 time (L) of each activity shown in figure by taking the expected completion time (t0 )
t_ 2 4 4 0 3
4 16 8 7 1.5 15 13 as an activity duration and show_ the values ofE and L around each nodes.
t 9 7 12 0
- - - ~ I ~ _ W_ ii) The critical path is 1-2-4-5-7
i) Expected length of project/critical path
ii) Draw the network.
T =3+5+6+8= 22 days
iii) Find critical path.
iv) Find probability of completing project in 25 days. Jan 2010 (12M) Varia~ce of the project/critical path
cr2=1.78+2.78+0.44+2.78=7.78 days
:. a= 2.79 days
\
-;~~~-~- ·~~·- .:.;\-~~5?iftt:~;;'.f~,~'1°··· ·N~o,Rl['4!~~-ff~f4j$}~g~}}fr,f:l;~,;~,;:·.:,,ifj_ __
·"·•>:,' x£PfJ'~;';'~i~~~~~mr~~l£\Rbe
iv) T,= Original schedule time of comleting the project= 25 days Activity tn tm tn • t. a2
T.= 22 days 1-2 3 6 15 7 4
o = 2.79 days 1-6 2 s 14 6 4
then, 2-3 6 12 30 14 16
T. -T 25-22
NormaldeviateZ =-5- - • =--·- = 1.07 2-4 2 s 8 5 I
O" 2.79. 3-S s II 17 11 4
At Z= 1.07, the probability of completing the project is 0.8577 = 85. 77%
4-5 3 6 15 7 4
29) The tielow table shows the jobs of a network along with their time estimates. S-8 I 4 7 4 I
The time estimates are in days: 6-7 3 9 27 II 16
Jobs I -2 1-6 2-3 2-4 3 - 5 4-5 5-8 6-7 7-8 7-8 4 19 27 17.83 14.69
a 3 2 6 2 5 3 I 3 4 Calculate the Earliest expected completion time (E) and Latest expected completion·
m 6 s 12 s II 6 4 9 19 time {L) of each activity shown in figure by taking the expected completion time (t.)
b IS 14 30 8 17 IS 7 27 27 as an activity duration and show the values of E and L around each nodes.
i) Draw the project network. ii) The critical path is 1-2-3-S-8
it) Find the critical path. i) Expected length of project
iii) Find the probability that the project is completed in 31 days. T.=7+14+11+4 = 36 days
June 2010 (ISM) T0= 36 days
Sol. The network diagram corresponding to the given activities is constructed as shown Variance of the project
in figure. o2 = 4+16+4+1=2S days
a2= 25 days
Standard deviation o = '5.s = S days.
E2 =7 T,= 31 days (given)
L,=7 E,=36
L,=36 T0= 36 days
CJ= 5 days
T. -T 31-36
:. NormaldeviateZ=-5- -0 =--=-!
0 s
Z=-1
E,=0 ,., E =6 From standard normal probability table,
L, = 0 L:= 7.17
At Z= -I, the probability that the project completed in original schedule.time is1l. I587
Calculate the expected completion time (t0 ) and variance (o2) for all activities using
the three time estimates given in the fable using the relations. i.e,IS.87%
(t 0 +4tm +tp) .
t - and
e 6
2
CJ 2 -(tp
- --t.
-) ...
6
Pll!t~~~~;~\,-~· . •· ··'"':;fo\;~i':~J;f~ti1~~~1tt~Jiiifui
w~~~~M1t~~~"~;;:1:r:>:;;,~·;j1~~%·,x~f°5~~;·,\·;g1;rf~:;.Si~,~r:Zi~":1:;A~j?l~~•ii•
•:-"
j 30) Consider a project having the following 12 activities and their time estimates:
Prec~ing Activity Tune (Weeks) ( t +4tm +tp)
0
Activity t
6 and
activit¥ Optimistic Most likely Pessimistic e
A - 4 6 IO
2 (tp -t 2
B - 3 7 12 0 = - -)
6
0
c A 5 6 9
D A 2 4 6
E
F
B
B
6
3
10
4
20
7
Activity t0 tm tp t.
(1 0 +4tm + tp)
6
cr 2 -(Ip
- . --t
6-
J
0
G C,D 5 9 15 "
E. 1-2 4 6 10 6.33
H .- J 7 12
,.
1
I C,D 2 4 5 1-3 3 7 12 7.17 2.25
J G,H 1 3 6 2-4 5 6 9 6.33 0.44
K F 2 5 8 2-5 2 4 6 4 0.44
L J,K 2 2 6 3-6 6 IO 20 11 5.44
1) Draw the network and find the critical path.
ii) Find the expected time duration and variance for each activity.
3-7 3 4 7 4.33 0.44
iii) Calculate the standard deviation of the project. 4-8 5 9 15 9.33 2.78
'1 iv) What is the probability of completion of project at least two weeks earlier 4-10 2 4 5 3.83 0.25
than expected? June 2010 (16M) 5-4 0 0 0 0 0
Sol. The sequence of actiyities together with their predecessor and successor relationships 6-8 3 7 12 7.17 2.25
are shown in the table.
7-9 2 5 8 5 I
Activity A 13 c D E F G H I J K L
8-9 l 3 6 3.17 0.69
Preceded by - - A A B B C.D E C,D G,H F J,K
9-10 2 2 6
Succ~ssor activity C.D E,F G,I G,I H K J J - L L - 2.67 0.44
The network corresponding to tqe given activities is constructed as shown in figure ·~~-~1'.' L
Calculate the Earliest expected completion time (E) and Latest expected completion
A and B are the starting activities, where as, I and Lare ending activities. time (L) of each activity shown in figure by taking the expected completion time (t)
as an activity duration a.nd show the values of E and L around each nodes.
i) The critical path is 1-3-6-8-9-l 0, as the values or E and L along this path are equal
at all nodes.
iii) Tfie expected length of the project is
Tc =1 8 +tE +tH +tJ +IL
= 7.17+11+7.17 +3.17 +2.67 =3 I. I 8weeks
Variance of project length
a-' =cr 8 - +aE- +aH-' +crJ-., +aL-.,
; ;
=2.25 + 5.44 + 2.25 + 0.69 + 0.44 =I I .07weeks

a= Jll§i = 3.33weeks
7JE,=115 iv)T, = 29. I 8weeks(i.e. 2weeksearlier than expected)
L7 = 23.51
2
Calculate the expected completion timtll(t) and variance {cr for all activities using
)
T, = 3 l.18 weeks
the three time estimates given in the table using the relations. 0=3.33weeks
... then,
. Z Ts-T. 29.18-31.18
0PERATI01'8 REsEAJtce
N-Eri<>~ .b.u.y~J'j'.\'.'.t? ?:: ,-:~ 11::1;t~~'.Wiff1f~5:·:r\:·>{/· .. ...
·,
Norma Id ev1ate =--. = - 060

.
CJ 3.33 ~.ll•c
At Z= -0.60, the probability= 0_.2743
i.e. The probability of completing the project 2 weeks earlier than expected is 27.43%
f~) Following data refer to a project:
Immediate Optimistic Most likely Pessimistic
\:--~-\~
~ Activity
Predecessor Time<Hrs) Time <Hrs) Time <Hrs)
·A -- 4 6
s
8
B -- I 4.5
c A 3 3 3
D A 4 s 6 2.) E, :4 \2) E, = 18
L,-9 L,=18
E A 0.5 I 1.5
F BC 3 4 s Calculate the expected completion time (tJ and variance (u 2) for all activities using
G BC l 1.5 s the three time estimates given in the table using the relations.
H EF s 6 7
t.
(t +4tm +tp)
0
and
l E.F 2 s 8 6
J DH 2.5 2.75 4.5 2
K GI 3 s 7 ?
u·= (
T
t -t )
a. Draw the network diagram.
b. Find out the ES, EF, LS, LF and slack for each activity.
c. Find out the variance and standard deviation for the critical path. Activity tn t,,, t_ t. cr2 EST EFT LST LFT Slack
d. Determine the probability of completing the p,roject in 24 hrs. 1-2 4 6 8 6 0.11 0 6 0 6. 0
· Jan 2016 (20M) 1-3 I 4.5 s
4 0.44 0 4 s 9 5
2-4 3 33 3 0 69 6
are shown. ; 9 0
Activity A 8 c ·o E F G H I J K
2-6 4 s6 5 0.1 I 6
II IS 20 9
2-5 0.5 I 1.5 I 0.03 6
Predecessor activity - - A A A B,C B,C E,F E;F D,H G,I
3-4 0 0
7 12 13 6
Successor activity C,D.E F,G F,G J H,I H,I K J K - - 0 0 0 4
4 9 9 s
In this problem, A and Bare the starting activities and J and Kare the ending activities. 4-5 3 4 5 4 0.11
9 13 9 13 0
A dummy activity is drawn to connect the activities B and C as the activities F and 4-7 I 1.5 5 2 0.44
9 II 16 18 5
G emanates from the node 4. 5-6 .. 5 6 7 6 0.1 I
13 19 14 20 I
The network corresponding to the activities given is constructed as shown in figure. 5-7 2 5 8 s I 13 18 13 18 0
6-8 2.5 2.75 4.5 3 0.11 19 22 20 23 I
• 7-8 3 5 7 5 0.44 18 23 18 ')"
-J 0
11) Since EST and LFT are calculated by takmg into account the expected time (t,, of
an activity as a duration of that activity. EST, EFT, LST, LFT and slack are shown in
table . EFT and LST are calculated using the relations.
EFT= EST+te
LST= LFT- tc
iii) The critical path is 1-2-4-5-7-8
.. ..
The expected project duration
T,=t"+tc+tF+t 1 +tK
'.: .
-~ :;~;~~!f:@~:Zft::~1~:. -~~-; ·QP~fi~i!i:t{aijj(~e · NEiWQRK AKALYSW::,:.{;:'5%~~Jii-~ jj:~~!:~; i:J·.•.
Crash cost
(Maximurit (C.)
/(Crash point)
,
..
~'.~~~~?
= 6 + 3 + 4 + 5 + 5= 23 hrs cost) '•,, Linear cost-time

~er 2 Direct '•,vrelationship
0 -_ a A 2 +a C 2 +a F2 +";j'2
2
=0.11 +0+0.11 +I +0.44

I K
t cost ',
Normal cost '•,, / (Normal point)
2
a =1.66 hrs(variance) (Minimum (C.) '
cost)
CT= 1.29 hrs(standard deviation)
(T.) Crash time Normal time (T.,)
l(T, =24hrs(given) (Minimum time) (Regular time)
T. = 23hrs - Activity duration
a =l.29hrs It is ·observed from the figure that project cost decreases with increase in the activity
then, the normal deviate, duration. If the activation duration is further increased beyond the point N, decrease in the
cost is insignificant. As the activity is decreased beyond C, the cost increases very rapidly
Z= Ts-T. =24-23 =0. 77 for insignificant change in the activity duration.
a 1.29
Crash time is minimum activity duration to which an activity can be compressed by
z = 0.77 increasing the resources i.e. by increasing the direct cost.
From standard normal probability table, The linear relationship exists between the cost and duration. The slope of the line gives
AtZ=0.77,the probabilityis0.7794 i.e.77.94% the increase in direct cost per unit time for accelerating the activity. This is known as cost
slope.
5.11 CRASHING THENETWORK Crashcost-Normalcost C.-C
Costs Iope= =--- 0
Each activity involved in the project are executed by consuming some resources and Normal time -Crash time T,, - T.
the cost associated with them. T_he cost of an activity generally tends to vary somehow ~c
Costslope=-
with the amount of time consumed by the activity. The total cost of the project is the ~ T
summation of activity costs depends upon the project duration time, but by increasing
the costs, the project duration can be minimized to some extent. Therefore, it is always ~.11.2 l~d,frect cost· . ; ;~.':.::;'.-b,::::'}.2sdJJ\.
necessary to balance between the costs and time to obtain an optimum project schedule
The cost associated with the administrative expenses, licence fee, insurance cost and
that leads to lowest possible cost and associated time for the project. The execution of any
taxes. The indirect cost is computed on per day, per week or per month basis.
project involves direct and indirect costs.
The indirect cost increases linearly with time as shown in figure.
5; 11.1 Direct costs .
The cost that directly involved in the execution of the activities using the n:sources such t
ti
as material cost, labour cost, equipment cost is called direct cost. The direct cost inc;eases
•
generally if the activity is done in a duration lesser than the normal.
Figure below shows the direct cost -time relationship.
-:a
0
u
u
2:!
.5
Time-
The sum of direct cost and indirect cost gives the total project cost.
As we know that the direct cost decreases with time and indirect cost increases with
-
cost, the optimum cost.
·pI>~;q~i~· ;JUsl!:ARcu
time, the total project cost curve will have a point on it, where the total cost is minimum as
shown in figure. The time corresponding to this point is called optimum duration and the
N~Q,~Ai~YBI$
1 32.
Activity
1·2 13
· :/. ·. '•.<·:i.L:i,·i1~~&i;~~~i\'.:_:::/.4P1
·_i-.~~'.~"'.'''~Rc>,BLE~S ON c11As"filtl§Jii!i.tifi:'~j'.t'.'°~{~·~
Consider the data of a project as shown in table below·
Normal timt: (wt:t:ks) •i.1 c<ISt(Rs.)
700
Crash time (weeks)
9
Crash cost (Rs.)
900
1·3 5 400 ' 4 460.
t 1-4
2-5
7
12
600
800
4
II
810
865
ti
0 3-2 6 900 4 1130
()
(ii 3-4 5 IOOO 3 1180

~ 4-5 9 1500 6
.. 1800
If the indirect cost per week is Rs. 160, find the optimal crashed project
completion time. '
Project duration~ Sol. i) Calculate the cost slope for all activities and show with normal and crash details
-
Normal time (T.):
Time Cost Time Cost Cost C -C
It is the regular time of completion of the project which is the summation of the normal Activity =-'--"
(weeks) (Rs) (weeks) (Rs) slope(Rs) T -T
time durations of the critical activities and normal direct cost (C n) (i.e. normal cost of all " c
activities) 1-2 13 700 9 900 50

Cra~h time (T) : 1-3 5 400 4 460 60
It is the minimum time durations of the activiiies along the critical path. 1-4 7 600 4 810 70
2-5 12 800 II 865 65
5.12 PROJECT CRASHING PROCEDURE
3-2 6 900 4 1130 115
i) Calculate the cost slope for the given activities. 3-4 5 1000 3 1180 90
ii) Draw the network diagram for the given activities using normal durations. 4-5 9 1500 6 1800 100
iii) Determine the critical path (or paths) among the different paths of completing the L: 5900
project and list out the critical activities. ii) Draw the network diagram for the given activities using normal durations .
iv) Find the total cost and normal duration of the project. .. •"'no) __...:.---::!'(z),JIJ"
v) Determine the crash limit for all critical activities and crash the critical activity with ~\~/'""~)
least cost slope to maximum possible extent to reduce the project duration.
vi) Calculate the new direct cost cumulatively by adding the cost of crashing to the current
direct cost.
Total cost= New direct cost+ current indirect cost.
vii) When critica_I activities are crashed and duration gets reduced, few more paths may
iii) List out the different paths of completing the project and identify the critical
become critical and are called parallel critical paths. When there is more than one
path (or paths) and activities along with the total cost
critical path in the network, the project duration reduces when either the critical
• Iteration -1
activity common to all critical paths is reduced or the suitable critical activities on
Path Duration (weeks)
different paths are reduced simultaneously.
1-2-5 = 13 + 12 = 25 -+ Critical Path
viii) Stop crashing when either all critical activities of critical path (i.e. original) are 1-3-2-5 =5+6+ 12 = 23
crashed or total cost starts increasing. The duration of_the project where crashing stops 1-3-4-5 =5+5+9 19
is called crashed duration and corresponding cost is called crashed cost. 1-4-5 =7+9 = 16
The duration of the project one stage/iteration prior to the stage where crashing is
stopped is called optimal duration and corresponding cost is optimal cost.
...,.. .
. )it~:.::~~£~·;;!~~i1~~ni>~&;~~c...
1-2-S is the critical path, 1-2 & 2-S are the critical activities and project duration is
~~i~(~~;U.U.i&~ .
We have,
2S weeks. -:::Total cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in direct cost
We have, =5900+(100 + 65)+~0
~otal cost= Total direct cost+ Indirect cost
Totalcost =Rs. 95 85 ----(3)
= S900+(2Sx 160)
Total cost = Rs. 9900 - --{I) On comparing equation (2) and (3), it has been noticed that total cost of iteration (3)
iv) Determine the crash limit for all critical activities and crash the activity/ is lesser than that of iteration (2), proceed to next iteration
nctwo.rk as per the minimum cost slope Iteration -4
Iteration -2 Path Duration (weeks)
Critical activity Crash limit (weeks) Cost slope (Rs) 1-2-5 = 11 + 11 22
4 @ }-critical Path
1-2 1-3-2-5 = 5 + 6 + 11 = 22
2-5 65 l-3-4-S=5+S+9 = 19
Note:- Crash limit= Normal time - Crash time. 1-4-5 = 7 + 9 16
Crash the critical activity 1-2 with minimum cost slope of Rs. SO by 2 weeks. Though, Critical activity Crash limit (weeks) Cost slope (Rs)
the crash limit of activity 1-2 is maximum of 4 weeks, it is to be crashed only for 2
weeks to retain the path 1-2-S as critical. The project duration reduces from 25 weeks
1-2
2-5
2 ®
to 23 weeks. After crashing, the path 1-3-2-5 becomes parallel critical path
we have, dl:- 1-3 @
Atal cost= Total direct cost+ Increase ii) direct cost due to crashing+ fficrease in indirect cost 3-2 2 115
=5900 + (2 x SO) .(~O 2-5
Total cost= Rs. 9680 ----(2) No common critical activity for two critical paths. The activity 1-2 has minimum
cost slope for the path 1-2-5 and activity 1-3 has minimum cost slope for the path
Since the total cost of iteration (2) is lesser than that ofiteration (I) (i.e. on comparing
1-3-2-5. Crash the paths 1-2 and 1-3 parallelly by l week to retain two paths critical.
equation (I ) & (2 )), proceed to the next iteration. The project duration reduces from 22 weks to 21 weeks.
Iteration -3 We haxe, ·
--f--
Path Duration (weeks) 4otal co.st= Total direct cost+ Increase in indirect cost due to crashing+ Increase in indirect cost
1-2-5 = 11+12 = 23) Critical
=5900+(100 + 65 + 50+60)+2lx160
1-3-2-5 = 5+6+12= 23 Path
Total cost= Rs.9535
-----··- . . - -
1-3-4-5 = 5+5+9 = 19 ----(4)
1-4-5 = 7+9 16 Since the total cost of iteration (4) is lesser than that of iteration (3 ), proceed to next
iteration.
Critical activity Crash limit (weeks) Cost slope (Rs) Iteration - 5
1-2 2 so Path Duration (weeks)
2-5 @ 1-2-5 = 10+ II =21}-c .. IP h
ntlca at
1-3 60 1-3-2-5 = 4 + 6 + II = 21 ...
3-2 2 115 1-3-4-5 = 4 + 5 + 9 = 18
2-5 @ 1-4-5 =7+9 = 16
Path 1-2 is already crashed to the maximum extent, no further crashing is permissible.
Although, activity 1-3 has minimum cost slope of Rs.60, crash activity 2-5, which
is common for both critical paths 1-2-5 and 1-3-2-5 by maximum of I week. The
project duration reduces from 23 weeks to 22 weeks.
... Critical activity
1-2
Crash limit (weeks)
I
0PERA'POllS JbsEARCH
Cost slope (Rs)

50
· lt~cj~ Aliiii&fi·f
- .. - . -~ - .. _ - ·=•'-'7":,_ -
Nonna!
-
Crash
••.
~:,~
Activity Cost = c, -c.

2-5 Time Time Cost
Cost (Rs) slope(Rs.) T• -1c
(days) (days) (Rs)
1-3
A 4 60 3 90
3-2 2 115 3Q
B 6 150 4 250
2-5 50
·c 2 38 I 60
Crash the activities 1-2 and 3-2 parallelly by I week. The project duration reduces 22
from 21 weeks to 20 weeks. D 5 . 150 3 250 50
We have, E .. - 2 JOO JOO
~otal cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost F . 7
2 -
115 5 175 30
=5900+(100 + 65 +50 + 60+.~Q+JJ5)±~Qx,160 G . 4 JOO 2 240 70
Total cost= Rs. 9540 ----(5) .E 713
Since total cost of iteration (5) is more than that of iteration (4), further crashing is ii) Draw the network diagram for the activities using normal durations :
not possible. Hence, optimum duration of completing the project is 21 weeks and 2
corresponding cost is Rs. 9535.
33. The following table gives the activities in a construction project and other
relevant information: ·
Immediate Time (months) Direct cost (Rs.)
Activity
Pred~cessor Normal Crash Normal Crash
A - 4 3 60 90 iii) List out the different paths of completing the project and identify the critical
B -- 6 4 150 250 path (or paths) and activities along with the total cost
c Iteration -1
-- 2 I 38 60
Path Duration (days)
D A 5 3 150 250
A-F =4 + 7 II
E c 2 2 100 100
·. ·115 A-D-G = 4 + S + 4 = 13 - Critical path
F A 7 5 175
8-G = 6+4 10
t D,B,E 4 2 100 240
Indirect cost vary as follows: C-E-G = 2 + 2 + 4 = 8
Months IS 14 13 12 11 l0 9 8 7 6 A-D-G is the critical path, A, D and G are the critical activities and project duration
is 13 days.
Cost (Rs.) 600 500 400 250 175 100 75 SO 35 25
Total cost= Total direct cost+ Indirect cost
i) Determine the project duration, which will result in minimum total cost
project cost by crashing systematically. July 2007 (14M) =713+400
Sol. The sequence of activities with their predecessor and successor relationships are =Rs.1113 ----(!)
shown in the table.
iv) Determine the crash limit for all critical activities and crash the activity I
Activity A B c D E· F G network as per the minimum cost slope
.Predecessor activity - - - A c A D,B,E Iteration -2
Successor activity .D,F G E G G - - Critical activity Crash limit (days) Cost slope (Rs)
i) Calculate the cost slope for all activities and show with normal and crash A I @
details: D 2 so
G 2 70
... .:. .:,:,;:.:::. ~!'.-~~:~61,M,i!§!i~~<.i>
Crash the activity Aby 1 day, as its minimum slope is Rs. 30J. The pmject duration
reduces from 13 days to 12 days.
·•:f(~'!ii~mt~~wra11~~~1as;;;~~~«-~JP1
No common critical activity for 3 critical paths, crash the activities parallelly. Crash
activity F & G by 2 days. The project duration reduces from I0 days to 8 days.
We have, We have,
~ta! cost= Total direct cost+ Increase in direct cost duet~ crashing+ Decrease in indirect cost --;:::'1-0talcost=713+(30+1-00+ 2_!_~~~+__2~-~~) + 50
=713-t:{lx30)+250 Totalcost=Rs.1093 ----( 4)
Total cost= Rs.993 ----(2) Since the total cost of iteration (4) is more than that of iteration (3), no further
Since the total cost of iteration (2) is lessor than that of iteration ( 1), proceed to next crashing is possible, as critical activities in the path A-D-G areerashed. The-Optimal
itefation- project duration is 10 days and minimum (i.e. optimal) total cost is Rs. 943.
lteration - 3 34.
Path Duration (days) Duration in weeks Cost in Rs.
Activity
· A-F = 3+7 10 Normal Crash Normal Crash
A-D-G = 3+5+4 = 12 - Critical Path 1-2 6 3 700 1400
B-G =6+4 10 1-3 8 5 400 850
C-E-G = 2+2+4 = 8 1-4 4 I 600 900
Critical activity Crash limit (days) Cost slope (Rs) 2-4 5 3 800 1500
A 2-5 4 2 500 1100
D 2 @ 3-5 6 3 500 800
G 2 70 4-6 5 2 600 1200
Crash the activity D by 2 days. The project duration reduces from 12 days to 10 days. 5-6 3 I 700 800
Two parallel critical paths are formed with original path A-D-G. i) Find normal cost and duration if the indirect cost is 300/week.
We have ii) Find the optimum project schedule and optimum cost. Jan 2007 (lSM)
/otalcost=7 I~+~+ I 00 Sol. i) Calculate the cost slope for all activities and show with normal and crash
details:
Total cost= Rs. 94 3 ---- (3)
Activity Normal Crash Cost = C,-C,
Since the total cost of iteration (3) is lesser than that of iteration (2), proceed to next Duration Cost Duration Cost slope(Rs) r. -r,
iteration. (weeks) (Rs) (weeks) (Rs)
Iteration -4
1-2 6 700 3 1400 233.33
1-3 '8 400 5 850 150
A-F = 3+7
1
l O 0 } - Critical path 1-4 4 600 1 900 100
A-D-G = 3+3+4 =
2-4 5 800 3 1500 350
B-G = 6+4 10
2-5 4 500 2 1100 300
C-E-G = 2+2+4 = 8
3-5 6 500 <a 3 800 100
Critical activity Crash limit {days) Cost slope (Rs) 4-6 5 600 2 1200 200
A 5-6 3 700 I 800 50
E 2 30 L4800
A ii) Draw the network diagram for the given activities using normal durations
D
Q 2 70
B 2 50
G 2 7-0
... ... : .. 0PERATIOiflrREsmcu
NJm!l)RK ANALYSIS . \,
Critical activity
1-3
Crash limit (weeks) Cost slope (Rs)
3 150
-,:.;-.-
3-5 3 <@)
5-6
1-2 3 233
2-4 2 350
4-6 3 @
iii) List out the different paths of completing the project and identify, the critical No common activity among the critical paths to crash. Crash the activity 3-5 of path
(or: paths) and activities along with the tot-al cost 1-3-5-6 and activity 4-6 of path 1-2-4-6 by 3 weeks. The project duration reduces
Iteration - 1 from 16 weeks to 13 weeks.
Path Duration (weeks) We have,
1-3-5-6 = 8 + 6 + 3 = 17 ---:1>- Critical Path Totalcost=4800+ (50+3x100+3x200)+13 x 300
1-2-5-6=6+4+3= 13 Totalcost = Rs.9650 ----(3)
1-2-4-6 = 6 + 5 + 5 = 16 Since the total cost of the iteration (3) is equal to that of iteration (2), proceed to next
l -4-6 = 4 + 5 = 9 iteration
The critical path is 1-3-5-6. 1-3,3-5 and 5-6 are the critical activities and the project Iteration - 4
duration is 17 weeks. Path Duration
Total cost= Total direct cost+ Indirect cost 1-3-5-6·= 8+3+2= 13-Critical path
=4800 + (300 x l 7) 1-2-5-6 = 6+4+2= 12
Total cost =Rs.9900 ----(1) 1-2-4-6 = 6+5+2= l 3 -critical path
1-4-6 =4+2 = 6
iv) Determine the crash limit for all critical activities and crash the activity/
network as per the minimum cost slope Critical activity Crash limit (weeks) Cost slope (Rs)
,,
;
Iteration - 2 1-3 3 @
Critical activity Crash limit (weeks) Slope cost (Rs)
3-5
1-3 3 150
5-6
3-5 3 JOO
1-2 3 233
5-6 @) 2-4 2 @
Crash the activity 5-6 by 1 week. The project duration reduces from 17 weeks to 16 4-6 2 200
weeks. The path 1-2-4-6 becomes parallel critical activity after crashing.
No common critical activity for the two critical paths. crash 1-3 of path 1-3-5-6
, Totalcost=4800 + 50 + (16 x 300)
and activity 2-4 of path 1-2-4-6 by I week, which leads to create one more parallel
Total cost=Rs.9650 ----(2) critical activity 1-2-5-6. The project duration reduces to l 2 weeks.
As the total cost of iteration (2) is lesser than that of iteration (I), proceed to next iteration. We have, o
Totalcost=4800 + 50 + 300 + 600+(1x150) + (12 x 300) +(Ix 350)
Iteration -3
Path Duration Total cost= Rs.9850 - - - -( 4)
1-3-5-6 = 8 + 6 + 2 = 16 --+-Critical Path Since total cost of iteration (4) is more than that of iteration (3 ), no further crashing
1-2-~-6=6+4+2= 12 is possible. The optimal project duration is 13 weeks and associated cost is Rs. 9650.
1-2-4-6 = 6 + 5 + 5 = 16 --+-Critical Path
1-4-6 . = 4 + 5 9
..
~ 35.
.. ·~~
.- _::,_ :·::·:_:':~~~1~~4.4~~~,.~~~~;.a:~i;;;~~?: ·; p~~!!~i~~~j-,

The utility data for a network is given
Activity
-
below:
Nonnal Crash
Total cost= Total direct coSt +Indirect cost
=400+ lOx 100
Time (days) Cost(Rs.) Time (days) Cost (Rs.)
Total cost = Rs.1400
1-2 8 100 6 200 ----(1)
1-3 4 . 150 2 350 iv) Determine the crash limit for all critical activities and crash ·the activity
network as per the minimum cost slope ·
2-4 2 50 I 90
Iteration - 2
1-d
- - " 100
--- I 200
Indirect cost: Rs. 100 per day. Crash systematically and determine tl:~e optimum
Critical activity Crash limit (days) Cost slope (Rs)
1-2 2 50
project duration and cost. Jan 2010 (IOM)
Sol. i) Calculate the slope for all given activities and show with normal ancl crash 2-4 @
details· Crash the activity 2-4 by 1 day. The project duration reduces from I 0 days to 9 days.
Normal Crash %hn~ - -
Cost C -C
Activity =-'--' Total cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost
Time (days) Cost (Rs). Time (days) Cost (Rs) slope(Rs.) T• -Tc
Total cost =400 + (1x40) +(9x100)
1-2 8 100 6 200 50 Total cost= Rs.1340
----(2)
1-3 4 ISO 2 350 100
Since total cost of iteration (2) is lesser than that of iteration (I), proceed to next
2-4 2 so I 90 40 iteration.
3-4 5 100 I 200 2S IteratiOn - 3
L400 Path Duration (days)
ii) Draw the network diagram for the given activities using normal durations
~
1-2-4 = 8+1 =
1-3-4 = 4+5 = }-critical path
Critical activity Crash limit (days) Cost slope

1-2 2 @)
2-4 0
1-3 2 100
3-4 4 @
Although, the activity 3-4 has maximum crash limit of 4 days, crash it by 2 days
along with the activity 1-2 to retain the parallel critical activities. The project duration
reduces from 9 days to 7 days.
iii) List out the different paths of completing the project and identify the critical We have,
path (or paths) and activities along with the total cost Total cost= 400+ 40+(2x 50)+(2x 2S)+ 7x100
Iteration - I Q
Total cost= Rs.1290 ----(3)
1-2-4 = 8+2 = IO - Critical path 4· :-?Since all the critical activities of the original critical path are crashed, no further
crashing is possible.
1-3-4 = 4+S = 9
The optimal project duration is 7 days and corresponding cost is Rs. 1290.
1-2-4 is the critical path, 1-2 and 2-4 are the critical activities. The project duration
is 10 days.
-~-- - A~1itt~~~;i-~ _-~ttfa%t~~~!i~,~~~~ ,.
'f: 36. -t~~t~-~-
A small maintenance project consists of jobs given in the table below. The cost
in Rs. per day for crashing of each job is also given: -
.
Since total direct cost is not given, take it as zero
. Duration (days) Cost of crashing Totalcost=O+ 20x 60
Job
Normal Crash per day (Rs.) Totalc'ost =Rs.1200 ----(1)
1-2 9 6 20 iv) l;>etermine the crash limit for all critical activities and crash the network as
1-3 8 5 25 pe_r network as per the minimum cost slope
1-4 15 10 30 Iteration -2
2-4 5 3 IO Critical activity Crash limit (days) Cost slope (Rs)
3-4 10 6 15 1-3 3 25
4-5 2 I 40 3-4 4 @
i) What is the normal pr()ject length? 4-5 40
ii) What is the optimum length schedule, if the indirect costs are Rs. 60 per day? Crash the activity 3-4 by 3 days. After crashing, the path 1-4-5 becomes parallel
ii) Draw the graph duration v/s crashing cost and duration v/s total cost. critical path. The project duration reduces from 20 days to 17 days
Jan 2010 (10 M) I June 2010 (20M) We have,
Sol. i) Show the given cost slope for all activities With normal and crash durations Total cost= Increase in direct cost+ Increaseinduetocrashing +Indirect cost
Job Normal duration (days) Crash duration (days) Cost slope =3xl5+17x60
1-2 9 6 20 Total cost= Rs.I 065
----(2)
1-3 8 5 25 Iteration -3
1-4 15 10 30 Path Duration (days)
2-4 5 3 10 1-2-4-5 = 9+5+2 = r
16 '
3-4 10 6 15 1-4-5 = 15+2 = 17
4-5 2 I 40 } Cntica
.. I pat- h
:. 1-3-4-5 = 9+7+2 = 17 -
'i
!
--
ii) Draw the network diagram for the given jobs using normal durations
2
1-4 ,5 30
4-5 1 @)
l-3 3 25
3-4 15
4-5
@
iii) List out the different paths of completing the project and identify the critical Crash the common activity 4-5 by l day. After crashing, two parallel critical paths
path (or paths) and activities are formed. The project duration reduces from 17 days to 16 days.
Iteration -1 Total cost=( 45 + 40)+ (16 x 60)
Path Duration (days) Total cost= Rs.1045
0 ----(3)
1-2-4-5 = 9+5+2 16
\ Since the total cost of iteration (3) is lesser than that of iteration (2 ), proceed to next
1-4-5 = 15+2 17 iteration.
1-3-4-5 = 8+10+2 = 20 Critical path Iteration - 4
1-3-4-5 is the critical path. 1-3, 3-4 and 4-5 are the critical activities and the project Path Duration (days)
duration is 20 days. 1-2-4-5 = 9+5+1 = 15
Total cost = Total direct cost + Indirect cost 1-4-5 = 15+1 = 16
1-3-4-5 = 8+7+1 = }-critical path
16
,;~
~···:;61;:.>;~t~f.~~,--,,f~~~~~~~~~'i~~~~
-~:·
~
L'"'
Critical activity Crash limit (days) Cost slope - -
Task Immediate Normal time Norma cost Crash time Crash cost
1-4 5 @ Predecessor (weeks) (Rs.) (weeks) (Rs.)
4-5 .
A -- !{) 20000 7 30000
1-3 3 25
B -- 8 15000 6 2-0000
3-4 @ c B ·5 8000 4 14000
4-5 D B 6 llOOO 4 15000
Cr~sh the activities 1-4 and 3-4 parallelly by I day. Three parallel critical activities E B 8 9000 5 15000
are formed now. The project duration reduces from 16 days to 15 days.
F E 5 5000 4 8000
We have,
G A,D,C 1,.,----,12 3000 8 4000
Total cost=( 45 + 40+30+15)+ (ts x 60) 1u
I _ ..1: ___ "' -~ ....... ! ..... n ..... Anru ..
Total cost= Rs.I 030 ----(4) i) Draw the network and find critical path.
Since total cost of iteration (4) is lesser than that of iteration (3), proceed to next ii) Find normal duration and normal cost, optimum duration and optimum
iteration. cost and crash (least) duration and corresponding project cost. July 2008 (20M)
Iteration • 5 Sol. The sequence of activities with their predecessor and successor relationships are
0 shown in the table
~":rd}a-ys-)-•critica1
Path
1-2-4-5 = 9+5+1 = Task A B c D E F G
path
1-4-5 = 14+1 = Predecessor activity - - B B B E A,D,C
1-3-4-5 = 8+6+ I = 15 Successor activity G C,D,E G G F - -
1) Calculate the cost slope for all activities and show with normal and crash
Critical activity Crash limit (daysj Cost slope (Rs) details
1-2 3 20 Normal Crash Cost
2-4 2 @ Tasks Time Time
C -C
=-'--"
Cost (Rs.) Cost(Rs.) slope(Rs) T -T
4-5 (weeks) (weeks) " '
1-4 4 @) A 10 20000 7 30000 3333.33
4-5 B 8 15000 6 20000 2500
1-3 3 25 c 5 8000 4 14000 6000
3-4 D 6 11000 4 15000 2000
4-5 E 8 9000 5 15000 2000
No common activity is available for crashing. Crash the activities 2-4, 1-4 and 1-3 F 5 5000 4 8000 3000
parallelly by I day each. The project duration reduces from 15 days to 14 days. G 12 3000 8 4000 250
We have, ~ 7100d
Total cost=( 45 + 40+30+15+10 + 30+ 25) + l+x60 ii) Draw the network diagram for the given tasks using normal durations
Total cost= Rs. I 035 ---~(5) ~G(/<1,V(8)
Since the total cost of iteration (5) is more than that of iteration (4), stop crashing, as
further crashing is not permissible.
The optimal duration of the project is 15 days, whereas, crashed duration is 14 days.
i~" Crash the activity D by l week. The project duration reduces from 22 weeks to 21 weeks.
After crashing, the paths B~-G arid B-E-F becomes the parallel critical paths.
We have,
Total cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost
Duration (weeks) =71000+(1000+ Ix 2000) +(21x400x 7)
= 10+12= 22
Total cost= Rs. I 32800 ----(3)
B-C-G = 8+5+12= 25
B-D-G = 8+6+12= 26 --+Critical path It has been. noticed that total cost of iteration (3) is lesser than that of iteration (2),
proceed to the next iteration.
B-E-F = 8+8+5= 21 Iteration -4
~i?-a is the critical path, B,D and G are the critical activities and project duration
is26 weeks.
A-G =10+8= 18
We have,
Total cost= Total direct cost+ Indirect cost B-C-G =8+5+8=
21} ·Cnt1ca
.. I
B-D-G = 8 + 5 + 8 = 21
=71000+(26x400x 7) ·. Path
~·-
B=E=F = 8 + 8 + 5 = 21
Totalcost = Rs.143800 ----(!)
Critical activity Crash limit Cost slope
iv) Determine the crash limit for all critical activities and crash the activity/
network as per the minimum cost slope
B 2 ~
Iteration -2 c 6000
Critical activity Crash limit (weeks) Cost slope (Rs) .Q
B. 2 2500 B 2 ·~
D 2 2000 D 2000
G 4 @) .Q
The activitx G is critical with minimum cost slope and hence crash it by maximum B 2 ~
of 4 weeks to not to effect the critical path B-D-G. The project duration reduces from E 3 2000
26 weeks to 22 weeks. F 3000
We have, Crash the activity B common to three parallel critical paths by 2 weeks ( Ifwe take
activity D with minimum slope to crash, .it makes the path B-0-G non critical). The
=71000+ (250 x 4) + (22 x 400 x 7) project duration reduces from 21 weeks to 19 weeks.
Totalcost=Rs.133600 ----(2) We have, ·
Since total cost ofiteration (2) is lesser than that ofiteryition (l), proceed to next iteration.
=71000+1000+ 2000 + (2 x 2500) + (19x 400x7)
Iteration -3
Path Duration (weeks) Total cost= Rs.13 2200 ----(4)
A-G = 10+8 = 18 Since total cost of iteration (4) is lesser than that of iteration (3 ), proceed to next
B-C-G = 8+5+8= 21
• iteration.
B-D-G = 8+6+8= 22 - - - Critical Path Iteration - 5
B-E-F = 8+8+5= 2I
Critical activity Crash limit (weeks) Cost slope (Rs.)
B 2 2500
D 2 @
G
lim9M·AliAI.~IS .;<.: }> "..' ~--,:::">;:! ;:,~ :;.>__ _
iiiR!ifE.5~ni~~~~~~i-~~
Job Normal Normal cost Crash duration Crash cost (Rs.)
duration (days) (Rs.) (days)
A-G =10+8 18
A 6 70 5 JOO
8-C-G = 6 +5 + 8 =
8-D-G = 6 + 5 + 8 = ~:}·--•Critical path B
c
7
4
35
30
.:>~·
3
60
·so
8-E-F = 6 + 8 + 5 = 19 .
D 5 35 3 60
Critical activity Crash limit (weeks) Cost slope (Rs) E 4 45 4 45
8 t) Also, plot the graph project duration versus various costs. Jan 2009 (16M)
c 6000 Sol. i) Draw the network diagram for the given activities using normal durations :
Q ~~~~~~
8 C(4) ..........
D 2000
,-'
Q
8 4 ,,,--------
E 3 2000
F I 3000 ii) Calculate the cost slope for all activities and show with normal and crash
details ·
No common critical activity for the critical paths, crash activity C in the path 8-C-G,
activity D in the path 8-D-G and activity E in the path 8-E-F by I week. The project Normal Crash Cost C -C
duration reduces from 19 weeks to 18 weeks. Activity Duration Cost Duration Cost =-'--"
slope(RsJ T, -T,
We have, - (days) (Rs) (days) (Rs)
Total cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost A 6 70 5 100 30
=7 IOOO + IOOO + 2000 + 5000 + (1x2000) +(Ix 2000) +(Ix 6000) + (18 x400 x 7) 8 7 35 3 60 6.25
Totalcost= Rs.139400 -:- - - -(5) c 4 30 3 50 20
Since total cost of iteration (5) is more than that of iteration (4), no further crashing D 5 35 3 60 12.5
is possible. Hence, the optimal duration of completing the project is 19 weeks E 4 45 4 45 -
and optimum cosi is Rs. 132200, while, the crashed duration is 18 weeks' and L215
corresponding cost is Rs. 139400. iii) List out the different paths of completing the project and identify the critical
38. A building contractor bas given estimate for erecting a temporary structure as path (or paths) and activities along with the total cost
listed in the table below. Job A must precede all others and job E must follow Iteratio·n - I
all others. Apart from this, other jobs (B, C, D) are running concurrently. The Path Duration (days)
indirect cost is Rs. 20/- per day. Find the optimum duration for erecting the A-8-E = 6+7+4 = 17 - - - l > - Critical path
structure. What would be cost of the project if all the activities are crashed to A-C-E = 6+4+4 = 14
• the maximum possible extent. A-D-E = 6+5+4 = 15
A-B-E is the critical path, A,B and E are the critical activities and project duration
is 17 days.
,":\(
f{Etw~*~~![~~~%.I~·:l~'.~~~~~~~¥~ff ·
... ,'..:;.:?;':''.;~±•
1'7l'b<:.' ' ·.· ~·--~~A~fg~f~~;;;:sY;~:;~~i·:- .0PEli'l'iO'?iitR§~£iJt· •. ~ ·:·'?il:!.'!l:..•••-•lillillfM1
1
As the total cost of iteration (3) is lesser than.that of iteration (2), proceed to next
Total cost= Total direct cost+ Indirect cost iteration.
=215+20xl7 Iteration - 4
Totalcost=Rs.555 ----(1) Path Duration (days)
iv) Determine the crash limit for. all critical activities and crash the activity I A-B-E = 6+4+4 = It- \
A-C-E = 6+4+4 = 14 Critical path
network as per the minimum cost s!ope
Iteration -2 A-D-E = 6+4+4 = I
Critical activity Crash limit (days) Cost slope (Rs) Critical paths Crash limit (days) Cost slope (Rs)
A I 30 A I @)
B 4 cgD B I 6.25
E E
Crash the activity 8 by 2 days to retain the critical path unaltered. The project A @
duration reduces from 17 days to I 5 days. c 20
We have, . E
Totalcost=215 + (2x6.25)+15 x 20
A @)
Total cost =Rs.527.50 ----(2) D 12.5
Since total cost of iteration (2) is lesser than that of iteration ( 1), proceed to next E
iteration. Activity A is common to three critical paths, crash it by I day. The project duration
Iteration -3 reduces from 14 days to 13 days.
Path Duration (days) We have,
A-B-E = 6+5+4 = 15 Critical path
Totalcost=215 + (!2.5+6.25+12.5 +30) + (13 x 20)
A-C-E= 6+4+4 = 14
15 Critical path
Total cost= Rs.536.25 ----(4)
A~D-E = 6+5+4 = ~'
Since total cost of.this iteration i~e .. (4) is more than that of iteration (3), stop
Critical activity Crash limit (days) Cost slope (Rs) crashing, no further crashing is possible. Hence, optimal project duration is 14 days
A I 30 and corresponding cost is Rs. 526.25
8 2 @ 39. The information regarding a project is summarized in the table below. Find out
\-.J.
E /'
~- the optimum project duration and the corresponding cost
A I 30 Preceding Normal time Crash Time Normal Crash Cost
Activity
D 2 @ activity (weeks) (weeks) Cost (Rs.) (Rs.)
Though the activity A common to both critical paths, crash activity B and activity \ .. A -- 5 4 600 800
D by I day to to retain critical paths. Due to crashing A-C-E is also become parallel ~" .:-' \
B -- 3 I 400 600
critical path. The project duration reduces from 15 days to 14 days. \r ~i- c -- 8 5 900 1200
We ha~, D A 4 2 600 1200
Totalcost =215 + (12.5+6.25+12.5) + 14 x 20 E 8 4 3 500 700
Total cost =Rs. 526.25 ----(3) Feb 2006 (20 M)
Sol. The sequence of activities with their predecessor and successor relationships are
shown in the table
... Activity
Predecessor activity
A
-
8
-
c
-
0PERATIONal~!:SmtH
D
A
E
8
NETWORK ANALYSIS~
iv) Determine the crash limit for the critical activities and crash the activity I
Iteration -2
Successor activity D E -- -
i) Calculate the cost slope for all activities and show with normal and crash \ Critical activity Crash limit (weeks) Cost slope (Rs)
details · A I @>
Normal Crash D 2 300
Cost c -c
=-'--"
~ctivity Time Cost Time Cost Crash the activity A by 1·week and project duration reduces from 9 weeks to 8 weeks.
slope(Rs,.) T -T We have,
(Weeks) (Rs) (Weeks) (Rs) " '
A 5 600 4 800 200 Total cost= Total direct cost+ Increase in direct cost due to crashing
8 3 400 I 600 JOO - =3000 + (! x 200)
c 8 900 5 1200 100 Total cost= Rs. 3200
----(2)
D 4 600 2 1200 300 Although the total cost increases due to crashing because of no indirect cost, proceed
E 4 500 3 700 200 till no further crashing stage is reached. Now A-D and C are the parallel critical
~ 3000 paths.
ii) Draw the network diagram for th~iven activities using normal durations. Path Duration (weeks)
2 A-0=4+4= 8
-+ Critical path
c = 8 = 8
}
8-E= 3 +4 = 7
Critical activity Crash limit Cost slope
A 0
J2 2 3-00
iii) List out the different paths of completing the project and identify the critical
path (or paths) and activities along with the total cos,t.:
c 3 100
Now, crash theactivity D of path A-D and C of path C by one week. After crashing,
Path Duration (weeks) A-D, C and 8-E are the parallel critical paths and project duration reduces to 7
A-D = 5 + 4 = 9 --> Critical path weeks.
8-E = 3 + 4 = 7 We have,
c =8 = 8 Total cost= Direct cost+ Increase in direct cost due to crashing
The. critical path is A-D. A and Dare the critical activities and project duration is 9 = 3000 + (200 + 300 + I 00)
weeks. = Rs. 3600 ---(3)
Iteration -1 Path Duration (weeks)
~
Total cost= Total direct cost+ Indirect cost A-0=4+3 =
=3000+0 c = 7 ; } Ccitiool p•th
Total cost= Rs.3000 ----(1) 8-E =3 +4 =
Note :- Indirect cost is not giveh, hence direct cost increases with crashing.
-c : I ...,. ~~ :.
Critical activity
A
Crash li1t1it (weeks)
0
· •;;woP.ERAnoj~
·- ·· ... REsEARce
::)'"·-'"'••'''"'
.cost slope (Rs.)

..
-~
~;~·
~··
~~'iij~~¥~~f~::~~.':;•,. ;h:;::fi*~i~~~~~~~~f}L~~~:difm
Activity Normal
Duration Cost
Crash Cost c.-C" R
Duration Cost Slop = - - s.
T0 -Tc
u
I
(days) (Rs) (days) (Rs)
c 2 A
• 7 500 5 900 200
8 2 B 4 400 2 600 100
E 200 c 5 500 5 500 -
Now, c~ash the activities D, C and B by maximum of one week, as no more crashing D 6 800 4 1000 100
is not possible. E 7 700 4 1000 JOO
We have, F 5 800 2 1400 200
fo .Aotal cost= 3000 + 200 + 300 + 100 + 300 + 100 + 100 G 6 800 4 1600 400
// Tota:I cost = Rs. 4100 ··
L4500
)# 40. A small project is having seven activities. The relevant data about these activities iii) Draw the network diagram for the gi_y_en activities using normal durations
is given below. Indirect cost per day is Rs. 100/- 3
Normal Crash duration Normal Crash cost
Activity Dependence
duration (days) (days) cost (Rs.) (Rs.)
A -- 7 5 500 900
8
A 4 2 400 600 . lt(
c A 5. 5 500 500
D A 6 4 800 1000
E B,C 7 4 700 1000
F C,D 5 2 800 1400 iii) List out the different paths of completing the project and id~ntify the critical
G E,F 6 4 800 1600 path (or paths) and activities along with the total cost
i) Find out the normal duration and cost. Iteration - 4
ii) Crash the network to complete in 21 days. What is the percentage increase Path Duration (Days)
in cost to complete in 21 days? Aug 2005 (14 M) A-B-E-G=7+4+7+6= 24
Sol. The sequence of activities with their predecessor and successor relationships are A-C-E-G=7+5+7+6= 25 Critical path
shown in the table A-C-F-G=7+S+5+6= 23
Activity A 8 c -D E F G A-D-F-G=7+6+5+6= 24
Predecessor activity - A A A B,C C,D E,F
The critical path is A-C-E-G. A,C,E and G are the critical activities and project
Successor activity B,C,D E E,F F G G - duration is 25 days.
i) Calculate the cost slope for all activities and show with normal and crash Total cost= Total direct cost +Indirect cost
details
Totalcost=4500+25x100
Total cost= Rs. 7000 ----(1)
iv) ~etermine the crash limit for all critical activities and crash the activity I
...
~ Iteration - 2
Critical activity
-~OPERATIONS
·_-.- ' .
-~
Crash limit (days) ·Cost slope (Rs)

REsEARCH
~~-
,,.,
'?Ji~*~xt~'l'SIS" "', .
Iteration 4
Path
::0 ·;;;e,~":'~/' ::'f:~lJ~i~zj~f .:
Duration (days)
A 2 200 A-C-E-G= 7+5+5+6= 23
c 0 \ -<
!· A-C-F-G= 7+5+5+6= 23 ---+-Critical path
E 3 @) A-D-F-G= 7+5+5+6= 23
G 2 400 Critical activity Crash limit (days) Cost slope (Rs)
Though, the maximum crash possible for the activity Eis 3 days, crash it by I day to A
retain ·the critical activity A-C-E-G and parallel critical activity A-D-F-G is formed
2 @
c 0
after crashing. The project duration reduces from 25 days to 24 days.
E I JOO
We' have,
Total cost =Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost ·· Q 2 400
A
=4500+(1x100)+ 24x 100 2 @
Total cost= Rs. 7000 ----(2) c 0
F 3 200
Aince total cost obtained is same as previous iteration, proceed to next iteration Q 2 400
Iteration -3
Path Duration (days) A 2 @
A-B-C-E= 7+4+6+6= 23 D I 100
A-C-E-G= 7+5+6+6= 24 - . Critical path F 3 200
A-C-F-G= 7+5+5+6= 23 G 2 400
A-D-F-G= 7+6+5+6= 24 _.Critical path The maximum possible crash in 2 days. Crash an activity A by 2 days to retain the
three criticalpaths unaltered. ·
We have ~
A 2 200
Total cost= 4500 + (I 00 + I 00 + I 00 + 2 x 200) + 21 x 100
c 0 =Rs. 7300
E 2 @ As per the statement, network has been crashed to completethe project in 21 days
Q 2 400 and the associated crashed cost is Rs. 7300
A 2 200 -f ./fife percentage of increase in cost to omplete in 21 days is calculated as follows.
Normal cost = Rs. 7000
D 2 @ Crashed cost= Rs. 7300
F 3 200 Rs. 300 is increased for Rs. 7000, then
G 2 400 7000~300
Crash the individual critical activities E in the ACEG path and D in the ADFG path 100~ 300xl00
by I day. The project duration reduces from 24 weeks to 23 weeks. 7000 ~
We have. =4.28%
Total cost =4500 + (100+I00+100) + 23x 100
=Rs. 7100 ----(3)
Now, ACEG, ACFG and ADFG are the parallel critical paths. Continue the crashing
till the project completes in 21 days.
-~c- : 0~·&%Jl~~~~i.~ii1~~~t0.t~l~k~~fillr. ~;&~~Wi~ii!~I··~
41. Table below shows the activities with their normal duration, normal cost, crash li-;,.~Ji~~-1rtli'Jj~~~t~~;_;~}~i~ ~,_...... c ::
Jf . duration and crash cost/The overhead cost is Rs.300/day. iii) List out the different paths of completing the project and identify the critical
Nonnal duration in Nonnal cost Crash duration in Crash cost in path (or paths) and activities along with total cost
Activity Iteration -1
days in Rs. days Rs.
1-2 6 1400 4 1900
1-2-4-6 =6+3+10 = 19
1-3 8 2000 5 2800
1-2-3-4-6 = 6 + 4 + IO 20 - - . Critical Path
i-3 4 1100 2 1500
1-2-3-5-6 = 6 + 4 + 6 + 3 = 19
'2-4. 3 800 2 1400
1-3-4-6 = 8 + 10 = 18
3-4 -- -- -- -- .
1-3-5-6 =8+6+3 = 17
F5 6 900 3 1600
4-6 IO 2500 6 3500 The critical path is 1-2-3-4-6. 1-2, 2-3, 3-4 and 4-6 are the critical activities and
project duration is 20 days. · · ·
5-6 3 500 2 800 Totalcost=Totaldirectcost +Indirect cost
i) Draw the network and determine the normal length and its cost.
ii) Find the optimum duration and its cost.
=9200 + 20 x 300
iii) If all"the activities are crashed to the maximum possible extent, what is the Total cost= Rs.15200 ----(1)
corresponding cost of the project? Jan 2008(06+07+07 = 20M)
iv) Determine the crash limit for all critical activities and crash the activity I
Sol. i) Calculate the cost slope for all activities and show with the normal and crash
details Iteration - 2
Activity Normal Crash Cost C -C Critical activity Crash limit (days) Cost slope (Rs)
Duration Cost Duration Cost slope(Rs) =-'--" T• -Tc 1-2 2 250
(days) (Rs) (days) (Rs)
- 2-3 2 ·@
1-2 6 1400 4 1900 250
3-4
1-3 . 8 2000 5 2800 267
4-6 4 250
2-3 4 llOO 2 1500 2Q_O, .
CraslLthe..activity 2-3 by I day to retain the critical path same. The project duration
2-4 3 800 2 1400 600
reduces from 20 days to 19 days. The parallel critical path is 1-2-4-6.
3-4 - - - - - Total cost= Total direct cost+ Increase in direct cost due to crashing+ Increase in indirect cost
3_5; 6 900 3 1600 ' . 233
=9200+(1x200) +I 9x300
4-6 10 2500 6 3500 250 Totalcost=Rs.15100
5-6 2 800
----(2)
3 500 300
I: 9200
Since the total cost of this iteration is lesser than that of iteration (I), proceed to next
iteration.
ii) Draw the network diagram for the activities using normal durations
~
Iteration -3
2 Path Duration (days)
1-2-4-6 =6+3+10
1-2-3-4-6 = 6+3+10 : : } - - • Critical path
1-2-3-5-6 = 6+3+6+3 = 18
1-3-4-6 =8+10 18
1-3-5-6 = 8+6+3 17
-t~'!;~,,~,•-;,;tif~fl.~~~~)f_;~~J'~t~;i~~~~11 ~~~ti4iiJ~~:·::-
. . r~~~.)[~~~~:~~:~i{~,~~~:~);.~~~·~ ~i~~~~-~fi~~
7
·_- .. : .. ~~-
Critical activity Crash limit (days) Cost slope (Rs) Crasff the critical activity 1-2 common to all 3 critical paths by I day. The project
duration reduces from 18 days to 17 days. Now, there are 5 parallel critical paths.
1-2 2 250
We have,
2-4 600 Totalcost=9200+ (200+ 250+ 250) + 17 x 300
'H 4 @ Total cost= Rs.15000 ----(4) ,_
1-2 2 250
2-3 200 Since the total cost of iteration (4) is lesser than that of iteration (3), proceed to next
iteration. ·
3-4
Iteration - 5
4-6 4 @ Path Duration (days)
The critical activity 4-6 is common to parallel critical paths, crash it by I day, that 1-2-4-6 = 5+3+9 17 -
leads to form one more parallel critical path 1-3-4~6. The project duration reduces 1-2-3-4-6 = 5+3+9 17
form 19 days to 18 days.
1-2-3-5-6 = 5+3+6+3 = 17 r-critical Path
We have,
Totalcost= 9200 + (200+250)+18 x 300 1-3-4-6 = 8+9 17
1-3-5-6 = 8+6+3 17
Totati cost= Rs. I 5050 ----(3)
Critical activities Crash limit (days) Cost slope (Rs)
Since total cost of the iteration (3) is lesser t~an that of iteration (2), proceed to next
1-2 l 250
iteration.
Iteration - 4 2-4 I 600
Path Duration (days) 4-6 3 250
1-2-4-6 = 6+3+9 1-2 I 250
18}
1-2-3-4-6 = 6+3+9 18 ~Critical Path 2-3 3 @
1-2-3-5-6 = 6+3+6+3 = 18 3-4
1-3-4-6 = 8+9 17 4-6 3 250
1-3-5-6 = 8+6+3 17 1-2 I 250
Critical activities Crash limit (days) Cost slope (Rs) 2-3 I @
1-2 . 2 @ 3-5 3 233
2-4 600 H 3 250
~· 3 250 1-3 3 ®
1-2 2 @ 3-4
200 4-6 3 250
2-3
3-4 1-3 3 @)
4-6 3 250 3-5 3 233
"' 5-6 I 300
1-2 2 @
2-3 I 200 No common activity for all critical paths is available to crash. Crash activities 2-3
233 and 1-3 by I day. The project duration reduces from 17 days to 16 days.
3-5 3
4-6 3 250
··-~,,~-~
·-~{ ~-:. ~'~~ -~- . ~- :::.;
We have,
-------------;
Total~st=9200+(290+ 250+ 250+ 200+267)+16 x 300
Totalcost=Rs.15 I67 ----(5) "·- Modu~~~-~-J
~ ·Since total cost of iteratl>n (5) is more that of iteration 4, stop crashing. Tit: optimum
project duration is 17 days and correspondin cost is Rs. 15000. The cra5hed duration~
is 16 days and correspon mg cost is Rs. 15167.
;._ - ------·--~----...---·--------·---
Queue is a well - known term that refers to a waiting line. We come across variOus
situations, wherein, number of customers either an individual, people, machines or vehicles
requiring the service are awiliting in a line for their tum to get the service done.
Queues are found in bus stops, railway stations, theatres, clinics, petrol pumps, tolls
etc, when the number of customers requiring the service exceeds the number of service
facilities or service facilities do not work efficiently and effectively and consumes more
time than that specified to serve the customers. The customers arriving for the service either
needs to await in a queue. or get served instantly that depends on the condition/ status of the
service provider. If the service facilities are free at the time of arrival, the customer can get
served instantly without waiting time.
Generally, waiting line problems exists as a result either huge demand for the facilities
or too less demand due to more facilities that caused much more idle facility time. At the
time of designing a system involving queue situation, it is necessary to attain the proper
balance between the service facilities and the customers so that a customer get the required.
service to certain extent from the service facilities at low cost, with a minimized average
waiting time. of the customers and effective utilization of the server above the desired level.
Queuing theory is widely applicable for different sort of situations, where it is difficult
to predict accurately the customer arrival rate and service rate of the facilities
6.1. ELEIV!l;tff$J,TRlr~T(.iff.~/¢.ff~Ri¢itER.ISTICSOF
... - ·.' ,,..,., - ...... '• .....·
·.··.- ·.' '• ~·. .., ., ·.. ..
·.- .· , ' . . . .
QUEUING
. . SYSTE.
' . M
A queuing system can be interpreted completely by the following entities

I. The input (or arrival pattern)
2. The service mechanism (or service pattern)
3. The queuin&_process
4. The queue discipline
5. Service channels and
6. Customers behavior
The input (or arrival pattern)
J:: This indicates the pattern. in which potential customers arrive at the service facility.
>The customers arrive at the service facility individually, or in batches separated by equal
....
nnr·i!fu·:~f~~:~1~ ~~ ~;·~Q',~i~£*•-t-!fl~~jt&.~r~~~i91
intervals of time or by unequal but definitely known intervals of time or by unequal intervals
of time whose probabilities are known as random arrivals. Arrivals may also be presented 0-.00---0-.0 o-.oc::~!r
~
by inter - arrival time(i.e. time period between two successive arrivals) In this queuing. Customers Queue Service
system, we deal with the customers arrive in oi son distribution with mean arrival ~ facility
a) Queue system with single queue and single service facility
Service mechanism(or Service pattern)
This pattern indicates the man~~r in 'which potential .customers are serviced and leave
the service facility. If enough service facility is available, then the customers are served
simultaneou~ly and effectively on arrival and there will be no queue. If there are finite
0-.00---0-.0
Customers Queue
o-.o-.o-.
Service Service
Served
customer
number of service facilities, then the customers are served as per the specific order with facility-I facility-2
service time(i.e. period between two successive services). The service time could be b) Queue system with series service facility
~
D@-.
a constant or random variable. In most of the cases, the departure folio~
probability distribution.
~
Queuing process
This refers to the number of queues - single , multiple or priority queues. 0-DD---D D @-.o Served
customer
If the service provider fail to accommodate the customers beyond the limit at a time, Customers Queue ~
no customer is permitted to enter until the sufficient space is available to accommodate the
new customers. Such queues are finite or limited source queues. If a service facility is able
D '51 ..
to accommodate all the customers at a time, then it is called infinite or unlimited source
queue.
Queue discipline D
This indicates the sequence or order in which the customers from the queue are selected Served
for the service. The most common disciplines are . customer
i. FCFS discipline i.e. First come first served in which customers are· chosen for
service in their order of arrival.
11. LCFS tfi.scipline i.e. Last come first served in which last arrived customer served
D
d) Queuing system with single queue and service facilities in series and parallel
first as in case of cargo handling.
iii. SIRO discipline i.e. Service in random order wherein, the customer is chosen for Customer's behavior
service at random, irrespective of their arrival at the system. The customer who arrive at the service point can wait in the same queue until he served
Service channels and does not change the queues is called patient eust0mer. -whereas, the customer who waits
in a queue for some time and then exit off the system without obtaining the service due to
In order to serve the incoming customers, finite number of service facilities are arranged some reasons called as impatient customer.
and are called service channels. The service channel may be arranged either in series,
parallel or mixed arrangements. · A customer can behave in four different ways
a. Balking: A customer do not join the queue and or leave the queue by looking at
In series arrangement, number of service facilitie~ are arranged in the sequence so that
the customers already in the queue due to space restrictions and due to estimated
a customer proceed through each facility ahead of the service is accofiiPlished.
excessive waiting time for the desired service.
In parallel arrangement, number of service facilities are in parallel so that customer can b. Reneging : A customer after joining the queue, wait for some time and leave the
obtain from any service facility by joining in the queue of their choice infront of the service queue without being served due to impatience.
facility. c. Jockeying: A customer can move from one queue to other expecting quick service
In mixed arrangement, number of service facilities are arranged in series as well as in than the normal time.
parallel. d. Priorities : Some customers are chosen earlier for the service irrespective of their
arrival due to their priority over others.
1111.' ., ·.· 'f~'<r ~':~·;EWt-f;i~~?.~~~-~}~*\',~P,~ti9~···$if4~~~';'.
..
6l~OP.ERAtiil'r.l;i~L~,.x ,ut1-~ ~•"="'g·.j--Eu~·.···""N·~"'G''··>s·".v"'s··-T-·E···M-·\·;i~'{~~
'.i ~~q:~~i~~i~ii0~~;~~fi§~~4}liiA;:Jr:u;:: . ;:,·.;;~
Pure tleath process/model •
. . . ·. ·-.. ··-<·-,,.,..,t~J!l!IJJ! ---::~'..:ww _ . . ._ - )_. . ·:~?7f.~·-·:}'f'/:•_:
,.,:W~·-t<;~'<l·•· '·,~t,•,·,;....;,i;~·~~· -~.-·-·· :-. . ,,, ._ -~--'. ,_.·-~·~'.t":.'~<";;..<·~.
€:.. The departure process assumes that no customer arrives in the system, while the service
is continued for the customers who are already in the system. Let, there be N ~ I customers
;-::
Fol~owing are the operating characteristics of a queuing system. . ~;;:y
1. Queue length (Lq): The average number of customers in the queue waiting to get 1
fr in the System at time t = 0 (i.e. starting time). Since the service is being provided at the rate
•
service. ofµ, therefore thi:: customers leave the system 11t the rate ofµ, after being served. Such a
process is called pure death process.
2. System length (L,): The average number of customers in the system including those
In general
3.
waitiqg as well as those being served;
Waiting time in the queue (Wq): The average time for which a customer has to wait
. (µtr-n
P0 (t)= ,.,.,
e-µI
\, ,forn=l,2 ....N
in the queue to get service.
4. Total time in the system (W,): The average total time spent by a customer in the
system from the instant he arrives till he leaves the system. It is the summation of 6.5·.Kl;NDALL'S ·~OTA,TIOtoJ~ {;;t•:t~i..;:;~;-:f /'XJh'~' •·
waiting time and the service time.
D.G.Kendall introduced useful notations for the queuing models, which are expressed
5. Utilization factor (J): It is the proportion of the time a server actually§pends with as (a/b/c): (die)
the customers. It is also called traffic intensity.
where
6.3 CLASSIFICATION.·OF.. QIJ_f:tJltil~·Moth~~s. a= Arrival (inter - arrival) distribution
b = Departure distribution
The queuing models are classified as follows:
Model I: (M/M/l): (oo/FCFS): This model deals with a queuing system having single
c =Number of channels 0.
I
\-~.
d =Capacity of the system c
server, Poison arrival (exponential inter arrival), Poison departure (exponential service e =Queue discipline
time) on basis of First Come First Served service discipline. In this, infinite number of !_!~'-'.\, ~v:!J-J,..
Notations )'
customers are allowed in the system.
The notations used for analysing a queuing system are as follows :
Model II: (M/M/1): (oo/FCFS):Jt is a general queuing model in which the arrival and n =Number of customers in the system
:;:
·' ;.i
servic~ rates depend upon the length of the gu~ue. P =Probability of'n' customers in the system p :.
I
q) ~
! Model ill: (M/M/l): (oo/SIRO): This model is essentially same as model I except that the P: = Probability of no customer in the system
I p p
I
service discipline is SIRO (Service in Random Order) instead ofFCFS. ' S =Number of service facilities or channels C?
!
Model IV: (M/M/1): (N/FCFS): In this model, the capacity of the system is limited say N N = Max.imum number of customers allowed in the system ,fc
and hence the number of arrivals cannot exceed N. Pw =Probability that an arriving customer has to wait l·. '~
Model V: (M/M/1): (n/FCFS): In this model, the probability of an arrival depends upon the
number of potential customers available to enter the system.
l-P0 =(;J i . \,--\'\ -----------~
' I ' ' p" • ~( I - \j
Model VI: (~c): (oo/FCFS):This model is same as model I except that there are cservice
channels working in parallel. 6?6 LllilliTATIONS OF QUEUING':Nip(»~L
I. The waiting space for the customers is usually limited.
~~4,,!1~;1!_@;'Q1~l'~;,j\tf_~~IWt~S!Uil4lC!9.~5~/f,~QJ>.~i.'$i<L· ~:.• . . ·;
2. A customer may go away without getting service on looking at the long queue.
The pure birth process is one where the customers arrive at the queuing.system and
never I leave it. In' this model, only arrivals are counted and no departure takes place. The 3. The arri~ during the peak period and slack period may be more or less than the
term birth refers to the arrival of the new entity in the system. average arrival rate. . ,. .· ·1 ~
.;.;, t"'\Wv'<:I::'._
The number of customers in the system at a time 't' before the start of the service facility 4. The population of customers may not b~nite.
and if follows poisson distribution with mean and variance equal to .At is given by S. Services may not be rendered continuously. The service may be provided in batches
P (t) =--e
0
r
(.At -Al
for n=0,1,2 ....
rather than individually.
6. The queuing system may not have reached the steady state.
n!
ii:~-
lail~..
.~.·-··,., - -·.- . . ._ ... , ·-.- .... .
.·...~........ ,~~~~~?.~;.Bf~rl)~J.i{:~~:·, >~Tloils ~~e~
- ..-.-, ~.-·.··"":".'··-:'.'~·-~·"f?.C'---·-. ~ ...: - ·-~s·"-"':--·· ..• ~- . ~v.,.,:.·..,
Cf··-·
~-pf,~f(t:~~l~~~~~;~:J~i~~'.'~i~~~'!1~~~i~:c¥1t~AL,;Ifd-
c
• '.-. ···-·,·!'.:,: •.. ;,·Qf.SYMBOLS7ANDJE~Rft'l~.UAEr~~.:;'.'i::::
6.7LIST · .-~~....,;4:4.tt:-'--.......,._ ~':.---.)~~'.,.:M'.:3:• ,{,!"~'.,
1-.,_.,.,Ji:-_,.A--t"--'l.,..:,_'11...-.."c.. 15.t.·•.-,."'Sxitilllt•>- ..
:\ xiii) P(n > I)= Probability that the queue is no~ --empty.
.....,,~
i) A.= Mean arrival rate i.e. Expected number-0f arrivais per unit time.
ii)µ= Mean service rate t.e. Expected number of customers served per unit time
A.
;1\·
T
,11,··
..
' P(•+(H '
iii) p = - Traffic intensity= Service utilization factor i.e. Expected fraction of time (,-\
"'--• xiv)
.·• Probability density function of waiting time (excluding service) distribution.
µ
= ~(µ-A.)e·(µ-'.J•, t>O
a server is busy i.e. actually spends with the customer. µ
0. iv) L = Expected number of customers waiting in the queue i.e. queue length
• q 2 ~·-··· A.
. A. =-(µ-A.),t=O;
L =-- ~l
q µ(µ-A.)
.@xv) Probability density function of (waiting+service) time distribution=(µ - A.) e-<µ· i.~
~ v) L, =Expected number of customers in the system (waiting+ being served).
L, - ( A. )
- - - -
( 0 R. \ L~ ":. ( ~ ~ )
__.:;.---
l,J_f
. '~ ·v.
' •• J., r
,.i
1
r
··
"•
-- . SOLVEi>.J?'R()B.LJENJS;,. .·.·., .,
~l-A. \: ) '1-\ . ·' 1.
\ I A Self-service store employs one cashier at its counter. Nine customers arrive
., vi) Wq =Expected waiting time for a customer in the queue on an average every 5 minutes while the cashier can serve 10 customers in
w= A. 5 minutes. Assuming Poisson distribution for arrival rate and exponential
q µ(µ-A.) distribution for service time, find
i) Average no. of customers in the system.
,,, vii) W, = Expected waiting time for a customer in the system (waiting+ Service) ii) Average no. of customers in the queue.
~- i.e. Expected time a unit spends in the system from the moment of its arrival till it iii) Average time a customer spends in the system.
leaves the system. iv) Average time a customer waits before being served. July 2016 (10 M)
1 Sol. Mean arrival rate A.
W=--
' (µ-A.) 5 minutes= 9 customers(i.e. arrivals)
Ys
\~
! n
viii) Var(n) =The variance (Fluctuation) of queue .length. I minute= customers l + VY. pe..tXLl ( ~ 7 L'
:. A.= 91 customers/ .
L6, :_ 'V - ,..i.,\ ..
Var(n)=-P-, 15 /mmute
(!-pf Mean service rateµ
ix) L. = Average length of non - empty queue i.e. the length queue that is formed '-, L
'V
+ ~
5minutes=I Ocustomers
from time to time. \
. 10
L =-µ- 1-mmute = -=2customers
" (µ-A.) 5
: .µ = 2 customers I minute j-. \jJS
x) w. =Average waiting time in non - empty queue i.e. Expected waiting time per @ Lb. "'°
( i) Average numberof customers in the system
busy period.
I A. 9
L =--=--
w. = (µ~) ' (µ-Iv) 5(2-Ys) @ L",:::. .>-\fl./. ~v
' .1
·; xi) P(?:k) =Probability of queue being greater than or equal to k. L, =9 \f>-.. ·: '·V" ,,J.·\ f
• k
No1r -. %l' <I\
(P~ k) =(;) (ii) Average numberof customers in the queue,
C
i.
j I
~ l_.\·.<'~ ·, l\
xii) P(>k) = Probability of queue being greater thank.
A)k+I
L =-A._2
q µ(µ-A.) Gr x(z-%Jx2 -'v-..:..V-"- '
P(>k)= ( µ· Lq =8.1
•*t~Jt.~r;~~~;;Ik~1i:~J:~:~i .:':,:~i ,J\!~tik~~ -
. ~rQ•~~~~~a~%~~r£,~--- -
(iii) Average time a customer spends in the system,
l l -
A, 2 (o.5)2
W=--=-- L = - =0 5
µ(µ-A) l(l-0.5) .
• (µ-J.) (2-J'Sl q
Lq = 0.5
W, = 5minutes.
iv) Average number of patrons in the system,
(iv) Average time a customer waits in the queue,
A. 0.5
L =--=--=I
.
w - A (%)
= ---'~'--
s (µ-/.) (l-0.5)
q µ(µ-A) 2(2-%) v) Average waiting time of a patron,
wq =4.Sminutes W = I. _ 0.5 =I
q µ(µ-!.) l(l-0.5)
f 2. Patrons arrive at a reception counter at an average inert arrival time of 2
minutes. The receptionist on duty takes an average of one minute per person.
wq =I minute
(Arrivals are as per exponential and service are as per Poisson distribution). vi) Average time a patron spends in the systems,
~ What is the probability that a person will straight away meet the receptionist? l I .
W = - - = - - - = 2 minutes
)i) -For what portion of the time the rec_91tionist is busy? ·- s (µ-!.) (l-0.5)
iii) What is the average queue length?
iv) What is the average number of patrons in the system?
v) What is the average waiting time of a patron?
'
3. A box office ticket window managed by manned by a single server, customers
arrive to purchase tickets according to Poisson's distribution with a mean rate
vi) What is the average time a patron spends in the system? of30/br. The time required to serve a customer bas an exponential distribution
Jan 2018 (12 M)/ Jan 2010 (14 M) with a mean oJ90 sec. Determine:
Sol. Mean arrival rate A. i) Mean queue length.
2 minutes = I patron ii) Mean waiting time iii the queue. ( ?"/ 'i
- l iii) Probability that there are 3 or more customers in the system.
Iminute=-patron
2 ...j~ercentage of time the server is busy. July 2017 (12 M)/ Jan 2007 (8 M)
:. A=0.5 patrons/ minute
Sol. Mean arrival -rate A.
3600 seconds (i.e. I hour)= 30 customers
Mean service rateµ 30
lsecond=--
I minute= I patron 3600
:.µ=l patron/minute -~ A.~}{20 ..customers/ second
i) Probability that a person will straight away meet the receptionist= probability that
Mean service rateµ
there is no patron in the system = probability that receptionist is idle,
90 seconds= Icustomer
p =l-Z:=l-Q2
0 µ l !second= Xo
P0 = 0.5
• :.µ= Xo customers/second
ii) The portion of the time the receptionist is busy= Service utilization fllctor p
i) Meanqueuelength,
A, 0.5
p=-=-=0.5
µ I
iii) Average queue length,
L =-" 2
_ (X20Y
q µ(µ-!.) (Xo)(Xo- X20)
Lq =2.25
lll!li<~:'.'.:~(;!_~ .~' . ,,;;_~?Aiil3,~.~~CH --~~~il~,I~
ii) Mean waiting time in the queue, iii) Average length of the queue,
2
·I/ A. 2 (0.133)
w= A = IUO 270Second L =---
q µ(µ-A.) O.l6\(0.167-0.133)
q µ(µ-A.) _!___(_!___ - _I )
90 90 120 Lq =3.1 lcustomers
iii) Probability that there are 3 or more customers in the system, iv) Average number of customers in the system,
3
P(;d)= ( -A.) = ( -t x90)

- =0.42
3
L =-"-- 0.133
. µ 120 I ' (µ-J..) (0.167-0.133)
iv) Percentage of time the server is busy= Service utilization factor, L, =3.91 customers
p=~=C~ 0
9 · 5. At apetrol pump, customer's arrival is a Poisson process, with an average time
x i°)=0.75
of 5 minutes between arrivals. The time intervals between services at the petrol
4. An airline's organization has one reservation clerk on duty in its local branch at pump follows exponential distribution and as such the mean time taken to
service a unit is two minutes. Find the following:
any given time. The clerk handles information regarding passenger reservation
i) Expected average queue length.
and flight timings. Assume that the number of customers arriving during any
ii) Average customers in the queue system.
given period is Poisson distributed with an arrival rate of eight per hour and
that reservation clerk can serve a customer in six minutes on an average, with iii) Expected waiting time in the queue and the system. June 2010 (lOM)
Sol. Mean arrival rate A
an exponentially distributed service time.
S minutes = I customer
i) What is the probability that system is busy?
. I
ii) What is the average time a customer spends in the system? I mmute=-customer
iii) What is the average length of the queue? s
iv) What is the average number of customers in the system? May 2017 (14 M) :. A= ~customer I minute
Sol. Mean arrival rate A. s
60 minutes (i.e. I hour)= 8 customers Mean service rateµ
. 8 2minutes=1 customer
lmmute=-
60
:.A.= 0.133 customers/ minute
I minute= }i customer
Mean service rateµ :.µ= }icustoemr/minute
6minutes= I customer i) Expected queue length,
. I
I mmute=-customer
6 L =---
1,.2 (Ys'f
:. µ = 0.167 customers I minute q µ(µ-J..)
X(Yz-Ys)
i)The probabily that the system is busy =Service utilization factor,
L =~
p=~= 0· 133 =0.79=0.8 q IS
µ 0.167 ii) Average customer in the queue system,
ii) Average time a customer spends in the system,
L =-A-= (Ys)
W =-1-=
s
I
(µ-A.) (0.167-0.133)
s (µ-A.) {Yz-Ys)
W, = 29.4minutes L =2/
' /3
-" ··);: ~t~-t4W2'
iii) Expected waiting time in the queue,
slack period and an average of 5 minutes during the afternoon peak period •
A. .(Ys) - Assess the average queue length and the expected waiting time in the queue
wq =µ(µ-A.)
:;-: Yz(Yi-Ys). Sol.
during the two periods.
Mean arrival rate during early morning slack period A.1
JJJly 2014 (14 M)
I . 12 minutes= I customer '

Wq =-mmutes I minute= 1/12 customer
3
iv) Expected waiting time in the system, :.A., = ){2 customers/minute
·w,,;,-'-=-' Mean arrival rate during a~emoon slack period A. 2
s (~l-A.) . (Yz-Ys) 5 minutes= I customer
W, =I 9'j minutes I minute= Ys customer
;16. In a railway marshalling yard, goods train arrive at a rate of 30 trains per day. :.A. 2 = Ys customers/ minute
Assuming arrival and service as per Poisson and exponential distributions and Mean service rate,µ
mean service time of36 minutes, calculate 3 minutes = I customer
i) The mean queue size (including train being served) l minute= 1/3 customer
ii) The probability that the queue size e~~· Feb 2006 (6M)
:. µ= }-; customers/ininute
Sol. Mean arrival rate A.
24 x 60 minutes (i.e. I day)= 30 trains Early morning slack period
I minute = 1148 trains i) Average queue length,
~ I . I .
!j
:. 11. =-trams mmute
48
Lq,
A. I2 (X2r
Mean service rateµ µ(µ-A.,)
!'1
36minutes=ltrain
X(X-X2)
~t
.d
ii I minute= X6 trai~s Lq1 = Yi2
~! ii) Expected waiting time in the queue,
:.µ=X'6 trains/minute
i) The mean queue size including the train being served is expected number of trains
w- = A., = (X2)
in the system, qi µ(µ-A.J X(X-X2)
A. II Wq =I minute
L=--=~ · Afternoon slack period
' (µ-A.) (X6- ~8) i) Average queue length
L, =3trains
L
,
A.2 · _
. (7511)
2
ii) The probability that the queue size exceeds I 0,

q, µ(µ-A. 2 ) X(X-Ys)
J6)
10 10
P(~IO)= ( A.) = ( I
48
µ xl =0.06 Lq, =0.9
ii) Expected waiting time in the queue,
7. A postal clerk can service a customer in 3 minutes. The service time is
being exponentially distributed. The inter arrival time of customers is also A.2 (Ys)
exponentially distributed with an average of 12 minutes during early morning wq, = µ(µ-A.i)
X01'-Ys) \
w'b. =4.5minutes '
. I
.·.,~:~",~Mllr~
At what average rate must a clerk ~t super market work in order to ensure Average number of broken down machines in the system,
a probability of 0.9 t~at the customer will not hav!__tO wait longer_!hanJ2 . A.
L =--
minutes? It is assumed that there is only one counter to which customer arrive ' µ-A.
inaPolsson fashion at an average rate of 15/hr. the length of service by the clerk\
Butµ= 4 machines/ hour i.e. mean s~rvice rate, then
has an exponential distribution. 3
Jan:2014 (7 M)/Dec 2012 (7 M)/July 2007 (5 M) L =_A._= - - =3 machines
s µ-A. (4-3)
Sol. As per the given data , 0.9 is the probability with which a clerk works to ensure
that a customer will not have'to wait longer than 12 minutes, then the probability of Non - productive cost due to break down= Rs. 5 I hour
waiting 2: 12 minutes i..e, probability (waiting time:'.':': 12) is I - 0.90 = 0.10 Total number of non - productive hours in 8 - hours a day= 3 x 8 = 24 hours
Mean. arrival rate A. - · :. Total cost I day= Nein - productive cost+ Mechanic charges
I hour= 15 customers = (2~ x 5) + (3 x 8) .
: . A. = 15 customers/ hour =Rs. 144
A. = 15160 customers/minute, MechanicB:
then Average number of broken down machines in the system,
Probability function of waiting time is A.
L =--
f12 ~(µ-A.)e-h•-•J•dt=O.I
µ
0
' µ-A.
But mean servicerateµ=6machines/ hour, then
A.. . .ji(p-1-)t ]"'
;;:?':_(µ-A.) e( . ) =0.10
3
L, = --=I machine.
6-3
µ - µ-A.
-- --··-· 12 Total numberof non - productive hours in 8-hours a day= Ix 8 =8 hours
-~[e-(p-1.J• ]" = 0.10 : . Total cost/ day= Non - productive cost+ mechanic charges
µ 12
={8x5)+(8x5)
- 41µ[o-e-(p-02S)12]=0.IO
=Rs.80
eJ-12p = 0.4µ :. MechanicBshould be hired.
I I mmute
. IO. At the balcony ticket counter of a cinema hall, customers arrive at the rate of
~t=--
2.48 12 per hour according to Poisson distribution. The single clerk at the counter
. 60 serves the customers at the rate of30 per hour.
orµ=-- = 24 .2 customers I hour i) What is the probability that there is no customer in the counter?
2.48
ii) What is the probability that there are more than 2 customers in the counter?
;. 9. A mechaf!ic is to be hired to repair machines which breakdown at an average iii) Average number of customers in.the system (counter) and in the queue.
rate of 3/hour. breakdowns are distributed in time in a manner that may be v) Average time a customer spends in the system and in the queue.
regarded as Poisson. The non-productive time on any machine is considered July 2011 (7 M)
to cost the company Rs. 5/hour. The company has narrowed the choice of Sol. Mean arrival rate A. 0
two mechanics A and B. The mechanic A costs Rs. 3/hour and will service the I hour= 12 customers
machines exponentially at an average rate of 4/hour. The mechanic B cost Rs. :. A.= 12 customers/hour
5/hour and can repair machines exponentially at an average rate of 6/hour. Mean service rate µ
Decide which mechanic should be hired. July 2007 (15 M) I hour= 30 customers
Sol. Mean arrival rate or expected number of machines per unit time A :.µ = 30 cust{)mers/ hour
I hour= 3 machines i) The probability that no customer-in the counter= probability that system is idle,
:. A.= 3 machines I hour
Mechanic A:
-~~-··· . ./-;·-'.0&t~~-l£~jf: ·.;:A~#px~;~~~~L :~ti,~a~~'.'·. ;~~~¥~-~
"""·'.._,, •..,.... 'll ... .!' ..,;:,;::.:_u;,_:·::~.
A. 12
P0 =I--=1--=0.6
µ 30 = f12µ~(µ-A.)e-(µ-~J1 dt 0°r t ··01>~Jo i Lit~
P0 =0.6 ~ ~~ 1~ S~e.Nvl
ii) The probability that there are more than 2c11stomers in the counter, =~(µ-A.)[-e_-<µ_-~>_•]" les\) ~ .
µ -(µ-A.) 12
f Pc~i) > ~ [> k). - .
µA)2+l = (12)3
c:::.:> D
=-;[ 0 _ e-(X-Y.0)12 J
?
P(>2)= ( =0.064
·~
fl ~t pMbcJ.; L;~
30
~ 11. In a machine shop, the inter arrival times at the tool rib are exponential, with I 6 _1v
"fi"""1i'l
an average time of 10 minutes. The length of the service time· is assumed to be
=-x-e /1s
10 I +i~ ~ ~~i\
exponential with a mean of 6 minutes. Find j.J, D. .I ' L' c ~I(' ho'V,,•.>J.:
~
.--?} The probability that a person arriving at the booth will have to wait. =~x0.449 I ~l~l
\1 r-- -t-JW..c t'
I\, . ,. .,
•• ~---
11) Average length of the queue.
---~ ........... z:::::::::~ - 10 ) '°, \t'·,,, ,I_·,
iii) The probability that an arrival will have to wait for more thag 12 minutes =0.27 4J . f ' '
for service and to obtain his tools. ~------~Dec 2010 (10 M) >f 12. In a hair dress by saloon with one barber, the customer arrival follows Poisson
Sol. Mean arrival rate A. distribution at an average rate of one every 45 minutes. The service time is
I 0 minute = I tool rib exponentially distributed with a mean of30 minutes. Find:
I minute=J__ tool rib i) Average number of customers in a saloon.
10 ii) Average waiting time of a customer before service.
:.A.=J__tool rib/ minute
-;::ru) Average idle time of barber. (, Dec 2012 (8 M)/Jan 2014 (8 M)
IO Sol. Mean arrival rate A.
Mean service rateµ 45 minutes = I customer
. I
6minutes=ltool rib I mmute=-customer
45
. ~I
·;1 I minute=_!_tool rib
!I 6 :.!.=_!_customers/ minute
.lj. 45
., Mean service rateµ
:.µ=_!_tool rib/ minute
6
30 minutes= I customer
i) The probability that a person arriving at the booth have to wait = fraction or
. I
probability o_f the server is busy= service utilization factor I mmute=-customer
A I 6 3 30
p=-=-x-=-=0.6
µ 10 I 5 I
:.µ=-customers I mmute
.
30
ii) Average length of the queue,
i)Averagenumberofcustomersinasaloon,
L A.
2
(Xof -~ _(}~5) ..
t/(_!__J__)- IO L - A.
(I I)
q µ(µ-A.)
' - (µ-A.)
16 6 IO
30 45
9
L=-
q IO L, =2
iii) Probability (waiting time~ 12)

-;:.{.'.:: •. ·.<:>~~·;",;!;;1~~}'.'':rf;~~~i~i~pil~;;Riis~~,:~'. :~~~9,~~r·,·t1:.;:::i;;;•j~:~:zrtJ-itff~~i1~~ix:f11~•·u
14. Arrivals at a telephone booth are considel'edto be Poisson distribution at an
ii) Average waiting time of a customer before service,
average time of 8 minutes between one arrival and the next. The length of the
"JI phone call is distributed exponentially with a mean of 4 minutes. Determine
w= "- ·(x;5) C'F --:;:i} Expected fraction of the day that the phone will be in use.
q µ(µ-A.) (_!_)(_!_ _ _!J ii) Expected number of units in the queue.
30 30 45) iii) What is the probability that an arrival will have to wait more than 6 minutes
wq = 60minutes in queue for service? --===
.
·
iii) Average idle time of the barber, iv) What is the probability that more than 5 units are in the system?
July 2015 (10 M)
P0 =l~~=l-(_!_x
µ 45 1
30
) Sol. Mean arrival rate A.
8 minutes = 1 arrival
P0 =0.33 . I . Is
I mmute=-arnva
8
13. The number of customers approaching the tailor appear to be Poisson distributed
with a mean of 6 customers per hour. The t~ilor attends the customers on FIFO :. "-=.!.arrivals/ minute
basis. The tailor can attend the customers at an average of 10 per hour with the 8
service time exponentially distributed. Find Mean service rateµ
i) The average idle time of tailor on a 10-hour working day. 4 minutes= I call
ii) The expected number of customers waiting for tailor's services.
iii) Probability of having exactly 3 customers in the tailor's shop. I minute =..!.call
4
iv) Probability of having 3 or less customers in the shop. July 2018 (12M)
Sol. Mean arrival rate A. :.µ=..!.calls/ minute
4
1 hour = 6 customers
:. A.= 6 customers/ hr i) Expected fraction of the day that the phone will be in use =Service utilization factor,
Mean service rate µ A. I 4
p=- =-x- = 0.5
1 hour= 10 customers µ 8 1
:. µ = 10 customers/hr p =0.Sday
i) The average idle time of tailor,
ii) Expected numberof units in the queue,
A. 6
P0 =1--= 1--=0.4 2
µ 10
L_ = A.2
_ ( 1/)
/8
P0 = 4 hours I day
µ(µ-A.) - .!.(.!._.!_)
ii) The expected numberof customers waiting for tailors service, 4 4 8
A.
2
62 36 Lq = 0.5
L= = -
q µ(µ-A.) 10(10-6) 40
iii) The probability that an arrival have to wait more than 6 min in queue for service,
Lq = 0.9
P( waiting time~ 6) =i ~(µ-A.)e-(µ-•J• dt
iii) Probability of havingexactly3customersin thetrailor'sshop 6µ
P{~3)=(;J =C~)3 A. [ e -(µ-1-Jt

=µ(µ-A.) --(-µ--A.)
]"'
=0.22
= ~[ 0-eix-Ys)'r
r;·
f•
- ~~YT~~~~~~-
~ .~~~.:!~:~~~:~;;~~~~~ ~~~-~ ~~-·:4 ~~;~f~ ~-~~--;/ c 21
'*'·•·';_;~'G):: .. J:Bc0·:~~?i~tif1 '~fc~~{K:r~~{~.~;,1t~i:2iS~~~rii
m> Let A., be the increased (i.e. new) arrival rate to justify the installation of second
I 4 telephone booth.
=-x-e--0.1s Average waiting time in the queue,
8 1
=0.24 W=~
q µ(µ-A.,)
iv) The probability that more than 5. units a\e in the system,
(I 4)
(
A)~' 6
. . .
A.,
4--- --
P(>S)= µ =
81x =0.02
-X(X-"-,)
"J 15. Arrival rate of telephone calls at a telephone booth are according to Poisson I A., A.,
distriJ>Ution, with an average time of9 minutes between two consecutive arrivals.
---=-
9 3 4
The length of telephone calls is assumed to be exponentially distributed with
_!_=A.(.!.+.!.)
mean 3 minutes. 9 I 3 4
i) Determine the probability that a person arriving at the booth will have to
~ ~ '--'.>-'>•· ,,,;.y - - - - - · - - - - - -.. -~~::::O.~::c~-
.!.=A.
9 I 12
(2-)
j
0
* ii) Find the average queue length.
jJI} The telephone company will install a second booth when convinced that an
arrival would expect to have to wait at least 4 minutes for the phone. Find
. ~ _4/
.. r.,-121
the increase in flow arrivals which will justify a second booth. ~crease in flow arrivals =A. 1 - A
iv) What is the probability that an arrival will_h~~.J& ~aitfor wore t~.a.'! IO ~ 4 I
minutes before the phone is free? -~- · ··
==---
21 9
June 2010 (141\1)/Jan 2017 (14M)/ Jan 2015 (14M)
5 I mmute
=- .
..
~;.:
Sol. Mean arrival rate A
9 minutes = I telephone call
63
.,
! '~ .
iv) Probability (waiting time?: I 0)
I minute= 119 telephone call
~i ~
-•:I
:;;1'
:. A.= 119 telephone call/minute J
= !:(µ-A.) e-<µ-i.Ji dt
Me.an service rate µ JOµ
:1l 3 minutes = I telephone call
A. [ e-(µ-i.Ji ]"'
I minute = 113 telephone call =µ(µ-A.) --(-µ--A.-) 10
:.µ = 1/3 telephone call/minute
i) Probability that a person arriving at the booth will have to wait= fraction of the
time the server is busy,
+A. µ-A. [o-e-0S-1')10J
µ (-(µ-A.))
p=!:=~=.!.
µ x 3
= ~"-(-e_2%)
·P=0.33 A. ~
=-e 9 -a
ii) Average queue length, µ
L = A.2 u~r I 3
=-x-x0.108
9 I
q µ(µ-A.)
X(X-~) =0.036
Lq= x
7
•t&'flt~~~!!l5!i~Y;g~f?;0~~1~~i~~GI~~#.f ~c;'QJ~~~~l~J'~¥~~~~ilt~~ ~ ·-
)6. Inthata the

railway yard, goods trains arrive at a rate of 30 trains per day. Assume wq = I08minutes
inter arrival time follows an exponential distribution and the service iv)Averagenumberof trains in the queue
time distribution is also eliponential with an average 36 minutes. Calculate the
following:
i) The average number of trains in the system.
·
Lq=-
i.. i u~s
µ(µ-i..)
~]
1
ii) The probability that the queue size exceeds 10. U6)[3 6-_
iii) Expected waiting time in the queue.
iv) A.verage number of trains in the queue. Lq = 2.25
J/-v) The changes in (i) and (ii) if the input of trains increases to an average 33_pcrday. . v) If the input of trains increases to33 per day, then
Dec 2011 (15 M)
.....1:'. 33 11 . I .
/r-t•=--=-trams mmute,t en
h
Sol. Mean arrival rate i..
60x24 480
24 x 60 minutes(i.e. I day)= 30 trains
.
I mmute=--=-
30 I L __A.__ (11,;so)
60x 24 48 s - (µ-i..)-(_!_ __
11)
~ I . I minute
. 36 480
:.11.=-trams
48 · 47 . 5 .
L, = 33/
17 1.e., . trams= trams_
Mean service rateµ
10 10
36minutes=I train
P(:?:IO)= ( -A.) = ( -11x 36)
-
. I . µ 480 I
I mmute=-tram
36 = (0.825)'°
· µ - II train/ =0.15
· · - 136 I minute ¥
i) The average number of trains in the system, 17.. A public telephone booth is in a post office. The arrivals are considered to be
Poisson's with an average inter arrival time of 1.2 minutes~ The length of the
L=-A.-= y,;8 phone call is assumed to be exponentially distributed, with an average of 4
• (µ-i..) (_!_ __!_) minutes, calculate the following:
36 48 i) What is the probability that fresh arrival will not have to wait for the phone?
L, =3trains ii) What is the probability that an arrival will have to wait more than 10 minutes
before the phone is free? - -~
ii) The probability that queue size exceeds I 0,
iii) What is the average length of the queue~hat forms time to timJ?
P(~IO)= -i...) =
10
(I_x_
36) =0.06
10
iv) What is the probability of finding more than S customers in the system?
(µ 48xl June 2012 (lSM)
Sol. Mean arrival rate i..
_iii) Expected waiting time in the queue,
12 minutes= I arrival
i.. • . I . I
wq µ(µ-A.) I mmute=-amva
12
:.i..= ){2arrivals/ minute
(y,;8)
Mean service rateµ
I ( I I )
36 36 48 4minutes= Iphone call
I minute =J_ phone call
4
l .
f'· :.µ=-phonescalls/minute
4
i) The probability that fresh ~ival will not have to wait for the phone= probability that I
:.A.= -customers/second
there is no arrival in the system i.e. booth is id le, 180
Mean service rateµ
P, =1-;= 1-(~ )=0.67 100 seconds= Icustomer
1
I second =-customers
P0 =0.67 100
ii) The probability that an arrival will have to wait more than l 0 minutes, I
: .µ =-customers I second
;.;
f
P( waitingtime~IO) = ~(µ-A.)e-(µ-1.)• dt
10µ
JOO
i) Average waiting time of a customer in the system,
I 1
~t A [ e-(µ-A)1 ]"' W------
.;
' - (µ-A.)-(-' __ I ).
=µ(µ-A.) -(µ-A.) 10
.:::
~ i
100 180
:·r =~A.[o-e«-XJ"] . W, = 225 seconds
ii) Probability that a customer have to wait for at least I 0 minutes,
1 4 _SI
'"*-- =-x-e /3 P( waiting time~ I0) = P:·(µ-A.)e-{µ-AJ• dt
;t
:.t.
12 1 10µ
=0.06
+;1
.;I iii)Theaveragelengthofthequeuethatformstimetotime, A. [ e-{µ-1.)1 ]"'
'·~.fl =µ(µ-A.) -(µ-A.) 10
~ Ii
:~ ~
~[o_,{,~ ,~)"]
L =-µ-=
_;.:l n (µ-A.) . (~ - Yi) =
-¥.:
L" = 1.5 2
I 100
iv) The probability_ offinding more than 5 customers in the system, = - x - e 45
180 I
A). l
=(12 x-r)4
S+I 6
P(> 5) =(µ =0.53

iii) Average sales counter cashier idle time,
=0.0014 A.
P0 =I--
18. Customers arrive at a sales counter managed by a single person, according to a µ
Poisson's process with a mean rate of20 per hour. The time required to serve a
customer bas an exponential distribution with mean of 100 seconds. Find
oa
= l-(-1-x 100)
180 1 ·
i) Average waiting time of a customer in the system.
ii) Probability that a customer will have to wait for at least 10 minutes.
P0 =0.44
iii) What time on an average, the sales counter cashier is idle? iv) Let the service is speeded up to 80 seconds, then
iv) If the service can be speeded up to 80 seconds, what will be the effect on I
µ = -customers I second, then
probability that a cu~tomer will have to wait for at least 10 minutes. 80
July 2008 (10 M)
.... :!-;!~~~·:~.:~~:.::_ ~·~~~JAi:-~-~-~:i~~~:ii~J~_:·:~/~-~;:;.~~~~:;~:. _;_~~~~:de.1t.~g;~,t.:
P( waiting time~ 10) =

.
f~(µ-A. )e-{µ-•)t dt
~oµ
:;So·:
L =-µ-= K
~ ~~~£~:;~~~~ ~<,
ii) Average length of non - empty queue that form from time to time
G 27
A. [ e-<µ-•)t ]"'
" (µ-/....) (K-1~)
=µ(µ-A.~ -(µ-A.) 10 L =1.43
0
"-;[0-e {~ .~}•] iii) Let A.1 be the new arrival rate to justify the installations of second telephone booth.
Average waiting time in the queue, ,,
I 80 _l.
w =__!:i
q µ(µ-/....,)
=-x-e 72
180 I
" A.,
=0.41
J= .!.(.!.-/....)
19. The rate of arrival of customers at a public telephone booth follows Poisson J J I
distribution, with an average time of 10 minutes between one customer and the
next. The duration of a phone call is assumed to follow exponential distribution, _!__!i=!i
9 3 3
with mean time of3 minutes.
i) What is the probability that a person arriving at the booth will have to wait? I 2\
-=-
ii) What is the average length of the non-empty queues that form from time to time? 9 3
,,;; iii) The telephone department will install a second booth when it is convinced :.f....,=0.17
that the customers would expect waiting for at least 3 minutes for their turn to : . Increase in the flow of arrivals
make a call. By how much time should the flow of customers increase in order
=f...., -/....
to justify a second booth?
iv) Estimate the fraction of a day that the phone will be in use. =0.17-0.1
Aug 2005 (10 M) = 0.07 I minute
Sol. Mean arrival rate A.
iv) The fraction of a day that the phone will be in use= service utilization factor,
I 0 minutes = I customer /.. . I 3 3
. I p =-=-X-=-=0.J
I mmute=-customer µ 10 I 10
10
20. On an average 96 patients per 24- hours day require the service of an emergency
:./....=_!_customers/ minute clinic. ·oil' an average a patient requires 10 minutes of active attention. The
10
Mean service rateµ facility can handle only one emergency at a time. Suppose that it costs the clinic
Rs. 100 per patient treated to obtain an averaging service time of 10 minutes
3 minutes= I phone call and that each minute of decrease in this average time would cost the clinic Rs.10
I minute=_!_phonecall per patient treated. How much would have to be budgeted by the clinic to
3 decrease the average queue size from 11/3 patients to 1/2 patient?
•
:.~L= lJ' phonecall/minute Sol. Mean arrival rate A
Jan 2016 (10 M)/Jan 2010 (10 M)
i) The probability that a person arriving at the booth have to wait= probability that (24 x 60) minutes = 96 patients
the system is busy,
/.. . I 3
p=-=-x-=0.3
µ 10 I
p=0.3
r l!IJ!lp~};~,:i;-!,~;~ftI~if~i1f~Jira~4i~~t· ·.\01'~~9,!l]i~~~:~ -~;®'11µ.i:i~~~ali~-tf::1~~11.~:~~1rwffi•D
.
. 96 l . 21. Goods trucks arrive randomly at a stockyard with a mean of 8 trucks/hour. A
1mmute=-- =-patients
24x60 15 crew of four operatives can unload a truck in 6 min. trucks waiting in queue to
be unloaded are paid a waiting charge at the rate of Rs. 60/ho~r. Operatives are
t.: :.!.= l(5 patients/minutes paid a wage rate of Rs. 20/hour. It is possible to augment the crew strength to 2
,: ·~
Mean service rateµ ,.._

or 3 (of four operatives per crew) when the unloading time will be 4_ minutes or
lOminutes= I patient 3 minutes respectively per truck. Find the optimal crew size. July 2011 (8 M)
Sol. Case (i) Mean arrival rate A.
·;. . l .
l mmute =-patient I hour = 8 trucks
. . 10
:. A. = 8 trucks/ hour
I . I . Mean service rate µ
:.µ=-patient mmute
'JO 0.1 hour (i.e. 6 minutes)= I truck
Average queue size i.e.,expected numberof patients in the waiting line I
lhour=-
0.1
;i.2 (){sf :.µ=I Otrucks/ hour
Lq
µ(µ-!.) I(I I)
10 10 15
Waiting time of a truck
A. 8
4 1 . w = = =0.4
Lq = '3 = 1]patients q ~L(µ-f..) 10(10-8)
Wq = 0.4 hour I truck
Now Lq =I ~is to be reduced to Lq, = Yz by increasing the service rateµ 1, then
:. Waitingtimeofalltrucks=Numbertrucksarriving perhourx Wq
+-·- ;i.2 =8x0.4
1
; Lq, = ( ) where A. 1 =A
L µI µ1-\ =3.2hours
:. Waitingtimecost=Rs.60/hrx3.2hours
i1:· 1 (){sf
f~ 2 = µ1 (µ1 - J{5)
= Rs.192
Operatives wages = Rs 20/hr x No. of operatives
H
~1 µ 2 _.&_8.89x10-3 = 0
= 20 x 4
I 15 =Rs. 80/hr
µ 1 =0.13 or µ 1·=-0.07 :. Total cost= Rs. ( 192 + 80) = Rs. 272 I hr
Case (ii):
µ1 = 0.13 patients/ minute
A. = 8 trucks I hour
I I .
:.-=--mmute I .
patient µ = Mean service rate
µI 0.13
_!_hour(i.e.,4minutes) =I truck
. . d_.b, h . 15 . 15
Averaget1merequlfe yeac patient= -minute I
7. 1hour=){ = 15 trucks/ hr
Decrease .mthe average time . edfior treatment = 10 - -15 = -5 mmutes
. requ1r . 15
2 2 Waiting time of a truck,
The budget required for each patient= Rs.I 00+ ~ x I 0= Rs.125 W= A. 8 8
2 q µ(µ-/..) 15(15-8)-105
Therefore, in order to reduce the size of the queue, the budget per patient must be
increased from Rs. 100 to Rs. 125. wq = Yios hours/truck
Waiting time of all trucks=..!.x8=~hours
105 105 )._ Module~~
•
Waiting time cost= Rs.60 x ~
105
= Rs.36.6
Operatives wages= Rs. 20 x 2 crew strength
= Rs.20x4x2 .JI.·
= Rs.160/hr
:. Totalcost_=Rs.(36.6+ 160)
= Rs.196.6/hr Game theory is a decision theory which is useful in taking decision where the two intelligent
Case (iii) : opponents with conflicting objectives are trying to outdo one another.
A. = 8 trucks/ hour Game: It refers to the situation of conflict and competition in which two or more competitors
µ = Mean service rate (or participants) are involved in making decisions in anticipation of certain outcomes
(result) over a period of time.
~hour(i.e.,3 minutes)= I truck
20 The conflict situation where the knowledge of game theory useful in taking decisions are
I I. Pricing of product, where a company's ultimate sales are detennined not only by the
!hour= =20trucks/hour
11 price levels it selects, but also by the prices its competitors set.
7120
Waiting time of a truck, 2. Putting the bid to win big government contract when several competitors compete
for it.
A. 8
wq =(µ-A.)
--=--
20(20-8) 30
3. A person fighting in an election has conflicting interests. Each candidate is interested
in securing more votes than those secured by the others etc.
I
wq =-hour/truck !tl11~~~~-.~lc:A1"9-<?~··of'<f~.Ml,2il.J~9)il~fiilii§i{~ii;~jMI: Ttt.~RflY·
30
Waiting time of all trucks= _!_x 8=.i.hours The games can be classified into following types on the basis of the following
30 15 characteristics.
1. Based on the chance or strategy: We have two types of games.
Waitingtimecost= Rs.60x_i_
15 (a) Game of strategy: The game in which activities are determined by skill.
= Rs.16 (b) Game of chance: The game in which activities are determined by chance.
Operative wages= Rs. 20 x 3crew strength 2. Based on number of persons: We have two types of game.
= Rs.20x3x4 (a) Two-person game: The game in which number of persons playing is two.
(b) n-person game: The game in which number of persons playing is n.
= Rs.240/hour
• 3. Based on number of activities: Two types of game .
:. Total cost= Rs.(16+ 240) = Rs.256/hour (a) Finite game: The game in which number of activities is finite.
Since total cost of crew size2(i.e.Rs.l 96.6)is less than that of crew size3 (i.e.Rs.240 ), (b) Infinite game: The game in which number of activities is infinite.
the optimal size of the crew is 2 with &operatives. 4. Based on number of alternatives (choices) available to each person:
(a) Finite game: The game in which number of alternatives is finite.
(b) Infinite game: The game in which number of alternatives .is infinite.
. .~~~?ii~~t~~ji,~:~~~--··
. .~:~~~~··:·:;~ ~~~~lf&.~
r . 5. Information to the players about the past activities of other players: If Xi is the probability of choosing course i, we have
(a) Completely availa!:>le x = (x,_ 'S· is . . xm)
(b) Partly available, or not available.at all. m
where IXi = I and xi ~O; i= I, 2, 3 .... m
i~~~!filti9'11ijJti!t~.~1~19n~~JJ~i}*1ljV',: ._.,;:;~ i=J i
1. Payoff: A quantitative measures of satisfaction a player gets at the end of the play.
1\vo- person zero-sum games: A game with only two pJayers, where a gain of one player
·;.
2. Player: Each participant I competitor in a game is called as player. A player may be
equals the loss to the other is known as two-person zero sum game. Jn such a game, interests
an individual, a group of individuals or organization.
of the two players are opposed so that the sum of their net gains are (sum.ofthe game is)
3. 1\vo-person game: The game in which the number players are two only. zero.
4. Zei-o-sum and Non-zero sum games:Jf in a game, sum of gains to one player is Two-person zero-sum games are also called as rectangular games because they are
exactly equal to the sum of losses to another player, so that sum of the gains and usually represented by a payoff matrix in rectangular form.
losses equals zero. The game is said to be zero-sum game; otherwise it is said to be
~~~Blli~~i!'':;J'~~I~~tirl:~ltlll!i!~~!~
non-zero sum game.
5. Strategy: The strategy for a player is the list of all possible actions (moves or courses
of action) that he will take for every payoff (outcome) that might arise. I. Only two players participate.
The rules governing the choices are known in advance to the players and outcome 2. Each player has finite number of strategies (i.e. courses of action) to use.
from a particular choice is known to the players in advance and is expressed in terms 3. Each specific strategy results in a payoff.
of numerical value (Example: Money, percent of market etc.)
4. Total payoff to the two players at the end of each play is zero.
6. Optimal strategy: The particular strategy by which a player optimizes his gains or
losses without knowing the competitor strategies is called optimal strategy. 5. Players act rationally and intelligently.
7. Value of the game: The expected outcome per play when players follow their 6. One player attempts to maximize gains and other attempts to minimize losses.
-~•;.
optimal strategy is called the. value of the gaine. 7. The list of strategies of each player and the amount of gain or loss on an individual
'i!l
::1
'I ' ' :~ i . -
choice of courses of action is known to each other in advance.
II 7.3 STWlTl:GIE$ . 8. Both players make decisions individually prior to the play without direct
!'I
;'j Generally, two types of strategies are used by players in a game. communication between them.
1) Pure strategy: It is the decision rule always used by the player to select (i.e. use) 9. Both,players select and announce their strategy simultaneously.
only one particular course of action during every play. Thus, each player knows in I0. The payoff is fixed and determined in advance.
advance all strategies out of which he always selects only one particular strategy Payoff matrix: The representation of the payoff in terms of gains or losses in the form of
regardless of the other player's strategy, and the objectives of the players is to a matrix, when players selected their particular strategies (courses of action) called as the
maximize gains or minimize losses. Pure strategy is usually represented by a number payoff matrix.
with which the course of action is associated.
In two-person zero sum games, one player's payoff table would contain the same amount of
2) Mixed strategy: The selection of courses of action among the pure strategies with payoff of other player table with the sign changed. Hence, it is sufficient to construct payoff
some fixed probability is called mixed strategy. A player is guessing as to which table only for one of the players.
activity is to be selected by the other and in advance he decides to use all or some of
• his available courses of action in some fixed proportion in any particular occasion.
Let the player A has m strategies represented by the letters: A 1• A ................ Am and player 8
2
.has n strategies represented by the letters: 8 1• B2................ Bn. The number m and n need not
The objective of the player is to maximize expected gains or to minimize expected be equal. The total number of possible outcomes ism x n.
losses by making choice among pure strategies with fixed probabilities.
It is assumed that player A is always a gainer whereas player 8 a loser. Let aii be the payoff
A mixed strategy of a player with m possible courses of action is denoted by a set X of
that player A gains from player 8, when player A chooses strategy i and player B chooses
m non-negative numbers. The sum of these numbers is unity and each number represent the
strategy j, then the payoff matrix is constructed as shown below
probability of with which each course action is chosen.
~i~
By-convention, the rows of the payoff matrix denote player A's strategies and the t:olumns Note:
denote player B's strategies. Player
•
A wishes to gain as large a payoff 'ay. 'as possible and
player B try to reach as small a.value aif as possible. 1. Maximin and Minimax principles are also called as Maximin and Minimax strategies.
~;;. -
2. A game may have more than one saddle point.
i
3. Agame is said to be fair game, ifthe lower-(maximin) and upper(minimax) values
of the game are equal and both equals zero.
The _selection of an optimal strategy by each player without the knowledge of the 4. A game is said to be strictly detem1inable, if the lower (maximin) and upper
competitor's strategy is the basic problem of playing games. The criterion used by the (minimax) values of the games are equal and both equal the value of the game.
players to select their respective strategies so that they may optimize their payoff is referred
to as the 'Minimax-Maximin Principle'. 1:~~&tt~J..;-!$_-1'Q;-~~t~,tiy.1~,gi:~~~~~~iilijj{!it'~t~~!~;_;"~~:_:i:•.;.-
i) Maximin Principle: 1. Select the minimum (lowest) element in each row of the payoff matrix and write them
For player A, minimum value in each row represents the least gain (i.e. payoff) under row minima heading. Then select the largest element among these elements
to him, if he chooses that particular strategy. These are written in the matrix by and enclose it in a rectangle (o).
row minima. Then he will select the strategy that gives largest gain among the row
2. Select the minimum (largest) element in each column of the payoff matrix and write
minimum values. The choice of player A is called the Maximin Principle, and the
them under column maxima heading then select the lowest element among these
corresponding gain is called Maximin value of the game. elements and enclosed it in a circle (0).
ii) Minimax Principle:
3. Find out the element (s) which is same in the circle as well as rectangle and mark the
For player B, who is assumed to be the looser, the maximum value in each column
position of such elements (s) in the matrix. This element represents the value of the
represent the maximum loss to him if he chooses his particular strategy, these are game and is called the saddle (equilibrium) point.
written in the payoff matrix by column maxima. Player B will select the strategy that
gives minimum loss among the column maximum values. This choice of player B
is called the Minimax Principal, and the corresponding loss is the Minimax value of
the game.
iii) Optimal strategy:
The particular strategy by which a player optimizes his gains or losses without
knowing the competitor strategies is called the optimal strategy. OR
The strategy whictt results in the maximin value equal the minimax value in the
game is called optimal strategy.
iv) Saddle point: _ _
The saddle point of a payoff matrix is the position of such an element in the payoff
matrix which is minimum in its row and·maximum in its column. OR
The game is said to have saddle point (equilibrium point), if the maximin value
equals minimax value.
v) Value of the game:
It is the expected payoff (i.e. outcome) at the end of the game, when each player uses
his optimal strategy i.e. the amount of payoff Vat the saddle point. 0
GAllE_ . ~RY . ~~~' ·:-~~:: ,::·_\~?~~·~-~~~F~~j:rf:L: :.:·- ~: .- _ / 1rf~f~itJ~;,~~am
..
~(_,.,·.i
~\~L~:·_ .,:,·~: .~l-t:-/::';;_~g~~~- 'W~~·~~ei§,_

}, 'i,'~~:':· fo~~t~r~1l~l{1~~~2~YEP;'ii9'~LEIW~-{~~r~i~~1fa~t:~:~: equilibrium point and is called a stable game and
corresponding pure strategies are
called optimal strategies.
1) Solve the following ga~e by using maximin (minimax) principle, whose payoff Saddle point position (.\, BJ is the point of intersection of two optimal strategies
matrix is given below: Include in your answer: · and gain at this point is called value of the game i.e. 4.
i) strategy selection for each player. 2) \ Solve the following game by using maximin {minimax) principle, whose payoff
ii) the value of the game to each player. Does the game have a saddle point? matrix is given below: Include in your answer:
Player Player 8 i) strategy selection for each player.
A 8, 8, B, 8, ii) the value of the game to each player. Does the game have a saddle point?
A I 7 3 4 Player Player B
. A, 5 6 4 5 A B, B, B, s. B,
A, 7 2 0 3 A -2 0 0 5 3
SoL Let us assume player A, the gainer and player B, the loser. The positive values in the A, 3 2 I 2 2
pay off matrix represents the payment from player 8 to player A.
A. -4 -3 0 -2 6
The payoff matrix can be written in the form of table shown below.
Player A Player B strategies Row A. 5 3 -4 2 6
Sol. Let us assume, Player A, the gainer and the Player 8, the loser. The payoff matrix can
strategies 8 B 8 8 Minima
A1
A2
, I 7
5 6
3
l©J
Player A
strategies
I
be written in the form of table shown below.
Player B strategies
B, B, B.
Row
B. .B I Minima
A. 7 2 0 Value of the game -2 0 0 5
A1
Column
Maxima
7 7 © 5 A2 3 2 @}:::
t - Ai -4 -3
Minimax value (V) A 5 3 -4 Value of the game
lfplayerAusestrategy A1, the minimum gairfto the player A isatleastmin.{ 1,7,3,4} =I s -~
I
Column Maxima 3 5 -
irrespective of the strategy used by player 8.
I
If player A use strategy A,, the minimum gain to th~ player A is at least min.{5,6,4,S} = 4. ·'!Minimax value (V)
\.
If player A use strategy~' the minimum gain to the player A is at least min.{7,2,0,3} = 0. • The optimal strategy for player A is A,, because he can maximize his minimum
These minimum values are shown under the column Row minima. Now, player A, gain (i.e. I) by choosing A2• -
by choosing his strategy A,, is maximizing his minimum gain. The payoff/gain is
• The optimal strategy for player B is 8 3, because he can minimize his maximum
given by max. {1,4,0} = 4. The strategy chosen by player is maxim in strategy and the
loss (i.e. I) by choosing 8 3•
corresponding gain is called maximin or lower value of the game.
On the other hand, the objective of player B is to minimize his losses. if he choose • Yes, the game have a saddle point (A 2, 8 3) and value of the game is the number at
strategy 8 1, he can lose no more than max (1,5, 7) = 7. If he chose strategy 8 2, the loss the saddle point position i.e. I. (i.e. maxim in value= minimax value= I =value
to him is max (7,6,2) = 7, regardless of A's selected strategy. of the game)
Similarly, the loss to player B is no more than 4 and 5 respectively, if he select 3) Solve the following game by using maximin (minimax) principle, whose payoff
strategies 8 3 and 8 4 respectively. These values are shown with the row column matrix is given below: Include in your answer:
minima. Now, player B, uses strategy 8 3 to minimize his maximum loss. The payoff/ i) strategy selection for each player.
loss is given by min (7,7,4,5) = 4. The strategy selected is called minimax and ii) the value of the game to each player. Does the game have a saddle point?
corresponding loss is called minimax or upper value of the game. Player Player B
It is known from conditions of minimax criterion that minimax. (upper) value is~ A B,
B 8,
maximin (lower) value.
A -2 15 -2
When minimax value= maximin value, the game is said to have a saddle point or
A, -6 -6 -4
A. -5 20 -8
-~,''¥t j;~~ ~~~11~~~
Sol. Let us take player A, the gainer and player B, the loser. The -payoff matrix is 5) Find the range of values of p and q that will render the entry (2,2) a saddle point
constructed as shown below.
Player A
strategies
· Player B strategies
B B B
Row
Mipima
I
:..Maximin-value (Y)
for the game:
Player PlayerB
A B B, B,
A1 2 15 -2. A, 2 4 5
A2 A, IO 7 q
A. I -5 20 -8 A, 4 p 6
Column Maxima I @
...._
20
_,,,,,..@ -
Minimax value (V)
Sol. The payoff matrix is written as shown below. Neglect the values of p and q and
determine the maximin and minimax values.
The positive values in the. payoff matrix represents the payme11t from player B to Player A Player B strategies Row
player A and negative values indicate the income to player B from player A. strategies B, . B, B, Minima
• The optimal strategy for player A is A 1, because he try to minimize his loss in this A1 2 4 5 2
case. A1 IO 7 q [2}- Maximin value (Y)
• The optimal strategy for player Bis B 1 or Bl, because he try to maximize the gain A, 4 p 6 4
in this case. Minimax value (V)
Column- -Maxirn11 Ill
---------- I - - 7 ~-
\::,/ I
• Yes, the game have two saddle points and value of the game is V = -2.
When p and q are neglected, V :f. V and hence no saddle point exists.
4) For the game with payoff matrix: In order to make (2,2) as a saddle point, V=V = 7, but V= 6. In this context, to make
Player PlayerB V=7 i.e. (2,2) as a saddle point, 'p' must be lesser than or equal to 7 and 'q' must be
A B, B, B, greater than or equal to 7 i.e., p ~ 7 and q ~ 7.
A -I 2 -2 6) For what value of A, the game with following pay-off matrix is strictly
determinable?
A, 6 4 -6
Determine the optimal strategies for players A and B. Also, determine the value Player PlayerB
of the game. Is this game (i) fair? (ii) Strictly determinable? A B, B, B_
Sol. The payoff matrix is written as follows assuming, player A, the gainer and player B, A, A. 6 2
the loser.
Player A PlayerB Row I A, -I A. -7
strategies
I strategies
B B,
Minima
Value of the game
Sol.
A -2 4 A.
Jan 2006 (06M)
Construct the payoff matrix and determine the maximin and minimax values by
A1 -1 2 ~ Maximin value (Y) neglecting /....
A, 6 4 -6 Player A Row
Saddle point position Player B strategies
strategies
Column Maxima 6 4
?
Minimax value (V) A1
Bl
A.
B~
6
B
~
Minima
• The optimal strategy for player A is A1• i..-=:...r-- Maxim in value (Y)
AZ -I A. -7 -7
• The optimal strategy for player B is Bl, A, -2 4 A. -2
• Value of the game is -2. Column Maxima
ED 6 2
• Since maximin value= minimax value= -2 :f. 0, the game is strictly detenninable. t
Minimax value (V)
~·
1~!~!
~
j.
i=
~
..
I" ;.
~; .
l '
.. I · .. ·~-:?r~s~lf$J!~F•~~~~;ylt{'., • '
When ;\ is neglected
Maxim in value = V = 2;
oiiERATfoxsRiSiARtill . :,~;.-~~:~~~-~~:~-~~:;it:~~i~~~J~~~:~~'..~:~;~.~; <::}~ -:~~'..:~-
The rules (or principles) of the dominance are used to reduce the size of the payoff
,1,tt Minimax value = V= I~ matrix. These rules help in deleting certain rows and I or columns of the payoff matrix
I~· jl:.j Since V 'f:. Y, no saddle point exists and hence cannot be categorized this game as which are inferior (less attractive) to at least one of the remaining rows and I columns
~ either strictly determinable or fair. ' (strategies) in terms of payoffs to the both the players. Rows and I or columns once deleted
~l,u To make the game strictly determinable, V= Y,ifc·O. will never be used for determining the optimum strategy for both the players.
Case (i): ·
r~
''!
_If maxim in value (Y) = 2, substitu\e :\= 2 to make Minimax value ( V) = 2, then the
The dominance principles used for the evaluation of two-person zero-sum games
without the saddle point are as follows
value' of the game is +2 and game becomes strictly determinable.
I. For player B who is assumed to be the looser, if each element in a column, say 'c,' is
Case (ii):
·L If ininimax value ( V) =·-1, substitute;\= -1 to make Maxim in value (Y) = -1, then greater than or equal to the corresponding element in another column, say 'c,' in the
:" ~
value of the game is -1 and game becomes strictly determinable. payoff matrix, then the column c, is said to be dominated by column c, and therefore
·i
q·
;, Therefore, for the game to be strictly determinable, the value of;\ should be in the column c, can be deleted from the payoff matrix. In other word player B will
never use strategy corresponding to column c, because he wil I lose more by choosing
between - I and 2 i.e. -I :SA. :S 2.
such strategy.
~
'\•
; 7) If the following payoff matrix has a saddle point, determine the value of the
2. For player A, who is assumed to be gainer, if each element in a row, say 'r,' is less
game and ranges of P and Q. - than or equal to the corresponding element in another row, say 'r,' in the payoff
Player B _
matrix, then the row r, can be deleted from the payoff matrix. In other word player A
I QI 6
will never use strategy corresponding to row r, because he will gain less by choosing
Player p
-i· 5 10 such strategy.
:1 A
6 2 3__. 3. The strategy 'K' can also be dominated ifit is inferior (less attractive) to an average of
;r-
r. Dec 2010 (06M) two or more other pure strategies. In this case, ifthe domination is strict, then strategy
( Ignore the values of P and Qand determine maxim in and minimax values. The payoff K can be deleted. lfthe strategy 'K' dominates the convex linear combination of some
J. Sol.
of-:-·
matrix is constructed as shown. other pure strategies, then one ofthi; pure strategies involved in the combination may
]f
Player A I Player 8 Row be deleted. The combination will be decided as per rules I and 2 above.
~n.• strategies Minima Value of the Note: Rules (principles) of dominance explained above are used when the payoff matrix is
game (V)
:.!
I I ciJ/ Maxim in value (Y)

a profit matrix for the player A and loss matrix for player B. Otherwise the principle gets
reversed.
2 p~ 7.Q MIXED STRATEGIES: GAMi;'v\i,tT~OO'f-THE SADDLE POINT

3 6 2
Saddle point In certain cases, the solution for a game cannot be obtained by using any particular
Column Maxima I 6 (3) 10
t 1 _ .•
pos1t1on (pure) strategy i.e. no saddle point exists. In such cases, to solve the game, both players
Minimax value (V) must use the optimal mixture of strategies to find the saddle point.
When P and Q are neglected, maximin value ( Y) = minimax value ( V) = 5. The The optimal mixture of strategies for each player may be determined by assigning to
saddle point position is (2, 2) and value of the game is 5. i.e. V = 5. each strategy its probability of being chosen. The strategies so determined are called mixed
In order to make the value of the game as 5, P must be greater than or equal to 5 and strategies, as they are the probabilistic combination of avlilable choice of the strategies.
Q must be smaller than or equal to 5 i.e. P :'.'. 5 and Q :S 5. A mixed strategy game can be solved either by
(i) Analytical or Arithmetic method
(ii) Graphical method and
-··: /:':~::.'~~§j~~~l
The arithmetic method (alsp known as short cut method) provides an easy method for
8)
GAME .TiiEORY
- ;.:_:, __ .-,
~;.··
Solve the game whose pay-off matrix to the p•ayer A is given below:
----·
'·_'.';';:';~i·
··.'~/··~···
:~- ~- ~~::~~~~~~1~~~
findi•g optimal strategies for each player in a payoff matrix of size 2 x 2 without saddle Player A Player B strategies
strategies I II III
point.
The following steps are to be followed. I I 7 2
I. Find the difference between the two values in first row and put it against the second II -6 2 7
row o,fthe matrix', neglecting negative sign (if any). Ill 5 2 6
2. Find the difference between the two values in second row and put it against the first July 2009 06CS661 (lOM)
row of the matrix, neglecting negative sign (if any). Sol. Search for the saddle Pl? int if any for -payoff
-
matrix shown below.
Player A Player B strategies Row
3. Repeat steps l and 2 for the two columns also. .-
strategies Minima
The values so obtained by 'swapping the differences' represent the optimal relative
frequencies of play for both player strategies. These may be converted into probabilities by I II III
dividing each of them by their sum. I I 7 2 I
Note: The arithmetic method should not be used to solve 2 x 2 game having saddle point,
because the method gives an incorrect answer.
rr
III
6
5
2
2
7
6
m
~M . .
[I]..--- ax1mm value {Y)
Column Maxima
cp©7
Minimax value (V)
7
-
Since Maximin value (Y) :f Minimax value (V ), no saddle point exists. It is not a
pure strategic problem, but a mixed strategic problem.
Reduce the size of the payoff matrix by using principles of dominance.
• On comparing strategies II and III of player A(i.e. rows II and III), all the elements
of row III are lesser than or equal to the corresponding elements of row II. Hence
strategy/row Ill is less attractive or inferior to player A compared to row II i.e.
row II is dominating over row IILH1i~ is because the objective of player A is to
maximize the income by choosing the optimal strategy that gives him more profit.
Delete the row III completely, then the payoff matrix obtained is shown below.
Player A Player B strategies
strategies I II III
I I 7 2
II 6 2 7
• On comparing the columns/strategies I and III of player B, all the elements of
0 column III are greater than or equal to the corresponding elements of column I.
Hence strategy III is iess attractive or inferior to player B compared to strategy/
column I. i.e. column I is dominating over column Ill. This is because the
objective/aim of player B is to minimizes his losses by choosing optimal strategy
that led to cause minimum losses. Delete column III completely. The resultant
payoff matrix is shown below.
~-~~;g· -~"J:;. -{ ,x~?q~f'. :!f~l§~1;~(~&J'.K'&i~~~A~~~li~m~~~~9~
Player A PlayerB Probabilities Oddments
of A
GAME THEORY ~
-:
. ~4~~
~. .-~1'~~~~
• The probabilities with which player A uses ·the optimal strategies is 0.4,0.6 and 0
respectively for the strategies I, II and III. ·
strategies
strategies
. I II • The probabilities with which player B uses the optimal strategies is 0.5,0.5 and 0
I 1-.. _,,7 P1 4 respectively for the strategies I, II and III.
II . 6">:."2 p,_ 6 • Value of the game V = 4.
Probabilities q, . q, 9) Deduce the following game by dominance principle and find the value of the
Oddments of B 5 5 game.
Let p and p2 be the probabilities with which player A uses strategies_ I and II Player A Player B strategies
1
respe<;tively. strategies B B, B, B,
A's oddments : A, J 2 4 0
I" row = Difference of two elements of row II ignoring sign ..
A, 3 4 2 4
=6-2=4 A, 4 2 4 0
11nc1 row= Difference of two elements of row I ignoring sign
=7-1=6
A, 0 4 0 8
Dec 2006 (07M), Jan 2008 (16M), June 2012 (08M), July 2016 (lOM)
To find p1 and p2
& July 2018 (08M)
4 4
P1 = 4 + 6 =10= 0.4 ; Sol. Search for the saddle point, if any, in the payoff matrix shown below.
Player A Row
6 6 Player B strategies
P2 = 4+6 =10=0.6; strategies Minima
B, 8, 8, 8,
P1 + P2 =0.4 + 0:6=1
A1 3 2 4 0 0
Let q1 and q2 be the probabilities with which player B uses strategies I and II ~ Maximin value 0£)
;.- Ai 3 4 2 4 11]
'·' respectively.
A3 4 2 4 0 0
B's oddments :
A. 0 4 0 8 0
!I'.j I" column = Difference of two elements of column II ignoring sign
=7-2=5 \'/ Column Maxima ~ ) 8
",j
nnc1 column = Difference of two element~"of column I ignoring sign '--.J/
'.j. =6-1=5 Minimax value (V)
To find q 1 and q 2 Since Vf. y, no saddle point exists.
5 5 Solve the problem using principles of dominance.
q =-=-=0.5·
I 5+5 10 ' • On comparing the rows A 1 and A3, the strategy A1 is found to be inferior for
5 5 player A compared to strategy A3, as all the elements of A1 are lesser than or
q2 =-=-=0.5: equal to the corresponding elements of A 3• Delete the row A 1 completely, then the
5+5 10
obtained payoff matrix is
q/ q, = 0.5 + 0.5 =I
-
Valueofthegame V
(I x 2)- (7 x 6) oa Player A strategies IPlayer B strategies
(I + 2) -(7 + 6) 81B, Bl B
Az 3 4 2 4
v = (2 - 42) = -40
(3-13) -1-0 A1 4 2 4 0
V=4 A4 0 4 0 8
• On comparing the columns 8 1 and B1, the strategy B1 found to be inferior/less
attractive for player B. Delete column B1 completely. The payoff matrix remained
is
...... Player A strategies
· ·. 1;~;·1~~11<>~&,~~Jt
Player B s~tegies
~~~:'flfEQ~r.
10)
·: ~ -;;Ki-:~f~J:t~;m~&~
Players A and B play a game in which each has three coins, a Sp, lOp and a 20p.
B, B. B Each selects a coin without the knowledge of the other's choice. If the sum of the
coins is odd amount, then A wins B's coin. But, if the sum is even, then B wins
A2 4 2 4
A's coin. Find the best strategy for each player and the value of the game.
A3 2 4 0 Sol. Construct the payoff matrix assuming player A, the gainer and player B,·the loser,
A4 4 0 8 by u,sing given data.
• Neither a row, nor a column could be deleted based on individual comparison Player B strategies
. Player A Row
with ~orresponding row or column. Now compare column B2 and average of I fl III
strategies Minima
column 8 3 and B4, the elements of column 8 2 are!ess attractive compared to !Op
ave.rage ofB 3 and B 4• Delete the column B2 completely.
I-+ Sp -5
• Similarly, on deleting column 8 2, row A2 is found to be less attractive than-the II-+ !Op
average of A, and A,. Delete the row A,- ".ompletely. Tht? resultant payoff matrix is Maximin value (Y')
-
Player A Player 8 Probabilities Oddments
Ill-+ 20p
strategies Strategi1;s of A Column Maxima . Saddle point
B, 8,
Minimax value (V)
AJ 4~ ,,.o P1 8 (Sum of coins-+ odd -+A wins B's coin)
o>:)("-8 p, 4
A.. (Sum of coins-+ even -+ 8 wins A's coin)
Probabilities q, q, The optimal strategy for player A is II i.e. !Op;
Oddments of B 8 4 The optimal strategy fo.£ player B is I i.e. Sp;
Value of the game V=V= ~ = S.
Let p1 and p2 be the probabilities with which player A uses the strategies A3 and A4
respectively.
11) In a game of ~atching coins with two players, suppose 'A' wins one unit of value
To find p1 and p2 when there are two heads, wins nothing when there are two tails and losses half
8 8 unit of value when there is one head and one tail. Determine the payoff matrix,
P1 = 8 + 4 =12= 0.67; best strategies for each player and the value of the game to A. July 2010 (14 M)
Sol. Construct payoff matrix assuming player A, the gainer and player B, the loser by
4 4
p2 =-=-=0.33· making use of given data.
8+4 12 H&H-+one unit from B to A
Let q1 and q2 be the probabilities with which player 8 uses the strategies 8 3 and 8 4 T&T-+ no loss/gain
respectively.
To find q 1 and q 2
4
q =-=0.33'
H&T/T&H-+ half unit from A to 8.
Player A
strategies
Player 8 strategies
I 2
Row
Minima
I
8+4 '
I
I
H T
. 8 1-+H
q,=-=0.67;
- 8+4 2-+T
I
• J/2
-1/2 I~,
~ Maximin value (Y')
(8 x 4)- (0) 32
• 0
~
Value of the game V =- Column Maxima
(8+4)-(0) 12 I -
_ Minimax value (V)
V=2.67
Since V =/; ~, no saddle point exists. It is a mixed strategic problem.
• The probabilities with which player A uses the strategiesA 1, A2, A3, A4 is 0,0,0.67
and 0.33 respectively.
• The probabilities with which player 8 uses the strategies 8 1, 8 2, 8 3 and 8 4 is 0, 0,
0.33 and 0.67 respectively.
• Value of the game V = 2.67
-·;~Kt~~ :-.~;;;~~£1t1Bi~1~§~~t~ii.~~~~~4~~~~~ti~: ·_:~,. :OPERAfi6j~1i£&ifutcH
.:.. . . : . ..- .
~ '";:~ ~:· . -~ ' •;_" '
GAME 1'11Eo~Y ..•. f.:.,;:~~¥'.~fV- .,;~:~\(~;K:~~;~~{~~~~ft~~;1,titfffef~f~tfi~Jit,~~\~. .
H and H- Player A wins Rs. 8
Player Bstrategies T and T _. Player A wins Re. I
Player A
2 Probabilities Oddments of A
strategies • l T and H/H and T _. Player B wins Rs. 3.
H T I would like to choose Plaver
-- -A--
J_.H I ~ ,,,-112 P1 112 Player B strategies
2-r -172 .k)Clll.. 0 p, 3/2 Pll!yerA Row
I 2
strategies Minima
Probabilities q q, H T
Oddments of B 1/2 3/2 J_.H 8 -3 QJ ..... ~ Maxim in
Let p1 and p2 be the probabilities with which player A uses the strategies I and 2 2-T -3 I Q]k value (Y)
(i.e~ H&T) respectively. Column Maxima 8 CD
To find p1 and p2 -
=~= 2· --02s·
Pi 0.5 + 1.5. '
0 5
Since Vi Y, no saddle point exists.
Minimax value (V)
5 Let p1 and p2 be the probabilities with which player A uses the strategies I and 3
=-1._- =.!.2 =0 75· respectively.
p2 1.5 + 0.5 2 . '
Similarly q1 and q2 be the probabilities with which player B uses the strategies I and
Let q1 and q2 be the probabilities with which player B uses the strategies I and 2 (i.e. 2 respectively.
H&T) respectively. To find p1 and p2
To find q1 and q2 A's oddments_. I - (-3) = 4
=~=o.ss=025· _. 8 - (-3) = II
q, 0.5+1.5 2 . ' 4 4
p1 = - - =- =0.27;
=-1._S-=.!_2=0 75 · 11 +4 15
q2 0.5+1.5 2 . ' 11 11
p2 =--=-=0.73'
(lx0)-(-0.Sx0.5) 4+11 15 '
VaIueo f thegame V
(I+ 0)-(-0.5 - 0.5)
t To find q 1 and q2
! - 0-0.25 - 0-0.25 - -0.25
V----------
B's oddments_. I - (-3) = 4
_. 8-(-3) = 11
n
1+1 l+l 2
I 4 4
V=--=-0.125 qi =--=-=0.27;
8 11+4 15
11 II
• The probabilities with which player A uses the strategies I and 2 is 0.25 and 0.75 q1=11 +4 =15=0.73;
respectively.
(8xl)-(-3x-3) -I
• The probabilities with which player Buses the strategies I and 2 is 0.25 and 0.75 ValueofthegameV -
respectively. (8+1)-(-3-3) IS
• Value of the game V = -1/8 = -0.125. V=-0.067
•
12) In a g~me of matching coins, player 'A' wins Rs. 8, if both coins show heads and The probabilities with which player A (i.e. me) uses the strategies I and 2 is 0.27 and
Re.1, if both are tails. Player 'B' wins Rs. 3 when coins do not match. Given the 0.73 respectively.
choice of being player A or player B, which would you choose and what would The probabilities with which player B (opponent) uses the strategies I and 2 is 0.27
be your strategy? Jan 2010 (lOM) and 0.73 respectively.
Sol. Let us assume player A, the gainer and player B, the looser. Construct the payoff Value of the game V = -0.067
matrix as per the given data as shown below.
Note:
·: ~~ :~:~~~;::·~~;~ ··•:::.·oii~.f.fsi•tRik~1-
."((~t[;-
• ' •, "'~- -~·. - ·-· .-· ••. _:·~·.~.. _.,..:.....,'!.-•.' GAME THEORY
13) Solve the following game: .

Player A Player B strategies Oddments
. Player A Player B strategies Probabilities
strategies strategies II III of A
f II III IV
I 15~- _,,..12 17
I 20 15 12 35
3 2.k
,>C
-,..19
'li
2. 25 14 . 8 10 p, 3
Probabilities q q,
3 40 2 19 5
Oddments of B 7 13
4 5 4 11 0
Jan 2010 (lOM) Let p1 and p2 be the probabilities with which player A uses the strategies I and 3
Sol. Construct the payoff matrix based on an assumption of player A, the· gainer and respectively.
player B, the loser. Check for the saddle point if any. Similarly q1 and q2 be the probabilities with which player B uses the strategies
II and III respectively.
Player A Player B strategies Row To find p1 and p2
strategies I II III IV Minima 17
Maxi min p =--=0.85·
I 20 15 12 35 [ill-+- value 0{) I 17 +3 '
2 25 14 8 10 8 3
P' =--=0.15·
3 40 2 19 5 2 - 17 +3 '
4 s 4 II 0 0 To find q 1 and q2
Column Maxima 40 (15) 19 35 7
qi=-- =0.35;
7+13
Minimax value 0/)
13
Since V"f Y.., no saddle point exists. Solve it by using the principles of dominance. q, = 13 + 7 =0.65 ;
• On comparing rows 1 and 4, row 4 found to be inferior for player A and hence
delete it. (19xl5)-(t?xl) (285 -24)
ValueofthegameV - -
• Delete the columns I, as it is found to be inferior to player B compared to column .(19+15)-(12+2) (34-14)
II. The payoff matrix obtained is 261
Y= =13.05
Player A Player B strategies 20
strategies II III IV 14) Solve the following game by dominance method:
I 15 12 35 Player A Player B strategies
2 14 8 10 strategies I lI Ill IV
3 2 19 5 I 6 8 3 13
• On comparing rows I and 2, row 2 is found to be inferior for player A compared II 4 I 3 5
to row I and hence delete it completely. The obtained payoff matrix is Ill 8 IO
4 12
• Player A Player B strategies IV 3 6 7 12
strategies II III IV Dec 2012 (08M) &Aug 2005 (08M)
I 15 12 35 Sol. Construct the payoff matrix and search for the saddle point, if any, in the matrix
shown below.
3 2 . 19 5
• Ultimately, delete column IV, as it is found to be less attractive compared to
column II. The resultant payoff matrix obtained is shown below.
.. Player A Player B strategies
m··
OPERATIONS REsEARCH
Row
Minima
•:,-·
~
GAME THEORY
To find q 1 and q 2
..
strategies
I
I
6 . II
8 3
IV
13 3
3 3
qi =--=-=0.375;
3 +5 8
II 4 I 5 3 I Maxim in
5 5
q, =-=-=0.625;
Ill 8 . IO 4 12 W*- value (y) - 3+5 8
IV 3 6 7 12 3 Value of the game
Cojumn Maxima 8 10 (7) 13 v (8 x 7)-(4 x 3) = _i.4
(8 + 7)- (4 + 3) 8
Minimax value (V)
Since ·V f. y, n~ saddle point exists. Solve it by using principles of dominance to V=5.5
reduce the size of the payoff matrix to 2x2. The probabilities with which player A uses strategies I, II, Ill and IV are 0, 0, 0.5 and
I•
• On comparing columns II and IV. column IV is found to be inferior for player B 0.5 respectively.
and hence delete it completely. The probabilities with which player B uses strategies I, II, Ill and IV arc 0.375. 0,
• On comparing rows I and Ill, row I found to be inferior to player A compared to 0.625 and 0 respectively.
Ill and hence eliminate it. The payoff matrix obtained is shown below. Value of the game V = 5.5.
Player A Player B strategies 15) Find the optimal strategies and value of the game by using dominance rule for
following game.
strategies I II III
II 4 I 5 Player A Player B strategics
strategies B, B, 13.
Ill 8 10 4
A -4 6 3
ll:- IV 3 6 7
F
Ii;
A, -3 -3 4
• On comparing row II and average ofrows III and IV, row II is found to be less
i
~.'.'.7'·.'.·.:.· attractive to player A and hence delete it. A. 2 -3 4
• Column II found to be inferior to player B compared to column I and hence delete July 2017 (08M) & Jan 2018 (IOM)
'f" Sol. Construct the payoff matrix and search for.the saddle point, if any, in the table given
col limn 11 como1ere1v. 1ne resultant ILXLJ oa 1orr mamx 1s snown oetow. below.
Player A Player B strategies Probabilities Oddments
L Player A Player B strategies Row
strategies I III of A
l strategies
l_, B, B, B, Minima
IV
Ill
-.-
8 ""'- _...-4
3 .J<-' ---i...7
P1
p,
4
4
A1 -4 6 3 -4
Probabilities q q,
A1 -3 -3 4 IJJ~ Maxim in
Oddments of B 3 5
A 2 -3 4 IJJ ..... value({)
Column Maxima (2) 6 4
Let p 1 and p2 be the probabilities with which a player A uses strategies Ill and IV
respectively. Minimax value (V)
Similar!~ q 1 and q2 be the probabilities with which a player B uses the strategies I Since Vf. y, no saddle point exists. Reduce the size of' the matrix to (2x2) using the
and III respectively. principles of dominance.
To find p 1 and p 2
• On comparing rows A2 and A3, row A2 is found to be less attractive for lhe player
4 4 A and hence delete it completely.
P1 =--=-=0.5;
4+4 8
• Column 13 3 is found to be inferior for the player 13 compared to column 131' delete
4 4 column 8 3 completely.
p 2 = + =3=0.5;
4 4 The resultant (2x2) matrix is shown below.
.... Player A
strategies
Player -8 strategies
8, 8,
Probabilit-ies
.OPERATIONS ,REsEARCH.
Oddments
of A
GA:ME_ THEORY
Sol. Search for the saddle point, if any, in the payoff matri~ given below.
Player A Player 8 strategies
.
-
Row
AID
strategies 8, B, Bi· B. 8, 86 Minima
A, -4 6 P, 5
A, 2 -3 p, 10 ~I 0 0 0 0 0 0 0
Probabilities q . q, Az 4 2 0 2 I I 0
Maximin
Oddments of B 9 6 A) 4 3 I 3 2 2 OJ - value(Y)
Let _p 1 and p2 be the probabilities with which a player A uses strategies A1 and A3 A4 4 3 7 -5 I 2 -5
,,
respectively. As 4 .) 4 -I 2 2 -I
Similarly q 1 and q2 be the probabilities with which a player B uses the strategies 8 1 A, 4 3 3 -2 2 2 -2
and B2 respectively.
~
Column Maxima 4 3 7 3
To find p 1 and p 2
5
P1 =--=0.33- Minimax value (V)
5+ 10 , Since V-:/- ~, no saddle point exists.
10 Reduce the size of the matrix by using the principles of dominance
Pz = S + l O = 0.67;
• On comparing the rows A1 and~ with row~ individually, A 1 and A2 are found
To find q 1 and q 2 to be inferior and hence delete the rows A1 and A2 simultaneously, then the payoff
9 matrix obtained is
q, =--=0.6;
9+6 Player A Player B strategies
6 strategies B 8, B_ B. 8 8
qz = 9+6 =0.4; 4 3
Ai I 3 2 2
(-4 x ~3)-(6x 2) A4 4 3 7 -5 I 2
Valueofthegame V
(-4-3)-(6+ 2) As 4 3 4 -I 2 2
v +12-·12 =_Q.__=0 A6 4 3 3 -2 2 2
-7-8 -15 • On comparing As and A6, the row A6 is found to be less attractive for player A.
0.33 and .067 be the probabilities with which player A uses the strategies A1 and A3 Delete row A6 completely. In addition to this, the columns 8 1 and 8 2 found to be
respectively. less attractive compared to column 8 6• Delete the columns 8 1 and 8 2 completely.
0.6 and 0.4 be the probabilities with which a player 8 uses the strategies 8 1 and 8 2 The payoff matrix obtained is
respectively. -
Value of the game V = 0.
strategies 8- B_ 8- B
16) Use dominance rule to find the optimum strategies for both the player.
Ai I 3 2 2
A4 7 -5 2
strategies
8 B, B, B. B< B,
0 - 0 As 4 -I 2 2
A, 0 0 0 0
• Delete column 8 6 completely, as it is found to be less attractive compared to 8 5
A, 4 2 0 2 I I for player 8, then
A, 4 3 I 3 2 2 Player B strategies
Player A
A, 4 3 7 -5 I 2 strategies B B B
A, 4 . 3 4 -I 2 2
A) I 3 2
A, 4 3 3 -2 2 2
A4 7 -5 I
July 20l1 (lOM), Jan 2014{07M),Jan2014and2015 (07M) and July 2014 (12M)
As 4 -I 2
... OPERATIONS RESEARCH
• On comparing-column 8 5 with average of B3 and 8 4 it was found to be less

· attractive and hence delete it completely. Also, the row A5 found to be inferior
GAME THEORY
J 7) Solve the following game using dominance principle:

Player A
-
Player 8 strategies
..
compared to average of A3 andA 4 and hence eliminate it completely. The resultant strategies I II III IV v
payoff matrix is . . J 3 5 4 9 6
Player A
strategies
Player B strategies
.,
8' BJ
Probabilities
Oddments
of A
' II
Ill
5
8
6
7
3
9
7
8
8
7
A) I 3 P1 12 IV 4 2 8 5 3
AJ 7 -5 p; 2 April 2018 (081\i) &Jan 2010 (IOM)
Probabilities q, q, Sol. Construct the payoff matrix and search for a saddle point, if any
Oddments of 8 8 6 Player A Player 8 strategies Row
. Let p1 and p2 be the probabilities with which player A uses the strategies A3 and A4 strategies I II III IV v Minima
respectively. I 3 5 4 9 6 3
To find p 1 and p2 II 5 6 3 7 8 3
12 12
p = - - =-= 0.86-
1 2+ 12 14 ,
Ill . 8 [Q2J 9 8 7 [II+ Maxim in
IV 4 2 8 5 3 2 value 0D
2 2
p, =·--=-=0.14·
- 2+ 12 14 , Column maxima 8 (]5 9 9 8
p, +p:=0.86+0.1_4=1 Minimax· value (V)
Since V = Y = 7, saddle point exists and value of the game Vis 7. But as per given
Let q1 and q2 be the probabilities with which player Buses the strategies 8} and B4
statement, solve it by using the principles of dominance.
respectively.
To find q 1 and q 2 • On comparing rows II I and IV, row JV found to be inferior for player A and hence
8 8 delete the row IV completely.
q =--=-=0.57;
8+6 14 • On comparing columns I and JV, column IV found to be inferior for player Band
i I
hence delete the column IV completely. The payoff matrix obtained is shown
' 6
q,=--=i.=0.43; below
1~ - - 8+6 14
q, + q2 = 0.57 + 0.43 =I Player A Player 8. strategies
then,valueofthegameisgivenby ·
strategies I II III v
J 3 5 4 6
(lx-5)-(7x3) -26
v- = - = 1.86 II 5 6 3 8
(1-5)-(7 +3) -14
Ill 8 7 9 7
• The probabilities with which player A uses the strategies A,, A2 , A}, A4 , A 5 and A0 • On comparing columns II and V, column Vis found to be less attractive for player
is (0.0, 0.86, 0.14. 0 arid 0) respectively. B and hence delete it completely. Then the payoff matrix obtained is
• The probabilities with which player Buses the strategies B,, 8 2 , B,, 8 4 , 8 5 and 13,, Player A Player B strategies
is (0, 0, 0.57, 0.43, 0 and 0) respectively. strategies ·I II Ill
• Value of the game V = 1.86
I 3 5 4
II 5 6 3
III 8 7 9
~ ·-···· o'klinoNS REsEAR.ce ~G.k~,~~~~~i-~~il~
• Now compare rows I and II with row llI solely. Rows I and II are found to be
.
• ·On comparing columns I and III after eliminating row IV, it is noticed that column
inferior compared to row III and hence delete rows I and II completely. The III is less attractive for player B and hence delete it completely. The payoff matrix
resultant oavoff · · · ·--
---- -- ---
obtained is shown below.
'
strategies I II III Minima strategies I II IV v
III .8 l<VII 9I 11 I 1 3 5 9 3
Column Maxima 8 (J)I 9I II 5 67 8
The optimal strategy for player A is Iii III 8 78 9
The optimal strategy for player B is II
• Delete columns IV and V, as they are inferior to player B. The resultant payoff
Value of the game Vis 7.
matrix obtained is shown below.
Note:
If dominance rules/principles are to be used to solve game problem with saddle Player A Player B strategies
point, it is not necessary to reduce the size of the payoff matrix to 2x2 and to find the strategies I II
probabilities of using those strategies. II 3 5
18) Solve the following game using the concept of dominance, whose payoff matrix II 5 6
is given below: III 8 7
Player A Player B strategies • Ultimately, compare rows I, II and III, and eliminate rows I and II, as they are less
strategies I II Ill IV v attractive for the la er A. The resultant a off matrix is
I 3 5 4 9 3 Player A Player B strategies Row
II 5 6 9 7 8 strategies I II Minima
Maximin
Ill 8 7 8 8 9 III 8 Jill]
value (y)
IV 4 4 8 5 3 Column Maxima 8
Jan 2009 (lOM)
Sol. Construct the payoff matrix as shown below in the table and search for the saddle Minimax value (V)
Do111t, 1t anv. The optimal strategy for player A and B is III and II respectively and value of the
Player A Player B strategies game is 7.
Row
strategies I II Ill IV v Minima 18) For the game having following payoff table, determine the optimal strategy for
each player by successively eliminating dominated strategies. Indicate the order
I 3 5 4 9 3 3
in which you eliminate strategies.
II 5 6 9 7 8 5
Maxim in Player A Player B strategies
Ill 8
4'~
[ill]
8 8 9 0+-
value (y) strategies 1 2 3
IV 4 5 3 3
I I 2 0
Column Maxima 8 (j) 9~9 9
2 2 -3 .. -2
Saddle point 3 0 3 -1
Minimax value (V)
Since V= y = 7. saddle point exists and value of the game V is 7. Jan 2010 06CS661 (lOM)
The optimal strategy for player A and Bare Ill and II respectively. Sol. Construct the payoff matrix· and search for a saddle point, if any, in the table shown
13ut, as per the direction of the statement/condition, solve it by using principles below.
dominance.
• On comparing row IV with either row 11/111, it is found to be less attractive for
player A and hence delete it completely.
•:·Qif;~1'J,Q~~;~~(:H ohi'i"~IM.~;15~~*<~'-' . .__·.~- .:.: :;~/~~}:~t~-:t;1~:~!;f!~r~~ \:,-·:t·:-.i-
Player A Player B strategies Row Player A Player B strategies Row
strategies I 2 3 Minima strategies 2 3 4 5 Minima
l • I 2 Maximin A 2 4 3 8 4 2
2 2 -3 value~
8 5 6 3 7 8 3
3 Q 3 -l Saddle c 8 7 ~Maximin
Column Maxima 2 ·3 0 point D ,., value (y)
4 3
Minimax value (V) Column Maxima 8 8
Since' V=y = 0, saddle point exists and value of the game is 0. Minimax· value (V) Saddle point
As.per the given statement, solve it by using principles of dominance. Since V= Y= 6, saddle point exists. But as per the statement, solve it by using the
• On comparing columns _l and 3, column l is found to be dominated by column 3 principles of dominance.
and hence delete it completely. • On comparing rows A and C, row C is found to be more superior for the player A
• After deleting column I, compare rows l and 2. Delete row 2 which is inferior to and hence delete the row A completely.
player A, then the payoff matrix is shown below. • On co!nparing rows C and D, row D is found to be less dominance or inferior for
Player A Player B strategies the player A compared to row C. Delete row D completely.
stra~_gj~s 2 3 • Column I is found to be superior for player B compared to columns 2, 4 and 5
l 2 0 respectively. Delete .columns 2, 4 and 5. The payoff matrix obtained is shown
below.
3 3 -I
• On comparing column 2 and 3, column 2 is found to be inferior for player 8 Player A Player 8 strategies
compared to column 3 and hence delete it. The resultant payoff matrix is shown strategies I 3
below. 8 6 9
Player A Player B strategies Row c 4 8
strategies 3 Minima • On comparing rows 8 and C, row C is found to be inferior compared to row 8 for
l [@] [[] player A and hence delete row C comoletelv. N - ----. -
3 -1 -1 Player A Player B strategies Row

strategies
Column Maxima ® 1 3 Minima
The optimal strategy for player A is l. 8 @] I 9 161
Th~ optimal strategy for player B is 3 Column Maxima ® I 9
Value of the game V = 0. The optimal strategy for player A is 8
19) Following is the pay-off matrix for player A The optimal strategy for player B is I .
Player A Player B strategies Value of the game V = 6.
strategies I 2 3 4 5 20) Solve the following game by dominance rule:
A 2 4 3 8 4 Player A Player B strategies 0
8 5 6 3 7 8 strategies B, B, 8,
c 6 7 9 8 7 A, 12 -8 -2
D . 4 2 8 4 3 A, 6 7 3
Use dominance properties, obtain the optimum strategies for both the player A, -10 -6 2
and determine the value of the game ·Dec 2012 (06 M) Can we formulate the above game as LPP and solve it by simplex/ Big-M
Sol. Check for the saddle point, if any, in the payoff matrix shown below. method? If yes, discuss how? Jan 2016 (08M)
Rb::~~~~~-·.: . :~~*~ ~~Ji~~~l~l!§aiiliiP~~~~:
Sol. Check for the ~ddle point, if any in the payoff matrix shown below. -I Oq 1 - 6q2 + 2q3:S V (If A uses strategies A )
1
Player A Player B strategies Row q1 +q2 +qi= I
strategies · , B. B_ B Minima and q1, .q2, qi 2: 0
Dividing each inequality and equality by V, we get
~ Maximin
A.I 12 -8
-21 12~L 8.9.L-z.9l_ ~ J·
A2
A
6
-10
7
~6
~ . ~- value(y) v v v '
Column Maxima 12 7 6-9.!.+7q 2 +3.9l.~1·
UJ I
.,..,_Saddle v v v '
Minimax"value (\i) point
-10-9.L-6q 2 +1.9l.-;;1·
Since V=V = 3, saddle point exists. The value of the game is 3 and optimal strategies v v v '
for player A is A2 and player B is B3. But, as per the statement, solve this problem
using dominance principles. -9.L +.9-L +.91. =_!_.
v v v v'
• On comparing rows A2 and A3, A3is found to be inferior for the player Acompared
In order to simplify, we define new variables:
to row A2, and hence delete row~ completely.
• On comparing the columns B1and B3, column B 1 is found to be inferior for the
v' y2 = ~andy
YI = -9.L v 3
= .9l.
v
player B compared to column 8 3 and hence delete column 8 1 completely. The
payoff matrix obtained is shown below. I
:.y1 +y2+Y3=-
Player B strategies V
Player A
wherey 1,y 2 ,y 3 <::0
strategies B, B,
A1 -8 -2 Player B trying minimise V, he must maximize !IV. The problem for the player B
A, 7 3 can be expressed as
Maximize (IN)= y1 + y2 + y3 subject to constraints.
• On comparing rows A1 and A2, row A1 is found to be inferior for the player A
compared to row Ar Delete row A1 completely. The resultant matrix obtained is 12y 1 - 8y2 -2y 3 :SI ..... (1)
shown below. 6y 1 + 7y2 + 3y3:S 1 ..... (2)
-IOy 1- 6y 2 + 2y3 :SI ..... (3)
(i) To convert all inequality constraints into equations. Add slack variables S , S ,
strategies B_ B and S3, then 1 2
A 7 I IC3 12y 1- 8y 2 -2y1 + S1=l;

7 I 10 6y 1 +7y2 + 3y3 + S2=1;
-10y 1 -~y2 +2y3 +S 3 =0,andy 1 ,y2 ,y1 S , S , S ~0
The optimal strategy for player A is A2•
Therefore, Maximize (l/V) = y1 + y2 + y3+ OS +0S + OS
1 2 3
The optimal strategy for player B is B3. 1 2 3
Value of the game V = 3 (ii) To obtain initial basic feasible solution, (n-m) variables must be equal to zero.
Yes, we can formulate the given problem as LPP and solve it by simplex method n-+ number of variables in objective function = 6
as shown below. m -+ number of constraints = 3
Let p1 ,p 2, p3 and q1, q2, q3 be the probabilities with which players A and B uses Therefore (n-m) = (6-3) = 3 variables must be equal to zero.
Let y 1 ~2 = y3 = 0, then
their strategies respectively.
S1= S2= S3 =I and Maximize (IN)= 0
Let the value of the game (to player A) be 'V'. Consider the game from Player B's
(iii) Construct simplex table and solve as usual.
point of.view.Player B trying to minimize V.
The expected loss for player B will be as follows:
12q 1 - 8q 2 -2q 1 :S V (If A uses strategies A1)
6q 1 + 7q 2 + 3q 1 :S V (If A uses strategies A2)
"
1
I ai;,\: ·.: .. 0PERATIO~sREs~cu·
i 'GAME;!J'HEORY . .,); ::~:~Lst~~itt!t'\iwit~,.i•:ii{·L·. .·,.·_ ~:_i'.l~~--
·i'
1.s.2 'so1ution ot c~.:iti~~[i6jjiimX~'ftfiaj;t~#''b.i. eraphi~B.• .n~th~d ··•· . . :--..-.-.~=-=..;,,~~·-.4~....,~::-·~in.r.~-.,:o~~:i-?!'.;.~~~llC"'-·;,..,r.:·.,
.• PROBl.iEMS'.TON~GR:a:~fflCAL-:omETHOD'::.'.,
,·...ra.:·~;>~
.:::~:.,,,,;,:..,,£?X-~~· '
I
i. l:i A ~•";"·:·.~-:.:'" ·~~~·'--!.- ...., ~--,.~"";;~~~~Y~;;r.;;.:. . -' ·· :.,__::.r- '.·~~·.-~-~
_ -:-_,_, • 1 :- >:...'.-·'."·.~-~·.;·:,}~ ·- .'.·~~- ,,;.;~_';:.~.
• - • •• • :' •
The graphical method is u_seful for the game where payoff matrix is of the size (2 x n) or 21) Use the graphical method for solving the following game and find the value of
ii (m x 2) i.e. the game with mixed strategies that has only two undominated pure strategies
Hii: 'fr the game.
'.!·i for one of the players in the two-person zero-sum game.
Player B Player
Optimal strategies for both ~e players assign non-zero probabilities to the same number A
··j··
B, B, B B,
' of pure strategies. Therefore, if one player. has only two strategies, the other will also use
the same number of strategies. Hence, this method is useful in finding out which of the two A 2 2 3 -2
strategies can_ be used. A, 4 3 2 6
Consider.the 2 x n payoff matrix of the game without saddle point Sol. Let p1 and p2 be the probabilities with which player A uses the strategies A1 and Az
respectively. The expected payoff to the player A, when player B use a particular
Player B strategy as follows.
t; Player A B, B, ... B" Probability Player B's strategies Player A's expected payoff
A a a,, ... a,n p B1 2p 1 + 4p~
L
A, a,, a,, ... a,n p, 82 2pl + 3p2
!;, Probability qi q2 ... q., B3 3p 1 + 2p 2
l: ~: . Player A has two strategies A1 and A2 with probability of their selection p1 and p2 B4 -2p1 + 6pz
!:• respectively, such that p1+ p2 = I and p1, p2?: 0. Now each of the pure strategies available Player A's expected payoff(profit) lines can be plotted on a graph.
to player B, expected payoff for player A would be as follows The probabilities with which a player A uses the strategies A 1 and Az is p and Pz
1
measured along X - axis.
B's pure strategies A's pure strategies
The expected payoff of player A is measured along Y - axis
B1 a11P1 + ai1P2 If player B use strategy B1, the expected profit for player A is 2, if player A uses A
B, 1
a12P2 + 3 22P2 strategy with p1=I (i.e. Pz =O) and 4, if player A use A2 strategy with p1 = 0 (i.e. p =
1
I). These two points (i.e. values 2 and 4) are connected by a straight line, which
shows the expected payoff for player A, when player 8 uses strategy B1. Three more
expected payoff lines for player A are drawn similarly for B2, B1 and 8 4 strategies of
Bn a1nP n+ aznPz player 8..
According to Maxi min criterion for mixed strategy games, player A should select the value Player 8, being a loser, will always use the best strategies that results in least payoff
of probability P1and P2 so as to maximize his minimum expected payoffs. This (i.e. profit) for player A. Thus, the payoff for player A is represented by the lower
may be done by-plotting the straight lines representing player A's expected payoff values. boundary.
The highest point on the lower boundary of these lines will give maximum expected From the graph, the highest expected gain (i.e. payoff) for player A is found at point
payoff among the minimum expected payoffs and the optimum value of the probability P1 'P', where two lines 8 3 and B4 intersect.
and P2. Now, player B uses strategies 8 3 and B4 only, then the resultant (2x2) matrix is
Now the two strategies of player B corresponding to those lines which pass through shown below.
the Maxim in point can be determined. It helps in reducing the size of the gaci-ie to (2 x 2), Player B Oddments
Player A Probabilities
which can be solved easily. The (m x 2) games are also treated in the same way except that
- B, s. of A
the upper boundary of the straight lines corresponding to B's expected payoff will give 3
A1 -2 P1 4
maximum expected payoff (Minimax value) and the optimum value of the probability q1
A, 2 6 p, 5
and q2 •
Probabilities q q,
Oddments of B 8 I
To find p 1 and P2
_:;9Aj,~:TQoRY:_-~;;~:,55:zfi~~x'if~l~ji1~~~t'.-:!:Jj~-{£J-·:~?I,.
-·~c~;~iE-9,!~rt'~i:-~l!iic~
Pit'~~,_,3;1~ilt1i 22) Obtain the optimal strategies for both pers6ns and the value of the game for
two-person zero-sum game whose payoff matrix is as follows:
4 4
PI =-=-=0.44•
4+5 9 '- Player A PlayerB
5 5 B B,
Pz = 4+5 =g=0.56; A I -3
P1 + P2 = 0.44 + 0.56 =I A, 3 s
A, -1 6
To find q 1 and q2 A, 4 I
.8 8 -
q1 = + l =9=0.89; A, 2 2
8 A. -5 0
1 1 Jan 2014 (07M)& Jan 2015 (07M)
qz-= 8+1 =9=0.11;
Sol. Let q 1 and q2 be the probabilities with which player B uses the strategies B 1 and 8 2
qi + q2 = 0.89 + 0.11 =I. respectively. The expected payoff (i.e. losses) for the player B, when player A use a
(6x3)-(2x-?) 22 particular strategy is as follows.
Valueofthegame V - =-
(6+3)-(2-2) 9 Player A's strategies Player B's expected payoff
v =2.44 A, q 1 - 3p2
Fromthegraph,p 1 =0.45,p 2 =0.55andV =2.44 Az 3q1 + Sq2
Expected payoff for player A Al ~1+6~
A4 4q1 + qz
A1
As 2q 1 + 2q 2
A6 -5q1
Player B's expected losses (payoff) lines can be plotted on a graph.
8' '8 The probabilities with which a player 8 uses the strategies B1 and B2 is q1 and q2
measured along X - axis.
7 The expected payoff of player B is measured along Y - axis
If player A use strategy A1, the expected loss for player 8 is 1, if player B use 8 1
6
strategy with q 1 =l (i.e. q2 =O) and -3, if player B use 8 2 strategy with q2 = 0 (i.e.
5 q 1= 0). These two points are connected by a straight line, which shows the expected
losses for player B, when player A uses strategy A1• Five more expected payoff lines
4 for player 8 are drawn similarly for A2, Al, A4, As and A6 strategies of player A.
Value of
the game Player A, being a gainer, always use the best strategies that maximizes the losses
v = 2.4 ·----~------~ ~ 12 Bi for player 8. Thus, the payoff(loss) for player 8 is represented by the upper boundary.
From the graph, the lowest loss for player Bis found at point 'P', where two lines A2
and A4 meets. Now, player A uses strategies A2 and A4 only, then the resultant (2x2)
matrix is shown below.
Player 8 Oddments
0.2 0 +-- P(A 1) Player A Probabilities
0.6 0.4 8, B, of A
1 +-- P(A 2) Az 3 5 3
P1
A, 4 1 p, 2
Probabilities q, q,
Oddments ofB 4 l
.. : ~.-
To find p1 and p2
OPERATIONS REsEARCH
To fin.d q1 and q2
..Q~ TllEoRY
23) Solve the following game using graphical method.
B' Strategy
..
4 4 A' Strategy
3 3 q =-=-=0.8: b b b b,
P1=3+2 =s=0.6; I 4+1 5 .
.·1 a, 8 5 -7 9
' I I
2 2 q,- =4+
- · =-=02·
I 5 . ' a, -6 6 I 4 -2
p, =-=-=04·
- 3+2 5 . ' Jan 2016 (08M)
q1 + q 2 = 0.8 + 0.2 = I.
P1 + P2 = 0.6 + 0.4 =I. Sol. Let p1 and p2 be the probabilities with which player A uses the strategies A 1 and A 2
·;,
- (3x l)-(5x4) -17 respectively. The expected payoff for the player A, when player B use a particular
I Valueofthegame V ( 3 + l) -(5+4) =-5- strategy is as follows.
Player B's strategies Player A's expected payoff
V=3.4
b, 8p, - 6p2
Fromgraph,q 1 = 0.8,q 2 = 0.2and V = 3.4
b2 5p 1 + 6p2
Expected payoff for b3 -7p 1+ 4p 2
B~ playerB
b. 9p, - 2p2
8 Player A's expected payoff lines are plotted on the graph. The payoff/profit for the
.[· 8 player A is represented by the. lower boundary. The highest gain for the player A
7 A3 occurs at point 'P' on the lower boundary, where h'l'O lines, b, and b3 met.
=~·. 7
Now, player Buses strategies b1and b3 only, then the resultant (2x2) matrix is shown
Value of 6 below.
\) ut\c\aii
the game
V=3.4 5 Iu\l\ler 0 . . .-r>.'6.1- \lo\t\\
1A\{\\W
Player A
Player B
Probabilities
Oddments
b b, of A
:<-·
a, 8 -7 P, 10
·•··
t~:'· a, -6 4 p, 15
~~,;
~'.'. Probabilities q, q,
:~· Oddments of B 11 14
To find p1 and p2
=-10_=.!.Q.=0 4·
p, I 0 + 15 25 . '
=-1_5_= 15 =0 6"
Pz I 0 + 15 25 . '
-3 p1 + p2 = 0.4 + 0.6 =I
-4 To find q, and q 2
-5 11
= --=JJ_=O 44·
• q, 11+!4 25 . ,
=-14_=~=0 56"
q2 11 + 14 25 . '
q, +q2 =0.44+0.56= I
(8x4)-(-7x-6) -10
Value of the game V = =- =-0.4
( 8 + 4 )- (-7 - 6) 25
S~'=~t~•'i".
v =-0.4 Player B's strategies Player A's expected payoff
Fromthegraph,p 1 =0.4,p 2 = 0.6andV =-0.4 I -Sp,+ 8p2
fxpected payoff for
player A -----..Ait II
IIr
+Sp, - 4p2
Op1 -P2
\
IV -p 1 +6p2
9
v 8p, -Sp2
'·· 8 Player A's expected payoff lines are plotted on the graph. The payoff/profit for the
7 player A is represented by the lower boundary. The highest gain for the player A
occurs at point -'.P' on the lower boundary, where two lines, I and Ill met.
______.i.-n---: b2
bl Now, player B uses strategies I and III only, then the resultant (2x2) matrix is shown
below.
PlayerB Oddments
4 Player A Probabilities
I III of A
3 I -S 0 P, 9
2 2 2 8 -1 p, s
Value of Probabilities q, q,
the game I
Oddments of B 1 13
V=-0.4 To find p 1 and p2
P(A)--+ l -t-------O:S------0:6-----
9 9
P(A2) --+ 0 -1 p, = 9+S =14=0.64;
-2 s s
p2 =-=-=0.36·
-3 9+S 14 '
b4
-4 To find q1 and q2
I I
-S q =-=-=0.07·
I 1+13 14 '
13 13
q, =-=-=0.93-
- 1+13 14 '
bl then
24) Solve the following two-person zero-sum game by graphical method. (-Sx-1)-(0) S ,.,
V= =-=0 ..J6
Player PlayerB (-S-1)-(8-0) -14
A I II Ill IV v from the graph
• I -S s 0 -1 8 p1 =0.64
2 8 -4 -1 6 -S p2 = 0.36 and
iuly 2005 (lOM) V=0.4
Sol. Let p1 and p2 be the probabilities with which player A uses the strategies I and
2 respectively. The expected payoff/profit for the player A, when player B use a
particular strategy is as follows.
-. I
~
. Expected payoff for
playerA ~
OPERATIONS REsEARCH
.2 ·,;.' .
GAME' TaEoRY
·:-
The highest gain for the player A occurs at point 'P' on the lower boundary. Point 'P'
occurs at two positions on the boundary, where two lines, (8 1 and 8 ) and (8 and 8 )
met respectively.
Case 1:
2 2 3
Now, player B uses strategies 8 1 and 8 2 , then the resultant (2x2) matrix is show~
below.
Player B Oddments
B B, of A
A, 6 4 P, 2
+5 A, 2 4 p, 2
Probabilities q, q,
Oddments of B 0 4
+3 To find p1 and p2
? 2 I
PI =---=-=-=O
2+2 4 2 . '
5·
+l 2 2 I
p2 =-=-=-=05·
21~
2+2 4 2 . '
III p1+ p2 = 0.5 + 0.5 = I
To find q 1 and q2
0
q =-=O·
I 0+4 '
4 4
r·. q 2 =-=-=I·
.,,, \ p1 °=0 .. 64 0+4 4 ,
' q 1+q 2 =0+1=1
Lower boundary
V = (6x4)-(4x2) -~=
(6+4)-(4+2) 4
4
25) Solve the following game using graphical method with the strategy adopted IJy
each player. From the graph,
Player Player B -p 1=0.5,p2 =0.5andV =4
A B, B, B, Case 2:
A, 6 4 3 Player Buse strategies B, and 8,, then the resultant (2x2) matrix is shown below
A, 2 4 8 Player 8
Player A Probabilities Oddments
Sol. Let p1 and p2 be the probabilities with which player A uses the strategies A1 and A2 B, B. of A
respectively. The expeited payoff/profit for the player A, are plotted on the graph. A1 4 3
The expected payoff for the player A are
P, 4
A, 4 8 p I
Player Ef s strategies Player A's expected payoff Probabilities q, q,
B, 6p, + 2p2 Oddments ofB 5 0
82 4p, + 4p2
BJ 3p, + 8p2
af~f~·:i'.;~::~•. .{• .'.: ,· · :~:~:j~~:!',,':Eh~1;;_,-::)'%'%3~~~~f~iMi~~,. 7.-lS
Tp find p1 and p1 26) --Solve-the.following (2 x 3) game graphically.

4 4 Player PlayerB
p =-=-=0.8·
I 4+1 S ' A B B, B,
I
p2 =-=-=0.2·
l a A l 3 ll
4+1 s ' A-2 8 5 2
To find q 1 and q1 Dec 2010 (lOM) &06 CS661 July 2009 (lOM)
. s s Sol. Let p1arid p2 be the probabilities with which player A uses the strategies A1and~
q =-=-=I·
I StO s ' respectively. The expected payoff for.the player A, when player B use a particular
0 0 strategy is as follows
q, =-=-=0,then
- 5+0 S Player B's strategies Player A's expected pa}'off
V= (8x4)-(4x3) = 20 = 4 B1 P1+8p2
{8+4)-(4+3) 5 82 3p, + 5p2
From the graph, 83 llpl + 2p2
P1=0.8,p 2 =0.2andV=4. The highest gain for the player A occurs at point 'P' on the lower boundary, where
A A2 two lines, B2 and B3 met.
1 Expected payoff for Now, player 8 uses strategies 8 2 and B3, then the resultant (2x2) matrix is shown
------- player A -----.,.· below.
Player 8 Oddments
9 8, B, of A
A, 3 11 P1 3
A, s 2 p, 8
7 Probabilities q q,
6 Oddments of B 9 2
To find p1 and p2
3 3
82 p =-=-=0.27·
I 3+8 l l '
I 8 8
I
I p2 =-.-=-=0.73'
I
I
3+8 11 '
I
I
I
I
To find q 1 and q2
I
I 9 9
I q =-=-=082·
I
' I 9+2 II . '
P1 =0.8 P, = 0.5
2 2
q 2 =-=-=0.18•
P(A)-+ 1 0.8 0.6 0.4 0.2 0 <- P(A) 9+2 11 '
P(Az)-+ 0 l <- P(A2) V (3x2)-(llx5) -49 = .
4 45
(3+2)-(11+5) -ll
From the graph,
P1=0.27,p 2 =0.73andV =4.45
... A,
·.------- Expected payoff for
· 0PERATl()1'8 ~EAR.CH
A~
GAME THzoav --~ :.· -~~-.:~y~~~~-#>tr~~~~;~
Player A
PlayerB
J 4
Probabilities
Oddments
of A
.:/t:~··-
• player A
Jr. I 6 -IS IO
HI P,
~ '. 2 '-8 2 p, 21
l' 10
Probabilities q, q,
i1! Oddments ofB 17 14
JI.
rl To find p1 and p2 To find q1 and q1
r\
n 10
p, = - - = 0.32;
7
q =-'-=0.SS;
Ii:?.. 10+21 I 17+14
7 21
1: q 2 =-14_=0.45;
f~r P2 = 10+21 =0.68; 17+ 14
/!.
l,,:, Value of I ', }<' I6
1;: V _(6x2)-(-15x-8) = _ 3 .4 9 = -3.5
,. - (6+2)-(-15-8)
1
..:.
q: From the graph
r:;
~.:: p, -032p
- . ' 2 =068andV=-3.5
•
---·
-~
~~~ Expected payoff for player A - - , 2
;;:.
,,i::.. \Lower
P1 =0.27
i)i;_
10
bounda
if
!;; ' P(A 1)-+ I 0.8 0.6 0.4 0.2 O +- P(A,)
a•t.·,
·~C:":
l""'' P(A)-+ 0 I+- P{A 2) 4
~~:
fl!;~ 27) Solve graphically.
W.i;:
:f•'·
~---
I
Player Player B
::::i: ~
A I 2 3 4
~t: I -6 0 6 -15
z,: 2 7 -3 -8 2 P(l)-+ I 0 +- P(l)
Feb 2006 (lOM) P(2)-+ 0 I+- P(2)
Sol. Let p 1 and p2 be the probabilities with which player A uses the strategies I and 2 •. Value of
respectively. The expected payoff for the player A, when player B use a particular -4 2 the game
strategy is as follows V=-3.5
I -6p, + 7p2
2 Op 1 - 3p2
3 6p, - 8p2
-10
P1 =0.32 -II
4 -15p, + 2p, -12
The highest payoff for the player A occurs at point 'P' on the lower boundary, where -13
two lines, 3, and 4 lines met. -15
Now, player B uses strategies 3 and 4 only, then the resultant (2x2) matrix is shown
below.
-~t~sr•.·:~~ij -~ ~'#:J~~~·:--~·: -:~~·;~~~ ~t:~?Y; .~:ftf~~~ !~~~~~
~J~~P-V- ·q~~~ 7 ..J:J
28) Cons.ider th~·rollowing game:

- - Player A Player B strategies
.Player PlayerB strategies -B, B.
•A B, B. B, B, AI 6 s
A 19 6 7 5
~ 3 6
A,. 7 3 14 6 A, 8 ' 4.
A, 12' 8 18 4 Let q1and q2 be the probabilities with which player B uses the strategies B2and 8 4
·.. respectively. The expected payoff (i.e. losses) for the player B, when player A use a
A, 8 7 13 -1
i) Find maximin and minimax values. particular strategy is as follows.
ii) Use dominance rule to reduce the game to either (2 x n) or (m x 2) game and Player A's strategies Player B's expected payoff
then s'olve graphically. Dec ZOll (lSM),July 2007 (lOM)& July 2011 (lOM) . 6ql+5q2
A1
Sol. Search for the saddle point
A2 3ql + 6q2
A, 8q + 4q,
strategies B, B. B, B, Minima
The lowest payoff/loss for the player B is represented by a point 'P' on the upper
A1 19 6 7 5 5 boundary, where lines A1and A, met.
A2 7 3 14 6 3 Now
A) 12 8 18 4 4 PlayerB Oddments
A, 8 7 13 -1 -1 B, B, of A
Column Maxima 19 8 18 6 A, 6 5 P1 3
No saddle point exists. A, 3 6 p, l
Maximin value (Y) = 5; Probabilities q, q,
Minimax value (V) = 6; Oddments ofB
r
I v- 3
Use dominance rule to reduce the size of the matrix.
To find p 1 and p2
Delete row A4, as it is less attractive for the player A compared to row A3• The
3 3
resultant matrix is P1=3+1=4=0.75;
1 l
strategies B, B, B, B, p2 =-=-=0.25·
3+1 4 '
A1 19 6 7 s
7 3 14 6
1 To find q 1 and q 2
~ l 1
A, 12 8 18 4 q =-=-=0.25·
I 1+3 4 '
Delete the column Bl' as it is less attractive compared to column B2for the player B. 3 3
The resultant matrix is q2 = + = 4 = 0. 75; then
1 3
(6x6)-(5x3) 21
strategies B, B, B, v -=5.25
Q
(6+6)-(5+3) 4
A1 6 7 5
From the graph
Ai 3 14 6
18 4 q1=0.25, q2=0.75andV=5.2
A, 8
Delete column 8 3, then the resultant matrix 1s
... 82
;:
Expected loss for

0PERATJ01'8 REsEARCH
84
10
GAME .TeaoRY
Player A
I
Player 8
IV
.
Probabilities
Oddments
of A
...
player 8
I 3 -1 p; 3
9
2 -I 2 p, 4
'11:
:, 8 Probabilities q q,
I
11
:·1.
1 :'
Oddments of B 3 4
7
To find p1 and p2
1: .1!
'.l''
lj~
p =-3
-=~=0.43:.
3+4 7
va1t11:-;;r5- I
1he game 4 4
"
P2 =3+4 =1=0.57;
'!! V=5.2
To fin<l q 1 and q 2
3 3
qi= 0.25 q =-=-=0.43·
2 I 3+4 7 '
4 4
-·i,, q, =-=-=0.57·
-~! . - 3+4 7 '
(3x2)-(-Ix-1)
P(8 2)--+ I 0.8 0.6 0.4 0.2 O+- P(8 2 ) v ~=0.71
P(8 4 )--+ 0 l <- P(8)
(3+2)-(-1-1) 7
.:I
·li-
29) Solve the game by graphical method From the graph,
j~ "
Player Player 8 P1 =0.43, p2 =0.57 and V =0. 7
':·
J;'
A I II Ill IV v Expected payoff for --..•2
ii'-;
j'·
I " 0 6 -1
.J 7 player A
,, I
t:; : 2 -1 5 -2 2 I
!,.. __ ,
July 2008 (14M)
Sol. Let p1 and p2 be the probabilities with which player A uses the strategies I and 2
... respectively. The expected payoff for the player A, when player 8 use a particular
strategy is as follows
I 3p1-P2
11 Op 1 + 5p2
Ill 6pl - 2p2
IV -p 1 + 2p 2 Value ofth-e----~----
•
V 7p1 + P2 gameV=0.7 I
I
Draw expected payoff lines for the player A on the graph P( I)--+ I I
The highest payoff/profit for the player Aoccurs at point 'P' on the lower boundary,
where lines I and IV met.
P{2)--+ 0 \ l p1 =0.43
. Now, player B uses the strategies I and IV only, then the resultant (2x2) matrix is Lower boundary
. i
__ 1_ '
Gm TeEoR1' .· ·• :)k~~~:tt:W.~'K~. ~;~~~~-:;f~J+::\~~'f;WfM
-
30) Solve the following (2 x 4) game. PlayerB Oddments
B ll III of A
A
I II III IV I 2 3 P, I
'1 2 2 3 -l 2 3 2 p, I
2· 4 3 2 6 Probabilities q q,
Jan 2009 (lOM)&Jan 2010 (lOM) Oddments of B I I
"· Sol. Let p1 and p2 be the probabilities with which player A uses the strategies I and 2 To find p1 and p2
·respectively. The expected payoff for the player A, when player B use a particular I I
strategy is as follows p, =-I+-I =z=0. 5;
Player B's strategies Player A's expected payoff I I
I 2p 1 +4~
P2 =-=-=0.5;
l+I 2
ll 2p,+3~ To find q 1 and q 2
III 3p 1 +2p2 I I
q =-=-=0.5·
IV -p 1 +6p2 I I+! 2 '
Draw expected payoff lines for the player A on the graph I I
The highest payoff/profit for the player A occurs at point 'P' on the lower boundary, q, =-=-=0.5;
- I+ I 2
where lines II, III and IV met.
V = ..._(2_x_2'-)-__,(_3x_3-'--) -5 = 2.5
Now calculate slope for 3 lines.
Linell: (2+2)-(3 +3) -2
2p, + 3p2 Case2:
2p, + 3(1 - p,) Consider lines III and IV, the resultant (2 x 2) matrix is
2p,+3 - 3p, Player B Oddments
y=-p, + 3 Player A Probabilities
Ill IV of A
Slope m =-I (i.e. co-efficient ofp 1}
Line ill: I 3 -I P, 4
3p, +2p2 2 2 6 p, 4
3p, + 2(1 - p,) Probabilities q q,
3p, + 2- 2p, Oddments of B 7 I
y= P, + 2 To find p 1 and p2
Slope m = I (i.e. co-efficient ofp 1) 4 4
Line IV: p, =--=-=0.5
4+4 8
-p, + 6p2
4 4
-p, + 6(1 - p,) P2 =--=-=0.5
4+4 8
-p, + 6- 6p,
y=-7p, +6
Slope m = -7 (i.e. co-efficient of p1}
J To find q 1 and q2
7 7
q,=1+1=8=0.875;
0
Now consider two lines with slopes of different signs

Case 1: o; I I
Consider lines ll and III, the resultant (2x2) matrix is q, =-=-=0.125•
- 7+l 8 '
From the graph,
p, =-0.5, p2 = 0.Sand V = 2.5
~·
,.
i;
1:
1:··
... ~
Expected payoff for
player A ~
OPERATIOI!~ :IY:sEARCH
•2
oAJ.ii:'Tirokv' "-'··>-
To find p1 and p2
3 3
·:-
IV P1 = -+- =1=0.43
,,. 7 3 4
·1
4 4
p2 =-=-=0.57
3+4 7
5 To find q 1 and q2
Maximin point
Value'of . 3 3
_ th.e game q =-=-=0.43·
I 3+4 7 '
v =2.5 4 4
q2 =-=-=0.57·
3+4 7 '
V =~(2_x~I)_-(._-2_x_---'-2) -2 =-0.28
(2+1)-(-2-2) 7
P(I)-> I 0.6 0.4 0 <-- P(I) From the graph,
P(2)-> 0 I <-- P(2)
ti!: -I P1 =0.43, P2 =0.57 and V =- 0.3
; ... I .f. __.. Expected payoff for ----.._..2
31) Solve the following game by graphical method. player A
Player Player B
A I II III IV v 7
l 2 -1 5 -2 6
2 -2 4 -3 I 0
June 2010 (lOM)
respectively. The expected payoff for the player A, when player B use a particular
strategy is as follows .
I 2pl - 2p2
II -pl+ 4p2 the game
V=-0.3
Ill 5p 1 - 3p 2
IV -2p 1 +p~
V 6p 1 + Op 2
The highest payoff for the player A occurs at point 'P' on the lower boundary, where
lines I and IV met.
Now player B uses the strategies I and IV only, then the resultant (2x2) matrix is
Player B Oddments
Player A Probabilities P1 = 0.43
I IV of A
I 2 -2 P1 3
2 -2 I p, 4
Probabilities q, q,
Oddments ofB 3 4
-r~~:::.· ·. :!}1~f_:::;~}-
4v
' ·0PERATJOR8 REsEARCB GAME TllEoRY
:~~·-t~-
32) Solve the following (2 x 4) game by graphical method. Expected payoff for·
Player I Player II player A
I II Ill IV
I 2 I 0 -2 3
II I 0 3. 2
June 2012 (OSM)
-:. Sol. Let p1 and p2 be the probabilities with which player I uses the strategies I and II
2
respectively. The expected payoff fot the player I, when player II use a particular
strategy is as follows
Value of
Player ll's strategies Player I's expected payoff
the game
I 2p 1 +p 2 V= 0.4
II P1 + Op2
111 Op 1 + 3p2
P(I)--> I
IV -2p 1 +2p2 0.3 O.l
The highest payoff for the player I occurs at point 'P' on the lower boundary, where P(ll)--> 0
lines II and IV met.
-I
Now player II use the strategies II and IV only, then the resultant (2x2) matrix is
-
Player I
Player II
II IV
Probabilities
Oddments
ofl
.P1 =0.4
Lower boundary
-2 -2
I I -2 P1 2
II 0 2 p, 3 33) Solve .the following game by graphical method.
Probabilities q q, Player PlayerB
Odd~ents of II 4 I A I 2 3 4
To find p1 and p2 I 3 3 4 0 r•
2 2
p =-=-=0.4· 2 s 4 3 7
I 2+3 5 '
July 2016 (IOM)
3 3 Sol. Let p1 and p2 be the probabilities with which player A useslhe strategies I and 2
P2 =-=-=06-
2+3 5 . ' :::..-- respectively. The expected payoff for the player A, when player 8 use a particular
To find q 1 and q2 ~rategy is as follows ·
4 4 Player B's strategies Player A's expected payoff
q =-=-=0 8·
I 4+ I 5 . ' I 3p 1 + 5p2
I I
q2 =-=-=02· • 2 3pl + 4p2
4t I S . ' 3 4pl + 3p2
(2xl)-(-2x0) 2 4 ~pl+7~
V= -=04
(2+1)-(-2+0) 5 . Player A's expected payoff lines are plotted on the graph. The payoff/profit for
From the graph the player A is represented by the lower boundary. The highest gain for the player A
occurs at point 'P' on the lower boundary, where three lines 8 2, 8 3, and B4 met.
P1 =0.4, p2 =0.6andV=0.4
Since three lines are meeting at a point P, calculate the slope -0fthe lines B2, B3 and
84.
!
fG
·!1
f
w:
ma OPERATIONS REsEARCH
The equation of straight line is given by y = mx+c, where m = slope.

Line B2 :
GAME THEORY
Case 2:
Consider strategies B, aiid B,, the resultant (2x2) matrix is
..
I . 3pl + 4p2 . Player B Oddments
!ii··.·; 3p 1 + 4(1 - p1)
Player A
3 4
Probabilities
of A
!
w 3pl+4-4pl I 4 3 P, 7
~l'i. j y =-pl+ 4 2 0 7 p, I
''.
;I: Slope m = - I (i.e. co-efficient of p1)
J.i
·;. Probabilities q, q,
l: 1:-ineB3 :
j! Oddments of B 4 4
ii 4pl ·+3p2
i• 4p 1+3(1 - p1) To find p 1 and P2
'I
~· 4pl + 3 - 3pl 7 7
'1~
p,=1+1=8;
y = P, + 3 .
r.
i Slope m = I (i.e. co-efficient ofp) I I
jl•
,11::' Line B4 : p2 =7+l=S;
Op1 + 7p2
['l Op 1 + 7(1 - p)
To find q 1 and q2
4 4
ii y =-pl+ 7 q =-=-=0.5·
It=, ..
.•'.
Slope m = - I (i.e. co-efficient of p1)
I 4+4
4
8
4
'
f.:
,~,
Now consider two lines with different slopes (i.e. lines with one +ve slope and -ve
slope)
q2 = 4+4 =;=0.5;
,, Case 1 : Valueofthegame V= (7x4)-(3x0) 28
Consider strategies B, and B,, the resultant (2x2) matrix is shown below. (7+4)-(3+0) - 8 =3.5
t'j
ii ~;
V=3.S
~
~
mu
·~
~;I
Player A
I
2
3
Player B
3
4
Probabilities
-
Oddments
of A
I
A~
Expected payoff for
player A
------A: 2
~~ P,
~ 2 ;4
~.
3 p, 1
tl
li
Probabilities q, q, ·8
Pi Oddments ofB I I 7
tJ To find p 1 and P2
.....
!~:;
L:
I
p =-=-=0.S-
1 l+l 2
I
'
6
81
Value of 5
:!!;..!.
1:: I I ·
:1·1
:;; ~
P2 =-=-=05·
!+I 2 . ' the-game 4 82
L~
!!_'
v =3.5
To find q 1 and q2
I
q1 =-=-=0.5·
I . Lower
Bi
I +I 2 '
boundary
I I
q2 =~=2=0.5; P1 =0.5
V = (3x3)-(4x4) = -7 =3. 0.6

5 0.8 0.4 0.2 0 <- P(A 1)
(3+3)-(4+4) -2 P(A 1)-> I
Value of thrgame V =3.5. P(A 2)-> 0 I +- P(A 2)
..
34)
,- ......
t:~f
Solve the following game grapbicaliy; ' ..
Player Player II
.. 'iJ'.>P£ilArii>!.~~~JOOtcll '"'\j~~li~tt'~lllf,h'~-:·~?~.k1i11:~
Player I Player II Probabilities Oddments
ofl
2 3
I I 2 3 4
I 2 3 P1 I
I 3 2 3 6
2 3 2 p, I
. 2 . 5 3 2 -1 Probabilities q q,
Jan 2007 (07 M)
Oddments .of II I I
Sol. Let p1 and p2 be the probabilities with which player I uses the strategies I and 2
To find p 1 and p2
respectively. The expected payoff for the player I, when player II use a particular
strategy is as follows · _ I _I_ .
P1 -----0.5,
l+I 2
Player ll's strategies Player l's expected payoff
I 3pl + 5p2
l
P2 == t:;:"j == z== 0.5;
I
2 2pl + 3p2 l I
3 3pl + 2p2 q ==-=-=0.5•
I I+! 2 ' •
4 6p1 - P2 l l
The highest profit for the player I occurs at point 'P' on the lower boundary, where qz == t:;:"j = 2 == 0.5;
lines 2, 3, and 4 met.
then
Since 3 lines are meeting at a point 'P', calculate slope of the lines 2, 3 and 4.
The equation of straight line is y = mx + c, where mis the slope. (2x2)-(3x3) -5
V= -=2.5
Line 2: (2+2)-(3+3) -2
2p, + 3p2 Case 2:
2p 1 + 3(1 • p1)
Consider strategies 2 and 4
2p,+3 - 3p,
Player II
y ==-pl+ 3 Player I · Probabilities Oddments of I
Slope m == - I (i.e. co-efficient of p1) 2 4
Line3: I 2 6 P1 4
3p, +2p2 2 3 -1 p, 4
3p 1 + 2(1 - p) Probabilities q q,
3pl + 2-2pl Oddments of[[ 7 I
y == P1 + 2
To find p 1 and p2
Slope m == I (i.e. co-efficient ofp 1)
4 4
Linc 4: p =--=-=0.5·
6 P1 -pz I 4+4 8 '
6pl -0(1-pl) 4 4
Pz = + =s=0.5;
y == 7p 1 - I. • 4 4
Slope m = 7 (i.e. co-efficient of p1) To find q 1 and q2
Now consider two lines with different slopes (i.e. slopes of different signs) and 7 7
construct (2x2) matrix q =-=-=0.875·
I 7 +I 8 '
Case 1:
I I
Consider strategies 4 and 3, then q 2 =-=-=0.125·
7 +I 8 '
V = ,,,,_(2_x--!"--)-__,,,(6_x~3) -20 =2.5
(2-1)-(6+3) -8
P9f3;;·_:-_·
From the graph,
-·';~-;-_i,£/i'~;ic-~,~~%~~%.~~J.k~~x-,··:::j~~~s ~~pa·.
P1 =0.5,p 2 =0.5and V =2,5

~.-,-_:·!ti._
~~~-..
where lines 2, 3 and 4 met.
_·- . . =. '
-···-·•.::/;i";'~~-~12~£~~rpaa
~ ,'·~--"' -"~''"-"-'~-,;,c-~~- J
Since 3 lines are meeting at point 'P', there exists an alternate optimal solution.
1 i ~Expected payoff for player ~r 2 To find an alternative optimal solution, calculate slope for those 3 lines.
Lioe2:
s I _ s 2pl + 3p2
2p1 + 3(1 - P)
7
2p,+3 - 3pl
·~.
6 y=-p, + 3
Slope m = - I (i.e. co-efficient of p1)
Line3:
3pl +2p2
4 3pl + 2(1--pl)
2
Value of
I
------- ' I
3pl + 2 - 2pl
the game y=p, + 2
v =2.5 ·---_--,-------~----------
"'- I 2 3
Slope m = I (i.e. co-efficient of p1)
Lioe4:
i
-pl+ 6p2
-p 1 + 6(1 - p 1)
P(I)--+ I 0.8 0.6 0.4 -pl+ 6- 6pl
y=-7pl +6
\--1 P(2)--+ 0
Therefore, slope m = -7 (i.e. co-efficient of p1)
;..:
I'"~"
Lower boundary I 4
Now, consider two lines with slopes of different signs to get alternate optimal solution.
Case 1:
pl= 0.5
;.i Consider lines 2 and 3, then the resultant (2x2) matrix is
:'1
35) Solve the following game graphically,
~'1' PlayerB
~;
B Player A
2
Probabilities Oddments
.... ..:_
3 of A
:-1
I 2 3 4 A1 2 3 P1 I
.. :
,,
'
A ~: I! I~HI ~ I~: I A,
Probabilities q
3 2
q,
p, I
:! If the given problem possesses multiple optimum solutions, find two solutions.
Oddments of-B I I
July 2018 (12M)
~.L To find P1 To find q1 and q2
respectively. The expected payoff for the player A, when player B use a particular I I I
strategy is as follows P1 = l+l = qi =I:t=z-=0.5;
"j
Player B's strategies Player A's expected payoff I - - I I

I • 2p 1 +4p2
P2 =I:!- 2
q2 =I:!= = 0.5;
i
2 2pl+3p2 V = (2x2),.._(3x3) __
-5 .,c
'! (2+
3 3pl + 2p2 (3+3)
4 -~+6~ Case2:
Draw lines corresponding to player A's expected payoff on the graph Consider lines 3 and 4, then the resultant (2 x 2) matrix is
The highest payoff/profit for the player A occurs at point 'P' on the lower boundary,
- Player A
A1
. 3
3
· :·~>,-','.fiS]JH;/~,~;,~;r,:f.t9~~9"~;~~91t:
PlayerB
.4
-1
Probabilities
P1
Oddments
of A
4
~o.Wli
;;::,;_
36)
THEOR'
-··- -·· r
Solve the following game graphically with payoff matrix of A given in the table:
Player _ Pl!lyerB
A
A.
B,
-l
B,
0
A, 2 6 p, 4
A, 3 -I
Probabilities . q, q,
A1 -3 2
Oddments of B 7 I
A. 5 -4
To find ~ 1 and p1
Dec 2012 (08M)
4 4 Sol. Let q1 and q2 be the probabilities with which player B uses the strategies 8 1 and
pI =-=-=05·
4.+ 4 8. . •
8 2 respectively. The expected loss for the player B, when player A use a particular
4 4 strategy as follows.
p2 =-=-=0 5·
4+4 8 . ' Player A's strategies Player B's expected payoff
To find q 1 and q 2 A1 -2q1 +Oqz
7 7
qi= + = =0.s15; AZ 3ql -q2
1 1 8 A1 -3q1+2qz
I I
q1=1+1=s=o.125; A4 5q 1-4q2
Draw expected payoff lines for the player B on the graph.
(6x3)-(2x-1) 20 The lowest loss for the player B occurs on the upper boundary point 'P', where
V= -=? 5
(6+3)-(2-1) 8 -· lines A2 and A 3 met.
From the graph, Now player A use strategies A, and A, only, then the resultant (2x2) matrix is
Player A PlayerB Probabilities Oddments
P1=0.S, P2 = 0.Sand V = 2.5
Expected payoff for B B, of A
A1 player A AZ AZ 3 -I P1 5
8
A, -3 2 p, 4
Probabilities ~ q,
Oddments of B 3 6
6 To find p1 and p2
5 5
P1 = 5+4 =9=0.56;
i
4 4
4 p2 =-=-=0.44·
5+4 9 '
~luoofthe ~ 13
·-----~~--?? ~ t
game V = 2.5 _. =2 To find q 1 and q2
• _: 3 3 3
qi= 3+6 =9=0.33;
Lower boundary 6 6
q2 = 3+6 =9=0.67;
P(A 1)-+ I 0.6 ? 0.4 0.2 O+-P(A 1)

P(A 2)-+ 0 I+- P(A2)
P1=0.5
P'Wi' . .~:~_: ,:c'°~. . .iil•:~i~.~~-f~~~11'A~-l
- (3x2)-(-3x-1) 3
V= --=0 33
(3+2)-(-3-1). 9. .
From the graph
q1 =0.33, q2 =0.67 and V =0.35
82
Expected payoff for player B
5
4 4 The sequencing problem is the detennination of an optimal order or sequence ·of

_perfomi ing aseries ofjobs by a n~mber of faci Ii ties which minimizes the total time or cost.
Let /1 be the number of jobs to be performed, one at a time, on each of 'm' machines.
3 The sequence or order of the machines in which each job should be performed is given.
AJ The actual or expected time required by the jobs on each of the machines is also given. The.
general sequencing problem is to find the sequence out of (n!r possible sequences, which
minimize the total elapsed time between the start of the first job in the first machine and
2
completion of the last job on the last machine.
a.1 ··T.ERMIN.p~OGY:.~usl:o.IN SE~'-'ENCING

~-o-
I 1. Number of machines: It refers to the number of service facilities through which a
Value of
the ga.w___ ,. ____________ ---------- A1 job must pass before it is assumed to be completed.
' 2. Processing time: It defined as the time required by ajcb on each machine.
r:; V = 0.35
r P(BI) ~ l I
3. Processing order: It refers to the order in which machines are required for completing
L 0.8 the job.
P{B )~ 0
2 4. Idle time on a machine: This is the time during which a machine does not have a
-I job to process. i.e. The time interval from the end of first job to start of the second job
on the machine.
5. Total elapsed time: This is the time interval between starting the first job on the first
machine to the completion of last job on the last machine, including the idle time of
-2 the machines, if any.
6. No passing rule: It refers to the rule of maintaining the order in which jobs are to be
processed on given machine. i.e. the job which is processed first on machine A, must
-3 -3 also be processed first on machine B in the order AB.
• e.~.-- 'li~ilc~A~i,y.Mrt~o-~~fr.·{ ·<\\V''i-',\·•-·~; . . -.~i;.j;;·,;,,I~Lti~~t;~:r~·~i${\ .

-4 I. Only one job ~an be processed on a given machine at a time.
2: Once a job has begun on a machine, it must be completed before another job can
begin on the same machine.
3. Only machine of each type is available.
4. The processing time on different machines are known and are independent of the
order in which they are to be processed.
a·· ::.:.};'.''~3~~*!~R~~~~~~Jli~~~~~iif~f,l~£~~0~~tiQ!~~~1~ '. s~~-9~~~,~~\~~.c/',;{i~=i:ti~ -.. c~~]}j.~:f:~~\~-
S. The time taken by the job in ·moving from one machine to another is negligible. The weighted mean flow time
D
6. All jobs are known.and _are ready for processing before the period under consideration
'LwiF;
starts. WMFT=-i-_1- -
8~3~~;:P·RoCSSSIN'6':'.t(~olis·s•:Yt1iotiGH!ON"lf···. ·ic'' ·'i'e'XlsiNG. I w;
··: :/·. ~ PR•<>~•~Y.Jiu'.L_E~·~;.;~~~.~,;-~:rt:~~·:·:;?&~~<s~~m~~~x;~[,~~Ilµ~q~ ,J~f~:,.::-.'. . i=I
Consider a job shop with a single machine, wherein n different jobs with known 8.3.3 E~r1ie,~t .J>'QeJ>ate (EQ_D)t~~1~~5ff;)_;,:'"(;;i~~;,~::/~;fi;{,~j'J .....
processing times are required to be processed so that any new job if arrives does not disturb
the processing of these n jobs and assumed to be waited- for consideration in the.next batch The rule, wherein jobs are sequenced in the order of non-decreasing due dates is
after the processing of current n jobs is completed called EDD Rule. This rule minimizes the maximum job lateness as well as maximum job
tardiness, but tends to make more jobs tardy and increase mean tardiness.
Let
n =Number of different jobs. 8.3.4 Slack Time Remaining (STR) Rule:
ti =Processing time of job i Slack time for a job is defined as the difference of due date of the job and its processing
wi = Waiting time (before processing) for job i time.
Fi = Flow time for job i The rule wherein, sequencing the job is done in such a way that job with least slack time
=w+t. are considered first for processing followed by the one with the next smallest slack time and
I I
so on, is called Slack Time Remaining (STR) Rule.
c, =Completion time of job i
d, = Due date of job i
L; = Lateness of job i
= c.I - d.
I
E, = Earliness of job i
= dI -c I
Ti = Tardiness of job i and
Nr =Number of tardy jobs
~~.3.1 !»hprte.-oi::~.$.~ing Time (SPT) Ruh~~

SPT rule is one in which sequencing the jobs is done in such a way that a job with least
processing time is considered first, followed by th~ one withJb.~_next smallest processing
time
-,
and so on.
.. -- ---
The objectives ofSPT rule are
i) Minimizing mean waiting time
ii) Minimizing mean flow time 0
iii) Minimizing mean lateness and

iv) Minimizing the mean number of jobs waiting as in-process inventory.
8.3.2 Weighted Shortest Processing Time(WS~T)}~i.!e;\'.}'.

- .. ' ·. .. . ~-. ' - .,-
WSPT rule is one in which, a weight w; is assigned to each job based on their importance
so that a larger value indicates greater importance and the processing times are divided by
the weights and jobs sequenced in order of increasing ti I wi
r:I
0PERA,TIO!i8 REsEARCu SEQUENCING ~.:~ ··:-" 'Ym

Proc~~~i~i~f;~fg\ff'1~~~f~~~f~~~'§61~t"~~-.:if-f""~(:·'~o<i~'~
2. Eight jobs I, 2, ....... 8 are to be processed on a single machine. The processing
:~ .
times, due dates and importance weights of the jobs are represented in table
below:
1. Six jobs A, B, C, D, E a~d iF have arrived at one time to be processe~ on a single
machine. Assuming that no new jobs arrive thereafter determine.
Job
Processing time Due dated. Importance .l_
i'' . . Job A 8 C D E F ti (minutes) (minutes)
I
I.
I
.
Processing time (minutes) ·7 6 8 4 3 5
weight wi wi
!· i) Optimal sequence as per SPT rule, I 5 15 I 5.0
ii) Completion time of the job, 2 8 JO 2 4.0
!: : iii) Mean flmv time, 3 6 15 3 2.0
Li iv) Average in- process inventory. (June I July 2016) 4 3 25 I 3.0
Sol. ,.,.j) As per SPT rule, a job with processing time is to be taken followed by a job with
i.
next least processing time. 5 10 20 2 5.0
The optimal sequence is E-D-F-8-A-C 6 14 40 3 4.7
f· 1
Ai) Completion time of a job is the sum of waiting time of a job and its processing
/.
7 7 45 2 3.5
L time. 8 3 50 I 3.0
The completion time of the jobs are Assuming that no new jobs arrive thereafter, determine using SPT rule and
E= 0+3=3 minutes WSPT rule:
D= 3+4= 7 minutes i) Optimal sequence,
F= (3+4)+5 = 12 minutes ii) Completion time of the jobs,
B= (3+4+5)+6 = 18 minutes iii) Mean flow time as well as weighted mean flow time,
A=(3+4+5+6)+ 7=25 minutes iv) Average in-process inventory,
C= (3+4+5+6+7) +8 =33 minutes v) Lateness mean lateness and maximum lateness,
.ji1) Mean flow time is the ratio of summation of completion time of all jobs to the vi) Number of jobs actually late.
::·1 total number of jobs.
" Sol. SPT Rule :
"' . 3+7+12+18+25+33 98 .
~~ Mean flow time -= 16.33 mmutes. i)Optimalsequnceis 4-8-1-3-7-2-5-6 or
6 6 8-4-1-3-7-2-5-6
iv) Number of jobs waiting as in-process inventory are the jobs remained in waiting ii) Completion time of the jobs are
and job in process except job/ jobs already finished at a given interval of time.
6 jobs during the time interval 0-3 = i.e. 3 minutes Job4=0 + 3 = 3minutes
5 jobs during the time intervakl-7 = i,e. 4 minutes Job8=3 + 3 = 6minutes
4 jobs during the time interval 7-12 =i.e. 5 minutes Job I = 6 + 5 = 11 minutes
3 jobs during the time interval 12-18 =i.e. 6 minutes Job3=1 I =6=17minutes
2 jobs during the time interval 18-25 = i.e. 7 minutes
Job 7=17 + 7 = 24minutes
I jobs during the time interval 25-33 =i.e. 8 minutes
:. Average in-process inventory Job2= 24 + 8 = 32minutes
{(6x3)+(5x 4) +( 4x 5) + (3 x 6) + (2 x 7) +(Ix 8)} Job5= 32 +I 0 = 42minutes
(3+4+5+6+ 7 +8) Job6=42+14=56minutes
I ~=Z3.87 minutes.
98 ... )M fl . 3+6+11+17+24+32+42+56
= =2.97=3jobs(approximately) 111 ean ow tune
33 8 8
.. ~~~~~~~ft~-~~~~-~~k: .~:-->~;~:~·/ :· ;: - .tj~~~~!~~~~~.:.-~.
iv) Average in - process inventory
(8x 3) + (7 x 3)+(6x 5)+ (5x6)+(4x 7) + (3 x 8) +(2x 10) + (! x 14)
$,EQ~C~G
Jobi= 41+4 = 46minutes

.\~~~~5.~~t~?i
Job 5 = 46 + I 0 = 56 minutes
- <: '<;~~~~-
(1+3 + 5+6+ 7+8+10+14) ... . {(6+9+12+19+27+41+46+56)} 216 .

111)Meanflowt1me= - =27mmutes.
=3.41=4 jobs(approximately)' · ' Weighted mean flow time
8 8
v) Lateness is the difference between completion time of the job and due date and
is shown below = L (Product of completion time and importance weight wi)
. Job Completion time Due time Lateness (minutes) L(Importance weight w i)
4 3 25 -22 _ {( 6x 3)+(9 xi) +(12x l)+(l9x 2) +(27x 2) + ( 41x3) + ( 46x 1) +(56x 2)}
8 6 50 -44 - ~)3+1+1+2+2+3+1+2)
1 II 15 -4 412
3 17 15 2 = =27.47minutes.
15
7 24 45 -21 iv) Number of jobs waiting as in-process inventory are
2 32 10 22 8 jobs during the time interval 0-6 = i.e. 6 minutes
5 42 20 22 7 jobs during the time interval 6-9 = i.e. 3 minutes
6 56 40 16 6 jobs during the time interval 9-12 =i.e. 3 minutes
) lateness of all jobs --
5 jobs during the time interval 12-19 =i.e. 7 minutes
Mean late utes 4 jobs during the time interval 19-27 = i.e. 8 minutes
Numberof jobs 8
3 jobs during the time interval 27-41 =i.e. 14 minutes
Maximum lateness=22 minutes(i.e.highest'+ 'vevalue) 2 jobs during the time interval 41-46 = i.e. 5 minutes
vi) Numberof jobs actually Iate=4(i.e. Number of jobs with'- 've lateness) 1 job during the time interval 46-56 =i.e. 10 minutes
:.Average in - process inventory
WSPTRulc:-
_ (8x 6) +(7 x3)+(6x3)+(5x 7)+( 4x 8) + (3x 14) + (2x 5) + (1 x IO)
i) To determine the optimal sequence, i must be calculated for each job and is - (6+3+3+7+8+14+5+10)
W;
216
shown in last column in the given table. = =3.86 jobs=4 jobs
Optimal sequence based on non decreasing (t/w) is 56
3-4-8-7-2-6-1-5 ITT iv) Lateness is the difference between completion time and due time and is shown
3-8-4-7-2-6-1-5 ITT below:
3-4-8-7~2-6-5-l ITT Job Completion time Due date Lateness
c. (minutes) d. (minutes) L (minutes)
3-8-4-7-2-6-5-1
3 6 15 -9
ii) Completion times of the jobs are
Job3=0 + 6=6minutes 4 9 °25 -16
Job4 = 6 + 3 =9minutes 8 12 50 -38
Job8=9+3=12minutes 7 19 45 -26
2 27 IO 17
Job7=12+7=19minutes
6 41 40 01
Job 2 = 19 + 8 = 27minutes
1 46 15 31
Job6=27+14 =4lminutes
5 56 20 36
;.;
r:
;·;
ii'·' "!!fr· . OPERATIONS RESEARCH . ~EQ~CiliG

~
!1
I'
ti
IL, -4 .
Job6=32+ 14=46minutes
H
l I 8 -8
Maximum lateness =36 minutes
.
Mean lateness=--·-=-= -0.S minutes
::II~)
Job 7 = 46 + 7 =53 minutes
Job8=53 + 3=56minutes
!')
\I,., 3.
iv) Numberof jobs actually late=4
'
Eight jobs 1, 2, .. 8 are to be processed on a single machine. The processing times,
... )M ean fl owt1me=-----------=
lll
. 8+13+19+29+32+46+53+56
8
256 =32 minutes
8
... iv) Numberof jobs waiting as in -process inventory are
due dates and importance weights of the jobs are presented in table below:
; 8jobs during the time interval 0- 8 = i.e.8minutes
Processing time Due date d1 Importance _s__. .• 7jobs during the time interval 8 -13 = i.e.S minutes
Job
t; (minutes) (minutes) weightw1 W;
6 jobsduririg the time interval 13 - I9=i.e.6minutes
I s IS I 5.0 5jobs during the time interval 19-29= i.e.IOminutes
2 8 10 2 4.0 4jobsduring the time interval 29-32=i.e.3 minutes
U. 3 6 IS 3 2.0 3jobs during the time interval 32 - 46 = i.e.14 minutes
~t 4 3 25 I 3.0 2jobs during the time interval 46 - 53 =i.e. 7 minutes
::;
~l . 5 10 20 2 5.0 Ijob during the time interval 53 -56=i.e.3 minutes
~J
1~1 6 14 40 3 4.7 :. Average in - process inventory
'
~!
t1
L-.l
7 7 45 2 3.5 {(8x8+ 7 x S +6x 6+Sx 10+4x3+3x 14 +2x7 +I x3)} 256
li.l 8 3 50 I 3.0 (8+5+6+10+3+14+7+3) =56
.
li;ITT"···. Assuming that no new' jobs arrive thereafter, determine using SPT rule and
It;
i:•]. WSPT rule =4.57 jobs=5jobs
I~ i) Optimal sequence. v) Lateness is the difference between the completion time and due time and is shown
1i!i ii) Completion time of the jobs. below.
l~l· iii) Mean flow time as well as weighted mean flow time.
!~4 Job Completion time c. (min) Due dated. (min) Lateness L= (c.-d) (mi11)
~~r
iv) Average in-process inventory.. 2
.
111.:..
::~-
8 10 -2
ll ~ Lateness mean lateness and maximum lateness.
I 13 15
H vi) Number of jobs actually late.. -2
~1: 3
Compare the results with those obtained from SPT rule 19 IS 4
ji].
;+ Sol. EDD Rule : 5 29 20 9
i) Optimal sequence is 4 32 25
:;j
il·I 7
!:·~ 2-1-3-5-4-6-7-8 oc 6
/!\
'·'
46 40 6
;:i 2-3-1-5-4-6-7-8 7 53
r1 45 8
lil ii) Completion time of the jobs are 8 S6 50 6
Job2=0 + 8=8minutes -2-2+4+9+7+6+8+6 •
Mean lateness =4.S minutes
Job 1=8+S+=13 minutes 8
i.I
., JobJ= 13+6=19 minutes Maximum lateness=9 minutes
., JobS= 19+10=29.minutes iv) Number of jobs actually late= 6
SPTRule:
Job4=29 + 3 = 32 minutes
s~cpr~ . . ·: .·; 7 '·~t~''"£~iiffiMiC•~~~~1!i~1.is~~:.~;;e;_ : · -
;._zi:.:_p-::- . - ,: .. -, >. - ,_·":. .• ·--~
~#-&~: OPERATIONS REsEARCH
i)Optimalsequnceis4-8- I -3- 7-2-5-6 or 4. The information regarding jobs to be scheduled through one machine is given
below.
8~4-1-3-7-2-5-6
• Job A B c D E F G
Ii) Completion time of the jobs are
Processing time (days) 4 12 2 II IO
Job4=0 + 3 = 3 minutes 3 6
Due date (days).. 20· 30 15 16. 18
Job8=3 + 3 = 6minutes 5 9
i) What is the first come, first served (FCFS) schedule?
·. Job I = 6 + S = 11 minutes ii) What is the shortest processing time (SPT) schedule?
Joo3=1l=6=17 minutes iii) What is the slack time re:maining (STR) sc.hedule ?
)ob?= 17 + 7 = 24minutes iv) What is the earliest due date (EDD) schedule ?
v) What are the mean flow times for each of the schedule above?
Job 2 = 24 + 8 = 32 minutes Sol. i) First come, first served schedule (FCFS) :~ ·
I Job5= 32 +I 0 = 42minutes The FCFS schedule is A-+B-+C-+D-+E-+F-+G and the processing time will be as
j Job6=42+14=56minutes follows
f ... )M fl . 3+6+11+17+24+32+42+56 191 . Machine
ean owt1me= = 23 .87 minutes Job
lf ' 111
iv) Average in - process inventory

8 8
A
In
0
Out
4
I (8x3)+(7x3)+(6x5)+(5x6)+(4x7)+(3x8)+(2xlO)+(lxl4) 8 4 16
!
I
(3 + 3 + 5 + 6+ 7+8+10+ 14) c 16 18
'~ = 3.41=4 jobs (approximately) D 18 29
~
E 29 39
i' ' v) Lateness is the difference between completion time of the job and due dateand
~ F 39
I!! is shown below 42
G 42 48
Job Completion time Due time Lateness (minutes) ii) Shortest processing time (SPT) schedule:
4 3 25 -22 The SPT schedule is C-+F-+A-+G-+E-+D-+B and the processing time will be as
follows:
8 6 50 -44
1 II 15 -4 Machine
Job
3 17 15 2 In Out
7 24 45 -21 c 0 2
2 32 10 22 F 2 5
5 42 20 22 A 5 9
6 56 40 16
·a 9 15
Mean lateness
), Lateness of all jobs -- 0
E 15 25
Numberof jobs 8 D 25 36
8 36 48
Maximum lateness=22.minutes(i.e.highest'+ 'vevalue)
iii) Slack time remaining (~TR) schedule:
vi) Numberof jobs actually late=4(i.e. Number of jobs with'-' ve lateness) Calculate the slack time for all jobs first and the STR schedule is obtained as shown
below
EDD rule has reduced the maximum lateness from 22 minutes (i.e in SPT) to 9
minutes. However, it has increased the mean lateness from -3.625 minutes to 4.5
minutes. Also, the number of late jobs has increased ffom 4 to 6.
PFM;f·•~ .•. -.- ,_,::::t~r:,,;.:i1,~{~~t~§':'t~:'i~;~~¥\t~~~iJ¥·;~~~~~~~#--.• ., •\·)..::.~-~, . ~1-
·~;,.-= ~,
>~i§~'!JQCIKG '""""~•,,.;-;,J~~""""·i· ~
-·.:-;;- ·~ --t::;,,.·y ..
- • - •
.._it\:~?;.t;~~~~~~~f;$.-:~~f'Af~~~ ,
Job Due date di Processing timeSlack
.
time (d.-t)
I I
b)SPTschedule:
(days) t (days) (days)
~· 20 • .
Mean fl ow time 2+5+9+15+25+36+48 140 = 20days
A 4 I6
7 7
t
r1:, ,s 30 I2 18 c)STRsch~ule:
c 15 2 13
. 3+9+20+30+32+36+48 178 = 254Jda'
1·,. Mean fl ow time . ys
D I6 II 5
7 7
i E 18 IO 8 d)EDDschedule:
F 5 3 2
.
Mean fl ow time 3+9+II+22+32+36+48 =-=
16I 2Jdays
r.- Q h 3
7 7
The STR schedule is F-+G-+D-+E-+C-+A-+B and the processing time will be as 5.
!' follows:
Madan Mathur is the supervisor of legal-copy-express, which provides copy
services for downtown los Angeles law firms. Five customers submitted their
;'·1 Machine orders at the beginning of the week and are as follows. Schedule the jobs as per
Job
t: In Out i). EDD rule. ii). SPT rule and iii). Slack-time remaining per operation rule.
Vi F 0 3 Which rule gives the best result in terms of mean-flow-time?
!~ ! G 3 9 Job {In order of arrival) A B c D E
., D 9 20 Processing Time (Days) 3 4 6 2 I
E 20 30 Due Date (Days hence) 5 6 7 .9 2
c 30 32
µ.
Sol. i) EDD Rule Schedule : Jan 2016 (lOM)
A 32 36
:·;
:-H B 36 48 The schedule is
H iv) Earliest Due Date (EDD) schedule ~ E--+A--+B-+C-+D and the processing time will be as follows
ii
~1 The EDD schedule is F-+G-+C-+D-'-+E-+A-+B and the processing time will be as Machine
follows: Job
In Out
Machine E 0 I
Job
,, ·--
In Out A I 4
j F 0 3 B 4 8
G 3 9 c 8 14
c 9 II D 14 16
D II 22 ii) SPT Rule Schedule:
E 22 32 The schedule is
A 32 36 E--+D--+A--+8--+C and the processing time will be as follows :
B 36 48
v) Mean flow time for the various !!cb~!ll~~e.
. Job
In
Machine
Out
a) FCFS schedule : E 0 I
~ rcompletiontimeofalljobs D I 3
Mean flowt1me-.!!!!!!!!O.---'-------'---
No.of jobs A 3 6
4+ 16+ 18+ 29+39+42 + 48 I96 =28days B 6 10
7 7 c 10 16
· ~rioil~·~ce
1:11p;
iii) STR rule schedule :
The schedule is There are n different jobs to be processed on two machines A and B in the order AB.
E--+C--+B--+A--+D or i.e. a job assigned on machine A first is completely processed on machine A and then it is
C--+E--+B--+A--+D or assigned to machine B. If the machine Bis not free at the moment for processing tile same
C--+E--+A--+B--+D or job, then job has to wait in a line for its turn on the machine B. i.e. passing is not ·allowed.
E--+C--+A--+B--+D and the proc~ssing time will be as follows: The machine A will remain busy in processing all the n jobs one by one, while the machine
Machine B may remain idle for some time.
Job S.M Johnson and R. Bellman suggested a procedure for determining the optimal
In Out
sequence as follows
E 0 I
The algorithm to find the optimum sequence of jobs are as given below
c I 7
1. List the jobs'along with their processing times on each machine in a table.
A 7 10
10 14
I Jobs I I 2 3 4 .................. n
B
D 14 16 Machines I A IA, A, A, A4 .................. Ao
B 81 82 B3 B4 ...... -............ B.
i) EDD Rule Schedule :
2. Examine the rows of processing times of jobs on machines A and B and find the
. 1+7+11+14+16 49 98d
Mean fl owt1me =- = . ays smallest time/ value. If this value I time is on machine A, schedule this job first on
5 5 machine A. If this value is on machine B, schedule this job last on machine A (as the
ii) SPT RuleSched ule: order is AB)
. 1+3+6+10+16 36 72d 3. If there is a tie (i.e. equal minimal values one in each row), schedule the job in the
Mean fl ow ttme . ays
first row first on machine A and the job in the second column, last on the machine A.
5. 5
iii) STR Rule Schcd ule: 4. If both minimal/ equal values are in the first row (A), select the job with lowest entry
in row_Bfirst and schedule it to machine A and the other job next to the machine A.
. 1+7+10+14+16 48 96d
Mean fl ow time =- = . ays 5. If both minimal values are in the second row (B), select the job with the lowest entry
5 5 in row A first and schedule it to machine A last and next job to machine A next last
SPT rule gives the best results in terms of mean flow time. possible-sequence. ··
6. Remove the assigned jobs from the table. Repeat the steps 2 to 5 till the table becomes
empty.
7. Calculate the idle time for machines A and B and detennine the minimum total
elapsed time .
•
-C~zJ;i~?;~~~~iiJ~i~1Jutz~~~t~~\;1,i~\~-~~::s ··:8¢Q~cnl~gf:.\30:,t-;m~~~~·_, :~?\tt!*= 8 .17 'r
·~~i~~Jil~~i¥~~~~i:·~fi!*IWl11f!!1.!Ui6:ii!1ii,- --.·-· - ------------- - iii) Book 7 has minimum processing time of SO hrs on binding machine, hence
schedule book 7 last on the printing machine (i.e. first on the binding machine) cross
6. A bookbinder has one printing press, one book binding machine and manuscript off the column 7. The resultant sequence is
of 7 different books. The time required for performing printing and binding
operations for different books are shown below.
6 I I I 4 I I I 7 I I I
Printing +- Binding
Book Printing time (hrs.) Binding time (hrs.) machine -+ machine
1 io 25 iv) Book 2 has minimum processingtimeof60 hrs on the binding machine compared
2 90 60 to books 3 and 5 and hence schedule book 2 to next possible last sequence. Cross
3 80 75 off the column 2. Similar procedure is followed to schedule book 3 and 5 to next
20 30 possible last sequence on the printing machine respectively. The optimal sequence
4
so obtained is shown below:
5 120 90
6 15 35 I 611 I 4 I s-131 2 I 1 I
j 50 Printing <-Binding
'7 65
I machine-+ machine
Determine the optimal sequence, total elapsed time and idle time for either
I operation.
Th-- - - - --· I minimum elaosed time fi)r ormtm_g anid binding is given below in the table.
-
;.·l
Printing Binding Idle time for
:i·l
1r
Sol. List of jobs/books along with their processing time on each machine, shown below Book
Time in nmeout Time in Timeout binding machine
:.--1 in a table.
,;1 It has been noticed in the statement that processing order is not given, the printing 6 0 Otl5=15 15 I5_-f:3_5_=50 15
ti
i.i work is to be done on printing press followed by the binding work on the binding I 15 15+20=35-" ____ 1-----50 51H:,2_5,:=75 0
~I
~ i
machine for all books. 4 35 35+20=55------ --ff 75+3~105 0
~- 2 5- 6- 3- 7 4 -175·-
5 55 55+120=175--" 175+~!?_=265 70
~t Book/ Job I 2 3 4 5 6 7
3 175 175+80=255 -- - -2i:r- 265+75=340 0
~ Printing time (hrs) 20 90 80 20 120 15 65 -1-;i3-- 345+60=405
2 255 255+90;'345 "- - 5
It 25 60 75 30 90 35 50
~ Binding time (hrs) 7 345 345+65=410--- --'lflo-- 410t50=460
9 5
p B B p B p B
Idle time for
lli (460-410)=50 hrs 95hrs
m i) On examining the printing time and binding time of all books column wise, the printing m/c
i~_! book 6 has minimum processing time of 15 hrs on printing machine. Hence schedule
w The total minimum elapsed time i.e. time from· start of printing book 6 to the binding
~~f.
~:;
the book 6 on printing machine first and round I cross of column 6 in the table. We the last book 7 is 460 hrs. The idle time for printing machine is difference of time of
~f have the following sequence. last finishing book on binding machine and printing machine i.e. (460-410) = 50 hrs.
fil I 6 I I I I I I I The idle time for binding machine is 95 hrs.

~.:;
Printing <- Binding Note:-
machine -+ machine 1. Time-in of 2nd job on machine B is the highest of time out of I" job on machine B
n" ii) Repeat the procedure for finding smallest processing time column wise, jobs I and time-out of 2"" job on machine A and so on.
books 1 and 4 have same minimal processing time of2Q.hrs on printing machine i.e. 2. Idle time for machine B with job 200 processing on it is the difference of time-in
tie occur. In order to break a tie, choose a book among I and 4, which has minimum of 2nd job on machine Band time-out of I" job on the same machine (i.e machine 8)
:;; processing time on binding machine. The job/ book I has minimum processing time and so on.
frl
; !
~
of25 hrs on binding machine compared to 30 hrs of processing time of book 4 on the 3. Idle time for machine A is the difference of total elapsed time and time of
.. ; same binding machine. Now schedule book 1 on the printing machine followed by completion of last job on machine A.
book 4 in the sequence after book 6. We have the following sequence.
I 6 I I I 4 I I I I I
Printing +-Binding
machine-+ machine
-....
•:•u-.. 0PERArio11s REsEARCH.
S£QUERcmo,3" \((:; ~{~:~t~R~h'.'i;'.~~;§f;}..~~~~~14;.:~(;~";d· . c'~\Z - .:}';};:_:{~~~~~-·
.•
·--
7. We have five jobs, each of which must go through the two machines A and Bin
The processing order is AB
the order AB. Processing times are given in the table below.
2 6 7 4 5- - 3
• Job I 2 3 4 5 Job .
~
1 2 3 4 5 6 7
Machine A 5 I 9 3 10
Mic A 3 12 15 6 10 ll 11 9
MachineB 2 6 7 8 4
Mic B 8 10 10
Determine a sequence for
the five jobs that will minimize the total elapsed time. 6 12 I 3
-B
Also, find the idle time for both the machines. Jan 2018 (08M) & July 2017 (IOM) A B B A/B A B
Sol. . List of the jobs along with their processing time on each machine is shown in the i) Job 6 has minimum processing time of I hr on machine B. Hence schedufo the job
table below with processing order AB. 6 last on machine A i.e. first on machine B The sequence obtained is shown below
Job
2
I
I
2
-5
3
3
4
4
5
I I I I I I 6 I I
M/cA-> ~M/cB
M/c A 5 l 9 3 10 ii) Job I and 7 have minimum processing time of 3 hrs on machine A and 8
Mic 8 2 6 7 8 4 respectively. Hence schedule job I on machine A first and job 7 on machine A last in
8 A A 8 the possible sequence (i.e. schedule job 7 next to job 6 on machine B). The obtained
sequence is
The optimal sequence obtained by using the general procedure is shown below
"i1
I 2 4 I I3 I s I1 I I I I I I 7I 6 I I I
M/cA-> ~ M/c B
Mic A-> ~ Mic B
iii) Job 4 has minimum processing time of4 hrs on both machine A and Band hence
The total minimum elapsed with idle times for the machines A and 8 is as shown it can be scheduled either on machine A or machine B
~
below in the table
M/cA M/cB Idle time for
I 1 I 4 I "i I I 1 I 6 I
Job M/cA-> ~ M/c 8
~
' machine 8
:: Timein Timeout Timein Time out
OR
~;
'
2 0 I --
_[_ - --- 7 I
I I I I I 4 I
7 6I I I
4 I 4--------- _]_ ---- -- 15 0
MlcA-> ~Mic B
13--------
( 3 4 ~~--- --- 22 0 iv) Job 5 has minimum processing time of I0 hrs on M/c A, whereas job 2 and 3
5 13 23·-------- _i1--- --- 27 I have minimum processing time of 10 hrs on machine B. i.e. tie occur. But job 2
l.
28---- --- -
~: I 23 28 30 I has minimum processing time of 12 hrs on machine A compared to that of job 3
with 15 hrs of processing time. Hence schedule job 5 on machine A for the first
[.: Idle time for Mic A (30-28)=2 time units 3 time units
possible sequence followed by jobs 3 and 2 respectfully on machine A. The optimal
r The total elapsed time is 30 time units. sequences obtained are shown below -
Idle time for machine A is 2 time units.
Idle time for.machine 8 is 3 time units. I 1l4lsl3lzl1161
·Mic A-> ~Mic B
8. There are seven jobs, each of which has to go through the machines A and Bin
OR
the order AB. Processing time in hours are given as
• l1lsl3l2l4l1161
Job I 2 3 4 5 6 7
Mic A-> ~ Mic B
Machine A 3 12 15 6 10 11 9
The total minimum elapsed time for machines A and B is given below in the table.
Machine 8 8 10 10 6 12 l 3 Construct the table for either of the two optimal sequences.
Determine a sequence of these jobs that will minimize the total elapsed time. Also,
find the idle time for both the machines. July 2016 (12M) and July 2011 (08M)
Sol. List of jobs along with their processing time on each machine is shown in the table.
---~:.~'
,,
);
i
.... Job
-Machine A
OPERATIONS REsEARCH
Machine B Idle time for

_)!t
·'..'.l{f~
'}-· .
,_:;;,
:;:.
SEQUENCING ·-. -~-~~;;'~F .
ii) Jobs 3 and 6 have same minimum processing time of 6 minutes on machine A. i.e
tie occurs. Schedule job 3 first on machine A at possible sequence, as its processing
··'@!JI
l1
ij I
Time.in
0
. Timeout
3
Time in Time out
) ____ -- rt
machine B
3
.-~
,$
%
time on machine Bis 11 minutes compared to 14 minutes of job 6 on that machine
The sequence obtained is shown below
9-------
tL-- -- 17
]
0
11
(I
4 3
19------ 2
I 4 I I I 3 I 6 I I I'
5 9 I~.:-- -- 31 Mic A-+ -MJcB
~l 34------ -34 ___ -- 44 3
3 19 iii) Job 2 has minimum processing time of 7 minutes on machine B and hence
:!/~1 .
i'\!
46------ -- 4g ___ -- 56
'J
2 34 2 , r~~ sc.hedule this job last on machine A (i.e. first on machine B), which is followed by
7 46 55-----· -5g ___ -· 59 .0
'(~
·~~j: job 5. The optimal sequence obtained is shown below
l
I'
I<
ii.1
6 55
Idle time for machine A (67-66) = I hr
66-----· 66 67 7
17 hrs
1411131615121
Mic A-+ -MJcB
1f:l'· The total elapsed time with idle times of machines A and Bis shown in table below,
'1 The total minimum processing time is 67 hrs. orovtded with number ot units ot eac h
Idle time for machine A is (67-66) = I hr
It
.Bl Idle time for machine B is 17 hrs Job
No of units
of each job Timein
Machine A Machine 8 Idle time for
Timeout Timein Time out machine 8
9. A manufacturing company processes 6 different jobs 011 two machines A and B. ;:;;-,
Number of units of each job and its processing time on A and B arc given in the
I 0 3 ___ 8
J___ --- 8 3
table below. Find the optimal sequence, the total minimum elapsed time and 2 3 6 --· --- 13 0
idle time for either machine 4 3 6 9 --· ---13··
--- 18 0
Processing time 4 9 12 ---
-·-jg--
--- 23 0
Job No. of units ofeachjob
Machine A (minutes) Machine B (minutes) 5 12 15 --- ---23·~ --- 28
I 3 5 8 I 15 20 --- ---28 --- 36 0
2 4 16 7 l 2 20 25 --- ---36--
--- 44 0
3 2 6 II 3 25 30 --- ---44~~ --- 52 0
4 5 3 5
3
2
I 30 36---
42 ---
~:-~~---
-- - 63 0
5 2 9 7.5 36 6'.?,_. --- 74 0
I 42 48 ---
6 3 6 14 ---~4-- --- 88 0
May 2017 (08 M) 6 2 48 54 ---
EL
... ---~~-- --- 102 0
Sol. List of jobs with processing time on either machines is shown in the table below. 3 54 60 --- IO.?. - --- I 16 0
I~; 2 5 3 I 6 4 I 60 69 --- - . 116_ - --123.5
'Y*
.
Job I 2 3 4 5 6 5
78 --- 123).
-
...... ..... 0
2 69
. JEl Mic A 5 16 6 3 9 6 I 78 94 --- ...... _131
- • • 13 I
---138
0
7 II 5 7.5 14
--
... - 0
Mic B 8 2 94 I 10·· - 138 . • - - 145 0
-B A A 2
ii[i' • A A 3 110 126--- ::!~~:. •• - 152 0
11L: i) Jobs 4 and I arc having minimum processing time of 3 minutes and 5 minutes 4 126 142--- 152 159 0
l
~l;_, respectively on machine A and hence schedule these jobs first on machine A. The Idle time for machine A (159-142) = 17 minutes 3 minutes
q. sequence obtained at this moment is shown below.
The total elapsed time is 159 minutes.
!U!J:•lu.,
li!o_·· . I 4 I I I I I I I The idle time of machine A and 8 is 17 minutes and 3 minutes respectively.
ililUl Mic A-+ -M/cB
in' it
lnl!•t:
ittll.Ll.
I•
-::<"---
11
.
~
L
,,
r
t
...
8.5 JOHNSON'S RULE: PROCESSING.~ri JOBS THROUGH THREE
MACHINES .,,,:~i.·~''><-· . . .
OPERATIONS REsEARCH ~EQ~~G
Sot From the given -data

MinAi=6;
-411'
I I
i
In this,
1. Only three machines A, 8 and C are involved.
MinCi=4;
Max Bi=\).
Since Min A = Max B = 6, a problem of processing n jobs through 3 machines can
1
i 2. Each job is processed in the order ABC. be converted into a pr;blem of processing n jobs through 2 machines. Consider two
t 3. No passing of jobs is permitted. . fictitious machines G and H over which all jobs are processed. The processing time
.. The jobs with the processing times on the machines are given below. -~
on two fictitious machine G and H can be determined by two relations given below.
!·' . Job No I 1 2 3 4 ................... n
.1
Gi =Ai+ Bi
Hi= Bi+ C,
• ( 1)
(2)
I
a
Processing
time on
machines
I
A
8
C
I C-: C-: -1
C, c. ..................... c: I
_
4
,
where i = I, 2,. ...... 5.
The processing times of the new problem are given below
3 5 I 2 4
~··
An optimal solution to this problem can be obtained if either or both of the following Job I 2 3 4 5
. conditions holds good. Mic G 13 16 8 10 15
1. The minimum time on machine A is~ maximum time on machine 8.
n·" 2. The minimum time on machine C is~ maximum time on machine 8.
M/c H 9 15 10 9 9
I
H H H
I, If either or both the above conditions holds good, then replace this problem by an
equivalent problem involving 11 jobs and two machines; otherwise the method/ algorithm
G H
Now apply the procedure used for n jobs on two machines to obtain optimal sequence
I
! fails. for the new problem. The optimal sequence is given by
3. Introduce two fictitious machines. say G and H with corresponding processing times
given by
I 3 I 2 I 5 I I I 4 I
M/cG~ ~M/cH
G.=A+B
I I I The total minimum elapsed time is calculated using the steps followed in case of n
H=B+C. jobs on two machines.
4. Determine the optimal sequence of 11job thro~gh two machine equivalent sequencing
1
The processing order given is ABC

problem with the prescribed order GH. Machine A Machine B Idle time Machine C Idle time
Job
m:. Problems on processing njobs through three machines
Time in Timeout Time in Timeout for Mic B Timein Timeout for Mic C
__!!, ___ -- 16
3 0 6 6 6 8
&-·_· 10. Find the sequence that minimizes the total time required in performing the
--
-- - 8
----3·
~-· 2 6 16 ••• -- 16 -- ---22--- _l-2--- -- 31 6
following jobs on three machines-in-the or-der ABC. Processing times (in hours) 5 16 21--- -- 27 -- ---31--- ----5·· __ JJ ___ -- 36
.. 0
r
a' '
1:1-..'.
u .;.
~[·
p
:·
are given in the following table.
Job
Machine A 8
I 2
JO
3
6
4
7
5
11
.
4
I
Idle time
ofM/c s
27
35
35---
42--·
M/c A= (51-42) =9 hrs

35 -- ---40---
--
42 45---
----4
----2
25 hrs
__ .§D.-- -- 44
45 51
4
I
19 hrs
~ : Machine 8 5 6 2 3 4
~~
Uli. MachineC 4 9 8 6 5 The total elapsed time is 51 hrs
r:.
....... Idle time for Mic A is 51-42 = 9 hrs
Sol. List of jobs along with their processing time on each of the machines is shown in the
iF Idle time for Mic 8 is 25+(51-45)=31 hrs
table below the processing- order given is ABC
'i.:.i~.;-
i.
Job
M/cA
I 2 3 4 5
8 10 6 7 II
Idle time for M/ c C is 19 hrs
Note:
I. Time-in for 2nd job on machine C is the highest time-out of I" job on machine C
!t. 5 6 2 3 4
",,... M/cB and time out of 2nd job on machine B.
;.J.'
M/cC 4 9 8 6 5 Similarly time-in for 3rd job on machine C is the highest -0f time-<mt of 2nd job on
~:·;.,;
--~1-
machine C and time-out of 3rd job -on machine B.
~i..!.
f
;;;_
II
,.•\
'ii;
(
-. OPERATIONS REsEARCH
2. Idle time for machine A is the difference of total elapsed time (i.e. time of completion
of last job on machine C) and time of completion of last job on machine A.
SEQUENCING. ', ..-: ; ~
By applying the procedure of processing of n jobs through two machines, theq>timal

sequence obtained is given below.
-:-:.'•
3. Total idle for macbiqe Bis the_ sum of idle times on that machine and difference of I A I D I G I F I B I c I E I
to_~al elapsed time and time of completion of last job on that machine B. Mic G-+ +-Mic H '
11. You are given the following data regarding the processing times of some jobs on The total elapsed tiAt~ along with the idle time of the machines is shown below in
three machines I, II and· III. The order of processing is I-11-111. Determine the the table
---- ---
--
sequence that minimizes the total elapsed time required to complete all the jobs. Job Mic! Mic II Idle time Mic III. Idle time
Time in Timeout Time in Time out for Mic II Time in Timeout for Mic Ill
. Mention clearly the total elapsed time and the idle time of all three machines.
A 0 3 3 . . -- ---7 3 __ 7__ ---13 7 ~
Processing time (hours)

Job Machine D 3 7--- -- 7 --- ---12-- - _)) ___ ----er-
---24 0
7 14--- -- 14 ---17--- - ---2- - __ 2.4.-- ---36 0
I II III G
--
3 4 6 F 14 22--- --·22 -- -- -26- - - ----5 __ .3.fi.-- ---42 0
A
B 22 30--- --3Q_.- -·"33--- ----4 __ A2--- ---49 0
B 8 3 7
c 30 37--· 37 ___ --"39--- ----4 __ .49--- ---54 0
c 7 2 5
37 46--- 46 - 47--- ----7
II
E 54 59 0
D 4 5
25
E 9 I 5
4 6 The total elapsed time is 59 hrs.
F 8
Idle time for machine I is (59-46) = 13 hrs.
G 7 3 12
Jan 2016 (IOM) Idle time for machine II is (59-47) + 25=37 hrs.
lfr Sol. List of jobs along with H1eir processing time on all machines with processing order
.Jf Idle time for machine III is 7 hrs.
12. Find the sequence of the following eight jobs. Each job has to be processed in
It
!!f'"
I-II-Ill is as follows
Job A B c D E F. G the ~B. Following entries give the time in hours on the machine:
Jo~ I 2 3 4 5 6 7 8
'f Mic! 3 8 7 4 9 8 7
~¥ Machine A 4 6 7 4 5 3 6 2
"lji•;io Mic II 4 3 2 5 I 4 3
:4· 6 12 Machine B 8 10 7 8 II 8 9 13
:::..i....- Mic III 6 7 5 II 5
H~: MachineC 5 6 2 3 4 9 15 II
;g~- We have Min I,= 3;
4 Calculate the elapsed time and idle time. Dec 2010 (ISM)
e!·· Min III, =5;
m\]_ ''. Sol. List of jobs along with processing times on all machines with the processing order
Max IL= 5.
~m_r._:_'_i.. ; I
Since Min Ill,= Max II,= 5, the proble·m of processing njobs on 3 machines can be CAB is as shown in the table
- - -
~ ~
.. j
; :~~~ converted into a problem of n jobs on 2 fictitious machines G and H The processing c
I 2 3 4 5 6 7 8
c l!.i!
na::; time for new problem is calculated using the relations shown below.
•f.1:' c 5 6 2 3 4 9 15 II
j[:i;i G. =I +IL and
llJ.i i I I I
H, =II,+ Ill, A 4 6 7 4 5 3 6 2
~~UI.
ill~l · where i =A, 8, ...... G.
;~-; .. ; B 8 IO 7 8 II 8 9 13
W-1;.;.o_
;:a.;:: 2 6 3 4 I 7 - 5
UJ1L Job A B c D E F G \ Fr?m the data,
HE;j _ Mm (C)=2;
U111~
MlcG 7 11 9 9 10 12 10 1
nt:i ,__ ) Min (B ) = 7;
Ill:: 6 10 15
tlL
Mic H 10 10 7 16 I\.____Max (A)- 7.
I -
!:£. G H H G H H G
u:.s •. J.
..... I ,
Hr
~~l
iltfr
..
!I i
-.
·.':JI•'
~~ t
\·I OPERATIONS REsEARCH SEQUENCING
II
ff Since Min (B), = Max(A), = 7, this problem can be replaced by n jobs processed on .
[ two fictitious machines G and H. :~ Book I 2 3 4 5
If The processing time on two fictitious machines G and H is calculated using the
relations shown below.
G =C +A and
\
,t{
t
Printing time
Binding time
40
50
90
60
80
20
60
30
50
40
Finishing time 80 100 60 70 110
lr '
H=A+B.
'
'
'
'
' __ June 2012 (lOM)
where i = I, 2, .... 8.
~ . The processing time for the replaced problem can be written as shown below.
Sol. List of jobs with their processing times on all machines is given below in the table
with processing order printing, binding and finishing
~ 2 6 3 I 4 S
~ -8 7
Job
! I 2 3 4 5
Job I 2 3 4 s 6 7 8
III MlcG 9 12 9 7 . 9 12 - 2·1 13
Printing 40 90 80 60 50
' Mic s Binding . so 60 20 ,30 40
II
{ Mic H 12 16 14 12 16 11 IS 1s
~ Finishing 80 100 60 70 110
i. G G G G G H G From data,
u· The optimal sequence obtained on the consideration of minimum processing time Oil Min (P), = 40;
~i Min (F);= 60;
if:: machines G and H is shown below
ij:.i Max (B) 1 = 60.
E 14ltl3l s 12l8l7l6l
Mic G---> +- Mic H
Since Min (F), =Max (B)1, we can consider this problem as processing of n jobs on
\' the two fictitious machines G and H.
1.~·
•!t'
/The total elapsed time along with idle time of all the machines is shown below in
The processing time on the fictitious machines is calculated using the relations
~ the table shown below.
~ Mic C Mic A Idle time M/cB Idle time G, = P, + B, and
R, Job I
Time in Time out Time in Timeout for M/cA Time in Timeout for M/c B H=B+F
.,~:
I I I
4 0 3 3 - -- 7 3 __ ) ___ - -- 15 7 where i = I, 2, ..... 5.

11·
it .. :·.
I 3 8 --- -- 8 ----12 --- -----r- JL- ---23 0
i! I0 - - - -- 12 -----er- __ 13--- -- -30
3- 5.
.,
2 4
-'--
~-~ 3 8
-- ----19 --- 0 Job I ] 2 .) 4 5
il; 14 - - - .- - -19 ----6-
9o I 150
5 10 ---24 --- 39___ ---41 0 M/cG
::!: ____()" ___ 100 90 90
11: 2 14 20 -- - - - -24 .---30 --- _9L- ---51 0
,I Mic H 130) 160 80 100 150
~j;. 8 20
--
31 - - - - 31 -~---33- .. - ----i-- 5_I ___ ---64 0 - -
'l - G H G G
:1· 7 31 46 - - - 46 ----52 --- ----13---- 99--- ---73 0
·l
,,' 6 46 55 - - - ---55 58 --- -----3-- 73 81 0
The optimal sequence for all the jobs on two fictitious machines based on their
processing times is as shown below.
:1~
~ ~!
rl
d
21 hrs 7 hrs ,~-4-.-,-,-.-,~5~,~2-~, -3-...,
l The total elapsed time is 81 hrs. Mic G ---> +- Mic H
I
! Idle time for machine C is (81-55) = 26 hrs. The total minimum elapsed time along with idle time of all machines is shown in
j·
Idle time for machine/\ is (81-58)+21 =44 hrs. table below. o
...,
. Idle time for machine B is 7 hrs .
:.L.
i 13. A book binder has one printing machine, one binding machine and one finishing
'! machine. The time in minutes required for printing, binding and fihishing
:1
i operations for each hook are known. Determine the order in which the books
should be processed in order to minimize the total time required to process au
the jobs. Also, find the total elapsed time and idle time.
1
t·
L
n
0PERATI~l'(~ ~EARC:H ~-~9,~b~~~~~it~ ~;:~_~?j~ij~-::;,~. :,~' :;~f~~Gi.~:~{[f~;;:~fm~
~(
I
:1
""' Job
Machine P
Time Time.
in out
Machine B
Time Time
•.in out
Idle time for
Machine B
Machine F
Time Time
in out
Idle
time for
Machine F
Job
M/cG
3
I
II
'6
2
18
2
3
9
4
8
4
5
12
~
12
5
6
~
4 0 60 60
- -- 90 60
------10
-- .90-- -160 .90
~
M/cH 21 20 13 18 II 14
l 60 100 - -·[oQ_ --150- -- _160-- -240 0 G G G H G
•'150 --190- ------o --- _24-0-- -350 0 By applying the usual procedure, the optimal sequence obtained is as shown b'elow
11l
5 100 150 - - ------50 - _350.- -450 0
iii.
:..:
2 150
240
240 -
320 - --320
--
•'i40 --300-
340- -----20 450 510 0
l4IJl1l6lzl5I
M/cG-+ ~M/cH
3
t 140 minutes 90 minutes The total minimum elapsed time with idle time of the machines is shown in the table
I
,. !' The total minimum elapsed time is 510 minutes.
below.
Turning Threading Knurling
:•><~'
Idle time for printing machine is (510-320)=190 minutes. Idle time for Idle time for
Job
Idle time for binding machine is (510-340)+ 140=3 l 0 minutes. Time in Timeout Time in Time out threading Time in Timeout knurling
Idle time for finishing machine is 90 minutes. 4 0 2 2 -- --- 8 2 ___ a___ ---20 8
14. Find the sequence for the following six jobs that will minimize the total elapsed 3 2 7 -- -- 8 -- ---12 --- ----() __ .m-- ---29 0
time for the three operations: I 7 IO -- ---12 ---20 --- ----0 ].J_ -- ---42 0
I 2 3 4 5 6 6 10 --·21 ---22 --- -----(-- ___ 55 0
Job
9 11
21 --
- -~--rr---
4]._ - -
3 12 5 2 2 21 33 -- --·33 _s_s_ - - ---69 0
Turning (A)
1
- ---39 ---
----3--
Threading (B) 8 6 4 6 3 5 33 42 -- -··42 45 --- 69 77 0
Knurling (C) (Time in minutes) 13 14 9 12 8 13 The total minimum elapsed time is 77 minutes
Sol. List of jobs along with their processing time on all 3 machines with processing order Idle time for turning machine is (77-42) = 35 minutes
ABC is shown below in the table Idle time for threading m~chine (77-45) + 17=49 minutes
Job - 1 2 3 4 5 6 Idle time for knurling machine is 8 minutes
M/cA 3 12 5 2 9 11 15. Find the sequence that minimized the total time required in performing the job
~~:' 6 4 6 3 l on 3 machines in the order CBA.
Er: M/cB
M/cC
8
13 14 9 12 8 13 Job A B c
!l.Mn.l····
ill;;t:; From the data, l 8 3 8
iff: MinA;=2; 2 7 4 3
i~f-;
!Hl · MinC;=8; 3 6 5 7
i!il MaxB;=8.
:!iif =
Since Min C; = Max B; 8, this problem can be converted into 'n' jobs processing 4 9 2 2
iH
~iii
through two fictitious machines G & H. 5 10 I 5
E$ The processing time of all the jobs on these two fictitious machines is obtained using 6 9 6 I
~!tl~.
the relations shown below. Jan 2017 (16M) &July 2015 (lOM)
;;J:.:
trl G. =A +Band
I I I
Sol. List ofjobs along with their processing time on all machines is shown in table below:
ii:i ~
111f:
H=B+C
I I I
wherei=l,2, .... 6.
The processing order given is CBA
Job I 2 3 4 5 6
r~r
i
al..iLl
;:~
The processing time for new problem is given below.
M/cC
M/cB
8
3
3
4
7
5
2
2
5
1
I
6
!.~ !
Ll M/cj\. 8 7 6 9 10 9
J·tf.l;.l
E'"+
i+'
.
F.lli:
....
From the data,
MinC,= I:
OPERATIONS REsEARCH SEQUENCING
. Job
M/cC M/cB Idle time Mice
411
Idle time
Time in Time out Time in Timeout for Mic B Time in Time out for M/cC
Min A' =6·, 4 0 2 2
-- --- 4 ----32 ___ 4.--- ---13
__ JJ ___ ---23
4
Max. B, = 6. \ 5 7 --- ~- 7 --- 8 --- 0
':: Since Min A, = Max. B,. the given problem can be converted into a problem of
2
-- _z3 ___ ---30
2 7 JO --- •• 10 -- _.-14--- -·-·2 0
" processing of 11 jobs through two fictitious machines G and H. The processing time -- ----o-
6 10 11 --- 14 -- ---20--- _J!L- ---39 0
18 --- -- 20 ---2s--- ----o
on these machines can be calculated using the relations shown below.
1,:'•
G = C +Band
3 II
- _29--- ---45 0
' ' ' I 18 26 --- --26 29--- ----j- 45 53 -0
H =B-+A
' ' '
where i = I, 2, 3 .....6 Idle time for Mic C = 53 - 26 8 time 4 time ·
The processing time for new problem is written as below: = 27 time units units_ units
i 5 3 6 I 2 --4
_,,,.
J;___ -- .
-- The total minimum processing time is 53 time units.
.!. Job I 2 3 4 II 5 i6 Idle time for Mic C is 27 time units.
MlcG II 7 12 41 16 11 Idle time for Mic 8 is 8 + (53 '- 29) = 32 time units.
1( Mic H II II 11 11 j l-
11. \ 15 Idle time for Mic A is 4 time units.
1''
GIH G G G G 16. We have five jobs each of which must go through the machines A, Band C in the
Ul order ABC. Determine a sequence for job that will minimize the total elapsed
trI'' By applying the procedure of processing 'n' jobs through two machines, the sequence time and idle time for each machine.
H: obtained is Job Processing time in hours
ii'
ill
I"
I 4 I 5 I 2 I 6I I I I 2 3 4 5
it M/cG-> <-Mic H
fil Machine A 5 7 6 9 5
pl Job I and 3 have same minimum processing time of 11 time units on machine H
1i.1•1l i_e. tie occurs. To break this tie, take into account the minimum processing time Machine B 2 I 4 5 3
~j~l. of theses two jobs on machine G. Job I is scheduled to be last on the machine G MachineC 3 7 5 6 7
! :i
,,,IJir"
,,;,
Ji:'
(i.e. first on machine H). Also, the job I has same minimum processing time of
11 time units, hence it can also be scheduled on to on machine G at first possible
sequence. Hence the optimal sequence obtained is shown below.
Jan 2015 (12M)& Dec 2012 (IOM)
Sol. List d jobs with processing times on all machines is given in the following table
with processing order of ABC
~t~:
\4lsl2l6IJ I 1 I Job I 2 3 4 5
;i;. Mic G ___, <- Mic H Mic A 5 7 G 9 5
OR MlcB 2 I 4 5 3
14!5!2161113] MlcC 3 7 5 6 7
Mic G -> <- Mic H From the data,
The total elapsed time with idle time of3 machines in the o.rder CBA is given below Min A,= 5;
in the table. MinC=3;
' ~
Max Il = 5.
I
Since Min (A) = Max (8) = 5

The processing time of the jobs on the two fictitious machines G and His calculated
by using relations shown b~low
G.=A+ Band
0 0 I
HI =B.I +C O
where i = I, 2, .... 5
.. .Job
-'·
I
2/3
2
4
3
5
4
OPERATIONS REsEARCH . '
3/2
5
. ~-§E,Q~,9,#t~·<':·, .. ):;Jc;~L?~~~~~ilW,~~~~~~Y:;t'.,:~;.;.;.;~
Sol. List of jobs along with processing time on all machines with the processing order
M1 M2 M3 is given in the table below
M/cG 7 8 IO 14 8
Job A B c D E
;!: M 6 8 7 10 6
MkH 5 8 9 II 10
·i:
M, 3 2 5 6 4
H G/H H· G
M, 4 8 6 7
8
i) Job I has minimum processing time of 5 hrs on machine H, schedule this job l on From the data,
:! machi,ne G on last possible sequence (i.e. first on machine.H)
~= r; Min (M); = 6;
.:1;
' I I I I1 I I ·-'!-
Min (M 3); = 4;
'!~ M/cG~ +-M/c H Max (M 2); = 6.
ii) Jobs 2 and 5 have same processing time of8 hrs on machine G. i.e. tie occurs. Schedule Since Min (M); =Max (M); = 6, this problem can be converted into n jobs processed
._ F
.,. the job 2 on Mic G first on possible sequence and job 5 follows it. Despite, the job 2 has on two fictitious machines G and H.
''·'
:i: same processing time of 8 hrs on both machines G and H, schedule the job 2 either on to The processing time on two fictitious machines G and H is calculated using the
'!:
;!' machine G or machine H. The possible optimal sequences are shown below. relations shown below.
G; = (M 1); + (M2); and
I I I I I I
i!"
2 5 4 3 I
H; = (M2); + (M);
M/cG~ +-Mic H :r~-
where i =A, B, .... E.
or Jr
The processing time for the new problem can be written as shown below.
I s I 4-1 3 I 2 I 1·1 I 2/3 4 5 3/2 -·~
M/cG~ +-Mic H
The total elapsed time along with idle time of all the machines is shown below in
_,-;;"
-+- Job A B c D E
'•.o;: G 9 10 12 16 10
the table
---- - -
Job Mic A M/cB Idle time M/cC Idle time H 7 10 II 13 12
Time in Time out Time in Timeout for Mic B Time in Time out for Mic C H G/H H G
~i:.
-!.:· ~1;.
i;i;;'.
'
:·
2
5
4
3
7
12
. 21
0 7
12 ---
21 -- -
27 ---
7
-·12 -- ---15 ---
- -- 8
-
-·21 - ---26 ---
-·21 ---31 ---
7 ---~--- ---15
----4
----(;--
---T
8
).:;_ -- ---22
-~9- -- ---32
R-- ---37
0
4
·~f_
Here, jobs B and E have same minimum processing time of I0 time units on M/c G
i.e. tie occurs. This tie has been broken by considering the processing time of these
two jobs on machine H. Schedule the job Bon machine G at'first possible sequence,
as it has low processing time of 11 time units on machine H compared to job E with
--32 - 34 ---
~. 0
---y- processing time of 12 time units. In addition to this, job B has same processing time
l!H I 27 32 - -- 37 40 0
of I0 time units on machine G as well as on machine H. Hence, it can be scheduled
rnir
l
The total elapsed time is 40 hrs. on to either machine G or machine H. The multiple optimal sequences obtained are
·i·.·
.U
.
Idle time for machine A is (40- 32) = 8 hrs. is given below
.
rn~;:·
Idle time for machine 8 is 19 + (40 - 34) = 25 hrs.
Idle time for machine C is 12 hrs.
I B I E I D I c I AI
:~rnf. -·
II~( •
M/cG~ +-Mic H
i:L 17. Find the sequence that minimizes the total elapsed time, idle time and normal OR
·r ,..~ '
time.
::;!:;-~:
IL~- Jobs
0
I EI D I cI 8 I A I
:·1;.
Machine Mic a~ +-Mic H
Ii:
'.£ :· A B c D E OR
fF"
~.~
!'.!.
M1 6
3
8
2
7
5
IO
6
6
4
IElslolclAI
''
I
.,J_.'
Mz M/c G~ +- Mic H
.:~ 4
; M, 8 6 7 8 The total elapsed time along with idle time of the 3 machines is shown in the table.
-.:--
Jan 2014 (l~M)
tL
~;1~
llii!:
,,
I
',
... Job
Time in
M,
Timeout Time in
M1
Timeout
Idle time
for M2
OPERATIONS RESEARCH
Ml
Time in Time out
Idle time
for Ml
SEQuiircmo
cutting, sewing and pressing and packing is sh6wn below.
Job I 2 3 4 5 6 7
41!1
·]· Cutting 5 7 3 4 6 7 12
1: B 0 8 8 - - - ---10 8 ___ LO-- 18
- 7 - 10
"
'i''
d E 8 14--- -- 14 --- ---18 --- ----.r ___ L&--- --- 26 0
Sewing 2 6 7 5 9 5 8
24--- --. 24 - ~ - ---30--- ---~6
:·\· Pressing & packing 10 12 II 13 12 10 II -
D 14 ___10-- - - - 37 4
c 3I--- -- ----1 _IL-- - - - 43
From data,
24 31
-- ·.--36·-- ----r-· 0 Min(q=3;
.,,
'.ii A 31 37 - - - -- ·37 40 --- 43 47 0 Max(S)i = 9;
The total minimum elapsed time is 47 time units. Min (P&P)i = IO.
i [,
'. Idle time for machine M, is (47 - 37) = I0 time units Since Min (P&P)i > Max (S)i i.e. I 0 > 9, this problem can be replaced by a problem
I
Ii: Idle time for machine M2 is (47 - 40) + 20 = 27 time units of processing of the 2 jobs.on two fictitious machinesG and H. The processing time
!!~
Idle time for machine M3 = 14 time units of the jobs on these two fictitious machine is obtained using the relations shown
below.
!,
I'
-~~· A readymade garment manufacturer has to process seven items through two
stages of production, viz, cutting and sewing. The time taken for each of these
G=C+ Sand
I I I
I Hi= Si + (P & P)i

,,
I items at the different stages is given below in appropriate units.
where i = I, 2 ..... 7.
L Item No. I 2 3 4 5 6 7
5 3 2 6 4 7
I:
Ii Processing time (Cutting) 5 7 3 4 6 7 12
1: Job I 2 3 4 5 6 7
"ii Processing time (Sewing) 2 6 7 5 9 5 8
Ii MlcG 7 I3 IO 9· 15 I2 20
it i) Find an order in which these items are to be processed through these stages so as
.; Mic H 12 18 I8 18 21 I5 19
I
to minimize the tcital processing time . -
I
t
'} ii) Suppose the third stage of production is added viz, pressing and packing with G G G G G G
i processing time for these items as follows: The optimal sequence of the jobs on three stages (i.e production stages) as per their
~,, processing times are shown below.
f' Item No. I 2 3 4 5 6 7
I
~,-,~,~4--.-,-3~,~6--.-,-2~,-5--.-,-7~,
Processing time (Pressing and Packhg) I0 12 11 13 12 I0 11
Minimize the time taken to process all the items through all the three stages. Mic G --> <-Mic H
Dec 20ll (!OM) The total minimum elapsed time along with idle time of all machines is shown below
Sol. List of jobs with their processing times on the machines is given in the following in table.
table with processing order of cutting and sewing. Job I
MlcC Mic S Idle time for Mic P&P Idle time for
I 316 2 3 516 4 7 Time in Timeout Timein Timeout MlcS Time in Timeout Mic P&P
,..I, (2
Job f (4j 5 6 (7) 0 5 5
-- - -- 7 5 - ___1-- --- 17 7
Cutting 5 \7 3 \4 I 6 7 1121 4 5 9 --- 9 ---14 -- ---.--2 _J7 __ --- 30 0
Sewing \.2 ~ ,7 \_5) '3 0,, w 3 l) 12 - - - ----,4,
-- ---21 -- -----o-- __ 30-- --- 41 0
19 -- - --- 21 -----0
s s c c c s 6 12
-- ---26 -- --~L- --- 51 0
•
The optimal sequence of all jobs on the machines as per their processing time is as
2 19 26 --- 26___ ---32 -- -----o- - __ 51-- --- 63 0
5 26 32 - - - -- 32 ---41 -- -----0 _§J __ --- 75
shown below. -- 0
7 32 44 --- --- 44 52 -- -----3--
j3j4l5l1l2161 CJ I
I0 time units
75 86 0
7 time units
Cutting Mic-> <- Sewing Mic
Above order is to be used to process the items through the above mentioned stages The total elapsed time is 86 time units.
to minimize the total processing time. [die time for cutting machine (i.e. stage) is (86- 44) = 42 time units.
If the third stage i.e. pressing and packing is also-considered, then the list of jobs with Idle time for sewing machine (i.e. stage) is (86- 52) + 10 = 44 time units.
:r-processing time on the three stages of production \vith the processing order of Idle time for processing and packing machine{i.e. stage) is 7 time units.
0
ccc; ''.1~2;~:~:,,,_;,~fr~:G.r~~J;;i~ i. cl~f~-~_Q~s~~~C~ . ;ti$la~~~;.~i,~%ii,'.~'.:Z:~;~:~0~:6litlf~!t~1~iit""-~~1tt~~w6*=ifi
-~:.:~---
IJ.~ ;~,;~~,H,~.~~~~~,~~~:,i9miJB..~r!i;!!r!~iii!iY!ii!H"'~~~·~1:s.· ·. Sol. List of jobs along with their processing time on all machines with the processing
order ABCD is shown below
This sequence problem is described as follows
J. There are n jobs to be perf6rmed, denoted by 1,2,3.. ... n. Job A B c D
2. There are m machines denoted by A, 8, C .......K. M 7 6 5 8
3. Each job is to be processed in the prescribing order say A, B, C ..... K. M, 5 6 4 3
4. No passing of jobs is permitted. M, 2 4 5 3
.. The jobs with the processing times on the machines are given below. M 3 5 6 2
- Job No I 2 3 ' 4 ········· n M, 9 10 8 6
A A2 A, A4 .......... A From data,
A1 0
Min (M 1); = 5;
Bi B. ......... 8
B B1 . 82 " Max (M2, M3, M4); = (6,5,6);
t. Min(M 5), =6 .
' Processing c cl c2 c, c. ... ...... c.
L time on Since Min (M5); =Max (M 2 , M) = 6, the given problem can be converted into n jobs
F machines through 2 fictitious machines G & H. The processing time on two fictitious machines
can be calculated by using the relations shown below.
~
'·
'· Gi = M1i + Mz; + MJ; + M~i and
L K K K, K, K, ......... K_ H; = Mzi + M,; + M•i + Msi·
An optimal solution to this problem can be obtained if either or both of the following where i =A, B, ..... D.
:}!
i~! 2 - 4 3- -
conditions hold good.
fj ii
i..l 1, I. The minimum time on m!lchine A is 2: maximum time on ma~hine B, C ...... K-1. Job A B c D
I
L·~ 2. The minimum time on machine K is 2: maximum time on machine B, C ...... K-1. M/cG 17 21 20 16
ii Then, replace m machines by an equivalent two machines G and H. Two fictitious MlcH 19 25 23 14
i:· machines G and H and their corresponding processing times are given by G G H
1!\
j;j
Gi =Ai+ Bi + ...................(K-1);. The optimal sequence of all jobs on the machines as per their processing time is
Hi: shown below.
Hi= Bi+ Ci+ ................... Ki
i;;<:
G'~.:
,-A]_c_J s 1 6J
t
Note: If neither of the conditions holds good, the method fails.
.. Mic G-> +---Mic H
" If Bi+ Ci+.·..................(K-l)i = k,
The total eta sed time al on with idle time of all mach incs js tabulated below
~l· Where, k is a fixed positive cpnstant for all jobs (i= I, 2, 3.. .... n), then the given problem
Mic M. Mic M, Mic M, Mic M, Mic M,
~··
.b;,,
can be solved as n job through two machines A and K inthe order AK.
Pr.obi ems on ;procjli~~p~'. n]pti~tllf,q~~li~m'.J#i:i~tih1~s . m

I I I
Job I T'.me Time Ti.me Time j Time j Time j Time j Time j Time I Time
out m out m out m out m I out
~ .
~·
19. Find an optimal sequence for the following sequencing problem of four jobs and A o I 7 I 7 _J.-12 I 12_.l-14 I 14 J- 17 I 17 J.- 26
L~ five machines when passing is not allowed of which processing time (in hours) is c 1 1 12-r12_.t--16-rr6-l-21-+--2,].21-l-·21--J.-Js
given below: • I B 12 1 1s-1· 1s J.-24 -f"24__J.-2s -~·-2s J_
33 +·35 - 1-45
..
Job
Machine D 1 s 1 26 -r26 I 29 -r29 32 I
-l·-33 - I
35 -~<is - 1 51
M M., M, M. M, 7+2+2+ 12+2+3+!+ 14+4+1+0+
fl: 2 3 9
Idle (5 J-Z 6)= 25 1 (51-29)±33 (51-32)=37 (51-35)=35 I l?+I = 18
~ ' A 7 5 time
" hrs hrs hrs hrs hrs
B 6 6 4 5 10
c 5 4 5 6 8 The total elapsed time is 51 hours.
D g. 3 3 2 6
~:
~-:;-
Also, find the total elapsed time and idle time for each machine.
:·~.·.·~~~T,i9~s:'RIS~bi(!
8£:-,'o:: LA-J-cJ_s _l_o_l
Idle time for machine M1 is 25 hrs. M/cG-> <-M/cH
Idle time for machine M, is 331 hrs. The total elapsed time along with the idle times of machines is shown below~n the
Idle time for machine M: is 37 hrs. table.
Idle time for machine M4 is 35 hrs. Mic l M/c2 M/c3 M/c4 M/c5
Idle time for machine M5 is 18 hrs.
When passing is not allowed, solve the following problem giving an optimal Job Time Time Time Time Time Time Time Time Time Tune
.20. in out in out in out m out m out
·. solution. A 0 9 9 -- 16 I6 -- 20 20 -25 25 --36
Machine - - - -
M, c 9 16 - --I6 --22 - --22 - -- 29 - --i9 -17 - -~37 - --47
Job
M. M, M, M, -·
5 11 .B 16 24 - -·24 _ --.32 - --jz- - -- 38 - ;.-38 - -45; :.-47 --59
-
-,.A. ·.9 .. 7 4
7 12 D 24 34 - -·34 39 - --39 44 - --45 49 - --59 67
8 8 8 6
8 10 (67-39) + 9 (67-44) + 16 (67-49) +20
c 7 6 7 Idle (67-34) = 33 25+1=26
+2+2=41 +2+3+1= +4 +I =43
5 5 4 8 time time units time units
D 10 July 2015 (lOM) time units 45 time units time units
List of jobs with their processing times on different machines in the processing order The total elapsed time is 67 time units.
Sol. Idle time for machine M1 is 33 time units.
Ml' M , M , M4 and Ms is shown below Idle time for machine M, is 41 time units.
2 1
Job A B c D
Idle time for machine M: is 45 time units.
9 8 7 10
M Idle time for machine M4 is 43 time units.
8 6 5 Idle time for machine Ms is 26 time units.
M, 7
M, 4 6 7 5 21. Determine the optimal sequence of performing 5 jobs on 4 machines. The
5 7 8 4 machining of each job is in the order ABCD and machining times are as follows:
M,
II 12 10 8 Machine
M, Job
A(hr) B(hr) C(hr) D(hr)
From data,
Min (M 1) 1= 7; I 8 3 4 7
Max (M , M1, M4) 1 = (8,7 ,8); 2 9 2 5 5
2
Min (Ms);= 8. 3 6 4 5 8
Since Min (Ms);= Max (M2' M ) = 8. This problem can be converted into processing
4 1
4 12 5 I 9
of'n' jobs through two fictitious machines G and H.
The processing time of jobs on theses two machines is calculated using the relations 5 7 I 2 3
July 2018 (IOM)
shown below.
G, = (M,) + (M 2) 1+ (M 1) 1+ (M 4) 1 and Sol. List of jobs along with their processing time on all machines with the processing
1
H = (M)1+ (M1); + (M 4) 1 +(Ms), order of ABCD is shown below
1 ~b I 2 3 4 5
where i =A, 8, .. ~ D. Mic
2-- 4 3-- A 8 9 6 12 7
Job A B c D B 3 2 4 5 I
28 24
G 25 29 c 4 5 5 I 2
27 33 31 22
H D 7 5 8 9 3
- G G H
The optimal sequence of all jobs on machines as per their processing time is shown
below.
;
'
L
i·ll.,
'.f
..,
..-- ~
.. :~~-:·.: +~~::;:;-=· Opi:fu.ri6/tJ~~~ce

•. ,, ··-.'-·.;:1.·..... : · .• · .. _
22.
IU~ i: From the data, There are five jobs, each of which is to be proce!lsed through machines A, Band
·i
Min(A).=6; · C in the order CAB, processing time in hours is given below: ·
r,
:I!:n Max (B,' q = Max (5,5);' A B C

Min(D); =3. '""' 3 4 7
'·'·I' Since Min (A);> Max (8, C),i.e. 6> 5, this problem can be converted into a problem 9 28 5
'1! of processing of n jobs through two fictitious machines G and H. The processing Job 3 I
5 7
;,1 time of all jobs on machines G and H is calculated using the relations shown below.
4 6 5 2
'!l! G. =A.+ B + C and
c'
1
'Ii H = s' + + o' 5 3 10 4
)Ii I I I I
·:Ii Determine the optimum sequence for the jobs and the total elapsed time.
where i = I, 2, .... 5
r!n 3 2 4 5
1:111:.
Sol. Jan 2018 (08 M)
·I. List of jobs along with their processing time on all 3 machines with the processing order
l~ob 1' 2 '·- 3 4 5 cofCAB is shown below
1f.1.: G 15 16 15 18 10 Job I 2 3 4 5
i.li H 14 12 17 15 6
J: M/cC 3 8 7 5 4
H H G H
Ii Mic A 4 5 I 2 3
Ii
1;
The optimal sequence of jobs on all machines as per their processing time is as M/cB 7 9 5 6 10
II follows From data,
l1 3 4 I
l I I I -2-r-.s -1 Min (A);= 3;
Min (8); = 5;
j! M/c G --+ <- M/c H
Max (A);= 5.
jL The total minimum-elapsed time along with the idle times of all machines is shown
"11!j.: below in the table Since Min (8); =Max (A);= 5, this problem can be converted into a problem of processing
'n' jobs through two fictitious machines G find H.
l,l·.·.. Job
Mic A I M/c B Mic C I Mic D
The processing time on theses two machines is calculated by using the relations shown
H:i Time in I Time out I Time in I Time out I Time in I Time out I Time in I Time out below.
IL
n 3 0 6 I 6 _J---10 I 10 _J---15 I -~-J--- 23 Gi = (C). +(A} and
!t!i'
,f 4 6
18
1s---r--18 J---23 --r-23 · l--24
26 ---r·-26 J..;-29 --1---~9
--t __ 24
--l---33 ---1- !j- -~- ,__ _40
-+-- 33
Hi =(A): + (8):
where i = I, 2, .... 5
!.·ii
~ .;.
2 26 35 --r·35 J.--37 --1--·31 --~---42 --r 42 __ J ___ 41 3
- 5 2 4
lj!
5 35 42 ---r--42 - I 43 -+-- 43 I 45 ---f-- 47 1 50
Job I 2 3 4 5
!.,.,,
·t
ldle time
in hr
(50-42) = 8 (50-43)
+6+8+ 3+6+5 = 35
I (50-45)
+I 0+8+5+4+ I = 33
I 15+1+2=18
M/cG
M/cH
7
II
13
14
8
6
7
8
7
13
!"
l'
II'.
G - -
tC The total elapse<l time is 50 hrs. H G G
tY Idle time for machine A is 8 hrs. The optimal sequence of the jobs on machines as per their processing time is shown
r~~~ below.
!..'..JJ Idle time for machine B is 35 hrs.
::·:
,. ,
;...1
!:_!
Idle time for machinet:: is "33 hrs.
Idle time for machine D is l 8 hrs.
4I I I 5 2I I 3 I I
l,l
k::
Mic G --+ <- M/c H
The total minimum elapsed time along with the idle times of machines is shown below
in the table.
E:.'I'
J.
f-;:
t ;:
L...
r !:
H
[lU
OPERATIQNS RBsEARCH
.'(:::~;j~JrL~~~·
,-":::-.- ::: :. -
M/cB Idle time Min (E). = 3;
Idle time
Job M/cC M/cA for M/c B Since Min (A);= Max (B, q = 4, this problem can be converted into a problem of
for Mic A Time Time
Time Tim~ Time Time processing ofn jobs through two fictitious machines G & H.
out in. out
in out in The processing time ofj\lbs on these two machines is calculated by using the relations
__ ) ___ -- 13 7
5 shown below.
4 0 5 5 -- 7 -- ----r _13-- -- 20 0
G.=A+B+C+D and
5 8 -- -- .8 -- --12 --
I
12 -- -·-12 -- -15 --
----o- -~lL- -- 30
0
I
H=B+C+D+E.
I I I I
8
----r-
1 1
5 0 where i = 1, 2, ..'.. 6.'
20 -- --·20 -- --25 --
_]9-- -- 39
2 12
3 . 20 27 -- -·-21 28 -- ----:r· 39 44 0 5 6 1/2 3 4 1/2
13 7 Job I 2 3 4 5 6
MachineO 15 . 18 12 11 . l3c . n::
1•. · The total elapsed time. is 44:hours Machine H 15 17 IO 12 14 ro
I Idle time for machine C is (44 - 27) = 17 hours
Idle time for machine A is (44 - 28) + 13 = 29 hours G/H H G G H
Idle time for machine 8 is 7 hours The optimal sequence of jobs on all machines as per their processing time is as
23. There are six jobs which are supposed to undergo processing on five machines follows ..
A, B, C, D and E in the order ABCDE. The processing time in minutes is given
in the following table. Determine the optimal sequence, minimum elapsed time
I 4 Is I 1 I 2 I .6 I fl
Mic G-> +--Mic H
and idle time of each machine. or
Job
Machines I 4 I5 I 2 I I I 6 =r-3-j
A 8 c D E M/c G-> +-M/cH
1 8 . 3 I 3 8 or
2 7 4 4 3 6 14151112131(1
3 5 I 4 2 3 M/cG-> +-M/cH
4
5
4
7
3
2
3
2
I
2
5
8
6
c4-rsJ 21-,-,- r 6 -, or
3--
6 8 l l 2 Mic G-> ·+--Mic H
April 2018 (16 M) The total elapsed time along with the idle time of the machines is shown below in
List of jobs along with their processing time ori all machines with the processing the table
Sol .. Mic A M/cB M/cC M/cD M/cE
order ABC DE is shown below.
Job Job Time· Time Time Time Time Time Time Time Time Time
Machine 4 5 6 m out in out in out in out in out
I 2 3 10 __ -- 11
4 0 4 7 11 __ --16
A 8 7 5 4 7 8
5 4 II -
4 -- -- 7
-- I I.- -- 13 -- --13
- --- 10
--- 15, 1 -- 15 __ --17 - - - 17 - --25
B 3 4 l 3 2 I
---,9 --22
- .--
--23 __
I II 19 - - - ·22 --- 23 -- --26 - -- 26 - --34
4 3 2 I
c 1 4 2 19 26 - ---26 --28
- - -28 ---32 -- -·32 -- --35 - --'.!5 - --41
3 2 I 2 2 --:36 __ --38
D 3 6 26 34 - -·-34 -- -- 35 - -35 - --- 36 -- - --41_ - --47
E 8 6 3 5 8 6
3 34 39 - -- 39 40 - 40- 44 -- - 44 46 - -- 47 50
From the data, (50-40) (50-44) (50-46)
Idle time 11+1+1+1
Min (A), =4; (50-39)= 11 +4+4+6+4+6+4 +7+3+7+5+3+4 +10+4+6
(minutes) = 14
Max (8, C, D), =Max (4, 4, 3); =38 = 35 +6+1+6=37
r•!;\
:. ~
!.l
"·1:
Jiu
i
... The total elapsed time is 50 minutes.

Idle time for machine A is 11 minutes.
OPERATIONS REsEARCH SEQuP:Jiicmo
The
·<--;}:~(;~~[t~ilmi:d;1~:§*!~:.:~"-
.
. ··-total elapsed time along with the idle time of the machines is tabulated as below.
Job Mic A M/cB Mice MlcD
I
I Idle time for machine B is 38 [Tlinutes. Time in Timeout Timein Time out Time in Time.out
ii
Idle time for machine C is 35 minutes. Time in. Time.out
!: 3 0 28
I'
Idle time for machine D is 37 minutes. ¥ -- ---40 40 --- 56
- 56 - -- JOO
j, Idle time for machine Eis 14 minutes.· 2 28 58 -- ----58 ---68
I 58
-- --·68 --
- ---86-- --ioo
- --132
:ii . 24. 4 jobs 1, 2, 3 and 4 are to be processed on each of 4 machines A, B, C and
"· D. Processing times in minutes are given in the table. Find for n passing, the 4 116
116 -- ---i16 -- ---130-- ---130 - ---144--
180-- ~--i8o 196-- ---196
---144 __
--20s
-- 192
208 -- 250
11 minimum elapsed time and idle time for each machine. Idle (250-180) = 70
11! -- Machine time minutes
(250-196) - (250-208)
+28+18+48+50 = +40+12+44+52 =
56+12+16= 84
minutes
11 Jcib
; i: A B c D 198 minutes 190 minutes
!, Iir I 58 14 14 48 The total elapsed time is 250 minutes.
Idle time for machine A is (250-180) = 70 minutes.
~ 2 30 10 18 32
Idle time for machine Bis= 198 minutes.
3 28 12 16 44
!Jti: 16 12 42
Idle time for machine C is = I90 minutes.
•'
''·!· 4 64 Idle time for machine D is = 84 rpinutes.
• Sol. List of jobs along ~ith their processing time on the machine with the processing
~ .., . ""-·. -
BCD is shown in the table below.
25. Solve the following sequencing problem giving an optimal solution when passing
is not allowed, of which processing times (in min) is given below.
'
l
~ I 2 3 4
~~
*t M/i.;
A 58 30 28 64 Machine
A B
Job
c D E
8 14 10 12 16
M, fl 13 9 16 17
c 14 18 16 12
M, 4
44 42 3 5 2 6
D 48 32
M 6 7 5 8 4
From data,
M, 15 8 13 9 II
Min Ai= 28;
Max (Bi, C) =( 16, 18); Sol. The list of jobs along with their processing time on all machines with the processing
order M1, M2, M3, M, is shown below in the table
Min D = 32.
I
Since Min A > Max C and Min D > Max C,this problem can be converted into ~b
Mic A 8 c D E
processing of n jobs thr~ugh two fictitious machines G and H. M, fl 13 9 16 17
In addition to this, M, 4 3 5 2 6
~~'
t (Bl+ C) = (Bz +CZ)= (83 + C3)+(84 +C4)=28. M 6 7 5 8 4
iE :. This problem can be converted into n jobs through 2 machines A and D.
~ff: . _M, 15 8 13 9 II
:tr 4 2 I 3
From data,
2 3 4
lit Job. I
28 64
Min (M 1), = 9;
~-: M/cA 58 30 Max (M 2, M), = (6,8);
=r M/cD 48 32 44 42 Min (M4), = 8;
-
.
l
l!l!:!f1.. c A A D Since Min (M 1)i >Max (M 3); i.e. 9 > 8
f Min (M4)i =Max (f\1)i =i.e. 8 = 8
The optimal sequence of the jobs on two machines A and D as per their processing
!
~- time is shown below
In addition to this
t!!"
J,
I3 I2 II I 4~ I (M2A + M3A) = (MzB + M3B)= (M2c +Mic)= (Mzo +Mm)= (MzE + MiE) = I0
This problem can be converted into processing of n jobs through machines M and
\r.•,ti Mic A-+ -~o M4 in the order M1 M 1
l L
4
~
~
I! - ~ti
Mic
4/5
A ·s
2/3
·C
2/3
D
OPERATIONS REsEARCH
4/5
E ~~,~~~lf~~~~l~T
~ M,
M.
11
15
13
8
9
13
16
9
17
II
In this
( There are m machines, denoted by A, B, C, ...... K.
t
Ii
M1 Mi M1 ...2 ···2
The optimal sequence of all jobs with all machines as per their processing time is as
2. There are two jobs to be performed job I and job2.
3. The technological ordering of each of the two jobs through 'm' machines is known,
11
shown below. but this ordering may or may not be the same for both jobs.
~ I
c A E D B I I I I I 4.. Each machine can work only one job at a time.
~
1l
Mic·· M I --+
...
~ Mic M4
The total elapsed time along with the idle time of machine is shown in the table below
:s':. ·_ ·: . ,_ '. .· ~-:. ·;·.· .;,:~1~2.{1:.);~~'~9r~a~i~~KhPr~l~~!~}t~~{t~~:t'.L .•_.
~ I 2 I M/c 3 I Mic 4 I. Draw tWo axes at right angles. to each other. Represent processing time on job I
r M/c
I I Mic
I I I ·
Job ' Time in l Time out j Time in j Time out j Time in j Time our ITime in I Time out I along x-axis and on job 2 along y-axis. Scale must be same for both the jobs.
~ 2. Layout the machine times for two jobs according to given technological order.
c 0 9 I 9 ~J.··· 14 ~ 14...-f • 19 ~I 19__ .t-··32 3. Construct the rectangles for the machines.
1t A 9
l
20._...j--_·_.-~4. ~- ~-.. +-_ .. _. 30 •• •• 32••• J.··47
20 •• ,-·,.........
-+·· __]
•" • 'JA _. •••
, 47 •• 47 L-· 58 4. Draw a line starting from the origin to the point marked 'Finish' by moving
r.
•fi
[
E
D
20
37
37
53
··r
--r
37 -+--·43 -··[ _ 43
··1~~~53 •• -t···55
..
··r· 1'·· l·· ----
69 ...
55•••
69
oJ •
76 ..
~
i;,
76
_J •• -72
horizontally, vertically and along 45° lines with respect to horizontal axis. Horizontal
line represents work on job I, while job 2 remains idle; A vertical line represents
work on job 2, while job l remains idle and a 45° line to the horizontal represents
I
i
~
B
Idle
53 66
(84-66) = 18
t>t>
(84-69)
·+9+6+13:tlo+l I=
I (84-76)
+14+5+13+8+6 =54119+0+0.+5+4 = 28
84
simultaneous work on both jobs.
Since simultaneous processing of both jobs on a machine is not possible. Therefore,
time minutes 64 minutes minutes minutes a diagonal movement through rectangle areas is not allowed.
!
•t The total elapsed time is 84 minutes . 5. An optimal path is one that minimizes the idle time for both the jobs. So we must
choose the path on Which diagonal movement is maximum.
~
I
Idle time for machine M 1 is 18 minutes.
f Idle time for machine M, is 64 minutes. 6. Total elapsed time is obtained by adding the idle time for either job and processing
il
p.
time for that job.
Idle time for machine M: is 54 minutes.
':·•,pl'.~J>l~ro.~fgqjgf~p).fii~!~~tfigij·;;:·:
Idle time for machine M4 is 28 minutes.
26. Use graphical method to minimize the time required to process the following
jobs on the machines. Calculate the·totalelapsed time to complete the jobs. For
each machine, specify the job that should be done first.
":(
t;-
Machines
Job I Sequence: A B c D E
Time(hr): 6 8 4 12 4
Job 2 Sequence: B c A D E
Time (hr): 10 8 6 4 12 ~
Sol. July 2014 {lOM)& July 2011 (09M)

Path 1
Idle time for job I = 4+6 =l 0 hrs
Idle time for job 2 = 4 hours
Path 2
Idle time for job 1 = 4+ 12 = 16 hours
. Idle time for job 2 = I0 hours
li.1
:!
l
SEQ~CING
·,\
i
t
w:-·
~ OPERATIONS REsEARCH ·:·-:."
'
l Path 3
Idle time for job I = 20 hours
Idle time for job 2 = 12 bours Job I f'//UA 11 VUffffi'A\~"1 ll ~
·''" Total minimum elapsed time for job I = Processing time+ idle time
'
i
I
= 34+ IO= 44 hours
'I
Total minimum elapsed time for jo,b 2 = Processing time + idle time Job 2r/ff///////4i~~'Tf010;,
= 40+4 = 44 hours ~~··I A M
..
-Sine~ idle time for both job l and job 2 is minimum along the path I compared to t
path 2 and path 3, path l is optimal
Show idle time for both job l and job 2 along path I on the graph sheet 0 4 8 12 16 20 24 28 32 36 40 44
The optimal schedule corresponding to the chosen path is shown below in figure Time (hrs) ...,.....
(i.e. Gantt chart) 27. - It is required to process the following jobs (two jobs) on various machines shown
(Refer graph sheet) . Based on Gantt chart, below:
The optimal schedule or sequence on various machines for two jobs l and 2 is as
Machines
follows:
Machine A-+ job l precedes job 2 Job I
Sequence: A B c D E
Time (hr): 7 9 5 13 5
Machine B -+job 2 precedes job l
Machine C :--->job 2 precedes job I Job2
Sequence: B c A D E
Machine D -+job 2 precedes job l Time (hr): II 9 7 5 13
Machine E-+ job 2 precedes job I Find for each machine which job should be done first and calculate the total
Job 2 Scale elapsed time. Jan 2010 (lOM)
lcm=4hrs Sol.
IT, Path 1
44 F (Finishing point) Idle time for job I = 4+7= 11 hours.
~i::.
Idle time for job 2 = 5 = 5 hours.
jli
Path 2
.11,:· Idle time for job I = 4+ 13 = 17 hours.
i~~~.
ij: Idle time for job 2 = 11 hours.

~:
!r,l. Path 3
~:: Idle time for job I = 22 hours.
i!L Idle time for job 2 = 16 hours.
:1r
.• 1~,.: <l'.
Since idle time for both job I and job 2 is minimum along the path I compared to
other two paths, it is an optimal path.
rnr~'.- Total minimum elapsed time for job I = Processing time+ idle time ·
:~r
.:ic
= 39+ 11 = 50.hours
ilil' u Total minimum elapsed time for job 2 = Processing time + idle time
=2t·:
-~~---
. = 45+5 = 50 hours •
i. Now, show idle time for job I and 2 along the optimal path (i.e. path I ) on the graph
sheet. The optimal schedule corresponding to the chosen path is shown in figure.
J: CJ'.l (Refer graph sheet) -
:~r ;
! 0 ~A4.., ff$6120 24 281f134 36 •

:l The optimal sequence or schedule or schedule on various machines for job I and 2
L Job I based on Gantt chart is as follows :
"J.' B ~c. ( D ) ( .., Machine A-+ job I precedes job 2
j
'i
±
.,...,,.;,
~-'
,i'
i!;
:j1
il
I I
! I
.. _·:~-.~r:~-s~:-:~~-:~i~~~tz~;f;;~~~~~~~~~::;-~-~-:Q~~~~;R!i~cH
Machine B --+job 2 precedes job I
Machine C --+job 2 precedes job I
Machine D --+job 2 p'r,ecedes job I
SEQuENCING
28.
-·- . ·- ;.-
..
Determine the minimum elapsed time for completing following two jobs. Details
of processing times and the sequence of operations are given below:
Job I: A- 4 to C - 2 to D - 6 to E - 3 to B ""7 2
;I Machine E --+job 2 precedes j~b I Job_.2: C - 8 to A - 3 to D - 4 to B - 2 to E - 3
Job 2 IT2 Also, determine the sequence of jobs on each machine. June 2012 (IOM)
11 Sol. Path I
48
iI
11
-
Idle time for job I = 4+5 = 9 time units
Idle time for job 2 = 6 time units
l, E
44 Path2
Idle time for job l = 4+5 = 9 time units
--Idle time for job 2 == 5+ l = 6 time units
rl·'
I
Path 3
r! J2.
Idle time for job I = 9 time units
~
f
D Idle time for job 2 = 6 time units
Since idle time for both jobs remain same along 3 paths, all are optimal paths
~ Consider path I as optimal path
,f A
Total elapsed time for job l = Processing time+ idle time
~I:
'!'' = 17 + 9 = 26 time units
t.
I Cl 16
Total elapsed time for job 2 = Processing time + idle time
= 20 + 6 = 26 time units
I
I' Now, show idle time for job I and job 2 along the optimal path I on the graph sheet.
The optimal schedule corresponding to the chosen path is shown in figure_
l' (refer graph sheet)
•·
I '
1:,. 8
1;;· 8 The optimal sequence or schedule on various machines for job I and job 2 based on
r ."16 I
!1 the Gantt chart is as follows :
~
Machine A--+ job I precedes job 2
--
I ~n ff 13~ I 44 • Job l
Machine 8 --+job 2 precedes job I
Machine C --+job 2 precedes job I
Machine D--+ job 2 precedes job I
Machine E --+job 2 precedes job I
Jobs
t
Q
4 8 12 16 20 24 28 32 36 40 44 48 50
Time (hrs) _.
'i'
Ii!
1-1
i
I
!i
I
-
. ~-
Job 2
22
0Pl!:RA:1'1~ii{tbi~cli~:
.- - -
1T2
' ..,.-...,...;:··:-··< -
·-·~';.;..:,·.,..~-
Scale
I cm = 2 time units
._·- -~~~NC,IR~ !;{"'!!~?21.i;t~~~Jrj$~7ft(1~~~:;j1.
29.
•... ,._
.-._i:
Use graphical method, determine the optimal sequence needed to process jobs 1
and 2 on five machines, A, B, C, D and E. For each machine, find the job which
should be done first. Also, calculate the total time needed to complete both jobs.
Machines
-:~-:~01f-
Ii F
Machines-
-
\I
Job 1
Sequence: A B c D E
E Time(hr): 1 2 3 5 1
lil
~ I
Job2
Sequence: c A D E B
•iii B Time (hr): 3 4 2 I 5
Sol. May 2017 (08M)
Path 1
,I~
:~
D
Idle time for job I = 3 hours
-,.'I'•f.i
,_ i
A
Path 2 and path 3 are ignored, as the idle time is more for both job 1 and job 2.
ii The optimal path is 1
1: The total minimum elapsed time for job I = Processing time + idle time
f. = 12 + 3 = 15 hours
it"t The total minimum elapsed time for job 2 = Processing time + idle time
:I:I
;ii
c = 15 + 0 = 15 hours
'·11 The optimal schedule corresponding to the chosen path is shown in figure below
(Refer graph sheet)
,1!:
1~ : i·~
0
- > ~
~ ~ R 10 I 12 141 J 6118 20 > Job I
The opti'mal sequence or schedule on various machine for job 1 job 2 based on the
Gantt chart is as follows:
Machine A ~job I precedes job 2
>l ... c.-1.... >I• - .,,,. >I
lL
ji:
I... A u
Machine B ~job I precedes job 2
IE Machine C -.. job 2 precedes job 1
··H: Machine D ~job 2 precedes job 1
'~J;;'
.!i E B Machine E ~job J precedes job I
mJ~:
Job 1
~t ~·
I!
I: li:.
~IP.'
,jj; Job
ill
l.i· t Job 2 ~~'Wffffej •• I
t'-l'-
tl
t:
I I ] " 17 20
. n 26
..
Li'
~f
0 6 8 10 12 14 16 18 20 20 24 26
2 4
t I;
Time (units) -
H
'-•·
~
ni
.. Job2
OPERATIONS REsEARCH
Scale
lcm = 2hours
SEQUENCING
30.
.. ..
A workshop has six machines A, B, C, D, E and F. Two jobs have to be processed
through each of these machines. The processing time on each machine and
technological sequence of jobs is given below.
\ F Job 1: A-. C ->D --. B-> E -> F
Job 2: A -.C-> B -> D-.F-. E
Time in hours on machine
A B c D E F
Job I 20 30 10 10 25 15
Job2 JO 15 30 10 20 15
In which order should jobs be done on each of the machines-to minimize the
total time required to process the jobs? Also find the minimum elapsed time.
Sol. Path 1
Idle time for job I = IO+ 25 = 35 hours
Path 2
Idle time for job I= 10+10+15 = 35 hours
t - 14 ~~
~ 11 10 I l12 14 ~ Job I
Idle time for job 2 = 5+40 = 45 hours
Path 3
Idle time for job I = IO+ I 0+5 = 25 hours
Path 4
·' E Idle time for job I= 15+5= 20 hours
Job I ~~. 11 W////////////N\l Idle time for job 2 = 20+ I 0 = 30 hours
Job • ., (. . 0 14 Since path 4 has minimum idle time for job I and job 2, it is an optimal path.
Total minimum elapsed time= Processing time+ idle time
t = I 00+30 = 130 hours.
Now show idle time for job I and job 2 along the optimal path on the graph sheet.
The optimal schedule corresponding to the chosen path is_ shown io figure (refer
graph sheet)
The optimal sequence or schedule on various machines for job I and job 2 based on
2 4 6 8 10 12 14 16 the Gantt chart is as follows:
0 Machine A--> job I precedes job 2.
Time (hours) ~
Machine B--> job I precedes job 2.
Machine C -->job I precedes job 2.
• Machine D--> job I precedes job 2.
Machine E--+ job I precedes job 2.
Machine F--+ job 2 precedes job I.
i.
Rb>: OPERATIONS
- REsmcia
-· . .
. . . .. -· ,,.
~ "' r~~9llio{ '·'~' :~;;~1t,~:~~~~;~;,~~~~
. . . . .:'t1"tr~~i~~q;;)i ,;'. ..•4ljl
Scale 31. Using graphical method, determine the minimum time needed to process the
Job 2 two jobs on six machines. The information about the machine sequence and the
I cm= 10 hours
F
time required by each job is given below:
11001 . I I I 7 ~ • ~ It Job I
Order: A B c D E F
E Time (hr) 4 5 I 3 6 5
!
Job 2
F t Order: B A c F D E
Time (hr) 6 3 2 4 3 5
D July 2018 (10 M)
Sol. Path 1
B Idle time for job I = 2 hours
Path 2
Idle time for job I = 5+3 = 8 hours
c [die time for job 2 = 9 hours
., .. Since idle time is less for job I and job 2 along the path I, it is an optional path.
The total minimum elapsed time for job I= Processing time+ idle time
Job I = 24 + 2 = 26 hours
The total minimum elapsed time for job 2 =processing time+ idle time
= 23 + 3 = 26 hours
Now, show idle time for job I and job 2 along the path I on the graph sheet
A c ID
The optimal schedule corresponding to the chosen path is shown in figure (refer
graph sheet)
The optimal sequence or schedule on various machines for job I and job 2 based on
the Gantt chart is as follows:
F Machine A-> job l precedes job 2.
Machine B ->job 2 precedes job I.
Job l
20 Machine C-> job I precedes job 2.
. .¥
30
Job Machine D ->job I precedes job 2.
lt.:: t I ~IT-
A c ~ ~.
Machine E ->job I precedes job 2.
Machine F ->job 2 precedes job I.
l l·-" Job2IT
;:.
c: 20 30
··-
H
<I
__ :JL_ 30 40 50 60 70 80 90 100 110 120 130

~t.t· 1r 10 20
Time (hours) ----+-
..;itn
I;
-it::
HitifJ:1
'
I.
~t. 1!..
jF;r.
~1t.
jff'--.
i!hl.
... OPERATIONS R.EsEARCH -
Scale: Standard Normal Cumulative Probability Table

·T-.
/ i\
; I \
; '
, I \
E
24
22
20
Cumulative probabilities for NEGATIVE z-values are shown in the following table:
z 0.00 0.01 D.02 0.03

AI l
\_
0.04 0.05 0.06 0.07 0.08 0.09
-3.4 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.-0003 0.0003 0.0002
"·
-3.3 0.0005 0.0005 0.0005 0.0004 0.0004 0.0004 0.0004 0.0004 0.0004 0.0003
-3.2 0.0007 0.0007 0.0006 0.0006 0.0006 0.0006 0.0006 0.0005 0.0005 0.0005
-3.1 0.0010 0.0009 0.0009 0.0009 0.0008 0.0008 0.0008 0.0008 0.0007 . 0.0007
-3.0 0.0013 0.0013 0.0013 0.0012 0.0012 0.0011 0.-0011 0.0011 0.0010 0.0010
F
12 -2.9 0.0019 0.0018 0.0018 0.0017 0.0016 0.0016 0.0015 0.0015 0.0014 0.0014
! ~~w//T-f,;,;]t--!l-:-
'Ill\
I -2.8 0.0026 0.0025 0.0024 0.0023 0.0023 0.0022 0.0021 0.0021 0.0020 0.0019
~rmz·
0.0035 . 0.0034
\s//-A/\__ll
tlD! -2.7 0.0033 0.0032 0.0031 0.0030 0.0029 0.0028 0.0027 0.0026
:rn:
I -2.6 0.0047 0.0045 0.0044 0.0043 0.0041 0.0040 0.0039 0.0038 0.0037 0.0036
-2.5 0.0062 0.0060 0.0059 0.0057 0.0055 0.0054 0.0052 0.0051 0.0049 0.0048
!rn' A I
-2.4 0.0082 0.0080 0.0078 0.0075 0.0073 0.0071 0.0069 0.0068 0.0066 0.0064
4 -2.3 0.0107 0.0104 0.0102 0.0099 0.0096 0.0094 0.0091 0.0089 0.0087 0.0084
B ·2.2 0.0139 0.0136 0.0132 0.0129 0.0125 0.0122 0.0119 0.0116 0.0113 0.0110
2 -2.1 0.0179 0.0174 0.0170 0.0166 0.0162 0.0158 0.0154 0.0150 0.0146 0.0143
t
0
~ · >~
\:On I 14 16. 18 I20
I? 22 2~ >Jobi
-2.0 0.0228 0.0222 0.0217 0.0212 0.0207 0.0202 0.0197 0.0192 0.0188 0.0183
-1.9 0.0287 0.0281 0.0274 0.0268 0.0262 0.0256 0.0250 0.0244 0.0239 0.0233
':IWi'J:
'·' ·
:~I
-1.8 0.0359 0.0351 0.0344 0.0336 0.0329 0.0322 0.-0314 0.0307 0.0301 0.0294
~;I -1.7 0.0446 0.0436 0.0427 0.0418 0.0409 0.0401 0.0392 0.0384 0.0375 0.0367
,,
!--:.
.-1.6 0.0548 0.0537 0.0526 0.0516 0.0505 0.0495 0.0485 0.0475 0.0465 0.0455
]'; -1.5 0.0668
Job I 0.0655 0.0643 0.0630 0.0618 · 1J:-0606 0.0594 0.0582 0.0571 0.0559
I -1.4 0.0808 0.0793 0.0778 0.0764 0.0749 0.0735 0.0721 0.0708 0.0694 0.0681
~[.
·.
. Job -1.3 0.0968 0.0951 0.0934 0.0918 0.0901 0.0885 0.0869 0.0853 0.0838 0.0823
~
t Job 2
-1.2
-1.1
0.1151
0.1357
·0.1131
0.1335
0.1112
0.1314
0.1093
0.1292
0.1075
0.1271
0.1056
-0.1251
0.1038
0.1230
0.1020
0.1210
0,1003
0.1190
0.0985
0.1170
I
-1.0 0.1587 0.1562 0.1539 0.1515 0.1492 0.1469 0.1446 0.1423 0.1401 0.1379
''
I;
I .:i··
\ 2 4 6 8 10 12 14 16 18 20 22 24 26 --0.9 0.1841 0.1814 0.1788 0.1762 0.1736 -0.1711 0.1685 0.1660 0.1635 0.1611
~ 0 --0.8 02119 0.2090 0.2061 0.2033 0.2005 0.1977 0.1949 0.1922 0.1894 0.1867
rn Time (hours~ --0.7 0.2420 0.2389 0.2358 0.2327 0.2296 0.2266 0.2236 0.2206 0.2177 0.2148
~
--0.6 0.2743 0.2709 0.2676 0.2-043 0.2611 0.2578
ll!·
~ • --0.5 0.3085 0.3050 0.3015 0.2981 0.2946 0.2912

0.2546
0.2877
0.2514
0.2843
0.2483
D.2810
0.2451
0.277{)
!~:
~-
IL
~
--0.4 0.3446 0.3409 0.3372 0.3336 0.3300 0.3264 0.3228 0.3192 0.3156 0.3121
Ir
~'
I~'
--0.3 0.3821 0.3783 0.3745 0.3707 0.3669 0.3632 0.3594 0.3557 0.3520 0.3483
t: --0.2 0.4207 0.41~8 0.4129 0.4090 0.4052 0.4013 0.3974 0.3936 0.3897 0.3859
IL --0.1 0.4602 0.4562 0.4522 0.4483 0.4443 '0.4404 0.4364 0.4325 0.4286 0.4247
:E~ 0.0 0.5000 0.4960 0.4920 0.4880 0.4840 0.4801 0.4761 0.4721 0.4681 0.4641
!·'
!•',
n- OJ
tj _
nL
' ~ OPERATIONS REsEARCH
l'
1' Standard Normal Cumulative Probability Table. ~0~~{~~~

I MODULE· 1
~umulative probabilities for POSITIVE z-values are shown in the following table: I. ~
·. Define operations research. Give the historical development of operations research.

2.
z 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 List any three advantages and limitations of operations research.
0.0 0.5000 0.5040 0.5080 0.5120 0.5160 0.5199 0.5239 0.5279 0.5319 0.5359
0.1 0.5438 0.5478 0.5517 O.!j557 0.5596 0.5636 0.5675 0.5714 0.5753
3. Explain in brief different phases of operations research.
0.5398
0.2 0.5793 0.5832 0.5871 0.5910 0.5948 0.5987 0.6026 0.6064 0.6103 0.6141 4. Mention four application areas of operations research.
0.3 0.6179 0.6217 0.6255 0.6293 0.6331 0.6368 0.6406 0.6443 0.6480 0.6517
~ Iii
0.4 0.6554 0.6591 0.6628 0.6664 0.6700 0.6736 0.6772 0.6808 0.6844 0.6879 5. Briefly explain the scopes of operations research.
l:j/!
., I
;
0.5 0.6915 0.6950 0.6985 0.7019 0.7054 0.7088 0.7123 0.7157 0.7190 0.7224 6. List and explain the Various phases of operations research and state the limitations of
OR models.
0.6 0.7257 0.7291 0.7324 0.7357 0.7389 0.7422 0.7454 0.7486 0.7517 0.7549
0.7734 0.7764 0.7794 0.7823 0.7852
7.
0.7 0.7580 0.7611 0.7642 0.7673 0.7704
What are the features of OR approach to any decision problem? Explain in brief.
0.8 0.7881 0.7910 0.7939 0.7967 0.7995 0.8023 0.8051 0.8078 0.8106 0.8133 8.
0.9 0.8159 0.8186 0.8212 0.8238 0~8264 0.8289 0.8315 0.8340 0.8365 0.8389 List any four indusfrial applications of operation research.
9.
1.0 0.8413 0.8438 0.8461 0.8485 0.8508 0.8531 0.8554 0.8577 0.8599 0.8621 "Operations research is more than just mathematics". Justify the statement, with an
example.
1.1 0.8643 0.8665 0.8686 0.8708 0.8729 0.8749 0.8770 0.8790 0.8810 0.8830
10.
1.2 0.8849 0.8869 0.8888 0.8907 0.8925 0.8944 0.8962 0.8980 0.8997 0.9015
Discuss the areas of management where operations search techniques are applied.
1.3 0.9032 0.9049 0.9066 0.9082 0.9099 0.9115 0.9131 0.9147 0.9162 0.9177 11. Briefly explain the OR models.
1.4 0.9192 0.9207 0.9222 0.9236 0.9251 0.9265 0.9279 0.9292 0.9306 0.9319
12.
What are the characteristics of a good model?
1.5 0.9332 0.9345 0.9357 0.9370 0.9382 0.9394 0.9406 0.9418 0.9429 0.9441 13.
1.6 0.9452 0.9463 0.9474 0.9484 0.9495 0.9505 0.9515 0.9525 0.9535 0.9545 A firm produces three products. These products are processed on three different
1.7 0.9554 0.9564 0.9573 . 0.9582 0.9591 0.9599 0.9608 0.9616 0.9625 0.9633 machines. The time required to manufacture one unit of each of the products and the
1.8 0.9641 0.9649 0.9656 0.9664 0.9671 0.9678 0.9686 0.9693 0.9699 0.9706 daily capacity of the three machin,.c ic .,:.,~ .• L-•-
J; 1.9 0.9713 0.9719 0.9726 o.9h2 0.9738 0.9744 0.9750 0.9756 0.9761 0.9767 ----- ......... 51"""11 Ut::IUW.
~H
~ti. Machine Time per unit (minutes)
Machine capacity
1
-·1~: 2.0 0.9772 0.9778 0.9783 0.9788 0.9793 0.9798 0.9803 0.9808 0.9812 0.9817 Product 1 Product 2
n 2.1 0.9821 0.9826 0.9830 0.9834 0.9838 0.9842 0.9846 0.9850 0.9854 0.9857 M,
Product 3 (minutes/day)
1;;.
It 2.2 0.9861 0.9864 0.9868 0.9~71 0.9875 0.9878 0.9881 0.9884 0.9887 0.9890
M,
2 8 2 . 940"
4 -
J~'
2.3 0.9893 0.9896 0.9898 0.9901 0.9904 0.9906 0.9909 0.9911 0.9913 0.9916
8 980
2.4 0.9918 0.9920 0.9922 0.9925 0.9927 0.9929 0.9931 0.9932 0.9934 0.9936 M1
"·";;;: 2 5
.. -
It is , -·- __ ·~ ""''"'""111c me aa11y number of units to be manufactured for each
reOllirf>n tn rlMo•·-=-- 430
mp·
•I.
W.:
2.5 0.9938 0.9940 0.9941 0.9943 0.9945 0.9946 0.9948 0.9949 0.9951 0.99.52
ff\. it
2.6 0.9953 0.9955 0.9956 0.9957 0.9959 0.9960 0.9961 0.9962 0.9963 0.9964 product. The profit per unit for product l, 2 and 3 is Rs.4, Rs. 8 and Rs. 6 respectively.
ilill:
;l;;,:; 2.7 0.9965 0.9966 0.9967 0.9968 0.9969 0.9970 0.9971 0.9972 0.9973 0.9974
~~-
It is assumed that all the amounts produced are consumed in the market.
2.8 0.9974 0.9975 0.9976 0.9977 0.~77 0.9978 0.9979 0.9979 0.9980 0.9981 Formulate an LP model for the problem.
ifJL_ 2.9 0.9981 0.9982 0.9982 0.9983 0.9984 0.9984 0.9985 0.9985 0.9986 0.9986 14.
f'..f:/'
:~.:. i .. A farm is engaged in breeding pigs. The pigs are fed on various products grown in
; !. 3.0 0.9987 0.9987 0.9987 0.9988 0.9988 0.9989 0.9989 0.9989 0.9990 0.9990
1!·'!'r! the farm. Because of the need to ensure certain nutrient constituents, it is necessal)'
' ~ 3.1 0.9990 0.9991 0.9991 0.9991 0.9992 0.9992 0.9992 0.9992 0.9993 0.9993
;1:( 3.2 0.9993 0.9993 0.9994 0.9994 0.9994 0.9994 0.9994 0.9995 0.9995 0.9995
to buy additionally one or hyo products, which we shall call A and B. the nutrient
It!;,
l.t.,ii' 3.3 0.9995 0.9995 0.9995 0.9996 0.9996 0.9996 0.9996 0.9996 0.9996 0.9997 constituents (vitamins and proteins) in each unit of the products are given below.
ii'.!:
3.4 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997
~
:bfr 0.9997 0.9998
II
1:.
it; -
!l!JlL
m
~
Nutrient
0PERATIOtr8 :REStARcH
Nutrient contents in the products · Minimum amount
I -~0.X ,~"1fK:.,. ~·,.
Maximize Z = 20x 1 +25~

:t~~~1~~~:r .· ;F~~
A B of nutrients subject to 12x1 +16~::;100,

I 36 6 108 · l6x 1 + 8~::; 8,
2 3 12 36 x" 'S 2: 0. \
6. Use Big-M method to solve
3 20 10 100
Minimize Z = 2x 1 +4x
Product A costs Rs. 20 per unit and product B costs Rs. 40 per unit. Formulate the 2
subject to 2x 1 + ~ 2: 14,
LP"model for products A and B to be purchased at the lowest possi_ble cost so as to
provide the pigs, nutrients not less than that given in the table. x, + Jis 2: 18,
x1 + x2 2: 12,
15. What are the requirements of LPP? x" 'S? 0.
16. Define i) Feasible solution ii) Feasible region iii) Optimal solution iv) Unbound 7. Use two phase method to solve
solution v) Solution space Minimize Z = x1 + x
2
17. When do you conclude the following for LPP by graphical method? subject to 2x 1 + x2 2: 4,
i) LPP has an alternative (or multiple) optimal solutions x, + 7'S? 7,
ii) LPP has an unbound solution x" x2 2: 0.
f iii) LPP has an infeasible solution 8. Construct the dual of the problem
I: iv) LPP has redundant constraints Maximize Z = 20x1+40x
1;· 2
18. Solve graphically subject to 2x1 +20~? 40,
Minimize Z = 12x 1+7~ 20x 1 + J'S ? 20,
subject to x1+ 2x2 :S 40, 4x 1 +15x2 2: 30,
3x 1+ x2 2: 30, x1, ~2: 0.
i'
1111
1: 4x1+ 3x2 2: 60, 9. Use dual simplex method to solve
X 1, ~ 2: 0. Minimize Z = 3x1 +is
19. Solve graphically subject to x1 +is? 1,
Maximize Z = 2x 1+Jx2 2x 1 + Jis 2: 2,
subject to x1+ x2 :S I, x1, is? 0.
3x 1+ x2 :S4,
x1,JS2:0.
MODULE· 3
1.
!" MODULE· 2 Define Balanced and unbalanced transportation problem.
2. Formulate the transportation problem as LPP.
I. Write four assumptions of linear programming.
3.
Explain degeneracy and its resolution in transportation problem.
• 2. Define i) Slack variable ii) Surplus variable iii) Artificial variable
4.
3. Find the optimal solution to the following transportation prob!
Explain the concept of degeneracy in simplex method.
Factories p
4. When do you conclude the following for LPP by simplex method? Q R s Availability
A 10 8 7
i). LPP has an alternative (or multiple) optimal solutions 12 500
ii). LPP has no limit for the improvement of the objective function I LPP has an B 12 13 6 10 500
unbounded solution. c 8 10 12 14 900
iii). LPP has no feasible solution/consistency Demand 700 550
I__ •
450 300
5. Solve the following LPP by simplex fl)ethod: Solve tne Iransportat1on problem for which the cost, origin availabilities and
destination requirements are given below:
..... D D
'
D .
D D
OPERATIONS °REsEARCH
D a;
QUESTION BANK
MODULE-4
. ..
Jl·1'
:i o, I• 2 I 4 s 2 30 I. Explain the basic steps involved in PERT/CPM.
02 3 3 2 I 4 3 so 2. Explain the Ful~erson's rule of numbing the nodes.\

Oi 4 . 2 s 9 6 2 75 3. Write short notes on crashing ofa project network.
3 I 7 3 4 6 20 4.
04 Define the following:
b. 20 40 30 IO so 2S i) Normal cost ii) Crash cost
• J
Formulate an assignment problem as LPP. iii) Optimistic time iv) pessimistic time
Differentiate between assignment problem and transportation problem. v) Most likely time vi) Critical path
7.
8. Explain the steps involved in solving assignment problem using Hungarian method~ 5. Define the following terms with reference to PERT:
i)Total float ii) Free float
9. Differentiate between assignment problem and travelling salesman problem.
.'II[I
iii) Independent float iv) Earliest starting time
10. A team of 5 horses and S riders has entered a jumping show contest. The number of v) Slack vi) Estimated time (te)
penalty points to be expected when each rider rides any horse is shown below:
'Jt\ 6. List the differences between PERT and CPM.
Rider
7. Explain reasons for incorporating dummy activities in a network diagram. In what
R R. ,
. R R R d
' way do these differ from the normal activities?
HI I 2 I 4 s
8. Explain the following with respect to PERT/CPM:
Hz 3 3 2 I 4
Horse i) Dummy activity
.il; H, 4 2 5 9 6 ii) Node
H4 3 I 7 3 4 iii) Activity
HS 20 40 IO so 30 9. With sketches, give the meaning of merge and burst events as applicable to a project
How should the horses be allotted to the riders so as to minimize the expected loss network.
of the team? I 0. Construct the network for the following set of activities:
11. Solve the following assignment problem: Activity A B c D E . F G H I
! J
I II Iii IV v
Immediate
11 17 8 16 20 predecessor
- -
8 A,B A,8 8 E,D,F D,E E,F H,G,l,C
2 9 7 12 6 15 Draw the network for the following project:

3 13 16 15 12 16 Activity A B c D E F G H I J K L
4 21 24 28 17 26 Preceded by - A A B B c c F D G,H E I
5 14 IO II 15
12 Time (Weeks) 10 9 7 6 12 6 8 8 4 If 5 7
Find the least cost route for the travelling salesman problern shown below: Find the critical path, event slacks, total, free and independent floats.
To city 12. Give below is the information regarding a project:
-ill: • 2 3 4 5 6 7 Activity A B c D E F G H I J K L
!£11. 00 8 14 8 6 IO 3 Preceding activity - - - A,B B B F,C B E,H E,H C.D.F,J K
.jL
;.i,: ..
ff' 2 8 <J) 12 7 6 5 5 Duration (Days) 3 4 2 5 I 3 6 4 4 2 I 5
ii·
13 5 13 10 Draw the network and find the project critical path.
mJ
~a\::
From 3 10 9 (f)
7 10 8
i.a;.i. city 4 7 6 13 UJ 13. Three time estimates (in months) of all the activities of a project are given below:
'i"
r ~ . ,.
;. _,:... ..
·~·;:
5 7 4 9 10 U) 6 9
li fl;. 6 4
~ii~~: 6 8 5 13 7 C(J
.{;..,
f!L 7 4 5 11 9 6 5 (j)
...
~ -·.·~.:.:~~K~~~~~~,~t~~i~~~:~~~tf. ~ . ;_ OPER.\n611'8.RE&Wt<:a
- . ' ··.
··~ .-. . QtJano11 BANK
':"~
···:.. • .;~=.-·.~~
Activity t_
t t_ 27. The arrival rate of customers at the single window booking counter of a two-wheeler
1-2 3 4 5 agency follows Poisson distribution and the service time follows exponential
i 2-3 6 8 IO (negative) distribution and hence, the service rate also follows Poisson distribution.
2-4 2 3 4 The arrival rate and the service rate are 25 customers per hour and 35 customers per
hour, respectively. Find the following:
34 4 5 12 i) Utilization of the booking clerk.
II ·;. 4-5
~-6
5
9
7
16
9
17
ii) Average number of waiting customers in the queue.
iii) Average number of waiting customers in the system.
I
'I
i) Find the expected duration and standard deviation of each activity.
ii)· Construct the project network.
iv) Average waiting time per customer in the queue.
v) Average waiting time per customer in the system.
iii) Determine the critical path, expected project length and variance of the project.
28. A harbour has single dock to unload the containers from the incoming ships. The
l 14. The utility data for a network is given below. Crash the network to minimum project arrival rate of ships at the harbour follows Poisson distribution and the unloading
I
I. duration and determine the oroject cost for that duration. time for the ships follows exponential (negative) distribution and hence, the service
l
Ij.: Activity Time
Nonna[
Cost Time
Crash
Cost
rate also follows Poisson distribution. The arrival rate and the service rate are 8 ships
per week and 14 ships per week, respectively. Find the following:
i) Utilization of the dock.
(weeks) (Rs.) (weeks) (Rs.)
h
;,
0-1 I 5,000 I 5,000
ii) Average number of waiting ships in the queue.
1:· iii) Average number of waiting ships in the system.
~-! 1-2 3 5,000 2 12,000 iv) Average waiting time per ship in the queue.
,,
1-3 7 11,000 4 17,000 v) Average waiting time per ship in the system.
F
l:;
~·· 2-3 5 10,000 3 12,000
·J:
2-4 8 8,500 6 12,500 MODULE·S
f'
ji: 3-4 4· 8,500 2 16,500
LI l. Explain the following terms related to theory of games:
\!()~
Id:.
~ 4-5 1 5,000 1 5,000
l
Define the term queue. State ~qd explain the charactens
..
q g system. i) Payoff matrix ii) Min. Max and Max. Min principle iii) Dominance rule iv) Pure
f: and mixed strategies v) Fair game vi) Two person zero sum game
L 16. Explain a queuing discipline. 2. Explain different strategies in game theory.
jH 17. Explain in briefthe following terms related to 'Service cjiscipline' with example: 3. What are the characteristics of games?
i) First Jn First Out ii) Last In First Out iii) Priority service iv) Random service
4. What are the assumptions of two person zero·sum game?
18. Discuss on the limitations for the application of queuing models. 5.
.. Define and briefly explain following terms related to game theory.
19. Define five operating characteristics of a queuing system.
i) Payoff ii) Value of the game iii) Saddle point iv) rectangular game
!. 20. Mention and discuss seven elements of a queuing system. 6.
Define saddle point. Is it necessary that a game should always possess a saddle point?
21. Define: i) Balking ii) Reneging iii) Jockeying 7. Determine the optimal strategy and value of the game:
22. Briefly explain the classification of queuing models. Q
B
?1 Write the characteristics of waiting lines.
-.J. IO 4 2 9 I
24. What is service discipline? State various disciplines with examples. 7 6 5 7
A 8
25. Write a note on Kendall's notations. 3 5 4 4 9
26. Explain the need for studyfog queues. 6 7 3 "
.) 2
Solve the game by using dominance rule:
... 10
-
81
Player B
32 43
OPERATIONS REsEARCH
93
1
,,..
OPERATIONS RESEARCH
,..
Eighth Semester B.E. Degree Examination
"I
73 Model Question Paper • 1

Player 59 63 39 69
Time:\3 hrs. Max. Marks: 80
A 71 20 05 27 84 Note: /. A1m11er a11y FIVE full questions, selecting ONE/111/ question from each Module.
34 .(4 44 44 69 ~ 2. Use of statistical tables permuted.
Solve the following game using graphical method:
Player 8. Module-1
l 2 3 4 5 I. a. Explain briefly the characteristics of operations research. (06 Marks)
I I ; I ~ I -~ I ~ I -: I : I
Pfay0< A
What do you mean by job sequencing? List out any four assumptions underlying
b. A boat manufacture builds two types of boats: type A and type B. The boats built
during the months January-June go on sale in the months July-December at profit
of Rs. 2000/ type A boat and Rs. 1500/type B boat. Those built during the months
10. July-December go on sale in the months January-June at a profit of Rs.4000/type A
sequencing problems. boat and Rs. 3300/type B boat. Each type A boat requires 5 hours in the carpentry
11. Explain the following: shop and 3 hours in the finishing shop. Each type B boat requires 6 hours in carpentry
i) Idle time on machine shop and I hour in. the finishing shop. During each half year period, a maximum
ii) Total elapsed time of 12000 hours and 15000 hours are available in the carpentry and finishing shops
12. Explain SPT and WSPT rule. respectively. Sufficient material is available to build no more than 3000 type A boats
and 3000 type B boats a year. How many of each type of boat should be built during
13. Five jobs must pass throu.gh·a· lat·h· e and a s.uu~rfi
..g.rin. der, in that order. The processing
times in hours are shown below. Dete~e a minimum make span sequence of the each half year in order to maximize the profit. Formulate it as LPP. (I 0 Marks)
jobs and determine the nia~ke span and machine idle time. OR
Job 1 2 3 4 5 2. a. Define: i) Feasible solution ii) Optimal solution iii) Solution space (06 Marks)
Lathe 4 1 5 2 5 b. Solve the following LPP graph!cally,
Surface grindtir 3 2 4 3 6 Maximize Z = 2x 1 + Jx.,
Find the sequence that. minimizes the total elapsed time required to complete the subject to the constraints·
following jobs on three machines. Give the necessary condition for the method. x 1 +JS S30,
--
Jobs A B c D E F G x2::::: 3,
1 I 2 7 10 o sx2 s12,
Machine I 7 8
8 0 Sx 1 S20,
Machine II 7 II 9 7 10 9
x 1 - x2 ~ 0 and
Machine Ill s 2 I 3 7 6 3
xi' x2 ::::: 0. (I 0 Marks)
What is the minimum elapsed time? Module-2
15. The time spent on processing of two jobs on six machines A, 8, C, D, E, F and the
3. a. Define Slack variable and Surplus variable. (04 Marks)
necessaiy technological ordering of machines are as follows:
A B c D E F b. Solve the following LPP by simplex method,
Sequence
Job I 30 25 IS Maximize Z = 7x 1 + 5~
Time (min.) 20 10 10
subject to -x 1 - 2JS ~- 6
Sequence A c D D F E
4x 1 + 3x2 S 12 and
Job 2 15 10 15 20
Time (min.) 10 30 x 1 , x2 :0:: 0 (12 Marks)
Use graphical method to determine an optimal sequence of jDbs which minimizes
elapsed time.
[ill
OPERATIONS REsEARCH
~ MODEL QuEsnoN 1>~ . .
'Jm
p
OR Typist Rate/hr, Rs. No. of pages typed/hr. Job Number of pages

4. a. Write the dual of the following LP problem, A 5 12 p 199
Minimize Z = 3x 1 - 2x;+4is
B 6 14 Q 175
subject to 3x 1 + 5"2 + 4":J 2:.7
6x 1 + x2 + 3JS 2:. 4 c 3 8 R 145
7x 1 - 2x2 - x3 '.S 10 D 4 10 s 298
·. x 1 - 2x 2 + 5x3 2:.3 E 4 II T 178
4x 1 +7x2 -2x3 2:. 2 and
· (04 Marks) (10 Marks)
x 1, "2• x3 2:. 0.
Module-4
::
b. Solve the following proglem by dual simplex method,
Minimize Z = 2x 1 + x2 7. a. Define: i) Optimistic time ii) Pessimistic time (04 Marks)
subject to 3x 1 + x2 2:. 3 b. A small project consists of six activities. The duration (in days) of each activity and
4x 1 +3x 2 2:. 6. their immediate predecessors are shown below:
x. +2Xz2:. 3 Activity: A B c D
(12 Marks) E F
X , X2 2:. 0
1
Module-3
Immediate predecessor: -- - - A,B B B,C
Duration (days): 5 3 7 8 4 5
5. a. Explain degeneracy and its resolution in transportation problem. (06 Marks) i). Draw the network
;,
;~ b. Obtain the initial solution by VAM and optimal solution by MODI method for the ii). Find the critical path
!/ transportation problem, shown below· iii). Verify the critical path by earliest time and latt;st time values. (12 Marks)
·~
11;~ Unit transportation cost (Rs.) to markets OR
"
I'
.1
A B c. Supply 8. a. Explain briefly the operating characteristics of a queuing system. (-06 Marks)
"'
Q)
w, 5 . 4 6 65 b. At a petrol pump, customer's arrival is a Poisson process, with an average time of
I; "'0
::l
.c 4 7 42 5 minutes between arrivals. The time intervals between services at the petrol pump
il1 ~ w2 7
.,,;- follows exponential distribution and as such the meaiFtime taken to service a unit is
11:
~
~ Wi 8 6 7 43 two minutes. Find the following:
h Demand 70 30 50 i) Expected average queue length.
~·p· (10 Marks) ii) Average customers in the queue system.
i!~.
iii) Expected waiting time in the queue and the system. ( 10 Marks)
OR
Module-5
:t 6. a. Distinguish between assignment problem and transportation problem. (06 Marks)
9. a. Define : i) Payoff ii) Optimal strategy iii) Two person zero sum game (06 Marks)
~~ b. A solicitor's firm would like to employ typists on hourly piece-rate basis for their
IL
I.I work. There are five typists and their charges and capability (typing speed} are b. Solve the following game using the concept of dominance, whose payoff matrix is
11I·' different. There are five jobs available with the firm and one job is to be assigned
given below: Q
~ to one typist. A typist is paid for full hours even if he/she works for a fraction of an Player 8
li hour. Find an optimum assignment of typists to jobs to minimize the total cost to the
ii1: Player A I II III IV v
firm, given the following data: I 3 5 4 9 3
ri . II 5 6 9 7 8
L
Ii III 8 7 8 8 9
~
IV 4 4 8 5 3
(lOMarks)
~
~
OPERATIONS REsEARCH
OR Eighth Semester B.E. Degree Examination

10. a. Explain the basic assumptions made during sequencing. (06 Marks)
""'
OPERATIONS RESEARCH
b. 4 jobs I, 2, 3 and 4 are 'to be processed on each of 4 machines A; 8, C and D. Model Question Paper· 2
Processing times in minutes are given in the table. Find for n passing. the minimum Time: 3 hrs.
\ Max. Marks: 80
elapsed time and idle time for each machine. Note : 1. A11swer a11y FIVE full q11estio11s, selecti11g ONE full question from eac/1 Module.
Machine ~ . 2. Use of statistical tables permitted.
Job ./.
·~.
A B c D
14 48
Module-I
I 58 14
18 32 1. a. Explain briefly the phases of operations research.
2 30 JO (06 Marks)
3 28 12 16 44 b. An institute wants to host a seminar for next five days. For delegates, there is an
64 16 12 42 arrangement of dinner every day. The requireme'nt of napkins during the next five
4 days is as follows.
( 10 Marks)
Day I 2 3 4 5
Minimum no. of napkins required 75 60 110 65 125
The institute does not have any napkins in the beginning. After five days, the institute
has no more use of napkins. A new napkin cost at Rs 4 and washing charge for used
one is Rs 1.5. A napkin given for washing after dinner on first day is returned on
the third day before dinner and so on. The institute decides to accumulate the used
napkins and send them for washing just in time to.be used when they return. How to
meet the requirements so that the total cost minimized? Formulate this as an LPP.
(10 Marks)
OR
2. a. When do you conclude the following by graphical method?
i) LPP has an alternative (or multiple) optimal solutions.
ii) LPP has an infeasible solution
iii) LPP has redundant constraints
(06 Marks)
b. The standard weight of a special purpose brick is 5 kg and it contains two ingredients
8 1 and 8 2• 8 1 costs Rs. 5 per kg and 8 2 costs Rs. 8 per kg:Strength considerations
dictate that the brick should contain no more than 4 kg of8 and a minimum of2 kg
1
rn ofB,. Since the demand for the product is likely to be related to the price of the brick,
Bt::
rj:: find ~ut graphically the minimum cost of the brick satisfying the above conditions.
~~L !' (10 Marks)
!¥!~!'. Modulc-2
lfti:.£- •
illii'~l
3. a. What are the assumptions made in LPP?
(04 Marks)
-1·
b. Solve the following LPP using Big-M method.
Maximize Z = 3x 1 + 5x2
M!,
subject to x1 - 2x2 S 6
Jh\ ~
x1 S10
l
!l~)i
x, 2: I and
EH
x1 , x2 2: 0
!11 ( 12 Marks)
m [ill
na1m
I
I
i
....
~
OR
O~TIORS. RESEARCH M()D~ QuEsnoR PAPER& ..':~;~-~(;;L.-~:;-;i:!f:iT-
b. A company has a salesman who should visit 6 cities and the cost would be as given
below.
I~
4. a. Write the dual of the gi\'.en problem,
To city
MaximizeZ = 2x 1 + x2 •
I ~ubject to x, + 2x 2 :S I0 2 3 4 5 6
! x, + x2 ::; 6 OCJ 20 23 27 29 34
! x, + x2 ::; 2 2 21 19 26
OCJ 31 24
x1 - 2~ ::; I and
·. X , X2 ~ 0.
(04 Marks) I E 3
0
26 28 OCJ 15 36 26
1
U: 4 25 16 25 CQ 23 18
b. Use the two phase method to
Minimize Z = x, + x2 5 23 40 23 31 CQ 10
subject to 2x 1 + x2 ~ 4· 6 27 18 12 35 16 CQ
x, + 7x2 ~ 7 The salesman can visit each of the cities once and only once. Determine the optimum
;d x ,x ~0 (12 Marks)
1 2 sequence to minimize the total distance travelled. What is the total distance travelled?
.:i Module-3
I' (08 Marks)
.I:
5. a. Formulate the transportation problem as LPP. (06 Marks) Module-4
lji/
!Ii; b. A product is produced by four factories A, B C and D. The unit production costs in
!j: 7. The below table shows the jobs of a network along with their time estimates. The
:;l them are Rs. 2, Rs. 3, Rs. I and Rs. 5 respectively. Their production capacities are time estimates are in days:
:II A- 50 units; 8 - 70 units; C - 30 units; and D - 50 units. These factories supply the
JI Jobs I - 2 1-6 2-3 2-4 3-5 4-5 5-8 6-7 7-8
Wi product to four stores, demands of which are 25, 35, 105 and 20 units respectively.
11:::. a 3 2
ii; Unit transportation cost in Rupees from each factory to each store is given below. 6 2 5 3 I 3 4
il: l 2 3 4 m 6 5 12 5 11 6 4 9 19
~
~i
A 2 4 6 II
--- b 15 14
i) Draw the project network.
30 8 17 15 7 27 27
~1 B IO 8 7 5
~
ii) Find the critical path.
c 13 3 9 12 iii) Find the probability that the project is completed in 31 days. (16 Marks)
D 4 6 8 3
(~'· Determine the extent of deliveries from each fitl:~()I)' to each of the stores so that the
OR
~
Ji 8. a. Explain briefly the characteristics of a queuing system.
~
total production and transportation cost is minimum. ( 10 Marks) (06 Marks)
G~~
OR b. In a machine shop, the inter arrival times at the tool rib are exponential, with
'" ~ 6. a. ABC company has 5 tasks and 5 persons to perform. Determine the optimal an average time of I 0 minutes. The length of the service time is assumed to be
fImm llt assignment that minimizes the total cost. exponential with a mean of 6 minutes. Find
f:.f,1
Machines i) The probability that a person arriving at the booth will have to wait.
;~
Jobs ii) Average length of the queue.
l~
li
J, ~
A B c D E iii) The probability that an arrival will have to wait for more than 12 minutes for
Ll p 6 7 5 9 4 ~
service and to obtain his tools. (10 Marks)
L 7 5 10 9 6
i; Q
~
R 5 4 3 6 5
iJ
I'
If s 8 3 5 6 4
Iii; T 4 7 5 6 6
ii
1:.1,
(10 Marks)
f
I
.... Module-5
0PERATIOllS REsEARCH
9: a. For what value of A., the game with following pay-off matrix is strictly determinable?
Player B I. Hamdy A Taha, Operations Research, Ninth Edition, PEARSON.
.Player A B, B, - B, 2. Hillier, Lieberman, Nag and Basu, Introduction to Operations Research, Ninth
A,. A. 6 2 Edition, McGraw Hill Education Private Limited, New Delhi.
·;. A, -1 A. -7 3. Prem Kumar Gupta and Dr. D. S. Hira, Operations Research, Revised Edition, S.
A, -2 4 A. Chand & Company Private Limited, New Delhi.
(06 Marks)
4. J. K. Sharma, Operations Research, Fifth Edition,Macmillan Publishers India Ltd.
b. Solve the following (2 x 4) game graphically,
5. R. Panneersetvam, Operations Research, Second Edition, PHI Learning Private
8 Limited, New Delhi.
A I II III IV
6. A. M. Natarajan, P. Balasubramani and A. Tamilarasi, Operations Research,
1 2 2 3 -I Thirteenth Impression, 2013, PEARSON.
2 4 3 2 6
(10 Marks) 7. G. Srinivasan, Operations Research, Second Edition, PHI Leaming Private
Limited, New Delhi.
OR
10. a. Define: i) Idle time on a machine ii) Total'elapsed time (04 Marks)
b. Using graphical method., determine the minimum time needed to process the two
jobs ~n six machines. The information about the machine sequence and the time
required by each job is given below:
Job I
Order: A BIC D E F
Time (hr) 4 5 3 6 5
-"fob 2
Order: BI A IC F D E
Time (hr) 6 I 3 I 2 4 3 5
(12 Marks)
<a
""!;:
;J.!:
'l',.
ijl
!ii
Ill
ii7
H
,!l
·11
rm
II

Operations Research 8th &amp; 6th Sem Mechanical

Uploaded by

Document Information

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 8th &amp; 6th Sem Mechanical

Uploaded by

Copyright:

Available Formats

As·per the New Syllabus of VTU

Choice Based Credit System (CBCS)

The contents of the book are as follows:

.~! & h ... ' ;:.-:''-'"': c'.i.:~,'.;; :. · '"'."-~

?an.sporta!ion Problem: Formulation of transportation pro?le~, types, initial bas.ic f~asib~e

6.1 Elements/Structure/Characteristics of Queuing System

1.a.2,Use·of interdisciplinary teams 1I in the following fields.

1.4.8 In LIC 1.514 Deriving solution from the model

~'.', k) Analytic Models

!~ 4. The decision variables should be interrelated and non-negative. The non-negativity

consists of three basic elements.

PROBLEMS ON FORMULATION OF LPP

1 unit takes -+ 1 minute to process

The objective is to maximize the profit.

x5 + x1 + x~ + x3 + X 4 ~ 60 (Constraint on the number of doctors work on Thursday)

Step 3. Identify the constraints

Rate of processinii: units/week

(Constraint on minimum number of napkins required on day 1)

Let x be the number of units advertised by the Television,

2 3 2 1 2 x 1 units take ---+ 3x 1 hrs to process

2.6 OPl;~TIONS RESEARCH IS MORE THAN JUST MATHEMATICS

Use the graphical method to solve the following LP problem.

2.8.1 lso· profit (cost) ,function line method:

29> ___ Minimize Z =3x 1 + 2Xi

ll Plot the constraint I on the graph (i.e. line I)

I unit takes~ 3 hours I unit takes --> 2 hours

c (70,450) 12200 Step 1: Identify the decision variables

Step 3: Identify the constraints.

after extensive research, has determined that a maximum of 15 AM radio and x, = 15

The manufacturer of a line of patent medicines is preparing a production plan

OP£bno11s REsEARca WEAR PROGRAlllDJIG

10000 dryers produced-+ I month 7000 dryers produced -+ I month

Maximum free time available

2tx, + tis :S I OOOt

!~''"'""'"""""''"'"'""~ x, x , x 2: O; as the number of belts produced cannot be negative.

..Step I: Identify decision variables

Letx,-be-the number of Grade I inspectors assigned for inspection,

i: x,, ~;:: O; as the number of inspectors cannot be negative.

ff: GRAPHICA.t Mt:TMob . . .... ,

t..·.~ ;.(foN.c1.Qsfg·ftl$)).~\VfU=aoM:ifileioLU1'1()N OF LPP BY

Sol. The additional constraint is x 5 2y _

r; "'· I , l'.~:; ;·:·~, 'I

Fnl111 ~\·nstraint l'quatiuns,

:. (n - m) = (3 - J) =2 variables must be equal to zero 3. Objective function is of maximization type.

2.14 SIMPLEX ALGORITHM

iii) Construct simplex table

i.e. 4 is the key element. 80- ,Yix40=60 140 - 2 x 40 = 60

MaximizeZ=7x, +Sx, +Os, +Os, The new simplex table is written as

0 s, 12 [ -2 l4" 0 0 I 01 12/4 = 3 -+LY Jox%=4 3+(Jix4) ~ 5 I+(_% x4)·=11

%=0 1+0= I 0-(JxO)=O 0 -12/5 -115 -4/5 0

~:;:. The improved simplex table can be written as Maximize (-Z) = l I

.! r~: s, is the leaving variable .

2.15 TIE FOR ENTERING BA~HC V)UtJ~LE (l<EY COLUl\llN)

CB B ·"e . x, is is s, s2 SJ Minimum ratio

1-(_% xO)=l becomes the key row.

-~ -(Jj' x(-1))= lJ' subject to x 1 + 4x1 ::::; S

Key column Key Element Key row

-Yz =-I 1-1=0 Letx 1 =x 2 =s 1 =O;}Non-basicvariables

-Yi =-Yi 0-Yi=-Yi :.Minimize Z=3M+6M=9M

4 0 2 O· c.J -Z 4-7M l-4M M 0 0 0 I 0 0

1!,ti: MinZ=2M+4 z , 4 (SM+ 4)13 -M 0 M

:"!' I x 915 0 I 0 315 3

~·~· Min Z = 18/5 Z.-. 4 I 1/5 0

The improved solution is written in the table

Operations Research 8th & 6th Sem Mechanical

Operations Research 8th & 6th Sem Mechanical