Scribd
Upload
7 views

3-Module 1 - LPP - Product Mix Problem and Man Power Problem-04-01-2024

Uploaded by

happyhumanbeing420
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

3-Module 1 - LPP - Product Mix Problem and Man Power Problem-04-01-2024

Uploaded by

happyhumanbeing420
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

MEE1024 – OPERATIONS

RESEARCH
Prof. Raviteja Buddala
Department of Manufacturing Engineering
School of Mechanical Engineering
Vellore Institute of Technology, Vellore
632014
Product mix problem
Man power requirement
Production planning
Linear Programming Problems (L.P.P.)
It is a type of OR problem which is nothing but the process of determining the particular plan of the
action from among several alternatives. The term linear indicates that the all relations in the problem
are linear in nature.

General format of L.P.P.

Max. Z = a1x1 + a2x2 + a3x3 – objective function


Sub.to
a4x1 + a5x2 + a6x3 ≤ c1 Constraints
a7x1 + a8x2 + a9x3 ≤ c2
x1, x2, x3 ≥ 0 - Non -ve Constraints
x1, x2, x3 – Decision variables
Mathematical Formulation of LPP
1) A Company Manufactures two different types of products P1 & P2. Each product requires processing time
on milling machine & drilling machine. But each type of machine has limited hours available per week. The
net profit per unit of the products, resource requirement & availability of the resources are summarized as
given below. Develop a LPP model for the given problem.

P1 P2 M/C hrs. available/week

Milling machine 2 5 200

Drilling machine 4 2 240

Profit (Rs)/unit 250 400

Max. Z=250x1 + 400x2


Sub.to
2x1 + 5x2 ≤ 200
4x + 2x ≤ 240
1 2

x1, x2 ≥ 0
Linear Programming Problems:

2) Three grades of coal A, B, C contain ash and phosphorus as impurities. In a particular industrial
process a fuel obtained by blending the above grades of coal containing not more than 25% ash and 0.03
% phosphorus is required. The max. demand of the fuel is 100 tons. Percentage impurities and costs of
the various grades of coal are shown below. Assuming that there is an unlimited supply of each grade of
coal and there is no loss in blending. Formulate the blending problem to minimise the cost.

Coal grade % ash % Phosphorus Cost per ton in Rs.

A 30 0.02 240
B 20 0.04 300
C 35 0.03 280
Sol.
Dec. variables x1 = tons of grade A coal
x2 = tons of grade B coal
3 = tons of grade C coal
Obj. fun : Min. Z = 240x1 + 300x2 + 280x3
Const. : 0.3x1 + 0.2x2 + 0.35x3 ≤ 0.25 ( x1 + x2 + x3)
0.04 0.04 0.03
0.02 x3 ≤ (x1 + x2 + x3)
x2 +
x1 + 100
100 100 100

x1 + x2 + x3 ≤ 100

Non. -ve const. : x1 , x2 , x3 ≥ 0


3) A firm manufactures 3 products A, B and C . The profits are Rs. 3, Rs. 2 and Rs. 4 respectively. The firm has 2
M/C’s and below is the given the req. processing time in min. for each M/C on each product.

Products
M/C A B C
C 4 3 5
D 2 2 4

M/C’s C & D have 2,000 and 2,500 machine - minutes respectively. The firm must manufacture 100 A’s, 200
B’s and 50 C’s but not more than 150 A’s

Set-up a LPP to maximize the profit


Sol.

Dec. variables : x1 = No. of product A


x2 = No. of product B
x3 = No. of product C

Obj. fun. : Max. Z = 3x1 + 2x2 + 4x3


Constrai. : 4x1 + 3x2 + 5x3 ≤ 2, 000
2x1 + 2x2 + 4x3 ≤ 2, 500
Non. -ve const. : x2 ≥ 200,
x3 ≥ 50,
100 ≥ x1 ≤ 150

You might also like