version: 1.

CHAPTER

5 Linear Inequalities and

Linear Programming

Animation 5.1: Feasible Solution Set

Source and credit: eLearn.Punjab
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

5.1 INTRODUCTION
Fig. 5.21
Many real life problems involve linear inequalities. Here we shall consider those We conclude that the solution set of an inequality consists of all solutions of the
problems (relating to trade, industry and agriculture etc.) which involve systems of linear inequality.
inequalities in two variables. Linear inequalities in such problems are used to prescribe
limitations or restrictions on allocation of available resources (material, capital, machine 5.2.1 Graphing of A Linear Inequality in Two Variables
capacities, labour hours, land etc.). In this chapter, our main goal will be to optimize
(maximize or minimize) a quantity under consideration subject to certain restrictions. Generally a linear inequality in two variables x and y can be one of the following forms:
The method under our discussion is called the linear programming method and it ax + by < c ; ax + by > c ; ax + by 7 c ; ax + by 8 c
involves solutions of certain linear inequalities. where a, b, c are constants and a, b are not both zero.
We know that the graph of linear equation of the form
5.2 LINEAR INEQUALITIES ax + by = c is a line which divides the plane into two disjoint regions as stated below:
(1) The set of ordered pairs (x, y) such that ax + by < c
Inequalities are expressed by the following four symbols; (2) The set of ordered pairs (x, y) such that ax + by > c
> (greater than); < (less than); 8 (greater than or equal to); 7 (less than or equal to) The regions (1) and (2) are called half planes and the line
For example (i) ax < b (ii) ax + b 8 c (iii) ax + by > c (iv) ax + by 7 c are ax + by = c is called the boundary of each half plane.
inequalities. Inequalities (i) and (ii) are in one variable while inequalities (iii) and (iv) are in Note that a vertical line divides the plane into left and right half planes while a non-
two variables. vertical line divides the plane into upper and lower half planes.
The following operations will not afect the order (or sense) of inequality while changing A solution of a linear inequality in x and y is an ordered pair of numbers which satisies
it to simpler equivalent form: the inequality.
(i) Adding or subtracting a constant to each side of it. For example, the ordered pair (1, 1) is a solution of the inequality x + 2y < 6 because
(ii) Multiplying or dividing each side of it by a positive constant. 1 + 2(1) = 3 < 6 which is true.
Note that the order (or sense) of an inequality is changed by multiplying or dividing its There are ininitely many ordered pairs that satisfy the inequality x + 2y < 6, so its graph
each side by a negative constant. will be a half plane.
Note that the linear equation ax + by = c is called “associated or corresponding
Now for revision we consider inequality, x <
3
(A) equation” of each of the above mentioned inequalities.
2
All real numbers <
3
are in the solution set of (A). Procedure for Graphing a linear Inequality in two Variables
2
 3
(i) The corresponding equation of the inequality is irst graphed by using ‘dashes’ if the
Thus the interval  - ∞,  or - ∞ < x <
3
 2
is the solution set of the inequality involves the symbols > or < and a solid line is drawn if the inequality involves
2
the symbols 8 or 7.
inequality (A) which is shown in the igure 5.21 (ii) A test point (not on the graph of the corresponding equation) is chosen which
determines that the half plane is on which side of the boundary line.

version: 1.1 version: 1.1

2 3
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

Example 1. Graph the inequality x + 2y < 6.

Solution. The associated equation of the inequality Note: 2 All points on the line (ii) and above the line (ii)
x + 2y < 6 (i) satisfy the inequality x + 2y 8 6 .... (v). This means that
is x + 2y = 6 (ii) the solution set of the inequality (v) consists of all points
above the line (ii) and all points on the lines (ii). The graph
The line (ii) intersects the x-axis and y-axis at (6, 0) and of the inequality (v) is partially shown as shaded region
(0. 3) respectively. As no point of the line (ii) is a solution in igure 5.22(d)
of the inequality (i), so the graph of the line (ii) is shown by Note: 3 that the graphs of
using dashes. We take O(0, 0) as a test point because it is x + 2y 7 6 and x + 2y 8 6 are closed half planes.
not on the line (ii).

