Linear Programming

MODULE - X
37 Linear Programming
and Mathematical
Reasoning

LINEAR PROGRAMMING Notes

37.1 INTRODUTION TO LINEAR PROGRAMMING PROBLEMS

A toy dealer goes to the wholesale market with Rs. 1500.00 to purchase toys for selling. In the
market there are various types of toys available. From quality point of view, he finds that the toy
of type ‘A’ and type ‘B’ are suitable. The cost price of type ‘A’ toy is Rs. 300 each and that of
type ‘B’ is Rs. 250 each. He knows that the type ‘A’ toy can be sold for Rs. 325 each, while
the type ‘B’ toy can be sold for Rs. 265 each. Within the amount available to him he would like
to make maximum profit. His problem is to find out how many type ‘A’ and type ‘B’ toys
should be purchased so to get the maximum profit.
He can prepare the following table taking into account all possible combinations of type ‘A’ and
type ‘B’ toys subject to the limitation on the investment.

‘A’ type ‘B’ type Investment Amount after sale Profit on the
(including investment
the unutilised
amount if any)
0 6 1500.00 1590.00 90.00
1 4 1300.00 1585.00 85.00
2 3 1350.00 1595.00 95.00
3 2 1400.00 1605.00 105.00
4 1 1450.00 1615.00 115.00
5 0 1500.00 1625.00 125.00

Now, the decision leading to maximum profit is clear. Five type A toys should be purchased.
The above problem was easy to handle because the choice was limited to two types, and the
number of items to be purchased was small. Here, all possible combinations were thought of
and the corresponding gain calculated. But one must make sure that he has taken all possibilities
into account.
A situation faced by a retailer of radio sets similar to the one given above is described below.
A retailer of radio sets wishes to buy a number of transistor radio sets from the wholesaler.
There are two types (type A and type B) of radio sets which he can buy. Type A costs Rs.360
each and type B costs Rs. 240 each. The retailer can invest up to Rs. 5760. By selling the radio
sets, he can make a profit of Rs. 50 on each set of type A and of Rs. 40 on each set of type B.
How many of each type should he buy to maximize his total profit?
MATHEMATICS 521
 Linear Programming
MODULE - X Here we have to maximize the profit. Sometimes we come across a problem in which the costs
Linear Programming
and Mathematical
are to be minimized. Consider the following problem :
Reasoning
Two tailors A and B earn Rs.150 and Rs.200 per day respectively. A can stitch 6 shirts and 4
pants per day, while B can stitch 4 shirts and 7 pants per day. How many days shall each work
if they want to produce at least 60 shirts and 72 pants at a minimum labour cost?
Notes In this problem we have to minimise the labour cost.
These types of problems of maximisation and minimisation are called optimisation problems.
The technique followed by mathematicians to solve such problems is called ‘Linear
Programming’.

OBJECTIVES

After studying this lesson, you will be able to :

l undertstand the terminology used in linear programming;
l convert different type of problems into a linear programming problem;
l use graphical mehtod to find solution of the linear programming problems
EXPECTED BACKGROUND KNOWLEDGE
l good idea of converting a mathematical information into a in equality
l to be able to solve system of on equalities using graphical method.
37.2 DEFINITIONS OF VARIOUS TERMS INVOLVED IN
LINEAR PROGRAMMING
A close examination of the examples cited in the introduction points out one basic property that
all these problems have in common, i.e., in each example, we were concerned with maximising
or minimising some quantity.
In first two examples, we wanted to maximise the return on the investment. In third example,
we wanted to minimise the labour cost. In linear programming terminology the maximization or
minimization of a quantity is referred to as the objective of the problem.
37.2.1 OBJECTIVE FUNCTION
In a linear programming problem. z, the linear function of the variables which is to be optimized
is called objective function.
Here, a linear form means a mathematical expression of the type

a1 x1  a2 x2  .....  an xn ,

where a1 , a2, ....., an are constants and x1 , x2, ....., xn are variables.

In linear programming problems, the products, services, projects etc. that are competing with

522 MATHEMATICS
 Linear Programming
each other for sharing the given limited resources are called the variables or decision variables. MODULE - X
Linear Programming
37.2.2 CONSTRAINTS and Mathematical
Reasoning
The limitations on resources (like cash in hand, production capacity, man power, time, machines,
etc.) which are to be allocated among various competing variables are in the form of linear
equations or inequations (inequalities) and are called constraints or restrictions.
37.2.3 NON-NEGATIVE RESTRICTIONS Notes

All decision variables must assume non-negative values, as negative values of physical quantities
is an impossible situation.

37.3 FORMULATION OF A LINEAR PROGRAMMING PROBLEM

The formulation of a linear programming problem as a mathematical model involves the following
key steps.
Step 1 : Identify the decision variables to be determined and express them in terms of algebraic
symbols such as x1, x2, x3, ..........

Step 2 : Identify all the limitations in the given problem and then express them as linear equations
or inequalities in terms of above defined decision variables.
Step 3 : Identify the objective which is to be optimised (maximised or minimised) and express
it as a linear function of the above defined decision variables.

