Unit IV

LPP

0.1 Introduction

Many business and economic situations are concerned with a problem of planning
activity.
In each case, there are limited resources at our disposal and our problem is to make
such a use of these resources so as to yield the maximum production or to minimise
the cost of production, or to give the maximum profit, etc. Such problems are referred
to as the problems of constrained optimisation.
Linear programming is a technique for determining an optimum schedule of interde-
pendent activities in view of the available resources.
The word linear stands for indicating that all relationships involved in a particular
problem are linear. P rogramming is just another word for ’planning’ and refers to the
process of determining a particular plan of action from amongst several alternatives.

0.2 Linear Programming Problem

A Linear Programming Problem (LPP) consists of three components,

1. the decision variables (activities):

The decision variables refer to the activities that are competing one another
for sharing the resources available. All the decision variables are considered as
continuous, controllable and non-negative.

2. the objective (goal):

A linear programming problem must have an objective which should be clearly
identifiable and measurable in quantitative terms. It could be of profit max-
imisation, cost minimisation, and so on. The relationship among the variables

1
2

representing objective must be linear.

3. the constraints (restrictions):

There are always certain limitations or constraints on the use of resources, such
as labour, space, raw material, money, etc. Such constraints must be expressed
as linear inequalities or equalities in terms of decision variables.

Basic Assumptions:

1. Certainty: In all LPP’s, it is assumed that all the parameters; such as availabil-
ity of resources, profit (or lost) contribution of a unit of decision variable and
consumption of resources by a unit decision variable must be known and fixed.

2. Divisibility (or continuity): This implies that solution values of the decision
variables and resources can take on any non-negative values, including fractional
values of the decision variables.

3. Proportionality: This requires the contribution of each decision variable in both

the objective function and the constraints to be directly proportional to the
value of the variable.

4. Additivity: The value of the objective function for the given values of decision
variables and the total sum of resources used, must be equal to the sum of the
contributions earned from each decision variable and the sum of the resources
used by each decision variable respectively.

0.3 Mathematical Formulation of an LPP

The procedure for mathematical formulation of a linear programming problem con-

sists of the following steps:

1. Study the given situation to find the key decisions to be made.

2. Identify the variables involved and designate them by symbols xj (j = 1, 2, · · · ).

3. State the f easible alternatives which generally are: xj ≥ 0, for all j.

0.3. Mathematical Formulation of an LPP 3

4. Identify the constraints in the problem and express them as linear inequalities
or equations, LHS of which are linear functions of the decision variables.

5. Identify the objective function and express it as a linear function of the decision
variables.

Example 0.3.1 (Product Allocation Problem) A company has three operational de-
partments (weaving, processing and packing) with capacity to produce three different
types of cloths namely suitings, shirtings and woollens yielding a profit of Rs.2, Rs.4
and Rs.3 per metre respectively. One metre of suiting requires 3 minutes in weaving,
2 minutes in processing and 1 minute in packing. Similarly one metre of shirting
requires 4 minutes in weaving, 1 minute in processing and 3 minutes in packing. One
metre of woollen requires 3 minutes in each department. In a week, total run time of
each department is 60, 40 and 80 hours for weaving, processing and packing respec-
tively.
Formulate the linear programming problem to find the product mix to maximize the
profit
Solution The data of the given problem is listed as follows:

Weaving Processing Packing Profit

(in minutes) (in minutes) (in minutes) (Rs per metre)

Suitings 3 2 1 2
Shirtings 4 1 3 4
Woollens 3 3 3 3

Availability
of time 60 × 60 40 × 60 80 × 60
Step 1: The key decision is to determine the weekly rate of production for the three

types of cloths.
4

Step2: Let us designate the weekly production of suitings, shirtings and woollens by
x1 metres, x2 meters and x3 meters respectively.
Step3: Since it is not possible to produce negative quantities, feasible alternatives
are sets of values of x1 , x2 and x3 satisfying x1 ≥ 0, x2 ≥ 0 and x3 ≥ 0.
Step 4: The constraints are the limited availability of three operational depart-
ments. One metre of suiting requires 3 minutes of weaving. The quantity being x1
meters, the requirement for suiting alone will be 3x1 units. Similarly, x2 meters of
shirting and x3 meters of woollen will require 4x2 and 3x3 minutes respectively. Thus,
the total requirement of weaving will be 3x1 + 4x2 + 3x3 , which should not exceed
the available 3600 minutes. So, the labour constraint becomes 3x1 +4x2 +3x3 ≤ 3600.

Similarly, the constraints for the processing department and packing depart-
ments are 2x1 + x2 + 3x3 ≤ 2400 and x1 + 3x2 + 3x3 ≤ 4800 respectively.
Step 5: The objective is to maximize the total profit from sales. Assuming that
whatever is produced is sold in the market, the total profit is given by the linear
equation
z = 2x1 + 4x2 + 3x3 .

The linear programming problem can thus be put in the following mathematical
format:

Find x1 , x2 and x3 so as to
maximize z = 2x1 + 4x2 + 3x3
subject to the constraints:
3x1 + 4x2 + 3x3 ≤ 3600
2x1 + x2 + 3x3 ≤ 2400
x1 + 3x2 + 3x3 ≤ 4800
x1 ≥ 0, x2 ≥ 0 and x3 ≥ 0.