Substituting x = 0, y = 0 in the expression x + 2y gives

0 - 2(0) = 0 < 6, so the point (0, 0) satisies the inequality (i).
Example 2. Graph the following linear inequalities in
xy-plane;
Any other point below the line (ii) satisies the (i) 2x 8 - 3 (ii) y 7 2
inequality (i), that is all points in the half plane containing Solution. The inequality (i) in xy-plane is considered as
the point (0, 0) satisfy the inequality (i). 2x + 0y 8 - 3 and its solution set consists of all point (x, y)
Thus the graph of the solution set of inequality (i) is the a
such that x, y d R and x ≥ -
region on the origin-side of the line (ii), that is, the region 3
below the line (ii). A portion of the open halfplane below 2
The corresponding equation of the inequality (i) is
2x = -3
the line (ii) is shown as shaded region in igure 5.22(a)
(1)
All points above the dashed line satisfy the
which a vertical line (parallel to the y-axis) and its
inequality x + 2y > 6 (iii)
graph is drawn in igure 5.23(a).
The graph of the inequality 2x > -3 is the open half
A portion of the open half plane above the line (ii) is
shown by shading in igure 5.22(b)
plane to the right of the line (1).
Thus the graph of 2x 8 -3 is the closed half-plane to
the right of the line (1).
Note: 1. The graph of the inequality x + 2y 7 6 ..(iv)
(ii) The associated equation of the inequality (ii) is
includes the graph of the line (ii),’ so the open half-plane
y=2 (2)
below the line (ii) including the graph of the line (ii) is the
which is a horizontal line (parallel to the x-axis) and its
graph of the inequality (iv). A portion of the graph of the
graph is shown in igure 5.23(b) Here the solution
inequality (iv) is shown by shading in igure 5.22(c)
set of the inequality y < 2 is the open half plane below
the boundary line y = 2. Thus the graph of y 7 2 consists
of the boundary line and the open half plane below it.
version: 1.1 version: 1.1

4 5
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

We draw the graph of the line 2x + y = 2 joining

the points (1, 0) and (0, 2). The point (0, 0) does not
satisfy the inequality 2x + y > 2 because 2(0) + 0 = 0
Note that the intersection of graphs of 2x 8 -3 and > 2. Thus the graph of the inequality 2x + y 8 2 is the
y 72 is partially shown in the adjoining igure 5.23(c). closed half-plane not on the origin-side of the line
2x + y = 2.

5.3 REGION BOUNDED BY 2 OR 3 Thus the closed half-plane is shown partially as a

SIMULTANEOUS INEQUALITIES shaded region in igure 5.31(b). The solution region of
the given system of inequalities is the intersection of
The graph of a system of inequalities consists of the set of all ordered pairs (x, y) in the the graphs indicated in igures 5.31(a) and 5.31(b) and is
xy-plane which simultaneously satisfy all the inequalities in the system. Find the graph of shown as shaded region in igure 5.31(c).
such a system, we draw the graph of each inequality in the system on the same coordinate The intersection point (2, - 2) can be found by
axes and then take intersection of all the graphs. The common region so obtained is called solving the equations x - 2y = 6 and 2x + y = 2.
the solution region for the system of inequalities.

Example 1: Graph the system of inequalities

x - 2y 7 6
2x + y 8 2

Solution. Note that the line x - 2y = 6 and 2x + y = 2 divide the

The graph of the line x - 2y = 6 is drawn by joining xy-plane into four region bounded by these lines. These
the point (6, 0) and (0, -3). The point (0,0) satisfy the four (bounded) regions are displayed in the adjoining
inequality x - 2y < 6 because 0 - 2(0) = 0 < 6. Thus the igure.
graph of x - 2y 7 6 is the upper half-plane including
the graph of the line x - 2y = 6. The closed half-plane is
partially shown by shading in igure 5.31(a).

version: 1.1 version: 1.1

6 7
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