Example 37.1 A retailer wishes to buy a number of transistor radio sets of types A and B.
Type A cost Rs.360 each and type B cost Rs. 240 each. The retailer knows that he cannot sell
more than 20 sets, so he does not want to buy more than 20 sets and he cannot afford to pay
more than Rs.5760. His expectation is that he would get a profit of Rs.50 for each set of type
A and Rs.40 for each set of type B. Form a mathematical model to find how many of each type
should be purchased in order to make his total profit as large as possible?

Solution : Suppose the retailer purchases x1 sets of type A and x2 sets of type B. Since the
number of sets of each type is non-negative, so we have

x1  0,  (1)

x2  0,  (2)

Also the cost of x1 sets of type A and x2 sets of type B is 360 x1 + 240 x2 and it should be
equal to or less than Rs.5760, that is,

360 x1  240 x2  5760

or 3x1  2 x2  48  (3)
Further, the number of sets of both types should not exceed 20, so
MATHEMATICS 523
 Linear Programming
MODULE - X
Linear Programming
x1  x2  20  (4)
and Mathematical
Reasoning Since the total profit consists of profit derived from selling the x1 type A sets and x2 type B
sets, therefore, the retailer earns a profit of Rs.50 x1 on type A sets and Rs.40 x2 on type B
sets. So the total profit is given by :
Notes
z  50 x1  40 x2  (5)
Hence, the mathematical formulation of the given linear programming problem is as follows :

Find x1, x2 which

Maximise z = 50 x1  40 x2 (Objective function) subject to the conditions

3x1  2 x2  48

x1  x2  20 
Constraints
x1  0, x2  0 

Example 37.2 A soft drink company has two bottling plants, one located at P and the other
at Q. Each plant produ ces three different soft drinks A, B, and C. The capacities of the two
plants in terms of number of bottles per day, are as follows :
Plants
Products P Q
A 3000 1000
B 1000 1000
C 2000 6000

A market survey indicates that during the month of May, there will be a demand for 24000
bottles of A, 16000 bottles of B and 48000 bottles of C. The operating cost per day of running
plants P and Q are respectively Rs.6000 and Rs.4000. How many days should the firm run
each plant in the month of May so that the production cost is minimised while still meeting the
market demand.

Solution : Suppose that the firm runs the plant P for x1 days and plant Q for x2 days in the
month of May in order to meet the market demand.

The per day operating cost of plant P is Rs.6000. Therefore, for x1 days the operating cost
will be Rs.6000 x1 .

The per day operating cost of plant Q is Rs.4000. Therefore, for x2 days the operating cost
will be Rs.4000 x2 .

524 MATHEMATICS
 Linear Programming

Thus the total operating cost of two plants is given by : MODULE - X

Linear Programming
and Mathematical
z  6000 x1  4000 x2  (1) Reasoning

Plant P produces 3000 bottles of soft drink A per day. Therefore, in x1 days plant P will
produce 3000 x1 bottles of soft drink A.
Notes
Plant Q produces 1000 bottles of soft drink A per day.

Therefore, in x2 days plant Q will produce 1000 x2 bottles of soft drink A.

Total production of soft drink A in the supposed period is 3000 x1 + 1000 x2

But there will be a demand for 24000 bottles of this soft drink, so the total production of this
soft drink must be greater than or equal to this demand.

 3000 x1  1000 x2  24000

or 3x1  x2  24  (2)
Similarly, for the other two soft drinks, we have the constraints

1000 x1 1000 x2 16000

or x1  x2  16  (3)
and

2000 x1  6000 x2  48000

or x1  3x2  24  (4)

x1 and x2 are non-negative being the number of days, so

x1  0, x2  0  (5)

Thus our problem is to find x1 and x2 which

Minimize z  6000 x1  4000 x2 (objective function)

subject to the conditions

3 x1  x2  24 

x1  x2  16 
(constraints)
x1  3x2  24 

and x1  0, x2  0

MATHEMATICS 525
 Linear Programming
MODULE - X Example 37.3 A firm manufactures two types of products A and B and sells them at a profit
Linear Programming
and Mathematicalof Rs.2 on type A and Rs.3 on type B. Each product is processed on two machines G and H.
Reasoning
Type A requires one minute of processing time on G and 2 minutes on H, type B requires one
minute on G and one minute on H. The machine G is available for not more than 6 hours and 40
minutes while machine H is available for 10 hours during one working day. Formulate the
Notes problem as a linear programming problem so as to maximise profit.

Solution : Let x1 be the number of products of type A and x2 be the number of products of
type B.
The given information in the problem can systematically be arranged in the form of following
table :

Machine Processing time of the products Available time

(in minute) (in minute)

Type A ( x1 units) Type B ( x2 units)

G 1 1 400
H 2 1 600
Profit per unit Rs.2 Rs.3

Since the profit on type A is Rs.2 per product, so the profit on selling x1 units of type A will be
2x1. Similarly, the profit on selling x2 units of type B will be 3x2. Therefore, total profit on
selling x1 units of type A and x2 units of type B is given by

z  2 x1  3 x2 (objective function)  (1)

