ME 4051
Operation Research
Credit hour: 3.00
Linear Programming
Arup Kumar Debnath
Assistant Professor
Department of Mechanical Engineering,
Khulna University of Engineering &
Technology
Mechanical Engineering
1
Linear Programming
What is Linear Programming
• A model consisting of linear relationships representing
a firm’s objective and resource constraints
• LP is a mathematical modeling technique used to
determine a level of operational activity to achieve an
objective, subject to restrictions called constraints
• LP is a mathematical technique that finds the optimum
solution from a large number of possible decisions.
• The process of relating variables, constraints, and
objective functions is called mathematical technique.
2
Linear Programming
Formulation of Linear Programming
• The maximization or minimization of some
quantity is the objective in all linear
programming problems.
• All LP problems have constraints that limit
the degree to which the objective can be
pursued.
• A feasible solution satisfies all the problem's
constraints.
• An optimal solution is a feasible solution that
results in the largest possible objective
function value when maximizing (or smallest
when minimizing).
• A graphical solution method can be used to
solve a linear program with two variables. 3
Linear Programming
Characteristics of Linear Programming
• At least one objective function
• Resource constraints (Non-Negative constraints)
• All are linear function
• All variables are non-negative
• The objective function may be the maximization or minimization
4
Linear Programming
1. A company manufactures two types of products A1 and A2, each product uses
milling and drilling machines. The process time per unit of A1 on the milling
machine is 10hrs and on the drilling machine is 8hrs. The process time per unit of
A2 on the milling machine is 20hrs and on the drilling machine is 8hrs. The
maximum number of hours available per week on the milling and drilling machine
are 120 hrs and 80 hrs respectively. Also, the profit per unit of selling A 1 and A2
are 25 tk and 35 tk respectively. You are required to;
i. Formulate an LP model from the above information
ii. Determine the maximized profit using a graphical method
iii. Interpret the result
Linear Programming
A company manufactures two types of products A1 and A2, each product uses
milling and drilling machines. The process time per unit of A1 on the milling
machine is 10hrs and on the drilling machine is 8hrs. The process time per unit of
A2 on the milling machine is 20hrs and on the drilling machine is 8hrs. The
maximum number of hours available per week on the milling and drilling machine
are 120 hrs and 80 hrs respectively. Also, the profit per unit of selling A 1 and A2
are 25 tk and 35 tk respectively.
Machine Machine hours / unit Limit on
Product A1 Product A2 machine
hours
Milling Machine 10 120 120
Drilling Machine 8 80 80
Profit / unit 25 35
Linear Programming
A company manufactures two types of products A1 and A2, each product uses
milling and drilling machines. The process time per unit of A1 on the milling
machine is 10hrs and on the drilling machine is 8hrs. The process time per unit of
A2 on the milling machine is 20hrs and on the drilling machine is 8hrs. The
maximum number of hours available per week on the milling and drilling machine
are 120 hrs and 80 hrs respectively. Also, the profit per unit of selling A 1 and A2
are 25 tk and 35 tk respectively.
The objective is to maximize the total profit, which is the sum of the profits from
products A1 and A2. The profit per unit of A1 is 25, and the profit per unit of A2 is
35.
10 x1Z
Maximize
Milling Machine Constraints +=
120
25 x12+
≤35120
x2
Drilling Machine Constraints 8 x1+80 x2 ≤ 80
x1≥ 0, x2≥ 0
Linear Programming
2. A nutrition scheme for babies is proposed by a committee of doctors. Babies can
be given two types of food (I and II) which are available in standard-sized packets,
weighing 50 gms. The cost per packet of these foods is 2 and 3 respectively. The
vitamin availability in each type of food per packet and the minimum vitamin
requirement for each type of vitamin are summarized in the table given.
Linear Programming
The objective is to Minimize the total cost, which is the sum of the costs from
food Type 1 and type 2.
Minimize Z = 2 x1+3 x2
Vitamin I Constraints x1+ x2≥ 6
Vitamin II Constraints 7x1+ x2 ≤ 14
x1≥ 0, x2≥ 0
Graphical Method
Linear Programming
A company manufactures two types of products A1 and A2, each product uses
milling and drilling machines. The process time per unit of A1 on the milling
machine is 10hrs and on the drilling machine is 8hrs. The process time per unit of
A2 on the milling machine is 20hrs and on the drilling machine is 8hrs. The
maximum number of hours available per week on the milling and drilling machine
are 120 hrs and 80 hrs respectively. Also, the profit per unit of selling A 1 and A2
are 25 tk and 35 tk respectively.
Machine Machine hours / unit Limit on
Product A1 Product A2 machine
hours
Milling Machine 10 120 120
Drilling Machine 8 80 80
Profit / unit 25 35
Linear Programming
Machine Machine hours / unit Limit on
Product A1 Product A2 machine
hours
Milling Machine 10 120 120
Drilling Machine 8 80 80
Profit / unit 25 35
Maximize Z = 25 x1+35 x2
Milling Machine Constraints 10 x1+120 x2≤ 120
Drilling Machine Constraints 8 x1+80 x2 ≤ 80
x1≥ 0, x2≥ 0
Linear Programming
2. A nutrition scheme for babies is proposed by a committee of doctors. Babies can
be given two types of food (I and II) which are available in standard-sized packets,
weighing 50 gms. The cost per packet of these foods is 2 and 3 respectively. The
vitamin availability in each type of food per packet and the minimum vitamin
requirement for each type of vitamin are summarized in the table given.
Minimize Z = 2 x1+3 x2
Vitamin I x1+ x2≥ 6
Constraints
Vitamin II 7x1+ x2 ≤ 14
Constraints
x1≥ 0, x2≥ 0
Thank you
14