Example 2. Graph the solution region for the following system of inequalities: Example 3. Graph the following systems of inequalities.
x - 2y 7 6, 2x + y > 2, x + 2y 8 1 0
(i) 2x + y 8 2 (ii) 2x + y 8 2 (iii) 2x + y 8 2
x + 2y 7 10 x + 2y 7 10 x + 2y 7 10
Solution: The graph of the inequalities x - 2y 7 6 and y80 x80 x 8 0, y 8 0
2x + y 8 2 have already drawn in igure 5.31(a) and
5.31(b) and their intersection is partially shown as a Solution:
shaded region in igure 5.31(c) of the example 1 Art (i) The corresponding equations of the inequalities
(5.3). Following the procedure of the example 1 of Art 2x + y 8 2 and x + 2y 7 10 are
(5.3) the graph of the inequality x + 2y 7 10 is shown 2x + y = 2 (I) and x + 2y = 10 (II)
partially in the igure 5.32(a). For the partial graph of 2x + y 8 2 see igure 5.31(b) of the example 1 and the graph of
the inequality x + 2y 7 10 is partially shown in igure 5.32(a) of the example 2.

The intersection of three graphs is the required The solution region of the inequalities
solution region which is the shaded triangular region 2x + y 8 2 and x + 2y 7 10 is the intersection of their
PQR (including its sides) shown partially in the igure individual graphs. The common region of the graphs
5.32(b). of inequalities is partially shown as a shaded region in
igure 5.33(a).
Now we deine a corner point of a solution region.

DEFINITION:
A point of a solution region where two of its boundary lines intersect, is called a
corner point or vertex of the solution region.
The graph of y 8 0 is the upper half plane
Such points play a useful role while solving linear programming problems. In example
including the graph of the corresponding line y = 0
2, the following three corner points are obtained by corresponding equations (of linear
(the x-axis) of the linear inequality y 8 0. The graph of
inequalities given in the example 2) in pairs.
y 8 0 is partially displayed in igure 5.33(b).
Corresponding lines of inequalities: Corner Points
x - 2y = 6, 2x + y = 2 P(2, -2)
x - 2y = 6, x + 2y = 10 Q(8, 1)
2x + y = 2, x + 2y = 10 R(-2, 6)
version: 1.1 version: 1.1

8 9
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

The solution region of the system of (iii) The graphs of the system of inequalities in (iii)
inequalities in (i) is the intersection of the graphs are drawn in the solution of (i) and (ii). The solution
shown in igure 5.33(a) and 5.33(b). This solution region in this case, is shown as shaded region ABCD
region is displayed in igure 5.33(c). in igure 5.34. (c).

(ii) See igure 5.33(a) for the graphs of the inequalities 2x + y 8 2 and x + 2y 7 10.
EXERCISE 5.1

1. Graph the solution set of each of the following linear inequality in xy-plane:
(i) 2x + y 7 6 (ii) 3x + 7y 8 21 (iii) 3x - 2y 8 6
The graph of x 8 0 consists of the open (iv) 5x - 4y 7 20 (v) 2x + 1 8 0 (vi) 3y - 4 7 0
half-plane to the right of the corresponding line 2. Indicate the solution set of the following systems of linear inequalities
x = 0 (y-axis) of the inequality x 8 0 and its graph. by shading:
See igure 5.34(a). (i) 2x - 3y 7 6 (ii) x + y 8 5 (iii) 3x + 7y 8 21
2x + 3y 7 12 -y + x 7 1 x-y72
(iv) 4x - 3y 7 12 (v) 3x + 7y 8 21

x ≥ -
3
y74
2
3. Indicate the solution region of the following systems of linear inequalities
Thus the solution region of the inequalities in by shading:
(ii) is partially shown in igure 5.34(b). This region (i) 2x - 3y 7 6 (ii) x + y 7 5 (iii) x + y 8 5
is the intersection of graphs in igure 5.33(a) and 2x + 3y 7 12 y - 2x 7 2 x-y81
5.34(a). y80 x80 y80
(iv) 3x + 7y 7 21 (v) 3x + 7y 7 21 (vi) 3x + 7y 7 21
x-y72 x-y72 2x - y 8 -3
x80 y80 x80

version: 1.1 version: 1.1

10 11
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