Since machine G takes 1 minute time on type A and 1 minute time on type B, therefore, the total
number of minutes required on machine G is given by

x1  x2

But the machine G is not available for more than 6 hours and 40 minutes (i.e., 400 minutes).
Therefore,
x1  x2  400  (2)
Similarly, the total number of minutes required on machine H is given by
2x1  x2
Also, the machine H is available for 10 hours (i.e., 600 minutes). Therefore,
2 x1  x2  600  (3)

526 MATHEMATICS
 Linear Programming
Since, it is not possible to produce negative quantities, so MODULE - X
Linear Programming
and Mathematical
x1  0, x2  0  (4) Reasoning

Thus, the problem is to find x1 and x2 which

Maximize z  2 x1  3x2 (objective function)

Notes
subject to the conditions

x1  x2  400
2 x1  x2  600
x1  0, x2  0

Example 37.4 A furniture manufacturer makes two types of sofas – sofa of type A and sofa
of type B. For simplicity, divide the production process into three distinct operations, say
carpentary, finishing and upholstery. The amount of labour required for each operation varies.
Manufacture of a sofa of type A requires 6 hours of carpentary, 1 hour of finishing and 2 hours
of upholstery. Manufacture of a sofa of type B requires 3 hours of carpentary, 1 hour of finishing
and 6 hours of upholstery. Owing to limited availability of skilled labour as well as of tools and
equipment, the factory has available each day 96 man hours of carpentary, 18 man hours for
finishing and 72 man hours for upholstery. The profit per sofa of type A is Rs.80 and the profit
per sofa of type B is Rs. 70. How many sofas of type A and type B should be produced each
day in order to maximise the profit? Formulate the problems as linear programming problem.
Solution : The different operations and the availability of man hours for each operation can be
put in the following tabular form :

Operations Sofa of type A Sofa of type B Available labour

Carpentary 6 hours 3 hours 96 man hours
Finishing 1 hour 1 hour 18 man hours
Upholstery 2 hours 6 hours 72 man hours
Profit Rs. 80 Rs. 70

Let x1 be the number of sofas of type A and x2 be the number of sofas of type B.

Each row of the chart gives one restriction. The first row says that the amount of carpentary
required is 6 hours for each sofa of type A and 3 hours for each sofa of type B. Further, only 96
man hours of carpentary are available per day. We can compute the total number of man hours
of carpentary required per day to produce x1 sofas of type A and x2 sofas of type B as follows:

Number of man - hours per day of carpentary

= { (Number of hours carpentary per sofa of type A)  (Number
MATHEMATICS 527
 Linear Programming
MODULE - X of sofas of type A) }
Linear Programming
and Mathematical
Reasoning + { (Number of hours carpentary per sofa of type B) 
(Number of sofas of type B) }

 6 x1  3x2
Notes
The requirement that at most 96 man hours of carpentary per day means

6 x1  3 x2  96

or 2x1 + x2 < 32  (1)

Similarly, second and third row of the chart give the restrictions on finishing and upholstery
respectively as
x1 + x2 < 18  (2)
and

2 x1  6 x2  72

or x1 + 3x2 < 36  (3)

Since, the number of the sofas cannot be negative, therefore
x1 > 0, x2 > 0  (4)
Now, the profit comes from two sources, that is, sofas of type A and sofas of type B. Therefore,
Profit = (Profit from sofas of type A) + (Profit from sofas of type B)
= { (Profit per sofa of type A)  (Number of sofas of type A) }
+ { (Profit per sofa of type B)  (Number of sofas of type B) }

z  80 x1  70 x2 (objective function)  (5)

Thus, the problem is to find x1 and x2 which

Maximize z = 80 x1 + 70 x2 (objective function)

subject to the constraints

2 x1  x2  32 
x1  x2  18 

x1  3x2  36  (Constraints)
x1  0, x2  0 

528 MATHEMATICS
 Linear Programming
MODULE - X
Linear Programming
CHECK YOUR PROGRESS 37.1 and Mathematical
Reasoning
1. A company is producing two products A and B. Each product is processed on two
machines G and H. Type A requires 3 hours of processing time on G and 4 hours on
H; type B requires 4 hours of processing time time on G and 5 hours on H. The available
time is 18 hours and 21 hours for operations on G and H respectively. The products A Notes
and B can be sold at the profit of Rs. 3 and Rs. 8 per unit respectively. Formulate the
problem as a linear programming problem.
2. A furnit ure dealer deals in o nly two items, t ables and chairs. He has
Rs. 5000 to invest and a space to store at most 60 pieces. A table costs him Rs. 250 and
a chair Rs. 50. He can sell a table at a profit of Rs. 50 and a chair at a profit of Rs. 15.
Assuming, he can sell all the items that he buys, how should he invest his money in order
that may maximize his profit? Formulate a linear programming problem.
3. A dairy has its two plants one located at P and the other at Q. Each plant produces two
types of products A and B in 1 kg packets. The capacity of two plants in number of
packets per day are as follows:
Plants
Products P Q
A 2000 1500
B 4000 6000

