Beruflich Dokumente
Kultur Dokumente
Text Book:
Operations Research: An Introduction
By Hamdy A.Taha (Pearson Education)
th
7 Edition
Reference Books:
1. Hadley, G: Linear Programming,
Addison Wesley
2. Pant, J.C: Optimization,
Jain Brothers
3. Hillier & Lieberman
Introduction to Operations
Research, Tata McGraw-Hill
4. Bazaraa, Jarvis & Sherali
Linear Programming and Network
Flows, John Wiley
You may view my lecture slides in the
following site.
http://discovery.bits-
pilani.ac.in/discipline/math/msr/index.
html
The formal activities of Operations Research
(OR) were initiated in England during World
War II when a team of British scientists set
out to make decisions regarding the best
utilization of war material. Following the
end of the war, the ideas advanced in
military operations were adapted to improve
efficiency and productivity in the civilian
sector. Today, OR is a dominant and
indispensable decision making tool.
Example: The Burroughs garment
company manufactures men's shirts
and women’s blouses for Walmark
Discount stores. Walmark will accept
all the production supplied by
Burroughs. The production process
includes cutting, sewing and
packaging. Burroughs employs 25
workers in the cutting department, 35
in the sewing department and 5 in the
packaging department. The factory works
one 8-hour shift, 5 days a week. The
following table gives the time
requirements and the profits per unit for
the two garments:
Minutes per unit
Garment Cutting Sewing Packaging Unit
profit($)
Shirts 20 70 12 8.00
Blouses 60 60 4 12.00
Pattern II 20
10
20 10
Pattern III 10
20
Pattern I: cut into 10 pieces of size 10 by 10
so as to make 10 tops of size 1
Pattern II: cut into 2 pieces of size 20 by 20
and 2 pieces of size 10 by 10 so as to make
2 tops of size 2 and 2 tops of size 1
Pattern III: cut into 1 piece of size 20 by 20
and 6 pieces of size 10 by 10 so as to make
1 top of size 2 and 6 tops of size 1
So assume that x1 sheets are cut according to
pattern I, x2 according to pattern II, x3
according to pattern III
The problem is to
Minimize z = x1 + x2 + x3
Subject to 10 x1 + 2 x2 + 6 x3 ≥ 20,000
2 x2 + x3 ≥ 15,000
x1, x2, x3 ≥ 0, integers
A Post Office requires different number of
full-time employees on different days of the
week. The number of employees required on
each day is given in the table below. Union
rules say that each full-time employee must
receive two days off after working for five
consecutive days. The Post Office wants to
meet its requirements using only full-time
employees. Formulate the above problem as
a LPP so as to minimize the number of full-
time employees hired.
Requirements of full-time employees
day-wise
Day No. of full-time
employees required
1 - Monday 10
2 - Tuesday 6
3 - Wednesday 8
4 - Thursday 12
5 - Friday 7
6 - Saturday 9
7 - Sunday 4
Solution: Let xi be the number of full-time
employees employed at the beginning of day
i (i = 1, 2, …, 7). Thus our problem is to find
xi so as to
Minimize z x1 x2 x3 x4 x5 x6 x7
Subject to
x1 x4 x5 x6 x7 10 (Mon)
x1 x2 x5 x6 x7 6 (Tue)
x1 x2 x3 x6 x7 8 (Wed)
x1 x2 x3 x4 x7 12 (Thu)
x1 x2 x3 x4 x5 7 (Fri) xi 0.
x2 x3 x4 x5 x6 9 (Sat) integers
x3 x4 x5 x6 x7 4 (Sun)
BITS wants to host a Seminar for five
days. For the delegates there is an
arrangement of dinner every day. The
requirement of napkins during the 5
days is as follows:
Day 1 2 3 4 5