4. Graph the solution region of the following system of linear inequalities and It is the polygonal region ABCDE (including its sides)
ind the corner points in each case. as shown in the igure 5.51.
(i) 2x - 3y 7 6 (ii) x + y 7 5 (iii) 3x + 7y 7 21
2x + 3y 7 12 -2x + y 7 2 2x - y 7 -3 Such a region (which is restricted to the irst
x80 y80 y80 quadrant) is referred to as a feasible region for the set
(iv) 3x + 2y 8 6 (v) 5x + 7y 7 35 (vi) 5x + 7y 7 35 of given constraints. Each point of the feasible region
x + 3y 7 6 -x + 3y 7 3 x - 2y 7 2 is called a feasible solution of the system of linear
y80 x80 x80 inequalities (or for the set of a given constraints). A set
5. Graph the solution region of the following system of linear inequalities consisting of all the feasible solutions of the system of
by shading. linear inequalities is called a feasible solution set.
(i) 3x - 4y 7 12 (ii) 3x - 4y 7 12 (iii) 2x + y 7 4
3x + 2y 8 3 x + 2y 7 6 2x - 3y 8 12 Example 1. Graph the feasible region and ind the corner points for the following
x + 2y 7 9 x+y81 x + 2y 7 6 system of inequalities (or subject to the following constraints).
(iv) 2x + y 7 10 (v) 2x + 3y 7 18 (vi) 3x - 2y 8 3 x-y73
x+y77 2x + y 7 10 x + 4y 7 12 x + 2y 7 6 , x 8 0, y80
-2x + y 7 4 -2x + y 7 2 3x + y 7 12
Solution: The associated equations for the inequalities
5.4 PROBLEM CONSTRAINTS x - y 7 3 (i) and x + 2y 7 6 (ii)
are x - y = 3 (1) and x + 2y = 6 (2)
As the point (3, 0) and (0, -3) are on the line (1),
so the graph of x - y = 3 is drawn by joining the points
In the beginning we described that linear inequalities prescribe limitations and

(3, 0) and (0, -3) by solid line.

restrictions on allocation of available sources. While tackling a certain problem from every
day life each linear inequality concerning the problem is named as problem constraint.
The system of linear inequalities involved in the problem concerned are called problem Similarly line (2) is graphed by joining the points
constraints. The variables used in the system of linear inequalities relating to the problems (6, 0) and (0, 3) by solid line. For x = 0 and y = 0, we
of every day life are non-negative and are called non-negative constraints. These non- have;

0 - 0 = 073 and 0 + 2(0) = 076,

negative constraints play an important role for taking decision. So these variables are called
decision variables.

5.5 Feasible solution set so both the ciosed half-planes are on the origin
sides of the lines (1) and (2). The intersection of these
We see that solution region of the inequalities in example 2 of Art 5.3 is not within the closed half-planes is partially displayed as shaded
irst quadrant. If the nonnegative constraints x 8 0 and y 8 0 are included with the system of region in igure 5.52(a).
inequalities given in the example 2, then the solution region is restricted to the irst quadrant.

version: 1.1 version: 1.1

12 13
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

Example 2. A manufacturer wants to make two types of concrete. Each bag of Agrade
concrete contains 8 kilograms of gravel (small pebbles with coarse sand) and 4 kilograms of
cement while each bag of B-grade concrete contains 12 kilograms of gravel and two kilograms
For the graph of y 8 0, see igure 5.33(b) of cement. If there are 1920 kilograms of gravel and 480 kilograms of cement, then graph
of the example 3 of art 5.3. the feasible region under the given restrictions and ind corner points of the feasible region.

The intersection of graphs shown in Solution: Let x be the number of bags of A-grade concrete produced and y denote the
igures 5.52(a) and 5.33(b) is partially graphed number of bags of B-grade concrete produced, then 8x kilograms of gravel will be used
as shaded region in igure 5.52(b). for A-grade concrete and 12y kilograms of gravel will be required for B-grade concretes so
8x + 12y should not exceed 1920, that is,
8x + 12y 7 1920
Similarly, the linear constraint for cement will be
4x + 2y 7 480
Now we have to graph the feasible region for the
linear constraints
8x + 12y 7 1920
The graph of x 8 0 is drawn in igure
4x + 2y 7 480, x 8 0, y 8 0
5.34(a). The intersection of the graphs shown
in igures 5.52(a) and 5.34(a) is graphed in
Taking the one unit along x-axis and y-axis
igure 5.52(c).
equal to 40 we draw the graph of the feasible region
required.
The shaded region of igure 5.53(a) shows the
graph of 8x + 12y 7 1920 including the nonnegative
constraints x 8 0 and y 8 0