A market survey indicates that during the month of April, there will be a demand for
20000 packets of A and 16000 packets of B. The operating cost per day of running
plants P and Q are respectively Rs.4000 and Rs.7500. How many days should the firm
run each plant in the month of April so that the production cost is minimized while still
meeting the market demand? Formulate a Linear programming problem.
4. A factory manufactures two articles A and B. To manufacture the article A, a certain
machine has to be worked for 1 hour and 30 minutes and in addition a craftsman has to
work for 2 hours. To manufacture the article B, the machine has to be worked for 2 hours
and 30 minutes and in addition the craftsman has to work for 1 hour and 30 minutes. In a
week the factory can avail of 80 hours of machine time and 70 hours of craftsman’s time.
The profit on each article A is Rs.5 and that on each article B is Rs.4. If all the articles
produced can be sold away, find how many of each kind should be produced to earn the
maximum profit per week. Formulate the problem as a linear programming problem.
37.4 GEOMETRIC APPORACH OF LINEAR PROGRAMMING PROBLEM
Let us consider a simple problem in two variables x and y. Find x and y which satisfy the
following equations

x  y 4
3 x  4 y  14

MATHEMATICS 529
 Linear Programming
MODULE - X Solving these equations, we get x = 2 and y = 2. What happens when the number of equations
Linear Programming
and Mathematical and variables are more?
Reasoning
Can we find a unique solution for such system of equations?
However, a unique solution for a set of simultaneous equations in n-variables can be obtained if
there are exactly n-relations. What will happen when the number of relations is greater than or
Notes less then n ?

A unique solution will not exist, but a number of trial solutions can be found. Again, if the number
of relations are greater than or less than the number of variables involved and the relation are in
the form of inequalities.
Can we find a solution for such a system?
Whenever the analysis of a problem leads to minimising or maximising a linear expression in
which the variable must obey a collection of linear inequalities, a solution may be obtained using
linear programming techniques. One way to solve linear programming problems that involve
only two variables is geometric approach called graphical solution of the linear programming
problem.

37.5 SOLUTION OF LINEAR PROGRAMMING PROBLEMS

In the previous section we have seen the problems in which the number of relations are not
equal to the number of variables and many of the relations are in the form of inequation
(i.e.,  or  ) to maximise (or minimise) a linear function of the variables subject to such
conditions.
Now the question is how one can find a solution for such problems?
To answer this questions, let us consider the system of equations and inequations (or inequalities).

x>0 y
x' O x

y>0
x' O x
y' y'
Fig. 6.11 Fig. 6.12
Fig. 37.1 Fig. 37.2

We know that x > 0 represents a region lying towards the right of y - axis including the y - axis.
Similarly, the region represented by y > 0, lies above the x - axis including the x-axis.

530 MATHEMATICS
 Linear Programming
MODULE - X
The question arises: what region will be represented by x > 0 and y > 0 simultaneously. Linear Programming
and Mathematical
Reasoning
y

Notes
x > 0, y > 0

x' O x

y' Fig. 37.3

6.13

Obviously, the region given by x > 0, y > 0 will consist of those points which are common to
both x > 0 and y > 0. It is the first quadrant of the plane.
Next, we consider the graph of the equation x + 2y < 8. For this, first we draw the line
x + 2y = 8 and then find the region satisfying x + 2y < 8.
Usually we choose x = 0 and calculate the corresponding value of y and choose y = 0 and
calculate the corresponding value of x to obtain two sets of values (This method fails, if the line
is parallel to either of the axes or passes through the origin. In that case, we choose any arbitrary
value for x and choose y so as to satisfy the equation).
Plotting the points (0,4) and (8,0) and joining them by a straight line, we obtain the graph of the
line as given in the Fig. 37.4 below.

B(0,4)
x+
2y
= 8
A (8,0)
x' O x

y' Fig. 37.4

Fig. 6.14

We have already seen that x  0 and y  0 represents the first quadrant. The graph given by
x + 2y < 8 lies towards that side of the line

MATHEMATICS 531
 Linear Programming
MODULE - X
Linear Programming
x + 2y = 8 in which the origin is situated because y
and Mathematical
Reasoning
any point in this region will satisfy the inequality.
Hence the shaded region in the Fig. 37.5 (0,4) x+
2y
represents x  0, y  0 and x + 2y  8 =8

Notes simultaneously. (8,0)

x' O x
Similarly, if we have to consider the regions
bounded by x  0, y  0 and x + 2y  8, y'
Fig.
Fig.6.15
37.5
then it will lie in the first quadrant and
y
on that side of the line x + 2y = 8 in
which the origin is not located. The
graph is shown by the shaded region,
in Fig. 37.6
(0,4)
The shaded region in which all the
x+
given constraints are satisfied is 2y
= 8
called the feasible region.
x' O (8,0) x
37.5.1 Feasible Solution
y'
A set of values of the variables of a Fig.37.6
Fig. 6.16

linear programming problem which

satisfies the set of constraints and the non-negative restrictions is called a feasible solution of
the problem.

37.5.2 Optimal Solution

A feasible solution of a linear programming problem which optimises its objective functions is
called the optimal solution of the problem.

