OR Theory
OR Theory
Pre-World War II
No science has ever been born on a specific day. There is no exception for
OR also. Its roots are as old as science and society. Though the roots of OR
are extended to early 1800s, Charles Babbage (Father of OR) has done his
research into the cost of transportation and sorting of mail led to England’s
University Penny Post in 1840. In 1885 Ferderick W Taylor emphasised the
application of scientific analysis to the methods of production, that the real
star took place. Taylor conducted an experiment in connection with a simple
shovel. His aim was to find the weight load of the ore moved by shovel with
minimum fatigue. After many experiments with varying weights he obtained
optimum weight load.
Another man of early scientific management era was Henry L Gantt worked
on Job scheduling methods. A job for instance may be processed on a
machine without trouble but it might wait for days for acceptance by the
other machine. Gantt mapped each job from machine to machine in such a
way that it minimizes the delay.
World War II
OR in India
In India OR came into existence with the opening of OR unit in 1949 at the
Regional Research Laboratory in Hyderabad. At the same time another OR
unit was set up at the Defence Science Laboratory in New Delhi. An OR unit
was established under Prof P C Mahalonobis in Kolkata in 1953 to apply OR
method in national planning and survey. Operations Research Society of
India was formed in 1957 and its first conference was held in Delhi in 1959.
Some of Indian organizations using OR techniques are Indian Airlines,
Railways, Defence Organisations, Fertilizer Corporation of India, Hindustan
Steel ltd, Tata iron and steel, TELCO, BHEL, SAIL etc.
Definition
NECESSITY OF OR IN INDUSTRY
(ii) In Industry
In India we have five year planning for steady economic growth. Every state
government has to prepare plans for balanced growth of the state. Various
secretaries belonging to different departments has to co-ordinate and plan
for steady economic growth. For this all departments can use Operations
research techniques for planning purpose.
(iv) In Agriculture
The demand for food products is increasing day by day due to the increase
in population. But the land available for agriculture is limited. We must find
newer ways of increasing agriculture yield. So the selection of land area for
agriculture and the seed of food grains for sowing must be meticulously
done so that the farmer will not get loss and at the same time the users will
get what they desire at the desired time and desired cost.
Monte Carlo methods can be applied in the area of transport to regulate the
train arrivals and their running times.
(i) Iconic Models: These models are scaled version of the actual object. For
example a toy of a car is an iconic model of a real car. In your laboratory,
you might have seen Internal Combustion Engine models, Boiler models etc.
All these are iconic models of actual engine and boiler etc.
(ii) Analogue Model: In this model one set of properties are used to represent
another set of properties. Many times we represent various aspects on graph
by different colours or different lines all these are analog models.
(ii) Predictive model: These models basing on the data collected, can predict
the approximate results of the situation under question.
(iii) Normative models: If the predictions of these models are successful, then
it can be used conveniently to prescribe the courses of action to be taken. In
such case we call it as Normative or Prescriptive model.
(i) Static Models: These models assume that no changes in the values of
variables given in the problem for the given planning horizon due to any
change in the environment or conditions of the system. All the values given
are independent of the time.
(ii) Dynamic Models: In these models the values of given variables goes on
changing with time or change in environment or change in the conditions of
the given system.
(i) Mathematical Models: Mathematical models are the most abstract type
since it requires not only mathematical knowledge but also great
concentration to get the idea of the real life situation they represent.
Problem is represented by mathematical equations.
(ii) Language Models: Least abstract since they instantaneously suggest the
shape or characteristics of the modelled entity. Cricket commentary is the
example for language model.
(f) Classification by generality
(i) General models: The model that can be used in number of functions or
departments of an organization is called general model.
(ii) Specific models: Model that can be used in only one department like sales
response curve used in marketing is called specific model
Objective of OR
The industrial growth has brought with it the need for division of
management functions within the organisation. Thus every organisation has
number of departments in it. Every department is having its own policy
which is the part of the organisation. Finally the total cost or process
parameters of the organisation should be optimized.
With economic growth uncertainty is also growing. This makes each decision
costlier and time consuming. However in the competitive world today, one
has to take quick decisions because any delay may only help the
competitors. The decision has to be quick as well as sound. This requires a
rigorous and scientific approach to the problem.
Two business realities a manager has to face are change and uncertainty.
The market demand fluctuates, raw materials and spares become scarce,
production equipment fails or the change in government policies may affect
the company’s policy drastically. Under such situations past experience or
past data and future trends help the manager in taking decisions. OR can
help the managers here.
Limitations of OR Model
1. OR models does not take all influencing factors which are real in to
consideration
2. Mathematical models are applicable to only specific categories of
problems.
3. Considerations of all the factors and establishing the relation between
them requires large calculations.
4. Being a new field there is a resistance from the employees to the new
proposals.
5. Management also offer a lot of resistance due to convensional thinking.
LINEAR PROGRAMMING
INTRODUCTION
Any linear programming model (problem) must have the following properties:
Assumptions in LPP
Similarities
1. Both have objective function.
2. Both have linear objective function.
3. Both have non - negativity constraints.
4. Both can be solved by simplex method.
5. A general linear programming problem can be reduced to a
transportation problem if the coefficients of the structural variables in
the constraints are restricted to the values 0 or 1 and there exists
homogeneity of units among the constraints.
Differences
1. Transportation model is basically a minimization model; whereas
general linear programming model may be of maximization type or
minimization type.
2. The resources, for which, the structural constraints are built up is
homogeneous in transportation model; where as in general linear
programming model they are different.
3. The transportation problem is solved by transportation algorithm;
whereas the general linear programming problem is solved by simplex
method.
4. The values of structural coefficients are not restricted to any value in
general linear programming model, where as it is restricted to values
either 0 or 1 in transportation problem.
Similarities
1. Both are special types of linear programming problems.
2. Both have objective function, structural constraints, and non-
negativity constraints. And the relationship between variables and
constraints are linear.
3. The coefficients of variables in the solution will be either 1 or zero in
both cases.
4. Both are basically minimization problems. For converting them into
maximization problem same procedure is used.
SEQUENCING
Assumptions Made in Sequencing Problems
a. The processing times Ai and Bi etc. are exactly known to us and they
are independent of order of processing the job on the machine.
b. The time taken by the job from one machine to other after processing
on the previous machine is negligible.
c. Each job once started on the machine, we should not stop the
processing in the middle. It is to be processed completely before
loading the next job.
d. The job starts on the machine as soon as the job and the machine
both become idle.
e. No machine may process more than one job simultaneously.
f. The cost of keeping the semi-finished job in inventory when next
machine on which the job is to be processed is busy is assumed to be
same for all jobs or it is assumed that it is too small and is negligible.
g. While processing, no job is given priority i.e. the order of completion of
jobs has no significance.
h. There is only one machine of each type.
REPLACEMENT
Classification of Inventories
Inventories may be classified as those which play direct role during
manufacture or which can be identified on the product and the second one
are those which are required for manufacturing but not as a part of
production or cannot be identified on the product. The first type is labelled
as direct inventories and the second are labelled as indirect inventories.
Further classification of direct and indirect inventories is as follows:
(i) Rent for the building in which the stock is maintained if it is a rented
building. In case it is own building, depreciation cost of the building is taken
into consideration. Sometimes for own buildings, the nominal rent is
calculated depending on the local rate of rent and is taken into
consideration.
(ii) It includes the cost of equipment if any and cost of racks and any special
facilities used in the stores.
(iii) Interest on the money locked in the form of inventory or on the money
invested in purchasing the inventory.
(iv) The cost of stationery used for maintaining the inventory.
(v) The wages of personnel working in the stores.
(vi) Cost of depreciation, insurance.
(vii) Cost of deterioration due to evaporation, spoilage of material etc.
(viii) Cost of obsolescence due to change in requirement of material or
changed in process or change in design and item stored as a result of
becomes old stock and become useless.
(ix) Cost of theft and pilferage i.e. indenting for the material in excess of
requirement.
1. List out all items in stores along with their unit price and annual
consumption.
2. Calculate the annual consumption cost of each item, which is given by
multiplying the quantity consumed in the time period and the unit cost. If ‘q’
is the quantity consumed in the time period and ‘p’ is the unit price then
annual consumption value = q × p = qp.
3. Rearrange the list in the descending order of the annual consumption
cost. i.e. highest cost at the top and next highest is the second and so on
and the last item is the lowest consumption value item.
4. Calculate the cumulative total of annual consumption value.
5. Find the parentage of each cumulative value with respect to the total cost
of inventory.
6. Mark a line at 70%, 90% and at 100%. All the items covered by 70% line
are ‘A’ class items, those which are covered between 70% line and 90% line
are ‘B’ class items and those are covered by 90% and 100 % are ‘C’ class
items.
QUEUING THEORY
CUSTOMER BEHAVIOUR
The length of the queue or the waiting time of a customer or the idle time of
the service facility mostly depends on the behaviour of the customer. Here
the behaviour refers to the impatience of a customer during the stay in the
line. Customer behaviour can be classified as:
(i) Balking: This behaviour signifies that the customer does not like to
join the queue seeing the long length of it. This behaviour may
effect in losing a customer by the organization. Always a lengthy
queue indicates insufficient service facility and customer may not
turn out next time. For example, a customer who wants to go by
train to his destination goes to railway station and after seeing the
long queue in front of the ticket counter, may not like to join the
queue and seek other type of transport to reach his destination.
(ii) Reneging: In this case the customer joins the queue and after
waiting for certain time loses his patience and leaves the queue.
This behaviour of the customer may also cause loss of customer to
the organization.
(iii) Collusion: In this case several customers may collaborate and only
one of them may stand in the queue. One customer represents a
group of customer. Here the queue length may be small but service
time for an individual will be more. This may break the patience of
the other customers in the waiting line and situation may lead to
any type of worst episode.
(iv) Jockeying: If there are number of waiting lines depending on the
number of service stations, for example Petrol bunks, Cinema
theatres, etc. A customer in one of the queue after seeing the other
queue length, which is shorter, with a hope of getting the service,
may leave the present queue and join the shorter queue. Perhaps
the situation may be that other queue which is shorter may be
having more number of Collaborated customers. In such case the
probability of getting service to the customer who has changed the
queue may be very less. Because of this character of the customer,
the queue lengths may goes on changing from time to time.
GAME THEORY
Assumptions in game theory
Classification of Games
1. If all the elements of a column (say ith column) are greater than or equal
to the corresponding elements of any other column (say jth column), then
ith column is dominated by jth column.
2. If all the elements of rth row are less than or equal to the corresponding
elements of any other row, say sth row, then rth row is dominated by sth
row.
3. A pure strategy of a player may also be dominated if it is inferior to some
convex combinations of two or more pure strategies, as a particular case,
inferior to the averages of two or more pure strategies.
DYNAMIC PROGRAMMING
Principle of Optimality: Bellman’s Principle of optimality states that ‘‘An
optimal policy (a sequence of decisions) has the property that whatever the
initial state and decision are, the remaining decisions must constitute an
optimal policy with regard to the state resulting from the first decision.’’