EXAMPLES
LINEAR PROGRAMMING PROBLEM (LPP) FORMULATION
TABLE OF CONTENTS
EXAMPLES OF LPP (FORMULATION ).............................................................................. 2
EXAMPLE 1: ................................................................................................................. 2
EXAMPLE 2: ................................................................................................................. 4
EXAMPLE 3: ................................................................................................................. 5
EXAMPLE 4: ................................................................................................................. 5
1|Page
EXAMPLES OF LPP (FORMULATION )
Example 1: Consider a chocolate manufacturing company that produces only two types of
chocolates namely – A and B. Both the chocolates require Milk and Choco only. To manufacture
each unit of A and B, the following quantities are required:
Each unit of A requires 2 units of Milk and 3 units of Choco
Each unit of B requires 4 units of Milk and 2 units of Choco
The company kitchen has a total of 20 units of Milk and 12 units of Choco. On each sale, the
company makes a profit of
Rs 6 per unit A sold
Rs 5 per unit B sold.
Now, the company wishes to maximize its profit. How many units of A and B should it produce
respectively?
Solution: The first thing I’m gonna do is to represent the problem in a tabular form for better
understanding which however is an optional step to follow.
Milk Choco Profit Per Unit
A 2 3 6
B 4 2 5
Total 20 12
I. Formulation of Linear Programming Problem (LPP):
Step 1: Identify the decision variables
Let the total number of units produced of type A = X
Let the total number of units produced of type B = Y
Step 2: Write the objective function
Now, the total profit is represented by Z
The total profit the company makes is given by the total number of units of A and B
produced multiplied by their per-unit profit of Rs 6 and Rs 5 respectively.
Profit: Max Z = 6X + 5Y
which means we have to maximize Z.
So our objective function (given by Z) is, Max Z = 6X + 5Y
2|Page
Step 3: Writing the constraints
The company will try to produce as many units of A and B to maximize the profit. But the
resources Milk and Choco are available in a limited amount.
Constraint 1: As per the above table, each unit of A and B requires 2 units and 4 units of
Milk respectively. The total amount of Milk available is 20 units. To represent this
mathematically,
2X + 4Y ≤ 20
Constraint 2: Also, each unit of A and B requires 3 units & 2 units of Choco respectively. The
total amount of Choco available is 12 units. To represent this mathematically,
3X + 2Y ≤ 12
Constraint 3 (The non-negativity stipulation constraint):Also, the values for units of A and B
can only be integers.
So we have two more constraints, X ≥ 0 & Y ≥ 0
For the company to make maximum profit, the above inequalities have to be satisfied.
This is called formulating a real-world problem into a mathematical model.
So at the end of I (Step 1, Step 2, and step 3), following will be a more precise mathematical form
of the above LPP
Maximize Z = 6X + 5Y
Subject to:
2X + 4Y ≤ 20
3X + 2Y ≤ 12
X ≥ 0, Y ≥ 0
3|Page
Example 2: A toy manufacturing organization manufactures two types of toys A and B. Both the
toys are sold at Rs.25 and Rs.20 respectively. There are 2000 plastic-sheet units available every
day from which the toy A requires 20 units while toy B requires 12 units. Both of these toys
require a production time of 5 minutes. Total working hours are 9 hours a day. What should be
the manufacturing quantity for each of the toys to maximize the profits?
Solution: The first thing I’m going to do is to represent the problem in a tabular form for better
understanding which however is an optional step to follow.
Toys Plastic Production Time Profit Per Unit
A 20 5 25
B 12 5 20
Total 2000 540
II. Formulation of Linear Programming Problem (LPP):
Step 1: Identify the decision variables
Let the total number of units produced of toy type A = X
Let the total number of units produced of toy type B = Y
Step 2: Write the objective function
Now, the total profit is represented by Z
The total profit the company makes is given by the total number of units of A and B
produced multiplied by their per-unit profit of Rs 25 and Rs20 respectively.
Profit: Max Z = 25X + 20Y
which means we have to maximize Z.
So our objective function (given by Z) is, Max Z = 25X + 20Y
Step 3: Writing the constraints
The company will try to produce as many units of A and B to maximize the profit. But the
resources plastics sheets and required production time are available in a limited amount.
Constraint 1:As per the above table, each unit of A and B requires 20 units and 12 units of
plastic sheet units respectively. The total amount of plastic sheet material available is 2000
units. To represent this mathematically,
20X + 12Y ≤ 2000
4|Page
Constraint 2: Also, each unit of A and B requires 5 units of production time. The total
amount of production time in minutes available is 540 units. To represent this
mathematically,
5X + 5Y ≤ 540
Constraint 3 (The non-negativity restriction): Also, the values for units of A and B can only
be integers. So we have two more constraints, X ≥ 0 & Y ≥ 0
For the company to make maximum profit, the above inequalities have to be satisfied.
This is called formulating a real-world problem into a mathematical model.
So at the end of I (Step 1, Step 2, and step 3), following will be a more precise mathematical form
of the above LPP
Maximize Z = 25X + 20Y
Subject to:
20X + 12Y ≤ 2000
5X + 5Y ≤ 540
X ≥ 0, Y ≥ 0
Example 3: 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 an LPP.
Solution: Maximize Z = 50X1 + 40X2
Subject to
1.5X1 + 2.5X2 ≤ 300
2.5X1 + 1.5X2 ≤ 240
X1 ≥ 0 , X2 ≥ 0
Example 4:
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 of products A, B
and C are given in the following table as:
Maximum raw material availability: P - 80 units; Q - 100 units; R - 150 units. Formulate LPP
Solution: Max. Z = 5X + 3Y + 4Z
Subject to
0X + 20Y + 30Z ≤ 80
20X + 30Y+ 20Z ≤ 100
50X + 0Y + 40Z ≤150
5|Page
