Q1.

By graphical method, the solution of linear programming problem 1 Mark

Maximize Z = 3x1 + 5x2
Subject to
3x1 + 2x2 ≤ 18
x1 ≤ 4
x2 ≤ 6
x1 ≥ 0, x2 ≥ 0, is:
1. x1 = 2, x2 = 0, Z = 6
2. x1 = 2, x2 = 6, Z = 36
3. x1 = 4, x2 = 3, Z = 27
4. x1 = 4, x2 = 6, Z = 42

Ans: 2. x1 = 2, x2 = 6, Z = 36
Solution:
We need to maximize the function Z = 3x4 + 5x2
First, we will convert the given inequations into equations, we obtain the following equations:
3x1 + 2x2 = 18, x1 = 4, x2 = 6, x1 = 0 and x2 = 0
Region represented by 3x1 + 2x2 ≤ 18:
The line 3x1 + 2x2 = 18 meets the coordinate axes at A(6, 0) and B(0, 9) respectively.
By joining these points we obtain the line 3X1 + 2x2 = 18.
Clearly (0, 0) satisfies the inequation 3x1 + 2x2 = 18.
So the region in the plane which contain the origin represents the solution set of the inequation 3x1 + 2x2 ≤ 18.
Region represented by x1 ≤ 4:
The line x1 = 4 is the line that passes through C(4, 0) and is parallel to the Y axis.
The region to the left of the line x1 = 4 will satisfy the inequation x1 ≤ 4.
Region represented by x2 ≤ 6:
The line x2 = 6 is the line that passes through D(0, 6) and is parallel to the X axis.
The region below the line x2 = 6 will satisfy the inequation X2 ≤ 6.
Region represented by x1 ≥ 0 and x2 ≥ 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations x1 ≥ 0 and x2 ≥ 0.
The feasible region determined by the system of constraints, 3x1 + 2x2 ≤ 18, x1 ≤ 4, x2 ≤ 6, x1 ≥ 0 and x2 ≥ 0 are as follows

Corner points are O(0, 0), D(0, 6), F(2, 6), E(4, 3) and C(4, 0).
The values of the objective function at these points are given in the following table.
Points Value of Z
O(0, 0) 3(0) + 5(0) = 0
D(0, 6) 3(0) + 5(6) = 30
F(2, 6) 3(2) + 5(6) = 36
E(4, 3) 3(4) + 5(3) = 27
C(4, 0) 3(4) + 5(0) = 12
We see that the maximum value of the objective function Z is 36 which is at F(2, 6).

Q2. The corner points of the feasible region determined by the system of linear inequalities are (0, 0), (4, 0), (2, 4) and 1 Mark
(0, 5). If the maximum value of z = ax + by, where a, b > 0 occurs at both (2, 4) and (4, 0), then:
 1. a = 2b
2. 2a = b
3. a = b
4. 3a = b

Ans: 1. a = 2b
Solution:
4a + 0b = 2a + 4b
4a = 2a + 4b
4a - 2a = 4b
2a = 4b
a = 2b

Q3. The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is: 1 Mark

1. unbounded in first quadrant
2. unbounded in first and second quadrants
3. bounded in first quadrant
4. none of these

Ans: 3. bounded in first quadrant

Solution:
Converting the given inequations into equations, we obtain
y = 6, x + y = 3, x = 0 and y = 0
y = 6 is the line passing through (0, 6) and parallel to the X axis.
The region below the line y = 6 will satisfy the given inequation.
The line x + y = 3 meets the coordinate axis at A(3, 0) and B(0, 3).
Join these points to obtain the line x + y = 3
Clearly, (0, 0) satisfies the inequation x + y ≤ 3.
So, the region in xy-plane that contains the origin represents the solution set of the given equation.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations.
These lines are drawn using a suitable scale.

The shaded region represents the feasible region of the given LPP, which is bounded in the first quadrant.

Q4. Choose the correct answer from the given four options. 1 Mark
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5)
Let F = 4x + 6y be the objective function Find the
Maximum of F - Minimum of F =
1. 60.
2. 48.
3. 42.
4. 18.

