LINEAR PROGRAMMING

OPTIMISATION
PROBLEMS
The problems which seek to
maximise (or,minimise)
Profit (or, cost)
from a general class of problems are
called

Optimisation problems.
 LINEAR PROGRAMMING
PROBLEM

Maximising or minimising the objective

Function ‘Z ‘ subject to certain conditions
determined by a set of linear inequalities
with variables as non-negative is called
Linear Programming problem
 Objective Function
• A linear function Z= ax + by where
a,b are constants which has to be
masimised or minimised is called a
linear objective function.
• The variables x,y are called decision
variables.
 Constraints
The linear inequalities or restrictions
on the variables of a linear
programming problem are called
constraints.
 EXAMPLE
• Linear Programming: Graphical Solution

• Solve the following LPP by graphical

method
• Maximize Z = 5x + 3y
• Subject to constraints
• 2x + y ≤ 1000
• x≤ 400
• y≤ 700
• x, y ≥ 0
• Solution:
• The first constraint 2x + y ≤ 1000 can
be represented as follows.
• We set 2x + y = 1000
• When x = 0 in the above constraint,
we get,
• 2 x 0 + y = 1000
• y = 1000
• Similarly when y = 0 in the above
constraint, we get,
• 2x + 0 = 1000
• x = 1000/2 = 500
• The second constraint X ≤ 400
can be represented as follows,
• We set X = 400
• The third constraint y ≤ 700 can
be represented as follows,
• We set y = 700
 The constraints are shown
plotted in the above figure.

Point X1 X2 Z = 5X1 +3X2

A 0 700 Z = 5 x 0 + 3 x 700 = 2,100

Z = 5 x 150 + 3 x 700 =
B 150 700 2,850* Maximum

Z = 5 x 400 + 3 x 200 =
C 400 200
2,600
D 400 0 Z = 5 x 400 + 3 x 0 = 2,000
• The Maximum profit is at point B

• When X1 = 150 and X2 = 700

• Z = 2850
EXAMPLE:
A manufacturing company makes two models A and
B of a product. Each piece of Model A requires 9
labour hours for fabricating and 1 labour hour for
finishing. Each piece of Model B requires 12 labour
hours for fabricating and 3 labour hours for
finishing. For fabricating and finishing the
maximum labour hours available are 180 and 30
respectively . The company makes a profit of Rs
8000 on each piece of model A and Rs 12000 on
each piece of Model B . How many pieces of Model
A and Model B should be manufactured per week to
realise a maximum profit? What is the maximum
profit per week?
Labour Constraints
Model A Model B
Time
available
for
fabricating 9 12 9x+12y ≤ 180
Total 180

for
finishing
1 3 x+3y ≤ 30
Total 30
 SOLUTION

Suppose x is the number of pieces of Model A and y is the number of

Pieces of Model B .

Then total profit in Rs. = 8000x+12000y

Z = 8000x+12000y --------------(1)

We now have the following mathematical model for the given problem.

Maximise Z = 8000x+12000y

Subject to the constraints: 9x+12y ≤ 180 (Fabricating constraint)

3x+4y ≤ 60-------------------------(2)

x+3y ≤ 30 -------------------------(3)

x ≤ 0, y ≤ 0 -------------------------(4)

The feasible region (shaded )OABC determined by the linear inequalities

 (0,15)

C(0,10)

B(12,6)

(30,0)

O
A

(20,0)
 CORNER POINT TABLE

Point x y Z = 8000x +12000y

O 0 0 0

A 20 0 160000

B 12 6 168000

C 0 10 120000
We find that maximum value of Z is 1,68,000 at B(12,6) .

Hence , the Company should produce 12 pieces of Model A and 6 pieces

of Model B to realise maximum profit and

maximum profit then will be Rs. 1,68,000.

Example:1

Suppose, a furniture dealer deals in only two items – tables and chairs. He has Rs.50, 000 to invest and has storage space to

accommodate 60 pieces. A table costs Rs.2500 and a chair cost Rs.500. The profits he gets on selling a table and a chair are 250 and 75

rupees respectively.

Tell me how many tables and chairs should he manufacture, so that

(i) He will not feel shortage of space

(ii) He will not feel shortage of his
investment and
(iii) How can he maximize his profit
subject to the limitations such as space
and investment?

On the basis of the data given in the example, let us fi rst prepare a table of contents and then

analyze what are we supposed to do.

No. of Tables to be manufactured x Units; (Positive Number)
No. of Chairs to be manufactured y Units (Positive Number)
Since he has the storage capacity Constraint No.1
of accommodating only 60 pieces
of furniture, so the sum of number x  y 60
of both tables and chairs should
not exceed 60.
According to Problem each table Total investment required is
costs him Rs.2500, while chair 2500x + 500y
costs Rs.500
Since he has the total amount to Constraint No.2
invest is RS.50,000 only so the
expenditure on purchasing both 2500 x  500 y 50000
tables and chairs should not
exceed his capacity of investment
According to data given, he has a P r o fi t F u n c t i o n ( O r )
profit on selling each table and a O b j e c t i v e Fu n c t i o n
chair as R s . 2 5 0 p e r t a b l e ,
R s . 5 0 p e r c h a i r. S o (maximize) P = 250x +
b a s e d o n t h i s p r o fi t 50y
margin, he should
 Formulation of a Linear Programming Problem

Objective Function:
P = 250x + 50y ( to be maximized)
Subject to constraints (Linear Inequations)

x 0;
y 0;
x  y 60 Constraint No.1

2500 x  500 y 50000

Constraint No.2

The process of changing a Word Problem of Linear Programming into an Algebraic Structure as shown above is called

Formulation of Linear Programming Problem

How to solve the above Linear Programming Algebraic structure to

maximize

the Objective Function

Step Take the Linear inequations as Equations and draw the
No.1 graph of all the inequations
Like what we did in Class XI Linear Inequations topic,
Step
in similar manner, Identify the Mesh region or Feasible
No.2
solution Set (See the graph in next slide)
For the feasible solution region you have got, there will
be corner points. (see the graph in next slide to note
that the CORNER POINTS are A ( 2 0 , 0 ) ; B ( 1 0 ,
Step 50) and C (0, 60). These points are in
No.3 C A L C U LU S C A L L E D “C R I T I C A L P O I N T S ” O R
“TURNING POINTS” where M a x i m u m o r
Minimum of t h e O b j e c t i v e Fu n c t i o n
take s p lac e
At the above said Corner Points, find the value of the
Step
objective function you have formulated as P = 250x +
No.4
50y
Of all the values you have got, chose the greatest and
Problem:
A furniture dealer deals in only two items - tables and chairs. He has Rs.50,000 to invest and has storage space of at most
60 pieces. A table costs Rs.2500 and a chair Rs.500. If he gets Rs.250 and Rs.75 as profits on the sale of a table and a chair
respectively. Find the number of tables and chairs he should manufacture so as to maximize his profit?
Formulate a LPP and use graphical method to do the problem.
 Feed back
• A dietician wishes to mix two types of foods in
such a way that vitamin contents of the mixture
contain atleast 8 units of vitamin A and 10 units
of vitamin C. Food I contains 2 units/kg of
vitamin A and 1unit/kg of vitamin C. Food II
contains 1 unit/kg of vitamin A and 2 units/kg of
vitamin C. It costs Rs.50 per kg to purchase food
I and Rs. 70 per kg to purchase food II.
Formulate this problem as a linear programming