Example 0.3.2 (Mathematical formulation(Product mix Problem)) Consider the

following problem faced by a production planner in a soft drink plant. He has two
bottling machines A and B. A is designed for 8−ounce bottles and B for 16− ounce
0.3. Mathematical Formulation of an LPP 5

bottles. However, each can be used on both types with some loss of efficiency. The
following data is available:
Machine 8−ounce bottles 16−ounce bottles

A 100/minute 40/minute
B 60/minute 75/minute

Each machine can be run 8−hours per day, 5 days per week. Profit on a 8−ounce
bottle is 25 paise and on a 16−ounce bottle is 35 paise. Weekly production of the
drink cannot exceed 3, 00, 000ounces and the market can absorb 25, 000 8−ounce
bottles and 7, 000 16−ounce bottles per week. The planner wishes to maximize his
profit subject, of course, to all the production and marketing restrictions.
Formulate this as a linear programming problem.
Solution The data of the problem is listed as follows:
Resource/
constraint Production Availability
8−ounce bottle 16−ounce bottle

Machine A time 100/minute 40/minute 8 × 5 × 60minutes

Machine B time 60/minute 75/minute 8 × 5 × 60minutes
Production 1 1 3, 00, 000 ounces/wk
Marketing 1 - 25, 000 units/wk
− 1 7, 000 units/wk
Profit/unit (Rs) 0.25 0.35

Step:1 The key decision to be made is to determine the number of bottles (8-
ounces and 16-ounces) to be produced per week.

Step:2 Let x1 and x2 be the number of 8−ounce and 16−ounce bottles respec-
tively, produced per week.
6

Step:3 Feasibles alternatives are the sets of values x1 ≥ 0, y ≥ 0.

Step:4 Constraints are on the availability of machine time and production.

1
1. Machine-time constraints: An 8−ounce bottle takes 100
minutes on machine A
1
and 60
minutes on machine B.
1 1
A 16−ounce bottle takes 40
minutes on machine A and 75
minutes on machine
B.
Since both the machines can run 8 hours per day for 5 days per week, the time
available on both the machines is 2, 400 minutes per week individually. Thus,
the two machine time constraints are:
x1 x2
+ ≤ 2, 400 (Machine A)
100 40
x1 x2
+ ≤ 2, 400 (Machine B)
60 75
That is,
4x1 + 10x2 ≤ 9, 60, 000

15x1 + 12x2 ≤ 21, 60, 000

2. Production constraints: It is given that the weekly production of the drink

should not exceed 3, 00, 000 ounces and the market can absorb only up to 25, 000
8-ounce bottles and 7, 000 16-ounce bottles per week.
∴ the two production constraints are:

8x1 + 16x2 ≤ 3, 00, 000(P roduction)

x1 ≤ 25, 000 and x2 ≤ 7, 000 (Market)

Step:5 The objective is to maximize the total profit, 0 · 25x1 + 0 · 35x2 .

The LPP, therefore, can be put in the following mathematical format:

Find x1 and x2 so as to
maximize z = 0 · 25x1 + 0 · 35x2
0.3. Mathematical Formulation of an LPP 7

subject to the constraints:

4x1 + 10x2 ≤ 9, 60, 000
15x1 + 12x2 ≤ 21, 60, 000
8x1 + 16x2 ≤ 3, 00, 000
x1 ≤ 25, 000, x2 ≤ 7, 000
x1 ≥ 0, x2 ≥ 0.

Example 0.3.3 (Blending Problem) The manager of an oil refinery must decide on
the optimum mix of two possible blending processes of which the input and output
production runs are as follows:
Process Input Output
Crude A Crude B Gasoline X Gasoline Y

1 6 4 6 9
2 5 6 5 5

The maximum amounts available of crudes A and B are 250 units and 200 units
respectively. Market demand shows that at least 150 units of gasoline X and 130
units of gasoline Y must be produced. The profits per production run from process 1
and process 2 are Rs.4 and Rs.5 respectively. Formulate the problem for maximising
the profit.
Solution Step:1 The key decision is to determine the number of units of gasoline
produced from process 1 and 2.
Step:2 Decision variables
Let x1 be the number of units of gasoline produced from process 1 and x2 be the
number of units of gasoline produced from process 2.
Step:3 Feasible alternatives

x1 ≥ 0 and x2 ≥ 0.

Step:4 Constraints

1. Availability constraints:
8

6x1 + 5x2 ≤ 250 (Availability of crude A)

4x1 + 6x2 ≤ 200 (Availability of crude B)

2. Demand constraints:

6x1 + 5x2 ≥ 150 (Demand of gasoline X)

9x1 + 5x2 ≥ 130 (Demand of gasoline Y)

Step:5 The objective is to maximize the total profit of the production of gasoline
4x1 + 5x2 .
Therefore the required LPP is

Find x1 and x2 so as to
maximize z = 4x1 + 5x
subject to the constraints:
6x1 + 5x2 ≤ 250,
4x1 + 6x2 ≤ 200,
6x1 + 5x2 ≥ 150,
9x1 + 5x2 ≥ 130,
x1 ≥ 0 and x2 ≥ 0.