Ans: 1. 60.
Solution:
Corner points Corresponding value of F = 4x + 6y
(0, 2) 12 (Minimum)
(3, 0) 12 (minimum)
(6, 0) 24
(6, 8) 72 (maxmimum)
 (0, 5) 30
Maximum of F - Minimum of F = 72 - 12 = 60.

Q5. Choose the correct answer from the given four options. 1 Mark
Corner points of the feasible region determined by the system of linear 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:
1. p = 2q
q
2. p = 2

3. p = 3q
4. p = q

q
Ans: 2. p = 2

Solution:
Corner point Corresponding value of X = px + qy; p,q > 0
(0, 3) 3q
(1, 1) p+q
(3, 0) 3p
So, condition of p and q, so that the minimum of Z occurs at (3, 0) and (1, 1) is,
p + q = 3p
⇒ 2p = q
q
∴ p =
2

Q6. Which of the following sets are convex? 1 Mark

1. {(x, y) : x + y ≥ 1}
2 2

2. {(x, y) : y ≥ x} 2

3. {(x, y) : 3x + 4y ≥ 5}2 2

4. {(x, y) : y ≥ 2, y ≤ 4}

Ans: 4. {(x, y) : y ≥ 2, y ≤ 4}
Solution:
is the region between two parallel lines, so any line segment joining any two points in it lies in it.
Hence, it is a convex set.

Q7. Which of the following is not a convex set? 1 Mark

1. {(x, y) ; 2x + 5y ≤ 7}
2. {(x, y) : x2 + y2 ≤ 4}
3. {x : |x| = 5}
4. {(x, y) : 3x2 + 2y2 ≤ 6}

Ans: 1. {x : |x| = 5}
Solution:
|x| = 5 is not a convex set as any two points from negative and positive x-axis if are joined will not lie in set.

Q8. Choose the correct answer from the given four options. 1 Mark
Let F = 3x - 4y be the objective function.
Minimum value of F is:
1. 0.
2. -16.
3. 12.
4. Does not exist.

Ans: 2. -16
Solution:
the feasible region as show in the figure, has objective function F= 3x - 4y
Corner points Corresponding value of z = 3x - 4y
(0, 0) 0
(12, 6) 12 (masimum)
(0, 4) -16 (miminum)
 We have minimum value of F is -16at (0, 4).

Q9. Let X1 and X2 are optimal solutions of a LPP, then: 1 Mark

1. X = λ X + (1 − λ)X , λ ∈ R is also an optimal solution
1 2

2. X = λ X + (1 − λ)X , 0 ≤ λ ≤ 1 given an optimal solution

1 2

3. X = λ X + (1 + λ)X , 0 ≤ λ ≤ 1 given an optimal solution

1 2

4. X = λ X + (1 + λ)X , λ ∈ R given an optimal solution

1 2

Ans: 2. X = λ X + (1 − λ)X , 0 ≤ λ ≤ 1 given an optimal solution

1 2

Solution:
A set A is convex if, for any two points X1, X2 ∈ A and λ ∈ 0, 1 imply that λ × 1 + 1 − λ × 2 ∈ A.
Since, here X1 and X2 are optimal solution
Therefore, their convex combination will also be an optimal solution
Thus, X = λ X + (1 − λ)X , 0 ≤ λ ≤ 1 gives an optimal solution.
1 2

Q10. The value of objective function is maximum under linear constraints 1 Mark
1. at the centre of feasible region
2. at (0, 0)
3. at any vertex of feasible region
4. the vertex which is maximum distance from (0, 0)

Ans: 3. at any vertex of feasible region

Solution:
In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we
obtain the maximum or minimum value.
Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.

Q11. The point at which the maximum value of x + y, subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x, y ≥ 0 1 Mark
isobtained, is:
1. (30, 25)
2. (20, 35)
3. (35, 20)
4. (40, 15)

Ans: 4. (40, 15)

