Remesh’s Maths Coaching

12. LINEAR PROGRAMMING

The linear programming problem is one that is concerned with finding the optimal values (maximum
and minimum) of a linear function of several variables (called object function) subject to the conditions
that the variables are non-negative and satisfy a set of linear inequalities (linear constraints). Variables
are sometimes called decision variables.

1. Objective function: Function which is to be maximized or minimized subject to specified

constraints on the variables is called an object function.
2. Constraints: The linear inequalities or equations on the variables of an LPP which describe the
condition under which the maximization or minimization is to be accomplished are called
constraints.
3. Solution: Values of the variables of an LPP, which satisfy the constraints is called solution.

4. Feasible solution: Values of the variables of an LPP is called a feasible solution of the LPP, it
satisfies the constraints and non-negativity restrictions of the problems.
5. Infeasible solution: Values of the variables of an LPP are called an infeasible solution of the LPP,
if the system of constraints has no point which satisfies all the constraints and non-negativity
restrictions.
6. Feasible region: The common region determined by all the constraints including non-negative
constraints is called the feasible region.
7. Optimal feasible region: If the feasible solution of an LPP optimizes the objective function, then
the solution is called optimal feasible solution.
8. Convex polygon: A closed plane figure bounded by three or more line segments is called convex
polygon.

Graphical methods for solving LPP

9. Corner point method

i. Find the feasible region of the LPP and determines its corner points or vertices.
ii. Evaluate the object function at each corner point. Let M and m respectively be the Maximum
and Minimum values at these points.
iii. If the feasible region is bounded, M and m be the maximum and minimum values of the object
function.
iv. If the feasible region is unbounded,
a. M is the maximum value of the object function, if the open half plane determined by has no
point in common with the feasible region. Otherwise, the object function has no maximum
value.

Based on updated syllabus | www.c-fust.in 1|P a g e

 Remesh’s Maths Coaching

b. m is the minimum value of the object function, if the open half plane determined by has no
point in common with the feasible region. Otherwise, the object function has no minimum
value.

Problems

Exercise 12.1

1. Maximise Z = 3x + 4y Subject to the constraints:

Graph of:
𝑖) 𝑥 + 𝑦 = 4
𝑥 0 4
𝑦 4 0

𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑖𝑖) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

The corner points are: O (0, 0), A (4, 0), and B (0, 4).
The values of Z at these points are as follows:

Corner point Z = 3x + 4y

O(0, 0) 0

A(4, 0) 12

B(0, 4) 16 → Maximum

Therefore, the maximum value of Z is 16 at the point B (0, 4).

Based on updated syllabus | www.c-fust.in 2|P a g e

 Remesh’s Maths Coaching

2. Minimise 𝑍 = −3𝑥 + 4𝑦 subject .

Draw the graph of:

𝑖) 𝑥 + 2𝑦 = 8
𝑥 0 8
𝑦 4 0

ii) 3𝑥 + 2𝑦 = 12
𝑥 0 4
𝑦 6 0

𝑖𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

The corner points of the feasible region are O (0, 0), A (4, 0), B (2, 3), and C (0, 4).

The values of Z at these corner points are as follows.

Corner point Z = −3x + 4y

0(0, 0) 0

A(4, 0) −12 → Minimum

B(2, 3) 6

C(0, 4) 16
Therefore, the minimum value of Z is −12 at the point (4, 0).

Based on updated syllabus | www.c-fust.in 3|P a g e

 Remesh’s Maths Coaching

3. Maximise Z = 5x + 3y
subject to

𝑖) 3𝑥 + 5𝑦 = 15
𝑥 0 5
𝑦 3 0

𝑖𝑖) 5𝑥 + 2𝑦 = 10
𝑥 0 2
𝑦 5 0

𝑖𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

20 45
The corner points of the feasible region are 𝑂(0, 0), 𝐴(2, 0), 𝐵 (0, 3), 𝑎𝑛𝑑 𝐶 (19 , 19) .

The values of Z at these corner points are as follows.

Corner point Z = 5x + 3y

0(0, 0) 0

A(2, 0) 10

B(0, 3) 9

→ Maximum

235 20 45
Therefore, the maximum value of Z is at the point (19 , 19)
19

Based on updated syllabus | www.c-fust.in 4|P a g e

 Remesh’s Maths Coaching

4. Minimise Z = 3x + 5y such that .

𝑖) 𝑥 + 3𝑦 = 3
𝑥 0 3
𝑦 1 0

𝑖𝑖) 𝑥 + 𝑦 = 2
𝑥 0 2
𝑦 2 0

𝑖𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

It can be seen that the feasible region is unbounded.

3 1
The corner points of the feasible region are A (3, 0), 𝐵 (2 , 2) and C (0, 2).

The values of Z at these corner points are as follows.

Corner point Z = 3x + 5y

A(3, 0) 9

7 → Smallest

C(0, 2) 10

As the feasible region is unbounded, therefore, 7 may or may not be the minimum value of Z.