Note : If none of the feasible solutions maximise (or minimise) the objective function,
or if there are no feasible solutions, then the linear programming problem has no
solution.

In order to find a graphical solution of the linear programming problem, following

steps be employed.
Step 1 : Formulate the linear programming problem.
Step 2 : Graph the constraints (inequalities), by the method discussed above.

532 MATHEMATICS
 Linear Programming

Step 3 : Identify the feasible region which satisfies all the constraints simultaneously. For less MODULE - X
Linear Programming
than or equal to’ constraints the region is generally below the lines and ‘for greater than and Mathematical
or equal to’ constraints, the region is above the lines. Reasoning

Step 4 : Locate the solution points on the feasible region. These points always occur at the
vertex of the feasible region.
Step 5 : Evaluate the objective function at each of the vertex (corner point) Notes

Step 6 : Identify the optimum value of the objective function.

Example 37.5 Minimise the quantity

z  x1  2 x2

subject to the constraints

x1  x2  1
x1  0, x2  0

Solution : The objective function to be minimised is

z  x1  2 x2

subject to the constraints

x1  x2  1
x1  0, x2  0

First of all we draw the graphs of these inequalities, which is as follows :

x2

B(0,1)
x +1
x =2
1

x1
O A(1,0)
Fig. 37.7
Fig. 6.17

MATHEMATICS 533
 Linear Programming
MODULE - X
Linear Programming
As we have discussed earlier that the region satisfied by x1  0 and x2  0 is the first quadrant
and Mathematical
Reasoning and the region satisfied by the line x1  x2  1 along with x1  0, x2  0 will be on that side
of the line x1  x2  1 in which the origin is not located. Hence, the shaded region is our
feasible solution because every point in this region satisfies all the constraints. Now, we have to
find optimal solution. The vertex of the feasible region are A (1,0) and B (0,1).
Notes
The value of z at A = 1
The value of z at B = 2
Take any other point in the feasible region say (1,1), (2,0), (0,2) etc. We see that the value of
z is minimum at A (1,0).

Example 37.6 Minimise the quantity

z  x1  2 x2

subject to the constraints

x1  x2  1
2 x1  4 x2  3
x1  0, x2  0

Solution : The objective function to be minimised is

z  x1  2 x2

subject to the constraints

x1  x2  1
2 x1  4 x2  3
x1  0, x2  0 x2

First of all we draw the graphs of these

inequalities (as discussed earlier) which
is as follows :
The shaded region is the feasible region. E(0,1)
Every point in the region satisfies all the D 0, 0.75 
mathematical inequalities and hence the C 0.5, 0.5
feasible solution. 2 x1  4 x2  3
Now, we have to find the optimal
solution. O A(1,0) x1
B 1.5, 0 
x +1

The value of z at B 1.5, 0 is 1.5

x2
=

Fig.
Fig.6.18
37.8
1

534 MATHEMATICS
 Linear Programming
MODULE - X
The value of z at C  0.5, 0.5 is 1.5 Linear Programming
and Mathematical
Reasoning
The value of z at E (0,1) is 2

3
If we take any point on the line 2 x1  4 x2  3 between B and C we will get and elsewhere
2
Notes
3
in the feasible region greater than . Of course, the reason any feasible point (between B and
2
C) on 2 x1  4 x2  3 minimizes the objective function (equation) z  x1  2 x2 is that the two
1
lines are parallel (both have slope  ). Thus this linear programming problem has infinitely
2
many solutions and two of them occur at the vertices.

Example 37.7 Maximise

z  0.25 x1  0.45 x2

subject to the constraints

x1  2 x2  300
3 x1  2 x2  480
x1  0, x2  0

Solution : The objective function is to maximise

z  0.25 x1  0.45 x2

subject to the constraints

x1  2 x2  300
3 x1  2 x2  480
x1  0, x2  0 x2

First of all we draw the graphs of these D(0,240)

inequalities, which is as follows :
The shaded region OABC is the feasible C(0,150)
region. Every point in the region satisfies
all the mathematical inequations and B(90,105)
hence the feasible solutions.
Now, we have to find the optimal E(300,0)
solution. O A(160,0) x1
x1  2 x2  300
The value of z at A (160, 0) is 40.00 3 x1  2 x2  480
Fig.
Fig. 6.19
37.9

MATHEMATICS 535
 Linear Programming
MODULE - X The value of z at B (90, 105) is 69.75.
Linear Programming
and Mathematical The value of z at C (0, 150) is 67.50
Reasoning
The value of z at O (0, 0) is 0.
If we take any other value from the feasible region say (60, 120), (80, 80) etc. we see that still
the maximum value is 69.75 obtained at the vertex B (90, 105) of the feasible region.
Notes
Note : For any linear programming problem that has a solution, the following
general rule is true.
If a linear programming problem has a solution it is located at a vertex of the feasible
region. If a linear programming problem has multiple solutions, at least one of them is
located at a vertex of the feasible region. In either case, the value of the objective
function is unique.