Finally the graph of the given system

of linear inequalities is displayed in igure In the igure 5.53(b), the graph of 4x + 2y 7 480
5.52(d) which is the feasible region for the including the non-negative constraints x 8 0 and y 8 0
given system of linear inequalities. The is displayed as shaded region.
points (0, 0), (3, 0), (4, 1) and (0, 3) are corner
points of the feasible region.

version: 1.1 version: 1.1

14 15
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

The intersection of these two graphs is shown as

The graph of 2x + y 8 2 is the closed half-plane
shaded region in igure 5.53(c), which is the feasible
not on the origin side of 2x + y = 2. The portion of
region for the given linear constraints.
the graph of the system 2x + y 8 2,
The point (0, 0), (120, 0), (60, 120) and (0, 160) are
x 8 0, y 8 0
the corner points of the feasible region.
is displayed as shaded region in igure 5.54(b).

Example 3. Graph the feasible regions subject to the following constraints.

(a) 2x - 3 y 7 6 (b) 2x - 3y 7 6 The graph of the system
2x + y 8 2 2x + y 8 2 2x - 3y 7 6, 2x + y 7 2,
x 8 0, y 8 0 x + 2y < 8, x 8 0, y 8 0 x 8 0, y 8 0

is the intersection of the graphs shown in

Solution: The graph of 2x - 3y 7 6 is the igures 5.54(a) and 5.54(b) and it is partially displayed
closed half-plane on the origin side of in igure 5.54(c) as shaded region.
2x - 3y = 6. The portion of the graph of
system 2x - 3y 7 6,
x 8 0, y 8 0
is shown as shaded region in igure 5.54(a).
(b) The graph of system x + 2y 7 8, x 8 0, y 8 0 is
a triangular region indicated in igure 5.45(d).
Thus the graph of the system
2x - 3y 7 6
2x + y 8 2
x + 2y 7 8 x 8 0, y 8 0

version: 1.1 version: 1.1

16 17
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

is the intersection of the graphs shown in igures 2. Graph the feasible region of the following system of linear inequalities and
5.54(c) and 5.54(d). It is the shaded region indicated ind the corner points in each case.
in the igure 5.54(e). (i) 2x + y 7 10 (ii) 2x + 3y 7 18 (iii) 2x + 3y 7 18
x + 4y 7 12 2x + y 7 10 x + 4y 7 12
Note: The corner points of feasible region x + 2y 7 10 x + 4y 7 12 3x + y 7 12
the set of constraints in (a) are (1, 0), (3, 0) and x 8 0, y 8 0 x80,y80 x 8 0, y 8 0
(0, 2) while the corner points of the feasible (iv) x + 2y 7 14 (v) x + 3y 7 15 (vi) 2x + y 7 20
region for the set of constraints in (b) are (1, 0), 3x + 4y 7 36 2x + y 7 12 8x+15y 7120
2x + y 7 10 4x + 3y 7 24 x + y 7 11
 36 10 
(3, 0),  ,  , (0, 4) and (0, 2)
 7 7
x 8 0, y 8 0 x 8 0, y 8 0 x 8 0, y 8 0

We see that the feasible solution regions in example 3(a) and 3(b) are of diferent types. 5.6 LINEAR PROGRAMMING
The feasible region in example 3(a) is unbounded as it cannot be enclosed in any circle how
large it may be while the feasible region in example 3(b) can easily be enclosed within a A function which is to be maximized or minimized is called an objective function.
circle, so it is bounded. If the line segment obtained by joining any two points of a region lies Note that there are ininitely many feasible solutions in the feasible region. The feasible
entirely within the region, then the region is called convex. solution which maximizes or minimizes the objective function is called the optimal solution.
The theorem of linear programming states that the maximum and minimum values of the
Both the feasible regions of example 3(a)
objective function occur at corner points of the feasible region.
and 3(b) are convex but the regions such
as shown in the adjoining igures are not Procedure for determining optimal solution:
convex. (i) Graph the solution set of linear inequality constraints to determine feasible region.
(ii) Find the corner points of the feasible region.
(iii) Evaluate the objective function at each corner point to ind the optimal solution.