Based on updated syllabus | www.c-fust.in 5|P a g e

 Remesh’s Maths Coaching

For this, we draw the graph of the inequality, 3x + 5y < 7, and check whether the resulting half plane
has points in common with the feasible region or not.
It can be seen that the feasible region has no common point with 3x + 5y < 7.
3 1
Therefore, the minimum value of Z is 7 at 𝐵 (2 , 2). .

5. Maximise Z = 3x + 2y subject to .

𝑖) 𝑥 + 2𝑦 = 10
𝑥 0 10
𝑦 5 0

𝑖𝑖) 3𝑥 + 𝑦 = 15
𝑥 0 5
𝑦 15 0

𝑖𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

The corner points of the feasible region are A (5, 0), B (4, 3), and C (0, 5).
The values of Z at these corner points are as follows.

Corner point Z = 3x + 2y

A(5, 0) 15

B(4, 3) 18 → Maximum

C(0, 5) 10

Therefore, the maximum value of Z is 18 at the point (4, 3).

Based on updated syllabus | www.c-fust.in 6|P a g e

 Remesh’s Maths Coaching

6. Minimise and Maximise Z = 5x + 10y subject to .

𝑖) 𝑥 + 2𝑦 = 120
𝑖𝑖𝑖) 𝑥 − 2𝑦 = 0
𝑥 0 120
𝑥 0 60
𝑦 60 0
𝑦 0 30
𝑖𝑖) 𝑥 + 𝑦 = 60
𝑖𝑣) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑥 0 60
𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠
𝑦 60 0

The corner points of the feasible region are A (60, 0), B (120, 0), C (60, 30), and D (40, 20).
The values of Z at these corner points are as follows.

Corner point Z = 5x + 10y

A(60, 0) 300 → Minimum

B(120, 0) 600 → Maximum

C(60, 30) 600 → Maximum

D(40, 20) 400

The minimum value of Z is 300 at (60, 0) and the maximum value of Z is 600 at all the points on the
line segment joining (120, 0) and (60, 30).

7. Minimise and Maximise Z = x + 2y subject to

𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200; 𝑥, 𝑦 ≥ 0 .

Based on updated syllabus | www.c-fust.in 7|P a g e

 Remesh’s Maths Coaching

𝑖) 𝑥 + 2𝑦 = 100
𝑥 0 100
𝑦 50 0

𝑖𝑖) 2𝑥 − 𝑦 = 0
𝑥 0 50
𝑦 0 100

𝑖𝑖𝑖) 2𝑥 + 𝑦 = 200
𝑥 0 100
𝑦 200 0

𝑖𝑣) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

The corner points of the feasible region are A(0, 50), B(20, 40), C(50, 100), and D(0, 200).
The values of Z at these corner points are as follows.

Corner point Z = x + 2y

A(0, 50) 100 → Minimum

B(20, 40) 100 → Minimum

C(50, 100) 250

D(0, 200) 400 → Maximum

The maximum value of Z is 400 at (0, 200) and the minimum value of Z is 100 at all the points on the
line segment joining the points (0, 50) and (20, 40).

Based on updated syllabus | www.c-fust.in 8|P a g e

 Remesh’s Maths Coaching

8. Maximise Z = − x + 2y, subject to the constraints:

𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0
𝑖) 𝑥 = 3

𝑖𝑖) 𝑥 + 𝑦 = 5
𝑥 0 5
𝑦 5 0

𝑖𝑖𝑖) 𝑥 + 2𝑦 = 6
𝑥 0 6
𝑦 3 0

𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

It can be seen that the feasible region is unbounded.

The values of Z at corner points A (6, 0), B (4, 1), and C (3, 2) are as follows.

Corner point Z = −x + 2y

A(6, 0) Z=−6

B(4, 1) Z=−2

C(3, 2) Z=1
As the feasible region is unbounded, therefore, Z = 1 may or may not be the maximum value.
For this, we graph the inequality, −x + 2y > 1, and check whether the resulting half plane has points in
common with the feasible region or not.
The resulting feasible region has points in common with the feasible region.
Therefore, Z = 1 is not the maximum value. Z has no maximum value.
Based on updated syllabus | www.c-fust.in 9|P a g e
 Remesh’s Maths Coaching

9. Maximise Z = x + y, subject to 𝑥 − 𝑦 ≤ −1, −𝑥 + 𝑦 ≤ 0; 𝑥, 𝑦 ≥ 0

𝑖) 𝑥 − 2𝑦 = −1
𝑥 0 −1
𝑦 0.5 0

𝑖𝑖) − 𝑥 + 𝑦 = 0
𝑥 0 6
𝑦 0 6

𝑖𝑖𝑖) 𝑥 = 0 𝑦 𝑎𝑥𝑖𝑠
𝑖𝑣) 𝑦 = 0 𝑥 𝑎𝑥𝑖𝑠

There is no feasible region and thus, Z has no maximum value.

Based on updated syllabus | www.c-fust.in 10 | P a g e