Solution:
We need to maximize the function
Z=x+y
Converting the given inequations into equations, we obtain x + 2y = 70, 2x + y = 95, x = 0 and y = 0
Region represented by x + 2y ≤ 70:
The line x + 2y = 70 meets the coordinate axes at A(70, 0) and B(0, 35) respectively.
By joining these points we obtain the line x + 2y = 70.
Clearly (0, 0) satisfies the inequation x + 2y ≤ 70.
So, the region containing the origin represents the solution set of the inequation x + 2y ≤ 70.
Region represented by 2x + y ≤ 95:
The line 2x + y = 95 meets the coordinate axes at C( 95

2
, 0) and D(0, 95) respectively.
By joining these points we obtain the line 2x + y = 95.
Clearly (0, 0) satisfies the inequation 2x + y ≤ 95.
So, the region containing the origin represents the solution set of the inequation 2x + y ≤ 95.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, and y ≥ 0, are as follows.
 The corner points of the feasible region are O(0, 0), C( , E(40, 15) and B(0, 35).
95
, 0)
2

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

Corner point Z = x + y
We see that
O(0, 0) 0 + 0 = 0
the maximum
95 95 95
value of the
C( , 0) + 0, 2 =
2 2 2
objective
E(40, 1) 40 + 15 = 55
function Z is
B(0, 35) 0 + 35 = 35 55 which is at
(40, 15).

Q12. Choose the correct answer from the given four options. 1 Mark
The feasible solution for a LPP is shown in. Let Z = 3x - 4y be the objective function.

Minimum of Z occurs at:

1. (0, 0)
2. (0, 8)
3. (5, 0)
4. (4, 10)

Ans: 2. (0, 8)
Solution:
Corner points Corresponding value of Z = 3x - 4y
(0, 0)
0
(5, 0)
15 - 2
(6, 5)
-14
(6, 8)
-28
(4, 10)
-32 (Minimum)
(0, 8)
Hence, the minimum of Z occurs at (0, 8) and its minimum value is (-32).

Q13. Consider a LPP given by 1 Mark

Minimum Z = 6x + 10y
Subjected to x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0
Redundant constraints in this LPP are
1. x ≥ 0, y ≥ 0
2. x ≥ 6
3. 2x + y ≥ 10
4. none of these

Ans: 3. 2x + y ≥ 10
Solution:
Consider, x = 6
and y = 2
Now 2x + y = 10
x y (x, y)
0 10 (0, 10)
5 0 (5, 0)
 Minimum Z will be at 2x + y ≥ 10.

Q14. Choose the correct answer from the given four options. 1 Mark
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40),
(60, 20), (60, 0). The objective function is Z = 4x + 3y.
Compare the quantity in Column A and Column B.
Column A Column B
Maximum of Z 325
1. The quantity in column A is greater .
2. The quantity in column B is greater.
3. The two quantities are equal.
4. The relationship can not be determined on the basis of the information supplied.

Ans: 2. The quantity in column B is greater.

Solution:
Corner points Corresponding value of Z = 4x + 3y
(0, 0) 0
(0, 40) 120
(20, 40) 200
(60, 20) 300 (Maximum)
(60, 0) 240
Hence, maxmimum value of Z = 300 < 325
So, the quantity in column B is greater.

Q15. Choose the correct answer from the given four options. 1 Mark

Let F = 3x - 4y be the objective function. Maximum value of F is:

1. 0.
2. 8.
3. 12.
4. -18.

Ans: 3. 12.
Solution:
The feasible region as shown in the figure, has objective function F = 3x - 4y
Corner points Corresponding value of Z = 3x - 4y
(0, 0) 0
(12, 6) 12 (maximum)
(0, 4) -16 (minimum)
Hence, the maximum value of F is 12.

Q16. The optimal value of the objective function is attained at the points 1 Mark
1. given by intersection of inequations with the axes only
2. given by intersection of inequations with x-axis only
3. given by corner points of the feasible region
4. none of these
Ans: 3. given by corner points of the feasible region
Solution:
It is known that the optimal value of the objective function is attained at any of the corner point.
Thus, the potimal value of the objective function is attined at the points given by corner points of the feasible region.

Q17. Choose the correct answer from the given four options. 1 Mark
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
Let F = 4x + 6y be the objective function.
The Minimum value of F occurs at.
1. (0, 2) only.
2. (3, 0) only.
3. The mid point of the line sgment joining the points (0, 2) and (3, 0) only.
4. Any point on the line segment joining the points (0, 2) and (3, 0).