EXERCISE 5.2 Example 1. Find the maximum and minimum values of

the function deined as:
f(x, y) = 2x + 3y subject to the constraints;
x-y72 2x - y 7 6, x 8 0
1. Graph the feasible region of the following system of linear inequalities and
ind the corner points in each case. x+y74
(i) 2x - 3y 7 6 (ii) x + y 7 5 (iii) x + y 7 5
2x + 3y 7 12 -2y + y 7 2 -2x + y 8 2 Solution. The graphs of x - y 7 2 is the closed half plane on
x 8 0, y 8 0 x 8 0, y 8 0 x80 the origin side of x - y = 2 and the graph of x + y 7 4 is the
(iv) 3x + 7y 7 21 (v) 3x + 2y > 6 (vi) 5x + 7y 7 35 closed half-plane not on the origin side of x + y = 4. The graph
x-y73 x+y74 x - 2y 7 4 of the system
x 8 0, y 8 0 x 8 0, y 8 0 x 8 0, y 8 0 x - y 7 2, x + y 8 4
version: 1.1 version: 1.1

18 19
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

including the non-negative constraints x 8 0 is Solution. The graphs of 2x - 3y 7 6, 2x + y 8 2, are displayed in the example 3 of
partially displayed as shaded region in the igure 5.61. Art. 5.5. Joining the points (6. 0) and (0, 4), we obtain the graph of the line 2x + 3y = 12. As
The graph of 2x - y 7 6 consists of the graph of the line 2(0) + 3(0) = 0 < 12, so the graph of 2x + 3y < 12 is the half plane below the line 2x + 3y = 12.
2x - y = 6 and the half plane on the origin side of the line Thus the graph of 2x + 3y 7 12 consists of the graph of the line 2x + 3y = 12 and the half plane
2x - y=6. A portion of the solution region of the given below the line 2x + 3y = 12. The solution region of 2x - 3y 7 6, 2x + y 8 2 and 2x + 3y 7 12 is the
system of inequalities is shaded in the igure 5.62. triangular region PQR shown in igure 5.63. The non-negative constraints x 8 0,
We see that feasible region is unbounded upwards y 80 indicated the irst quadrant. Thus the feasible region satisfying all the constrains is
and its corner points are A(0, 4), B(3, 1) and C(4, 2). shaded in the igure 5.63 and its corner points are (1, 0) (0, 2), (0, 4),

9 
Note that the point at which the lines x + y = 4 and
2x - y = 6 intersect is not a corner point of the feasible  , 1 and (3, 0).
2 
region.
It is obvious that the expression 2x + 3y does not We ind values of f at the corner points.
posses a maximum value in the feasible region because Corner
f(x, y) = 4x + 5y
its value can be made larger than any number by point
(1, 0) f (1, 0) = 4 x 1 + 5.0 = 4
increasing x and y. We calculate the values of f at the
(0, 2) f (0, 2) = 4 x 0 + 5.2 = 10
corner points to ind its minimum value:
(0, 4) f (0, 4) = 4 x 0 + 5.4 = 20
f (0, 4) = 2(0) + 3 x 4 = 12
(9/2, 1) f (9/2, 1) = 4 x 9/2 + 5.1 = 23
f (3, 1) = 2x3+3x1 = 6+3=9
(3, 0) f (3, 0) = 4 x 3 + 50 x 0 = 12
f (4, 2) = 2x4+3x2 = 8 + 6 = 14
From the above table, it follows that the minimum value of f is 4 at the corner point
Thus the minimum value of 2x + 3y is 9 at the corner point (3, 1).
9 
(1, 0) and maximum value of f is 23 at the corner point  , 1 . The values of f at the corner
Note: lf f(x , y) = 2x + 2y, then f (0 , 4) = 2 x 0 + 2 x 4 = 8, f (3, 1) = 2 x 3 + 2 x 1 = 6 + 2 = 8 2 
points are given below in tabular form.
and f(4, 2) = 2 x 4 + 2 x 2 = 8 + 4 =12. The minimum value of 2x + 2y is the same at two corner points