Example 0.3.4 Old hens can be bought for Rs.2 each and young ones Rs.5 each.
The old hens lay 3 eggs per week and the young ones 5 eggs per week. Each being
worth 30 paise. A hen costs Rs. 1 per week to feed. If I have only Rs.80 to spend
for hens, How many of each kind should I buy to give a profit of more than Rs.6 per
week. Also assuming that I cannot house more than 20 hens. Write a mathematical
model of the problem.
Solution Step:1 The key decision is to determine the number of old hens and young
hens to be bought.
Step:2 Decision variables
Let x1 be the number of old hens to be bought, and x2 be the number of young hens
0.3. Mathematical Formulation of an LPP 9

to be bought.
Step:3 Feasible alternatives

x1 ≥ 0 and x2 ≥ 0.

Step:4 Constraints

1. Availability constraints:

2x1 + 5x2 ≤ 80 (Availability of money)

x1 + x2 ≤ 20 (Availability of housing)

2. Profit constraint: Rate of 1 egg is 30 paise and one old hen lays 3 eggs per week.
So x1 number of old hens lay 3x1 eggs per week.
Therefore rate of 3x1 eggs is Rs.0 · 9x1 .
Similarly, the rate of 5x2 eggs is Rs.1 · 5x2 .
Also a hen costs Rs.1 per week to feed.
∴ In a week the total profit is 0 · 9x1 + 1 · 5x2 − (x1 + x2 )1 = −0 · 1x1 + 0 · 5x2 .
The constraint on the profit is more than Rs6.Hence the constraint on profit is

−0 · 1x1 + 0 · 5x2 ≥ 6.

Step:5 The objective is to maximize the total profit −0 · 1x1 + 0 · 5x2 .

Therefore the required LPP is

Find x1 and x2 so as to
maximize z = −0 · 1x1 + 0 · 5x2
subject to the constraints:
2x1 + 5x2 ≤ 80,
x1 + x2 ≤ 20,
−0 · 1x1 + 0 · 5x2 ≥ 6,
x1 ≥ 0 and x2 ≥ 0.
10

Example 0.3.5 An animal feed company must produce 200 grams of a mixture
containing the inheridiant X1 and X2 . X1 costs Rs.3 per gram and X2 costs Rs.8 per
gram. Not more than 80 grams of X1 can be used and minimum quantity to be used
for X2 is 60 grams. Find how much of inheridiant should be used if the company
wants to minimize the cost. Formulate.
Solution Step:1 The key decision is to determine the total cost of both inheridiants.
Step:2 Decision variables
Let x1 be the quantity of X1 , and x2 be the quantity of X2 .
Step:3 Feasible alternatives

x1 ≥ 0 and x2 ≥ 0.

Step:4 Constraints

1. Availability constraints:(Availability of inheridiants)

x1 ≤ 80
x2 ≥ 60

2. Constraint on quantity of mixture

x1 + x2 = 200.

Step:5 The objective is to minimize the total cost 3x1 + 8x2 of inheridiants. Therefore
the required LPP is

Find x1 and x2 so as to
minimize z = 3x1 + 8x2
subject to the constraints:
x1 ≤ 80,
x2 ≥ 60,
x1 + x2 = 200,
x1 ≥ 0 and x2 ≥ 0.
0.3. Mathematical Formulation of an LPP 11

Example 0.3.6 A company makes two kinds of leather belts. Belt A is a high quality
belt and Belt B is of lower quality. The respective profits are Rs.4 and Rs.3 per belt.
Each belt of type A requires twice as much time as a belt of type B, and if all belts
were of type B, the company could make 1000 belts per day. The supply of leathere
is sufficient for only 800 belts per day (both A and B combined). Belt A requires a
fancy buckle and only 400 buckles are available. There are 700 buckles a day available
for belt B. Write a mathematical model of the problem.
Solution Let x1 be the number of belts of type A and x2 be the number of belts of
type B.
The mathematical formulation of the given LPP is,

maximize z = 4x1 + 3x2

subject to the constraints:
2x1 + x2 ≤ 1000 (Time constraint)
x1 + x2 ≤ 800 (Availability of leather)
x1 ≤ 400 and x2 ≤ 700 (Availability of Buckles)
x1 ≥ 0 and x2 ≥ 0.

(Verify with your answer)

Example 0.3.7 An electronic company is engaged in the production of two compo-
nents C1 and C2 used in T.V sets. Each unit of C1 costs the company Rs.25 in wages
and Rs.25 in material, while each unit of C2 costs the company Rs.125 in wages and
Rs.75 in material. The company sells both products on one-period credit terms, but
the company’s labour and material expenses must be paid in cash. The selling price
of C1 is Rs.150 per unit and of C2 is Rs.350 per unit. Because of the strong monopoly
of the company for these components, it is assumed that the company can sell at the
prevailing prices as many units as it produces. The company’s production capacity
is, however, limited by two considerations. First, at the beginning of period 1, the
company has an initial balance of Rs.20,000 (cash plus bank credit plus collections
from past credit sales). Second, the company has available in each period 4,000 hours
12

of machine time and 2,800 hours of assembly time. The production of each C1 re-
quires 6 hours of machine time and 4 hours of assembly time, whereas the production
of each C2 requires 4 hours of machine time and 6 hours of assembly time. Formulate
this as an LPP so as to maximize the total profit to the company.
Solution Let x1 be the number of units of C1 and x2 be the number of units of C2 .
The mathematical format of the given LPP is:

Maximizez = 100x + 150y

subject to the constraints:
6x1 + 4x2 ≤ 4, 000,
4x1 + 6x2 ≤ 2, 800,
50x1 + 200x2 ≤ 20, 000
and x1 ≥ 0, x2 ≥ 0.

(Verify with your answer)

Example 0.3.8 A firm manufactures headache pills in two sizes A and B. Size A
contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine. Size B
contains 1 grain of aspirin, 8 grains of bicarbonate and 6 grains of codeine. It is found
by users that it requires at least 12 grains of aspirin, 74 grains of bicarbonate and 24
grains of codeine for providing immediate effect. It is required to determine the least
number of pills a patient should take to get immediate relief. Formulate the problem
as a standard LPP.
Solution Let x1 be the number of headache pills of size A and x2 be the number of
headache pills of size B.
The mathematical formulation of the given problem is:

minimize z = x1 + x2
subject to the constraints:
2x1 + x2 ≥ 12 (Demand of aspirin)
5x1 + 8x2 ≥ 74 (Demand of bicarbonate)
x1 + 6x2 ≥ 24 (Demand of codeine)
x1 ≥ 0 and x2 ≥ 0.
0.4. Graphical Method 13

(Verify with your answer)

0.4 Graphical Method

Linear programming problems involving two decision variables can be solved by graph-
ical method.
Search Approach Method:
The major steps in the solution of a linear programming problem by graphical method
are listed as follows:
Step 1 : Identify the problem: the decision variables, the objective and the con-
straints.
Step 2 : Set up the mathematical formulation of the problem.
Step 3 : Plot a graph representing all the constraints of the problem and identify the
feasible region. The feasible region is the intersection of all the regions represented
by the constraints of the problem and is restricted to the first quadrant only.
Step 4 : The feasible region obtained in Step 3 may be bounded or unbounded.
Compute the coordinates of all the corner points of the feasible region.
Step 5 : Find out the value of the objective function at each corner point determined
in Step 4.
Step 6 : Select the corner point that optimizes (maximizes or minimizes) the value
of the objective function. It gives the optimum feasible solution.
Example 0.4.1 A company makes two kinds of leather belts. Belt A is a high quality
belt and Belt B is of lower quality. The respective profits are Rs.4 and Rs.3 per belt.
Each belt of type A requires twice as much time as a belt of type B, and if all belts
were of type B, the company could make 1000 belts per day. The supply of leathere
is sufficient for only 800 belts per day (both A and B combined). Belt A requires a
fancy buckle and only 400 buckles are available. There are 700 buckles a day available
for belt B. Determine the optimal product mix.
Solution Let x1 be the number of belts of type A and x2 be the number of belts of
type B.
14

The mathematical formulation of the given LPP is:

maximize z = 4x1 + 3x2

subject to the constraints:
2x1 + x2 ≤ 1000 (Time constraint)
x1 + x2 ≤ 800 (Availability of leather)
x1 ≤ 400 and x2 ≤ 700 (Availability of Buckles)
x1 ≥ 0 and x2 ≥ 0.

Next we construct the graph by considering the carteasian plane. Now the inequalities
are graphed taking them as equations.
For example, the first constraint 2x1 + x2 ≤ 1000 will be graphed as 2x1 + x2 = 1000.
If x1 = 0, then x2 = 1000 and if x2 = 0 then x1 = 500.
These two points (0, 1000) and (500, 0) are then connected by a line which is shown
in following figure.
Any point that falls on this line or in the area below it, is acceptable in so far as
this constraint is concerned.
The region OAB formed by two axes and the line representing the equation

2x1 + x2 = 1000 is the region containing acceptable values of x1 and x2 in respect of

this constraint 2x1 + x2 ≤ 1000.
Similarly all other constraints are also plotted. The area bounded by all these

constraints, called feasible region or solution space is shown in the following figure by
the shaded area OPQRST.
0.4. Graphical Method 15

The optimum value of objective function occurs at one of the extreme(corner) points
of the feasible region. The coordinates of the extreme points are:
O = (0, 0), P = (400, 0), Q = (400, 200), R = (200, 600), S = (100, 700) and
T = (0, 700).
Now we compute the z-values corresponding to the extreme points:

Extremepoint (x1 , x2 ) z = 4x1 + 3x2

O (0,0) 0

P (400,0) 1600
Q (400,200) 2200
R (200,600) 2600 ←maximum
S (100, 700) 2500
T (0, 700) 2100

The optimum solution is that extreme point for which the objective function has
the largest value.
16

∴ x1 = 200 and x2 = 600.

Hence to maximize profit, the company should produce 200 belts of type A and 600
belts of type B per day.

0.5 Graphical Method 2:

Linear programming problems involving two decision variables can be solved by graph-
ical method.
Iso-Profit or Iso-cost Method:
The major steps in the solution of a linear programming problem by graphical method
are listed as follows:
Step 1 : Identify the problem: the decision variables, the objective and the con-
straints.
Step 2 : Set up the mathematical formulation of the problem.
Step 3 : Plot a graph representing all the constraints of the problem and identify the
feasible region. The feasible region is the intersection of all the regions represented
by the constraints of the problem and is restricted to the first quadrant only.
Step 4 : The feasible region obtained in Step 3 may be bounded or unbounded.
Compute the coordinates of all the corner points of the feasible region.
Step 5 : Choose a convenient profit (or cost) and draw iso-profit (iso-cost) line so
that it falls within the feasible region.
Step 6 : Move this iso-profit (iso-cost) line parallel to itself farther (closer) from (to)
the origin.
Step 7 : Identify the optimum solution as the coordinates of that point on the fea-
sible region touched by the highest possible iso-profit line (or lower possible iso-cost
line).
Step 8 : Compute the optimum feasible solution.
Example 0.5.1 (0.4.1) A company makes two kinds of leather belts. Belt A is a high
quality belt and Belt B is of lower quality. The respective profits are Rs.4 and Rs.3
per belt. Each belt of type A requires twice as much time as a belt of type B, and
if all belts were of type B, the company could make 1000 belts per day. The supply
0.5. Graphical Method 2: 17

of leathere is sufficient for only 800 belts per day (both A and B combined). Belt A
requires a fancy buckle and only 400 buckles are available. There are 700 buckles a
day available for belt B. Determine the optimal product mix.
Solution Let x1 be the number of belts of type A and x2 be the number of belts of
type B.
The mathematical formulation of the given LPP is:

maximize z = 4x1 + 3x2

subject to the constraints:
2x1 + x2 ≤ 1000 (Time constraint)
x1 + x2 ≤ 800 (Availability of leather)
x1 ≤ 400 and x2 ≤ 700 (Availability of Buckles)
x1 ≥ 0 and x2 ≥ 0.

Next we construct the graph by considering the carteasian plane. Now the inequalities
are graphed taking them as equations.
For example, the first constraint 2x1 + x2 ≤ 1000 will be graphed as 2x1 + x2 = 1000.
If x1 = 0, then x2 = 1000 and if x2 = 0 then x1 = 500.
These two points (0, 1000) and (500, 0) are then connected by a line which is shown
in following figure.
Any point that falls on this line or in the area below it, is acceptable in so far as
this constraint is concerned.
The region OAB formed by two axes and the line representing the equation

2x1 + x2 = 1000 is the region containing acceptable values of x1 and x2 in respect of

this constraint 2x1 + x2 ≤ 1000.
Similarly all other constraints are also plotted. The area bounded by all these

constraints, called feasible region or solution space is shown in the following figure by
the shaded area OPQRST.
The optimum value of objective function occurs at one of the extreme(corner)
points of the feasible region. The coordinates of the extreme points are:
18

O = (0, 0), P = (400, 0), Q = (400, 200), R = (200, 600), S = (100, 700) and
T = (0, 700).
Let the profit to the company is Rs.1200(arbitrary). The objective function then
becomes:
4x1 + 3x2 = 1200.

We draw this equation as a straight line in the feasible region shown in following
figure. This line is known as iso-profit line.

Also note that the iso-profit function(objective value function) is a straight line on
which every point has the same total profit.
Now, move the iso-profit line parallel to itself farther from the origin.
Observe that one of the iso-profit line touches only point R before leaving the feasible
region. This iso-profit line is termed as highest possible iso-profit line and point R
gives the extreme point of the solution space.
Hence, the optimum feasible solution is:

x1 = 200 and x2 = 600 with maximum z = Rs. 2600.

Example 0.5.2 Old hens can be bought for Rs.2 each and young ones Rs.5 each.
The old hens lay 3 eggs per week and the young ones 5 eggs per week. Each being
0.5. Graphical Method 2: 19

worth 30 paise. A hen costs Rs. 1 per week to feed. Also assuming that I cannot
house more than 20 hens. If I have only Rs.80 to spend for hens, How many of each
kind should I buy to give a profit of more than Rs.6 per week?
Solution Step:1 The key decision is to determine the number of old hens and young
hens to be bought.
Step:2 Decision variables
Let x1 be the number of old hens to be bought, and x2 be the number of young hens
to be bought.
Step:3 Feasible alternatives

x1 ≥ 0 and x2 ≥ 0.

Step:4 Constraints

1. Availability constraints:

2x1 + 5x2 ≤ 80 (Availability of money)

x1 + x2 ≤ 20 (Availability of housing)

2. Profit constraint: Rate of 1 egg is 30 paise and one old hen lays 3 eggs per week.
So x1 number of old hens lay 3x1 eggs per week.
Therefore rate of 3x1 eggs is Rs.0 · 9x1 .
Similarly, the rate of 5x2 eggs is Rs.1 · 5x2 .
Also a hen costs Rs.1 per week to feed.
∴ In a week the total profit is 0 · 9x1 + 1 · 5x2 − (x1 + x2 )1 = −0 · 1x1 + 0 · 5x2 .
The constraint on the profit is more than Rs6.Hence the constraint on profit is

−0 · 1x1 + 0 · 5x2 ≥ 6.

Step:5 The objective is to maximize the total profit −0 · 1x1 + 0 · 5x2 .

Therefore the required LPP is:
20