Ans: 4. Any point on the line segment joining the points (0, 2) and (3, 0).
Solution:
Corner points Corresponding value of F = 4x + 6y
(0, 2) 12 (Minimum)
(3, 0) 12 (Minimum)
(6, 0) 24
(6, 8) 72 (Maxmimum)
(0, 5) 30

Q18. Which of the following statements is correct? 1 Mark

1. Every LPP admits an optimal solution
2. A LPP admits unique optimal solution
3. If a LPP admits two optimal solution it has an infinite number of optimal solutions
4. The set of all feasible solutions of a LPP is not a converse set

Ans: 3. If a LPP admits two optimal solution it has an infinite number of optimal solutions
Solution:
Optimal solution of LPP has three types.
1. Unique
2. Infinite
3. Does not exist.
Hence, it has infinite solution if it admits two optimal solution.

Q19. If the constraints in a linear programming problem are changed 1 Mark

1. the problem is to be re-evaluated
2. solution is not defined
3. the objective function has to be modified
4. the change in constraints is ignored

Ans: 1. the problem is to be re-evaluated

Solution:
The optimisation of the objective function of a LPP is governed by the constraints.
Therefore, if the constraints in a linear programming problem are changed, then the problem needs to be re-evaluated.

Q20. The solution set of the inequation 2x + y > 5 is: 1 Mark

1. half plane that contains the origin
2. open half plane not containing the origin
3. whole xy-plane except the points lying on the line 2x + y = 5
4. none of these

Ans: 2. open half plane not containing the origin

Solution:
On putting x = 0, y = 0 in the given inequality, we get 0 > 5, which is absurd.
Therefore, the solution set of the given inequality does not include the origin.
 Thus, the solution set of the given inequality consists of the open half plane not containing the origin.

Q21. Choose the correct answer from the given four options. 1 Mark

The feasible solution for a LPP shown in Fig. 12.12. Let z = 3x - 4y be objective functio. (Maximum value of Z +
Minimum value of Z) is equal to:
1. 13.
2. 1.
3. -13.
4. -17.

Ans: 4. -17.
Solution:
Corner points Corresponding value of Z = 3x - 4y
(0, 0) 0
(5, 0) 15 (Maximum)
(6, 5) -2
(6, 8) -14
(4, 10) -28
(0, 8) -32 (Minimum)
Here, maximum value of Z + minimum value of Z = 15 - 32 = -17.

Q22. The corner points of the feasible region determined by the following system of linear inequalities: 1 Mark
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition

on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is:
1. p = q
2. p = 2q
3. p = 3q
4. q = 3p.

Ans: 4. q = 3p.
Explanation:
The maximum value of Z is unique.
It is given that the maximum value of Z occurs at two points, (3, 4) and (0, 5).
∴ Value of z at (3, 4) = Value of z at (0, 5)

⇒ p(3) + q(4) = p(0) + q(5)

⇒ 3p + 4q = 5q
⇒ q = 3p
Hence, the correct answer is D.

Q23. The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, 1 Mark
y ≤ 6, x, y ≥ 0
1. at only one point
2. at two points only
3. at an infinite number of points
4. none of these

Ans: 3. at an infinite number of points

Solution:
We need to maximize Z = 4x + 3y
First, we will convert the given inequations into equations, we obtain the following equations: 3x + 4y = 24, 8x + 6y = 48, x = 5, y = 6, x
= 0 and y = 0.
The line 3x + 4y = 24 meets the coordinate axis at A(8, 0) and B(0, 6).
Join these points to obtain the line 3x + 4y = 24.
 Clearly, (0, 0) satisfies the inequation 3x + 4y ≤ 24.
So, the region in xy-plane that contains the origin represents the solution set of the given equation.
The line 8x + 6y = 48 meets the coordinate axis at C(6, 0) and D(0, 8).
Join these points to obtain the line 8x + 6y = 48.
Clearly, (0, 0) satisfies the inequation 8x + 6y ≤ 48.
So, the region in xy plane that contains the origin represents the solution set of the given equation.
x = 5 is the line passing through x = 5 parallel to the Y axis.
y = 6 is the line passing through y = 6 parallel to the X axis.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations.
These lines are drawn using a suitable scale.
and B (0,6).
The corner points of the feasible region are O(0, 0), G(5, 0), F(5, 4

3
), E(
24

7
,
24

7
) and B(0, 6).
The values of Z at these corner points are as follows.
Corner point Z = 4x + 3y

