Module 1 - Introduction To or
Module 1 - Introduction To or
OR
Faculty: Radha.R
Assistant Professor (Sr.)
School of Mechanical and Building Sciences
VIT University, Chennai
Books for Reference
Operations Research An Introduction :
Hamdy Taha (PHI)
Operations Research :
P.K.Gupta, S.Hira(S.Chand)
Introduction
Origin of OR
Characteristics of OR
Applications of OR
OR approach
Solve
the
model
Modify
the Model
Testing the
Implementation Model and
and Controls its
Solutions
Advantages of OR
Effective decisions
Better coordination :
Facilitates control
Improves productivity
Limitations of OR
Magnitude of computation.
Non quantifiable factors.
Distance between user and analyst.
Time and Money cost.
Implementation
Modeling with Linear Programming
Steps in formulating Linear Programming
(LP) Models
1. Understand the problem.
2. Identify the decision variables
3. State the objective function as a linear
combination of the decision variables.
4. State the constraints as linear combinations
of the decision variables.
5. State the non negativity constraints.
LP Model Formulation: Maximization problem
Product mix problem
Example 1 : Beaver Creek Pottery Company
Labour Clay
hrs/unit Lbs/unit
Bowl 1 4 40
Mug 2 3 50
Limit on 40 120
resources
Terminology used in LP
Mathematical Formulation
Resource 40 hrs of labor per day
Availability: 120 lbs of clay
Decision x1 = number of bowls to produce per day
Variables: x2 = number of mugs to produce per day
Objective Maximize Z = 40x1 + 50x2
Function: Where Z = profit per day
Resource 1x1 + 2x2 40 hours of labor
Constraints: 4x1 + 3x2 120 pounds of clay
Non-Negativity x1 0; x2 0
Constraints:
Example 2 : Manufacturing Company
Lathe Milling
Machine
P1 5 4 6
P2 10 4 8
Limit on 60 40
Machine hours
LP Mathematical formulation
Subject to
5X1+ 10X2 60
4X1 + 4X2 40
X1 , X2 0
Example 3 : Nutrition Scheme
Cost/Packet 2 3
(Rs)
LP Mathematical formulation
Subject to
X1+ X2 6
7X1 + X2 14
X1 , X2 0
Example 4 : Manufacturing Company
P1 P2 P3
I 3 5 2 1000
II 4 - 3 700
III 4 3 2 1300
Cost/Produ 50 70 60
ct (Rs)
LP Mathematical formulation
X1,X2 and X3 be the production volumes of the products
P1, P2 and P3, respectively. Let X2/2 be the production
volume of the by-product from the product P2.
Maximize Z= 50X1 + 70X2 + 60X3 + 20X2/2 where X1 and
X2 are decision variables
Subject to
3X1+ 5X2 + 2X3 1000
4X1 + 3X3 700
4X1+ 3X2 + 2X3 1300
X1 500
X2/2 200
X 1 , X2 , X 3 0
Example 5 : Postal Department
The Postal department is considering the purchase of
vehicles to pick up and deliver mail from various
offices. They are considering three types of vehicles.
The cost of each vehicles are Rs 5 lakhs, Rs. 10 lakhs
and Rs. 8 lakhs respectively. These require a crew of
2, 4 and 4 persons per day considering multiple shifts.
They expect these to run for 60,100 and 80 km per
day and the total distance to be covered by the
vehicles per day would be 2000 km. Based on the fuel
economy, the operating cost per day for these
vehicles are Rs.200, Rs.350 and Rs.300 per day. They
have a budget restriction of Rs. 1.6 crore and have 80
people available as crew. Formulate a LP model to
minimize the operating costs.
LP Model Formulation
Table 5
Vehicles Resources Operating
cost in Rs
Subject to
5X1+ 10X2 + 8X3 1000
2X1+ 4X2 + 4X3 80
60X1+ 100X2 + 80X3 2000
X1 , X2, X3 0