AMIT KUMAR GUPTA, PGT MATHEMATICS

LINEAR PROGRAMMING PROBLEM

1. The corner points of the bounded feasible region determined by a system of linear constraints
are (0,3),(1,1)and (3,0). Let Z = px + qy, where p,q>0. The 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

2. For the following feasible region,the linear constraints are :

(A) 𝑥≥0, 𝑦≥0, 3𝑥+2𝑦≥12, 𝑥+3𝑦≥11 (B) 𝑥≥0, 𝑦≥0, 3𝑥+2𝑦≤12, 𝑥+3𝑦≥11

(C) 𝑥≥0, 𝑦≥0, 3𝑥+2𝑦≤12, 𝑥+3𝑦≤11 (D) None of these

3. Based on the given shaded region as the feasible region in the graph, at which point(s) is the
objective function Z = 3x + 9y maximum?

(A) Point B (B) Point C (C) Every point on line segment CD (D) Point D

4. Corner points of the feasible region for an LPP are and .

Let 𝑥 𝑦 be the objective function. The minimum value of occurs at:

(A) only (B) only

(C) The mid-point on the line segment joining the point and only

(D)Any point on the line segment joining the points and .

5. The corner point of the feasible region determined by the system of linear constraints are
(0,10), (5,5), (15,15) and (0,20) . let Z = px+ qy , where p,q>0.
Condition on p and q so that the maximum of z occurs at both the points (15,15) and (0,20) is

(A)p = q (B)p = 2q (C)q = 2p (D)q = 3p

6. The linear function which is to be optimized in the Linear Programming Problem is known as

(A)constraints (B)optimal solution (C)objective function (D)decision variables

 AMIT KUMAR GUPTA, PGT MATHEMATICS

7. Objective function of a L.P.P is

(A) a constraint (B) a function to be optimize

(C)a relation between the variable (D) none of these

8. if the constraint in a LPP are changed

(A)the problem is to be re-evaluated (B)solution is not defined

(C) the objective function has to be modified (D) the change in constraint is ignored.

9. 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. Maximum of F – Minimum of F =
(A )60 (B) 48 (C )42 (D)18
10. The corner points of the feasible region determined by the following system of linear
inequalities: 2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0,0), (5,0), (3,4), (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
(A) p = q (B) p = 2q ( C) p = 3q ( D) q = 3p
11. Besides non negativity constraints, the figure given below is subject to which of the following
constraints

D(0,4)

A(0,2.5) B(3,1)
E(5,0)
O C(4,0)

(A)𝑥 𝑦 𝑥 𝑦 (B)𝑥 𝑦 𝑥 𝑦
(C)𝑥 𝑦 𝑥 𝑦 (D)𝑥 𝑦 𝑥 𝑦

12. The restrictions imposed on decision variables involved in an objective function of a linear
programming problem are called :
(A) Feasible solutions (B)Constraints
(C)Optimal solutions (D)Infeasible solutions
13. In a linear programming problem, the constraints on the decision variables x and y are x-3y≥0,
y≥0, 0≤x≤3, the feasible region:
(A) Is not in the first quadrant, (B) is bounded in the first quadrant,
(C) is unbounded in the first quadrant (D) does not exists

14. The feasible solution for a LPP is shown (4, 10)

(0, 8) (6, 8)
in given figure. Let Z=3x-4y be the
(6, 5)
objective function. Minimum of Z occurs at

(A) (0,0) (B)(0,8)

(B) (5,0) (D)(4,10)
 AMIT KUMAR GUPTA, PGT MATHEMATICS

15. The corner points of feasible region of the LPP 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦 is

(A) (0,0) , (4,0), (7,1), (0,4) (B (0,0), (7/2,0), (3,1), (0,4)
(C) (0,0) , (0,7), (3,1), (0,4) (D) (0,0), (7/2,0), (3,1, (4,0)
16. Of the following , which group of constraints represents the feasible region

(A) 𝑥 𝑦 𝑥 𝑦 𝑥𝑦 (B) 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦
(C) 𝑥 𝑦 𝑥 𝑦 𝑥𝑦 (D) 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦

Subjective Questions
17. Solve the following linear programming problem graphically:
𝑥 𝑧 𝑥 𝑦 , Subject to : 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦 .
18. Solve the following Linear Programming Problem graphically:
Maximize 𝑧 𝑥 𝑦
Subject to 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦
19. Find the maximum value of the objective function, 𝑥 𝑦
Subject to the constraints: 𝑥 𝑦 𝑥 𝑦 𝑥– 𝑦 𝑥 𝑦
20.
Subject to constraints , ,
21. Solve the following linear programming problem graphically
Minimize 𝑥 𝑦 Subject to constraints: 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦
22. Solve the following Linear Programming Problem graphically:
Maximize and Minimize 𝑥 𝑦 subject to the constraints:
𝑥 𝑦 𝑥 𝑦 𝑥 𝑦 𝑥 𝑦
23. Solve the linear programming problem graphically
Maximize
Subject to the constraints: ; ;
 AMIT KUMAR GUPTA, PGT MATHEMATICS

SOME IMPORTANT QUESTIONS ON CALCULUS (FOR BRIGHT LEARNERS):

1. For what value of is the function defined by
𝑥 𝑥 𝑥
𝑥 { Continuous at x= 0 ?
𝑥 𝑥
2. Find 𝑥 𝑦
⁄
3. Evaluate: ∫ 𝑥

4. Evaluate: ∫ |𝑥 | 𝑥
𝑥 𝑥
5. If 𝑥 { 𝑥 is continuous at x = 1, find a and b.
𝑥 𝑥
6. If 𝑦 𝑥 𝑥 .
7. It is given that attains local maximum value at 𝑥 . Find the value
of ‘a ‘, hence obtain all other points where the given function 𝑥 attains local maximum
values.
8. A ladder 5 m long is leaning against a wall. The bottom of the ladder is pulled along the
ground, away from the wall, at the rate of 2cm/s. How fast is its height on the wall decreasing
when the foot of the ladder is 4 m away from the wall ?

9. Find : ∫ 𝑥

10. Find: ∫ ( ) 𝑥.

11. Evaluate : ∫ 𝑥 𝑥.
12. Find the critical points and hence find absolute maximum and minimum values of a function f
given by 𝑥 𝑥 𝑥 𝑥 .
13. A rectangular sheet of tin 45 cm by 24 cm is to be made into a box without top, by cutting off
square from each corner and folding up the flaps. What should be the side of the square to be
cut off so that the volume of the box is maximum ?
14. Using integration Find the area of the region in the first quadrant enclosed by x-axis, line
𝑥 √ 𝑦 and the circle𝑥 𝑦 .
15. Find the number of points at which the function 𝑥 is not continuous.
16. Find the Differential coefficient of 𝑥 with respect to 𝑥.
17. Prove that the function 𝑥 𝑥 𝑥 is always increasing.
18. ∫
(A) ∫ (B) ∫ (C)∫ (D)∫
19. The solution of the differential equation represents a family of
(A) Straight lines (B)Circles (C)Parabolas (D)Ellipses

20. If y = tan-1( ), then find .