O(0, 0) 4 × 0 + 3 × 0 = 0

G(5, 0) 4 × 5 + 3 × 0 = 20

4 4
F(5, ) 4 × 5 + 3 × = 24
3 3

24 24 24 24 196
E( , ) 4 × + 3 × = = 24
7 7 7 7 7

B(0, 6) 4 × 0 + 3 × 6 = 18

We see that the maximum value of the objective function Z is 24 which is at F(5, 4) and E( 24

7
,
24

7
).

Thus, the optimal value of Z is 24.

As, we know that if a LPP has two optimal solution, then there are an infinite number of optimal solutions.
Therefore, the given objective function can be subjected at an infinite number of points.

Q24. The corner points of the feasible region determined by the following system of linear inequalities: 1 Mark
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5).
Let Z = px + qy, where p.q > 0.
Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is:
1. P = q
2. p = 2q
3. p = 3q
4. q = 3q

Ans: 4. q = 3p
Solution:
The maximum value of Z is unique.
It is given that the maximum value of Z occurs at two points (3, 4) and (0,5).
Value of Z at (3, 4) = Value of Z at (0,5)
= p(3) + q(4) = p(0) + 7(5)
= 3p + 4q = 5q
= q = 3p

Q25. The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80, x, y ≥ 0 is: 1 Mark
1. 320
2. 300
3. 230
4. none of these

Ans: 4. none of these

Solution:
We need to maximize the function Z = 4x + 3y
Converting the given inequations into equations, we obtain
3x + 2y = 160, 5x + 2y = 200, x + 2y = 80, x = 0 and y = 0
Region represented by 3x + 2y ≥ 160:
 The line 3x + 2y = 160 meets the coordinate axes at A1603,0 and B(0, 80) respectively.
By joining these points we obtain the line 3x + 2y = 160.
Clearly (0, 0) does not satisfies the inequation 3x + 2y ≥ 160.
So, the region in xy plane which does not contain the origin represents the solution set of the inequation 3x + 2y ≥ 160.
Region represented by 5x +2y ≥ 200:
The line 5x + 2y = 200 meets the coordinate axes at C(40, 0) and D(0, 100) respectively.
By joining these points we obtain the line 5x + 2y = 200.
Clearly (0, 0) does not satisfies the inequation 5x +2y ≥ 200.
So, the region which does not contain the origin represents the solution set of the inequation 5x +2y ≥ 200.
Region represented by x +2y ≥ 80:
The line x + 2y = 80 meets the coordinate axes at E(80, 0) and F(0, 40) respectively.
By joining these points we obtain the line x + 2y = 80.
Clearly (0, 0) does not satisfies the inequation x + 2y ≥ 80.
So, the region which does not contain the origin represents the solution set of the inequation x + 2y ≥ 80.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints 3x + 2y ≥ 160,5x+2y ≥ 200, x +2y ≥ 80, x ≥ 0, and y ≥ 0 are as follows.

Here, we see that the feasible region is unbounded.

Therefore,maximum value is infinity.

Q26. Objective function of a LPP is: 1 Mark

1. a constraint
2. a function to be optimized
3. a relation between the variables
4. none of these

Ans: 2. a function to be optimized

Solution:
The objective function of a linear programming problem is either to be maximized or minimized i.e. objective function is to be
optimized.

Q27. The maximum value of Z = 4x + 2y Subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10, x, y ≥ 0 is: 1 Mark
1. 36
2. 40
3. 20
4. none of these

Ans: 4. none of these

Solution:
Consider, 2x + 3y = 18
x y (x, y)
0 6 (0, 6)
9 0 (9, 0)
Consider, x + y = 10
x y (x, y)
0 10 (0, 10)
10 0 (10, 0)
From the graph we conclude that no feasible region exist.