Find x1 and x2 so as to
maximize z = −0 · 1x1 + 0 · 5x2
subject to the constraints:
2x1 + 5x2 ≤ 80,
x1 + x2 ≤ 20,
−0 · 1x1 + 0 · 5x2 ≥ 6,
x1 ≥ 0 and x2 ≥ 0.

Next we construct the graph by considering the carteasian plane. Now the inequalities
are graphed taking them as equations.

2x1 + 5x2 = 80,

x1 + x2 = 20,

−0 · 1x1 + 0 · 5x2 = 6.

Here B is the point of intersection of two lines

2x1 + 5x2 = 80, and − 0 · 1x1 + 0 · 5x2 = 6.

Therefore the corresponding feasible region is ABC. Where the coordinates are
A(0, 12), B( 20
3 3
, 40 ) and C(0, 16).
0.5. Graphical Method 2: 21

Extreme points (x1 , x2 ) z = −0 · 1x1 + 0 · 5x2 .

A (0, 12) 6
B ( 20
3 3
, 40 ) 6

C C(0, 16) 8

Hence the solution is x1 = 0, x2 = 16 and max z = 8.

Therefore it is advisible to buy only young hens of 16 nos to get a maximum profit
Rs.8 per week.
Example 0.5.3 An animal feed company must produce 200 grams of a mixture
containing the inheridiant X1 and X2 . X1 costs Rs.3 per gram and X2 costs Rs.8 per
gram. Not more than 80 grams of X1 can be used and minimum quantity to be used
for X2 is 60 grams. Find how much of inheridiant should be used if the company
wants to minimize the cost?
Solution Let x1 be the quantity of X1 , and x2 be the quantity of X2 . The objective
is to minimize the total cost 3x1 + 8x2 of inheridiants.
Therefore the required LPP is

Find x1 and x2 so as to
minimize z = 3x1 + 8x2
subject to the constraints:
x1 ≤ 80,
x2 ≥ 60,
x1 + x2 = 200,
x1 ≥ 0 and x2 ≥ 0.

Next we construct the graph by considering the carteasian plane. Now the inequalities
are graphed taking them as equations.

x1 = 80,

x2 = 60,
22

x1 + x2 = 200.

Therefore the corresponding feasible region is the line segment joining the points A
and B. Where the coordinates are A(80, 120) and B(0, 200).

Extreme points (x1 , x2 ) z = 3x1 + 8x2 .

A (80, 120) 1200
B (0, 200) 1600

Hence the solution is x1 = 80, x2 = 120 and min z = 1200.

Therefore it is advisible to use 80 grams of inheridiant X1 and 120 grams of inheridiant
X2 .
Example 0.5.4 Use the graphical method to solve the following LPP:

Maximize z = 2x1 + 3x2 ;

subject to the constraints:
x1 + x2 ≤ 30,
0.5. Graphical Method 2: 23

x1 − x2 ≥ 0,
0 ≤ x1 ≤ 20 and 3 ≤ x2 ≤ 12.

Solution we construct the graph by considering the carteasian plane. Now the in-
equalities are graphed taking them as equations.

x1 + x2 = 30,

x1 − x2 = 0,

x1 = 20

x2 = 3 and x2 = 12.

Therefore the corresponding feasible region is ABCDE. Where the coordinates are
A(3, 3), B(20, 3), C(20, 10), D(18, 12) and E(12, 12).

Extreme points (x1 , x2 ) z = 2x1 + 3x2 .

A (3, 3) 15
B (20, 3) 49
24

C (20, 10) 70

D (18, 12) 72

E (12, 12) 60

Hence the optimum feasible solution is

x1 = 18, x2 = 12 and max z = 72.

Example 0.5.5 A firm manufactures two products A and B on which the profits
earned per unit are Rs.3 and Rs.4 respectively. Each product is processed on two
machines M1 and M2 . Product A requires one minute of processing time on M1
and two minutes on M2 while B requires one minute on M1 and one minute on M2 .
Machine M1 is available for not more than 7 hours and 30 minutes, while machine
M2 is available for 10 hours during any working day. Find the number of units of
products A and B to be manufactured to get maximum profit.
Solution The data of the given problem is listed as follows:

Products M1 (minutes) M2 (minutes) Profit (Rs)

A 3 1 2
B 4 1 1

Let x1 be the number of units of product A to be produced and x2 be the number

of units of product B to be produced.
The objective is to maximize the profit 3x1 + 4x2 .
Time availability constraints of machines M1 and M2 are:

x1 + x2 ≤ 450,

and
2x1 + x2 ≤ 600 respectively.

The linear programming problem can thus be put in the following mathematical
format:
0.5. Graphical Method 2: 25

Find x1 and x2 so as to maximize z = 3x1 + 4x2

subject to the constraints:

x1 + x2 ≤ 450,

and

2x1 + x2 ≤ 600

x1 ≥ 0 and x2 ≥ 0.

Next we construct the graph by considering the carteasian plane. Now the inequalities
are graphed taking them as equations.

x1 + x2 = 450,

and
2x1 + x2 = 600

Therefore the corresponding feasible region OABC. Where the coordinates are
O(0, 0), A(300, 0), B(150, 300) and C(0, 450).
26

Extreme points (x1 , x2 ) z = 3x1 + 4x2 .

O (0, 0) 0
A (300, 0) 900

B (150, 300) 1650