f(x, y) = 4x + 5y
(0, 4) and (3, 1).
Corner point
f (1, 0) = 4.1 + 6.0 = 4
We observe that the minimum value of 2x + 2y at each point of the line segment AB is
(1, 0)
8 as: f (0, 2) = 4.0 + 6.2 = 12
f(x, y) = 2x + 2(4 - x) (a x + y = 4 ⇒ y = 4 - x)
(0, 2)
(0, 4) f (0, 4) = 4.0 + 6.4 = 24
= 2x + 8 - 2x = 8 (9/2, 1) f (9/2, 1) = 4 . 9/2 + 6.1 = 24
(3, 0) f (3, 0) = 4 x 3 + 6.0 = 12
Example 2. Find the minimum and maximum values of f and f deined as: The minimum value of f is 4 at the point (1, 0) and maximum value of f is 24 at the
f(x, y) = 4x + 5y, f (x, y) = 4x + 6y
9 
corner points (0, 4) and  , 1 . As observed in the above example, it follows that the
2 
under the constraints
2x - 3y 7 6
function f has maximum value at all the points of the line segment between the points
2x + y 8 2 2x + 3y 7 12 x 8 0, y 8 0

version: 1.1 version: 1.1

20 21
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

Now the problem is to maximize the proit function P under the given constraints.
9 
(0, 4) and  , 1 .
Graphing the inequalities, we obtain the feasible region which is shaded in the igure 5.71.
2  Solving the equations x + y = 100 and 3x + 2y = 240 gives x = 240 - 2(x + y) = 240 - 200 = 40
and y = 100 - 40 = 60, that is; their point of intersection is (40, 60). The corner points of the
Note 1. Some times it may happen that each point of constraint line gives the optimal
feasible region are (0, 0),(0, 100), (40, 60) and (80, 0).
value of the objective function.
Now we ind the values of P at the corner points.
Corner point P(x, y) = 20x + 15y
Note 2. For diferent value of k, the equation 4x + 5y = k represents lines parallel to the
(0, 0) P(0, 0) = 2 0 x 0 + 15 x 0 = 0
line 4x + 5y = 0. For a certain admissible value of k, the intersection of 4x + 5y = k with the
(0, 100) P(0, 100) = 20 x 0 + 15 x 100 = 1500
feasible region gives feasible solutions for which the proit is k.
(40, 60) P(40, 60) = 20 x 40 + 15 x 60 = 1700
(80, 0) P(80, 0) = 20 x 80 + 15 x 0 = 1600
5.7 LINEAR PROGRAMMING PROBLEMS From the above table, it follows that the maximum proit is Rs. 1700 at the corner point
(40, 60). Thus the farmer will get the maximum proit if he cultivates 40 canals of corn and
Convert a linear programming problem to a mathematical form by using variables,
60 canals of wheat.
then follow the procedure given in Art 5.6.
Exam ple 2. A factory produces bicycles and motorcycles by using two machines A and
Example 1: A farmer possesses 100 canals of land and wants to grow corn and wheat.
B. Machine A has at most 120 hours available and machine B has a maximum of 144 hours
Cultivation of corn requires 3 hours per canal while cultivation of wheat requires 2 hours per
available. Manufacturing a bicycle requires 5 hours in machine A and 4 hours in machine B
canal. Working hours cannot exceed 240. If he gets a proit of Rs. 20 per canal for corn and
while manufacturing of a motorcycle requires 4 hours in machine A and 8 hours in machine
Rs. 15/- per canal for wheat, how many canals of each he should cultivate to maximize his
B. If he gets proit of Rs. 40 per bicycle and proit of Rs. 50 per motorcycle, how many bicycles
proit?
and motorcycles should be manufactured to get maximum proit?
Solution: Suppose that he cultivates x canals of corn
and y canals of wheat. Then constraints can be written Solution: Let the number of bicycles to be
as: manufactured be x and the number of motor cycles to
x + y 7 100 be manufactured be y.
3x + 2y 7 240
Then the time required to use machine A for x
Non-negative constraints are x 8 0, y 8 0. Let P(x, y) bicycles and y motorcycles is 5x + 4y (hours) and the time
be the proit function, then required to use machine B for x bicycles and y motorcycles
P(x, y) = 20x + 15y in 4x + 8y (hours). Thus the problem constraints are
5x + 4y 7 120
And 4x + 8y 7 144
⇒ 2x + 4y 7 72 .

