LINEAR PROGRAMING PROBLEM

ILLUSTRATIONS
1. Find the maximum value of the objective function Z = 5x + 10 y subject to the constraints
x + 2y ≤ 120 , x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.
2. Find the maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 40, x+ 2y ≤ 60, x ≥ 0
and
y≥0
3. Find the points where the minimum value of Z occurs:
Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
4. For the following feasible region, write the linear constraints.

5. The feasible region for LPP is shown shaded in the figure.

Let Z = 3 x – 4 y be the objective function, then write the maximumvalue of Z .

6. Feasible region for an LPP is shown shaded in the following figure. Find the point where
minimum of Z = 4 x + 3 y occurs.

7. Write the linear inequations for which the shaded area in the following figure is the solution set.

8. Write the linear inequations for which the shaded area in the following figure is the solution set.

9. Write the linear inequations for which the shaded area in the following figure is the solution set.
10. Solve the following Linear Programming Problems graphically: Maximise Z = 5x + 3y
subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0.
ANSWERS
1. 600 2.140
𝟏
3. (2, 𝟐) 4. x ≥ 0, y ≥ 0, 3x+ 2y ≥12, x +3y ≥ 11
5. 0 6. (2,5)
7. x + 2y ≤ 10, x + y ≥ 1, x – y ≤ 0, x ,y≥ 0 9. 3x + 4y ≤ 60, x +3y ≤ 30, x ≥0, y≥0
8. 5x + 4y ≤ 20, x ≥ 1, y ≥ 2
𝟐𝟑𝟓 𝟐𝟎 𝟒𝟓
10. Maximum Z = 𝟏𝟗 at 𝟏𝟗 , 𝟏𝟗

Test – 01 M.M. : 20
1 The set of all feasible solutions of a LPP is a ____ set. 1
(a) Concave (b) Convex
(c) Feasible (d) None of these
2 In a LPP, if the objective function Z = ax + by has the same maximum value 1
on two corner points of the feasible region, then every point on the line segment
joining these two points give the same……….value.
(a) minimum (b) maximum
(c) zero (d) none of these
3 In the feasible region for a LPP is ………, then the optimal value of the 1
objective function Z = ax+by may or may not exist.
(a) bounded (b) unbounded
(c) in circled form (d) in squared form
4 Region represented by x≥0, y≥0 is: 1
(a) First quadrant (b) Second quadrant
(c) Third quadrant (d) Fourth quadrant
5 The feasible region for an LPP is shown shaded in the figure. Let Z = 3x- 4y be 1
objective function. Maximum value of Z is

(a) 0 (b) 8 (c) 12 (d) -18

6 The maximum value of Z = 4x+3y, if the feasible region for an LPP is as shown 1
below, is

(a) 112 (b) 100 (c) 72 (d) 110

 7 In the given figure, the feasible region for a LPP is shown. Find the maximum 2
and minimum value of Z = x+2y

z
(a) 8 , 3.2 (b) 9 , 3.14 (c) 9 , 4 (d) None
8 The linear programming problem minimize Z= 3x+2y, 2
subject to constraints x + y ≤ 8, 3x+5y ≤ 15, x, y ≥0, has
(a) One solution (b) No feasible solution
(c) Two solutions (d) Infinitely many solutions
9 Corner points of the feasible region determined by the system of linear 2
constraints are (0,3),(1,1) and (3,0). Let Z= px + qy, where p, q>0. Condition on
p and q so that the minimum of Z occurs at (3,0) and (1,1) is
(a) p=2q (b) p= (c) p=3q (d) p=q
10 Solve the following Linear Programming Problem : 3
Max. Z = x + 2y
Subject to the constraints : x + y ≤ 50 , 3x + y ≤ 90 , x≥0 , y≥0
11 Solve the following Linear Programming Problem : 5
Min Z = x + 2y
Subject to the constraints : x + 2y ≥ 100 , 2x – y ≤ 0 , 2x + y ≤ 200 , x≥0 , y≥0

ANSWER :
1 (b) 2 (b) 3 (b) 4 (a) 5 (a) 6 (a) 7 (b) 8.(a) 9. (b) 10. Max. z =100 11.min z= 100
Test : 02 M. M. – 30
1 The common region determined by all the constraints including non-negative constraints 1
x, y ≥ 0 of a linear programming problem is called
(a) Feasible region (b) Feasible solution
(c) Optimal solution (d) Constraints
2 In the feasible region for a LPP is ………, then the optimal value of the objective function 1
Z = ax + by may or may not exist.
(a) bounded (b) unbounded
(c) in circled form (d) in squared form
3 Z = 250x + 75y is a linear objective function. Variables x and y are called ….. 1
(a) Decision variables (b) Constraints
(c) Constant (d) Objective function
4 Points within and on the boundary of the feasible region represent …… 1
(a) Infeasible solution (b) Feasible solution
(c) Objective solution (d) None
5 The maximum value of Z = 4x+3y, if the feasible region for an LPP is as shown below, is 1

(a) 112 (b) 72 (c) 110 (d) 100

6 Corner points of the feasible region determined by the system of linear constraints are (0,3),(1,1) 2
and (3,0). Let Z= px + qy, where p, q>0. Condition on p and q so that the minimum of Z occurs at
(3,0) and (1,1) is
(a) p=2q (b) p= q/2 (c) p=3q (d) p=q
7 Write the linear inequations for which the shaded area in the following figure is the solution set 2

(a) 5x + y ≤ 100 , x + y ≥ 60 (c) 5x + y ≥ 100 , x + y ≤ 60

(b) 5x + y ≥ 60 , x + y ≤ 100 (d) 5x + y ≤100 , x + y ≤ 60
8 In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum 2
value of Z = x+2y.

(a) 8 , 3.2 (b) 9 , 3.14 (c) 9 , 4 (d) None

9 Solve the following Linear Programming Problem : 3
Max. Z = x + 2y
Subject to the constraints : x + y ≤ 50 , 3x + y ≤ 90 , x≥0 , y≥0
10 Solve the following linear programming problem graphically: 3
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
11 Solve the following linear programming problem graphically: 3
Maximise Z = 4x + y
subject to the constraints:x + y ≤ 50 , 3x + y ≤ 90 , x ≥ 0, y ≥ 0
12 Find the minimum value of Z = 11x + 7y 5
Subject to x + 3y ≤ 9 , x + y ≤ 5 , x ≥ 0 , y ≥ 0
13 Solve the Linear Programming graphically: 5
Maximize Z= 9x+3y subject to2x + 3y ≤ 13 , 3x + y ≤ 5 , x ≥0 , y ≥0

ANSWER :
1 (a) 2 (b) 3 (a) 4 (b) 5 (a) 6 (b) 7 (d) 8.(b) 9. Max. z =100 10. Max. z =16
11 Max Z = 110 12. Min Z = 21 13. Max Z = 15