C (0, 450) 1800

Hence the solution is x1 = 0, x2 = 450 and max z = 1800.

Therefore it is advisible to be manufactured 0 units of product A and 450 units of
product B to get maximum profit Rs.1800.

0.6 Some exceptional cases of graphical method

This section considers the following three special cases that arise in the application
of the graphical method:

1. Alternative optima:
When the objective function is parallel to a binding constraint, the objective
function will assume the same optimum value at more than one solution point.
For this reason they are called alternative optima.

2. Unbounded solution:
When the values of the decision variables may be increased indefinitely without
violating any of the constraints, the solution space is unbounded. The value of
objective function, in such cases, may increase or decrease indefinitely. Thus,
both the solution space and the objective function value are unbounded.

3. Infeasible (or non-existing) solution:

When the constraints are not satisfied simultaneously, the linear programming
problem has no feasible solution. This situation can never occur if all the
constraints are of the 0 ≤0 type.

Example 0.6.1 (Alternative optima) Use graphical method to solve the LPP:
0.6. Some exceptional cases of graphical method 27

maximize z = 2x1 + 4x2

subject to the constraints:

x1 + 2x2 ≤ 5,

x1 + x2 ≤ 4

x1 ≥ 0 and x2 ≥ 0.

Solution we construct the graph by considering the carteasian plane. Now the
inequalities are graphed taking them as equations.

x1 + 2x2 = 5,

and
x 1 + x2 = 4

For x1 + 2x2 = 5, the line joins the points (0, 2 · 5) and (5, 0).
For drawing x1 + x2 = 4, the line joins the points (0, 4) and (4, 0). Therefore the
corresponding feasible region is the OABC shown in figure. Where the coordinates
are O(0, 0), A(4, 0), B(3, 1) and C(0, 2 · 5).
The unknown point B is obtained by solving the two equations

x1 + 2x2 = 5, and x1 + x2 = 4.
28

Now we find the values of z at the extreme points:

Extreme points (x1 , x2 ) z = 2x1 + 4x2 .
O (0, 0) 0
A (4, 0) 8

B (3, 1) 10

C (0, 2 · 5) 10

Here there are two extreme points gives the maximum value. Also note that any
point on the line segment BC gives the maximum value (z = 10) of the objective
function. So there are infinitely many solutions exist for the given problem.
Example 0.6.2 (Unbounded Solution) Use graphical method to solve the following
LPP:

maximize z = 6x1 + x2
subject to the constraints:

2x1 + x2 ≥ 3,

x2 − x1 ≥ 0

x1 ≥ 0 and x2 ≥ 0.

Solution we construct the graph by considering the carteasian plane. Now the
inequalities are graphed taking them as equations.

2x1 + x2 = 3, x2 − x1 = 0.

For drawing 2x1 + x2 = 3, the line joins the points (0, 3) and (1 · 5, 0).
For drawing x2 − x1 = 0, the line joins the points (0, 0) and (1, 1). Therefore the cor-
responding feasible region is unbounded and shown in figure. Where the coordinates
are A(1, 1), and B(0, 3).
0.6. Some exceptional cases of graphical method 29

Now we find the values of z at the extreme points:

Extreme points (x1 , x2 ) z = 6x1 + x2 .
A (1, 1) 7
B (0, 3) 3

Here, we observe, that the feasible region is unbounded and the value of the
objective function at the extreme points A(1, 1) and B(0, 3) are 7 and 3 respectively.
But there exist number of points in the feasible region for which the value of the
objective function is more than 7. For example, the point (1, 100) lies in the feasible
region and the objective function value at this point is 106 which is more than 7.
Thus both the variables x1 and x2 can be made arbitrarily large and the value of z
also increased. Hence, the problem has an unbounded solution.
That is there exist an infinite number of solutions to the given problem and the
optimal value of z lies at infinity.
Example 0.6.3 (Infeasible Solution) Use graphical method to solve the following
LPP:

maximize z = x1 + x2
30

subject to the constraints:

x1 + x2 ≤ 1,

−3x1 + x2 ≥ 3

x1 ≥ 0 and x2 ≥ 0.

Solution we construct the graph by considering the carteasian plane. Now the in-
equalities are graphed taking them as equations.

x1 + x2 = 1, − 3x1 + x2 = 3

For drawing x1 + x2 = 1, the line joins the points (0, 1) and (1, 0).
For drawing −3x1 + x2 = 3, the line joins the points (0, 3) and (−1, 0). The problem
is depicted graphically shown in the following figure.

From the graph, there is no point (x1 , x2 ) which can lie in the common region (satisfy
both the constraints), there exists no solution to the given problem. Hence, there is
infeasible solution.

0.7 General Linear Programming Problem

We shall consider the LPP in the general context, that is, when the number of
variables is more than two.
0.7. General Linear Programming Problem 31

Definition 0.7.1 (General Linear Programming Problem) Let z be a linear function

on Rn defined by
z = c1 x 1 + c2 x 2 + · · · + cn x n (0.1)

where cj ’s are constants. Let (aij ) be an m × n real matrix and {b1 , b2 , · · · , bm } be a

set of constants such that



 a11 x1 + a12 x2 + · · · + a1n xn ≥ or ≤ or = b1

 a x + a x + · · · + a x ≥ or ≤ or = b