Example 37.8 In a small scale industry a manufacturer produces two types of book cases.
The first type of book case requires 3 hours on machine A and 2 hours on machines B for
completion, whereas the second type of book case requires 3 hours on machine A and 3 hours
on machine B. The machine A can run at the most for 18 hours while the machine B for at the
most 14 hours per day. He earns a profit of Rs. 30 on each book case of the first type and Rs.
40 on each book case of the second type.
How many book cases of each type should he make each day so as to have a maximum porfit?

Solution : Let x1 be the number of first type book cases and x2 be the number of second type
book cases that the manufacturer will produce each day.

Since x1 and x2 are the number of book cases so

x1  0, x2  0  (1)

Since the first type of book case requires 3 hours on machine A, therefore, x1 book cases of
first type will require 3x1 hours on machine A. second type of book case also requires 3 hours
on machine A, therefore, x2 book cases of second type will require 3x2 hours on machine A.
But the working capacity of machine A is at most 18 hours per day, so we have

3 x1  3 x2  18

or x1 + x2 < 6  (2)
Similarly, on the machine B, first type of book case takes 2 hours and second type of book
case takes 3 hours for completion and the machine has the working capacity of 14 hours per
day, so we have

536 MATHEMATICS
 Linear Programming
MODULE - X
2x1 + 3x2 < 14  (3) Linear Programming
and Mathematical
Profit per day is given by Reasoning

z  30 x1  40 x2  (4)

Now, we have to determine x1 and x2 such that

Notes

Maximize z  30 x1  40 x2 (objective function) subject to the conditions

x1  x2  6 

2 x1  3x2  14 
constraints
x1  0, x2  0 

We use the graphical method to find the solution of the problem. First of all we draw the graphs
of these inequalities, which is as follows :

x2

(0,6)

14
C (0, )
3
B(4,2)

(7,0) x1
O A(6,0)
(0,0) 2 x1  3 x2  14

Fig. 6.20
Fig. 37.10 x1  x2  6

The shaded region OABC is the feasible region. Every point in the region satisfies all the
mathematical inequations and hence known as feasible solution.
We know that the optimal solution will be obtained at the vertices O (0, 0), A (6, 0). B (4,2).
Since the co-ordinates of C are not integers so we don’t consider this point. Co-ordinates of B
are calculated as the intersection of the two lines.
Now the profit at O is zero.
Profit at A = 30 × 6 + 40 × 0
= 180
Profit at B = 30 × 4 + 40 × 2

MATHEMATICS 537
 Linear Programming
MODULE - X = 120 + 80
Linear Programming
and Mathematical = 200
Reasoning
Thus the small scale manufacturer gains the maximum profit of Rs.200 if he prepares 4 first
type book cases and 2 second type book cases.

Notes Example 37.9 Maximize the quantity

z  x1  2 x2

subject to the constraints

x1  x2  1, x1  0, x2  0 x2
Solutions : First we graph the constraints

x1  x2  1, x1  0, x2  0 B(0,1)

The shaded portion is the set of feasible

solution.
Now, we have to maximize the objective
function. O A(1,0) x1
The value of z at A(1, 0) is 1.
Fig. 6.25
Fig. 37.11
The value of z at B(0, 1) is 2.
If we take the value of z at any other point from the feasible region, say (1, 1) or (2, 3) or (5,
4) etc, then we notice that every time we can find another point which gives the larger value
than the previous one. Hence, there is no feasible point that will make z largest. Since there is
no feasible point that makes z largest, we conclude that this linear programming problem has
no solution.

Example 37.10 Solve the following problem graphically.

Minimize z  2 x1  10 x2

subject to the constraints

x1  x2  0
x1  5 x2   5
x1  0, x2  0

Solution : First we graph the constraints

x1  x2  0
x1  5 x2   5
x1  0, x2  0
538 MATHEMATICS
 Linear Programming
MODULE - X
x2  x1  0, Linear Programming
and Mathematical
5 x2  x1  5 Reasoning
or
x1  x2  0

Notes
x2
0

x2

x1
5 5
A ,  feasible region
4 4

(0,1)  x1  5 x2  5

O x1
Fig.37.12
Fig. 6.26

The shaded region is the feasible region.

Here, we see that the feasible region is unbounded from one side.
But it is clear from Fig. 37.26 that the objective function attains its minimum value at the point
A which is the point of intersection of the two lines x1  x2  0 and  x1  5 x2  5.

5
Solving these we get x1  x2 
4

5 5
Hence, z is minimum when x1  , x2  , and it s minimum value is
4 4
5 5
2  10    10.
4 4

Note : If we want to find max. z with these constraints then it is not possible in this
case because the feasible region is unbounded from one side.

CHECK YOUR PROGRESS 37.2

Solve the following problems graphically
1. Maximize z  3x1  4 x2 2. Maximize   2 x1  3 x2
subject to the conditions subject to the conditions
MATHEMATICS 539
 Linear Programming
MODULE - X
Linear Programming x1  x2  40 x1  x2  400
and Mathematical
Reasoning x1  2 x2  60 2 x1  x2  600
x1  0, x2  0 x1  0, x2  0

3. Minimize z  60 x1  40 x2 4. Maximize z  20 x1  30 x2
Notes
subject to the conditions subject to the conditions

