Jinnah University for Women
Course Title: Optimization Theory
Course number: MAT-4082/608
Topic: Formulation of Linear Programming
Problems
(more examples)
Course Instructor: Ms Fareeha Rabbani
2
THE NATURE OF LINEAR PROGRAMMING PROBLEM
Two of the most common are:
1. The product-mix problem
2. The blending Problem
JUW,MsFareehaRabbani,MAT4082/608
3
1. In the product- mix problem there are two or more product also
called candidates or activities competing for limited resources. The
problem is to find out which products to include in production plan
and in what quantities these should be produced or sold in order to
maximize profit, market share or sales revenue.
2. The blending problem involves the determination of the best blend
of available ingredients to form a certain quantity of a product
under strict specifications. The best blend means the least cost
blend of the required inputs.
JUW,MsFareehaRabbani,MAT4082/608
4
EXAMPLE 1: PRODUCT MIX PROBLEM
A factory manufactures two products A and B. To manufacture one unit
of A, 1.5 machine hours and 2.5 labour hours are required. To
manufacture product B, 2.5 machine hours and 1.5 labour hours are
required. In a month, 300 machine hours and 240 labour hours are
available. Profit per unit for A is Rs. 50 and for B is Rs. 40. Formulate
as LPP.
JUW,MsFareehaRabbani,MAT4082/608
5
Solution
Products Resource / unit
Machine Labour
A 1.5 2.5
B 2.5 1.5
Availability 300 hrs 240 hrs
There will be two constraints. One for machine hours availability
and second for labour hours availability.
JUW,MsFareehaRabbani,MAT4082/608
6
Decision variables
X1 = Number of units of A manufactured per month
X2 = Number of units of B manufactured per month
The objective function:
Max Z = 50x1+ 40x2
Subject to the Constraints
For machine hours
1.5x1 + 2.5x2 ≤ 300
For labour hours
2.5x1 + 1.5x2 ≤ 240
Non negativity
x1, x2 ≥0
JUW,MsFareehaRabbani,MAT4082/608
7
EXAMPLE: 2 A company produces three products A, B, C. For
manufacturing three raw materials P, Q and R are used. Profit per unit
A - Rs. 5, B - Rs. 3, C - Rs. 4 Resource requirements/unit
Raw material P Q R
Product
A - 20 50
B 20 30 -
C 30 20 40
Maximum raw material availability:
P - 80 units; Q - 100 units; R - 150 units.
Formulate LPP.
JUW,MsFareehaRabbani,MAT4082/608
Solution:
8
Decision variables:
x1 = Number of units of A
x2 = Number of units of B
x3 = Number of units of C
Objective Function:
Since Profit per unit is given, objective function is maximization
Max Z = 5x1 + 3x2 + 4x3
Constraints:
For P: 20x2 + 30x3 ≤ 80
For Q: 20x1 + 30x2 + 20x3 ≤ 100
For R: 50x1 + 40x3 ≤ 150
x1, x2, x3 ≥ 0
JUW,MsFareehaRabbani,MAT4082/608
9
EXAMPLE 3: DIET PROBLEM
Vitamins B1 and B2 are found in two foods F1 and F2. 1 unit of F1
contains 3 units of B1 and 4 units of B2. 1 unit of F2 contains 5 units of B1
and 3 units of B2 respectively. Minimum daily prescribed consumption of
B1 & B2 is 30 and 40 units respectively. Cost per unit of F1 & F2 is Rs. 6
& Rs. 3 respectively. Formulate as LPP.
Solution:
Vitamins Foods Minimum
F1 F2 Consumption
B1 3 5 30
B2 5 7 40
JUW,MsFareehaRabbani,MAT4082/608
10
Decision Variables:
x1 = No. of units of F1 per day
x2 = No. of units of F2 per day
Objective function:
Min. Z = 100 x1 + 150 x2
Subject to constraints:
3x1+ 5x2 ≥ 30 (for B1)
5x1+ 7x2 ≥ 40 (for B2)
x1, x2 ≥ 0
JUW,MsFareehaRabbani,MAT4082/608
11
EXAMPLE 4: BLENDING PROBLEM
A manager at an oil company wants to find optimal mix of two
blending processes. Formulate LPP.
Data:
Process Input (Crude oil) Output (Gasoline)
Grade A Grade B X Y
P1 6 4 6 9
P2 5 6 5 5
Profit per operation: Process 1 (P1) = Rs. 4, 000 Process 2 (P2) = Rs.
5, 000 Maximum availability of crude oil: Grade A = 500 units Grade
B = 400 units Minimum Demand for Gasoline: X = 300 units Y = 200
units
JUW,MsFareehaRabbani,MAT4082/608
Solution:
12
Decision Variables:
x1 = No. of operations of P1
x1 = No. of operations of P2
Objective Function:
Max. Z = 4000 x1 + 5000 x2
Subjective to constraints:
6x1+ 5x2 ≤ 500
4x1+ 6x2 ≤ 400
6x1+ 5x2 ≥300
9x1+ 5x2 ≥200
x1, x2 ≥ 0JUW,MsFareehaRabbani,MAT4082/608