21 1 22 2 2n n 2
. . . (0.2)

 .. .. ..



am1 x1 + am2 x2 + · · · + amn xn ≥ or ≤ or = bm


and finally that

xj ≥ 0, j = 1, 2, · · · , n. (0.3)

The problem of determining an n-tuple (x1 , x2 , · · · , xn ) which makes z a minimum

(or maximum) and satisfies (0.2) and (0.3) is called the general linear programming
problem.
Definition 0.7.2 (Solution) An n-tuple (x1 , x2 , · · · , xn ) of real numbers which sat-
isfies the constraints of a general LPP is called a solution to the general LPP.
Definition 0.7.3 (Feasible Solution) Any solution to a General LPP which also
satisfies the non-negative restrictions of the problem, is called a feasible solution to
the General LPP.
Definition 0.7.4 (Optimum solution) Any feasible solution which optimizes (min-
imizes or maximizes) the objective function of a General LPP is called an optimum
solution to the General LPP.
Definition 0.7.5 (Slack variables) Let the constraints of a general LPP be
n
X
aij xj ≤ bi , i = 1, 2, · · · , k.
j=1

Then, the non-negative variables xn+i which satisfy

n
X
aij xj + xn+i = bi , i = 1, 2, · · · , k.
j=1

are called slack variables.

32

Definition 0.7.6 (Surplus variables) Let the constraints of a General LPP be

n
X
aij xj ≥ bi , i = k + 1, k + 2, · · · , l.
j=1

Then, the non-negative variables xn+i which satisfy

n
X
aij xj − xn+i = bi , i = k + 1, k + 2, · · · , l.
j=1

are called surplus variables.

Definition 0.7.7 (The Canonical form of LPP) The general linear programming
problem in the form

Maximize z = c1 x1 + c2 x2 + · · · + cn xn
subject to the constraints :
ai1 x1 + ai2 x2 + · · · + ain xn ≤ bi ; i = 1, 2, · · · , m.
x1 , x2 , · · · , xn ≥ 0.
is called the canonical form of LPP.
Definition 0.7.8 (The standard form of LPP) The general linear programming prob-
lem in the form

Maximize or Minimize z = c1 x1 + c2 x2 + · · · + cn xn
subject to the constraints:
ai1 x1 + ai2 x2 + · · · + ain xn = bi ; i = 1, 2, · · · , m.
x1 , x2 , · · · , xn ≥ 0.
is called standard form of LPP.
The characteristics of the canonical form:

1. The objective function is of the maximization type.

If the given linear objective function is Minimize z = c1 x1 + c2 x2 + · · · + cn xn ,
then change it into the equivalent objective function -Maximize z ∗ = −c1 x1 −
c2 x2 − · · · − cn xn with z ∗ = −z.

2. All the constraints are of the ≤ type, except for the non-negative restrictions.
An inequality of ≥ type can be changed to an inequality of the ≤ type by
multiplying both sides of the inequality by −1.
0.7. General Linear Programming Problem 33

3. All the variables are non-negative.

A variable which is unrestricted in sign is equivalent to the difference between
two non-negative variables.

The characteristics of the standard form:

1. All the constraints are expressed in the form of equations, except for the non-
negative restrictions.

2. The right hand side of each constraint equation is non-negative.

Definition 0.7.9 (The Matrix form of Canonical form of an LPP) The general linear
programming problem in the form

Maximize z = cT x
subject to the constraints :
Ax≤ b,
x ≥ 0.
where x = (x1 , x2 , · · · , xn ), c = (c1 , c2 , · · · , cn ), bT = (b1 , b2 , · · · , bn ) and A =
(aij ); i = 1, 2, · · · , m; j = 1, 2, · · · , n.
is called the matrix form of canonical form of an LPP.
Definition 0.7.10 (The matrix form of standard form of an LPP) The general linear
programming problem in the form

Maximize or Minimize z = cT x
subject to the constraints:
Ax=b,
x ≥ 0.

where x = (x1 , x2 , · · · , xn ), c = (c1 , c2 , · · · , cn ), bT = (b1 , b2 , · · · , bn ) and A =

(aij ); i = 1, 2, · · · , m; j = 1, 2, · · · , n.
is called matrix form of standard form of an LPP.
Theorem 0.7.11 The set of feasible solutions to an LPP is a convex set.
34

Proof:
Let the LPP be to determine x so as to maximize the linear function z = cT x subject
to the constraints: Ax=b, x≥ 0.
Let x(1) ,x(2) be two feasible solutions to this problem, so that

Ax(1) = b; Ax(2) = b; x(1) ≥ 0 and x(2) ≥ 0.

Now, consider convex combination of x(1) and x(2) , namely,

x = λx(1) + (1 − λ)x(2) , 0 ≤ λ ≤ 1.

Clearly,

Ax = A[λx(1) + (1 − λ)x(2) ] = λAx(1) + (1 − λ)Ax(2) = λb + (1 − λ)b = b.

Again, since x(1) ≥ 0, x(2) ≥ 0, and λ, 1 − λ ≥ 0,

∴ x ≥ 0. Hence x is also feasible solution to the problem. Thus, the set

S = {x | x is a feasible solution to an LPP}

is a convex set.