3 x1  x2  24 x1  x2  12,
x1  x2  16 5 x1  2 x2  50
x1  3x2  24 x1  3x2  30,
x1  0, x2  0 x1  0, x2  0

5. Maximize z  50 x1  15 x2 6. Minimize z  4000 x1  7500 x2

subject to the conditions subject to the conditions

5 x1  x2  100 4 x1  3x2  40
x1  x2  60 2 x1  3 x2  8
x1  0, x2  0 x1  0, x2  0
C

1A
+
%
LET US SUM UP

l Linear programming is a technique followed by mathematicians to solve the optimisation

problems.
l A set of values of the variables of a linear programming problem which satisfies the set of
constraints and the non-negative restrictions is called a feasible solution.
l A feasible solution of a linear programming problem which optimises its objective function
is called the Optimal solution of the problem.
l The optimal solution of a linear programming problem is located at a vertex of the set of
feasible region.
l If a linear programming problem has multiple solutions, at least one of them is located at
a vertex of the set of feasible region. But in all the cases the value of the objective
function remains the same.

SUPPORTIVE WEB SITES

http://people.brunel.ac.uk/~mastjjb/jeb/or/morelp.html
http://en.wikipedia.org/wiki/Simplex_algorithm
http://www.youtube.com/watch?v=XbGM4LjM52k

540 MATHEMATICS
 Linear Programming
MODULE - X
Linear Programming
TERMINAL EXERCISE and Mathematical
Reasoning

1. A dealer has 1500 only for a purchase of rice and wheat. A bag of rice costs 1500
and a bag of wheat costs 1200. He has a storage capacity of ten bags only and the
dealer gets a profit of 100 and 80 per bag of rice and wheat respectively. Formulate Notes
the problem as a linear programming problem to get the maximum profit.
2. A business man has 600000 at his disposal and wants to purchase cows and buffaloes
to take up a business. The cost price of a cow is 20,000 and that of a buffalo is
60000. The man can store fodder for the live stock to the extent of 40 quintals per
week. A cow gives 10 litres of milk and buffalo gives 20 litres of milk per day. Profit per
litre of milk of cow is 5 and per litre of the milk of a buffalo is 7. If the consumption
of fodder per cow is 1 quintal and per buffalo is 2 quintals a week, formulate the problem
as a linear programming problem to find the number of live stock of each kind the man
has to purchase so as to get maximum profit (assuming that he can sell all the quantity of
milk, he gets from the livestock)
3. A factory manufactures two types of soaps each with the help of two machines A and B.
A is operated for two minutes and B for 3 minutes to manufacture the first type, while the
second type is manufactured by operating A for 3 minutes and B for 5 minutes. Each
machine can be used for at most 8 hours on any day. The two types of soaps are sold at
a profit of 25 paise and 50 paise each respectively. How many soaps of each type should
the factory produce in a day so as to maximize the profit (assuming that the manufacturer
can sell all the soaps he can manufacture). Formulate the problem as a linear programming
problem.
4. Determine two non-negative rational numbers such that their sum is maximum provided
that their difference exceeds four and three times the first number plus the second should
be less than or equal to 9. Formulate the problem as a linear programming problem.
5. Vitamins A and B are found in two different foods E and F. One unit of food E contains
2 units of vitamin A and 3 units of vitamin B. One unit of food F contains 4 units of vitamin
A and 2 units of vitamin B. One unit of food E and F costs Rs.5 and Rs.2.50 respectively.
The minimum daily requirements for a person of vitamin A and B is 40 units and 50 units
respectively. Assuming that anything in excess of daily minimum requirement of vitamin A
and B is not harmful, find out the optimal mixture of food E and F at the minimum cost
which meets the daily minimum requirement of vitamin A and B. Formulate this as a linear
programming problem.
6. A machine producing either product A or B can produce A by using 2 units of chemicals
and 1 unit of a compound and can produce B by using 1 unit of chemicals and 2 units of
the compound. Only 800 units of chemicals and 1000 units of the compound are available.
The profits available per unit of A and B are respectively Rs. 30 and Rs.20. Find the
optimum allocation of units between A and B to maximise the total profit. Find the maximum
profit.

MATHEMATICS 541
 Linear Programming
MODULE - X 7. Solve the following Linear programming problem graphically.
Linear Programming
and Mathematical
Reasoning (a) Maximize z  25 x1  20 x2

subject to the constraints

3 x1  6 x2  50
Notes
x1  2 x2  10
x1  0, x2  0

(b) Maximize z  9 x1  10 x2

subject to the constraints

11x1  9 x2  9900
7 x1  12 x2  8400
3 x1  8 x2  4800
x1  0, x2  0

(c) Maximise z  22 x1  18 x2

subject to the constraints

x1  x2  20,
3 x1  2 x2  48
x1  0, x2  0

542 MATHEMATICS
 Linear Programming
MODULE - X
Linear Programming
ANSWERS and Mathematical
Reasoning

CHECK YOUR PROGRESS 37.1

1. Maximize z  3x1  8 x2 2. Maximize z  50 x1  15 x2

Notes
subject to the constraints subject to the constraints