version: 1.1 version: 1.1

22 23
1. Quadratic Equations eLearn.Punjab 1. Quadratic Equations eLearn.Punjab
5. Linear Inequalities and Linear Programming eLearn.Punjab 5. Linear Inequalities and Linear Programming eLearn.Punjab

5. Maximize the function deined as; f(x, y) = 2x + 3y subject to the constraints:

Since the numbers of articles to be produced cannot be negative, so x 8 0, y 8 0. 2x + y 7 8; x + 2y 7 14; x 8 0; y80
Let P(x, y) be the proit function, then P(x, y) = 40x + 50y. 6. Minimize z = 3x + y; subject to the constraints:
Now the problem is to maximize P subject to the constraints: 3x + 5y 8 15; x + 6y 8 9; x 8 0; y80
5x + 4y 7 120 7. Each unit of food X costs Rs. 25 and contains 2 units of protein and 4 units of iron
2x + 4y 7 72 ; x80,y80 while each unit of food Y costs Rs. 30 and contains 3 units of protein and 2 unit of iron.
Solving 5x + 4y = 120 and 2x + 4y = 72, gives 3x = 48 ⇒ x = 16 and Each animal must receive at least 12 units of protein and 16 units of iron each day.
4y = 72 - 2x = 72 - 32 = 40 ⇒ y = 10. How many units of each food should be fed to each animal at the smallest
Thus their point of intersection is (16, 10). Graphing the linear inequality constraints, possible cost?
the feasible region obtained is depicted in the igure 5.72 by shading. The corner points of 8. A dealer wishes to purchase a number of fans and sewing machines. He has only
the feasible region are (0, 0), (0, 18), (16, 10) and (24, 0). Rs. 5760 to invest and has space atmost for 20 items. A fan costs him Rs. 360 and
Now we ind the values of P at the comer points. a sewing machine costs Rs. 240. His expectation is that the can sell a fan at a proit
Corner point P(x, y) = 40x + 50y of Rs. 22 and a sewing machine at a proit of Rs. 18. Assuming that he can sell all the
(0, 0) P(0, 0) = 40 x 0 + 50 x 0 = 0 items that he can buy, how should he invest his money in order to maximize his proit?
(0, 18) P(0, 18) = 40 x 0 + 50 x 18 = 900 9. A machine can produce product A by using 2 units of chemical and 1 unit of a
(16, 10) P(16, 10) = 40 x 16 + 50 x 10 = 1140 compound or can produce product B by using 1 unit of chemical and 2 units of the
(24, 0) P(24, 0) = 40 x 24 + 50 x 0 = 960 compound. Only 800 units of chemical and 1000 units of the compound are available.
From the above table, it follows, that the maximum proit is Rs. 1140 at the corner The proits per unit of A and B are Rs. 30 and Rs. 20 respectively, maximize the
point (16, 10). Manufacturer gets the maximum proit if he manufactures 16 bicycles and 10 proit function.
motorcycles.

EXERCISE 5.3

1. Maximize f(x, y) = 2x + 5y
subject to the constraints
2y - x 7 8; x - y 7 4; x 0 8 0; y80
2. Maximize f(x , y) = x + 3y
subject to the constraints
2x + 5y 7 30; 5x + 4y 7 20; x 8 0; y80
3. Maximize z = 2x + 3y; subject to the constraints:
3x + 4y 7 12; 2x + y 7 4: 4x - y 7 4; x 8 0; y 8 0
4. Minimize z = 2x + y: subject to the constraints:
x + y 8 3; 7x + 5y 7 35; x 8 0; y80

version: 1.1 version: 1.1

24 25