3 x1  4 x2  18 5 x1  x2  100
4 x1  5 x2  21 x1  x2  60
x1  0, x2  0. x1  0, x2  0.

3. Minimize z  4000 x1  7500 x2 4. Maximize z  5 x1  4 x2

subject to the constraints subject to the constraints

4 x1  3x2  40 1.5 x1  2.5 x2  80

2 x1  3x2  8 2 x1  1.5 x2  70
x1  0, x2  0 x1  0, x2  0

CHECK YOUR PROGRESS 37.2

x2
(0,40)

C(0,30)

B(20,20)

on
1. gi
re
le
ib
e as
f
O A(40,0) (60,0) x1
Fig. 6.45 x1  x2  40 x1  2 x2  60
Fig. 37.13

Maximum z = 140 at B(20,20)

MATHEMATICS 543
 Linear Programming
MODULE - X
Linear Programming
and Mathematical x2
Reasoning

(0,600) fe
a sib
le
Notes re
C(0,400) g io
n
B (200,200)

2.
(400,0)
O A (300,0) x1
x1  x2  400

Fig. 37.14
Fig. 6.46 2 x1  x2  600

Maximize z = 1200 at C(0,400)

x2

D(0,24)

(0,16) feasible region

C(4,12)

(0,8)
3. B(12,4)

x1
O (8,0) (16,0) A(24,0)
x1  3 x2  24
x1  x2  16
Fig. 6.47
Fig. 37.15 3x1  x2  24

Minimize z  720 at C (4,12), x1  4, x2  12

544 MATHEMATICS
 Linear Programming
MODULE - X
Linear Programming
x2 and Mathematical
Reasoning

(0,25)

Notes
feasible region

 26 10 

C(
B , 

3,9
 3 3

)
D(0,10)
4.
A(10,0) (30,0) x1
O
x1  x2  12 x1  3x2  30
Fig. 6.48
Fig. 37.16 5 x1  2 x2  50

Maximum z  330 at C (3,9), x1  3, x2  9

x2

5. feasible region

C(0,60)
B(10,50)

A(20,0) (60,0)
O x1
5 x1  x2  100 x1  x2  60

Fig.
Fig. 6.49
37.17

Maximum z  1250 at B(10,50), x1  10, x2  50

MATHEMATICS 545
 Linear Programming
MODULE - X
Linear Programming
x2
and Mathematical
Reasoning
6.

Notes feasible region

10
(0, 40))
B(0,
B 33

O A(10,0) x1
2 x1  3 x2  8
4 x1  3 x 2  40
Fig.
Fig. 6.50
37.18

Maximum z = 40,000 at A(10,0), x1  10, x2  0

TERMINAL EXERCISE
1. Maximize z  100 x1  80 x2 2. Maximize z 150 x1  980 x2
subject to the conditions subject to the conditions

5 x1  4 x2  50 x1  3x2  30
x1  x2  10 7 x1  14 x2  40
x1  0, x2  0 x1  0, x2  0

3. Maximize z  25 x1  50 x2 4. Maximize z  x1  x2
subject to the conditions subject to the conditions

2 x1  3x2  480 x1  x2  4
3 x1  5 x2  480 3 x1  x2  9
x1  0, x2  0 x1  0, x2  0

5. Minimize z  5 x1  2.5 x2
subject to the conditions

546 MATHEMATICS
 Linear Programming
MODULE - X
x1  2 x2  20 Linear Programming
and Mathematical
3 x1  2 x2  50 Reasoning

x1  0, x2  0

6. Maximize z  30 x1  20 x2 x2
Notes
subject to the constraints
2 x1  x2  800
(0,800)
x1  2 x2  1000
x1  0, x2  0

C(0,500) feasible region OABC

B(200,400)

A(400,0) (1000,0)
O x1
Maximum z = 14000 at x1  2 x2  1000
2 x1  x2  800
B (200,400). 1 4 0 0 0  z Fig.37.19
Fig. 6.67

8. (a)
x2
25
(0, )
3

feasible region
C(0,5)
B(4,3)

(10,0)
O
 25  x1
A , 0 x1  2 x2 10
 4 
Fig. 37.20
Fig. 6.68
4 x1  3x2  25

Maximum z  160 at B  4,3 , x1  4 x2  3

MATHEMATICS 547
 Linear Programming
MODULE - X (b)
Linear Programming
and Mathematical
Reasoning x2

(0,1100)

Notes

(0,700) feasible region

B (626,335)
D(0,600) C (480,420)

3x1  8 x2  4800

x1
O A(900,0)
7 x1  12x2  8400
Fig.37.21
Fig. 6.69 11x1  9 x2  9900

A (900,0) D(0,600) B (626, 335), O(0, 0) and C (480, 420)

Maximum z  8984 at B(626,335) x1  626, x2  335

(c)

x2

(0,24)

C(0,20) feasible region OABC

B(8,12)

(20,0)
O A(16,0) x1
x1  x2  20

Fig.
Fig.37.22
6.70 3x1  2 x2  48

Maximum z  392 at B  8,12  x1  8 x2  12

548 MATHEMATICS