LI NEAR MCQ – 1;

Six Marks – 1;

Total Marks - 7

D EFI NI TI ONS:
1. Define linear objective function.
Sol n: In a linear programming problem, Z = ax + by (where a and b are constants) the linear function of
the variables x and y which is to be optimized (maximized or minimized) is called objective function.

2. Define feasible region (solution region).

Sol n: The common region determined by all the constraints of a LPP is called the feasible region
(solution region)
3. Define optimal solution.
Sol n: Any point in the feasible region that gives the optimal value (maximum or minimum) of the
objective functions is called optimal solution.
4. Define corner points.
Sol n: Vertex of the feasible region is called a corner point.
5. Define constraints.
Sol n: The linear inequalities or equations or restrictions on the variables of the linear programming problem are
called constraints.
6. Define Optimization problem.
Sol n: A problem which seeks to maximize or minimize a linear function subjected to constraints as determined
by a set of linear inequalities is called an optimization problem.

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 1

 MCQ:

1. The feasible solution of a L.P.P. belongs to

a) first and second quadrant b) first and third quadrant
c) second quadrant d) only first quadrant
n
Sol : d) only first quadrant
2. The corner points of the feasible region determined by the following system of linear inequalities:
2 x + y  10 , x + 3 y  15 , x, y  0 are ( 0, 0 ) , ( 5, 0 ) , ( 3, 4 ) and ( 0, 5 ) . Let Z = ax + by ,

where a, b  0 . Condition on a and b so that the maximum of Z occurs at both ( 3, 4 ) and ( 0, 5 ) is

a) a = b b) a = 2b c) a = 3b d) b = 3a

Sol n: d) b = 3a

3. In a Linear programming problem, the objective function is always

a) a cubic function b) a quadratic function c) a linear function d) a constant function

Sol n: c) a linear function

4. Feasible region is the set of points which satisfy

a) The objective function b) Non negative constraints

c) All the constraints and non-negative restrictions d) Some of the given constraints
Sol n : c) All the constraints and non-negative restrictions
5. The number of feasible solution of a L.P.P is
a) one b) two c) finite d) infinite

Sol n: d) infinite

6. Of all the points of the feasible region for maximum or minimum of objective function the points
a) Inside the feasible region b) at the boundary line of the feasible region
c) vertex points of the boundary of the feasible region d) None of the above
Sol n: c) vertex points of the boundary of the feasible region

7. The corner points of the feasible region determined by the following system of linear inequalities:
2 x + y  10 , x + 3 y  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
a) p = q b) p = 2q c) p = 3q d) q = 3 p
n
Sol : d) q = 3 p

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 2

8. 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
q
a) p = 3q b) p = 2q c) p = d) p = q
2
q
Sol n: c) p =
2

9. Maximum of Z = 3x + 4 y at the corner points ( 4, 3) , ( 5, 0 ) , ( 0, 0 ) and ( 0, 5 ) of the constraints

x + 2 y  10 , 3x + 2 y  15 , x  0, y  0 is

a) 24 b) 18 c) 16 d) None of these

Sol n: a) 24

10. Maximum of Z = 3x + 4 y at the corner points (4, 0), (0, 4) and (0, 0) of the constraints x + y  4 ,
x  0, y  0 is
a) 16 b) 28 c) 12 d) None of these
Sol n: a) 16
11. Corner points of the feasible region for an LPP are ( 0,10 ) , ( 5,5 ) , ( 0, 20 ) and (15,15 ) .Let Z = 3x + 9 y
be the objective function. The maximum value of Z occurs at
a) ( 0, 20 )

b) (15,15 )

c) line segment joining the points ( 0, 20 ) and (15,15 )

d) line segment joining the points ( 5,5 ) and (15,15 )

Sol n: c) line segment joining the points ( 0, 20 ) and (15,15 )

12. The feasible region consisting of infinitely many points which satisfies all the constraints is called
a) Infeasible region b) Optimal solution c) Feasible solution d) None of these

Sol n: c) Feasible solution

13. Each point in the feasible region is called

a) Feasible solution b) corner points c) Infeasible region d) feasible choice

Sol n: d) feasible choice

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 3

SI X MARK S QUESTI ON:

1. Solve the following problem graphically:

Maximize Z = 3x + 2 y Subjected to constraints:
x + 2 y  10, 3x + y  15, x, y  0 . (SEP 2020, J 2023, AUG 2023, MQP 24)

Sol n : Consider x + 2 y = 10 3x + y = 15

x 0 10 x 0 5
y 5 0 y 15 0

Clearly, F.R OABC is bounded and the

corner
points are O(0, 0), A(5, 0), B(4, 3), C (0, 5)

Corner points Z = 3x + 2 y

O(0, 0) Z = 3(0) + 2(0) = 0

A(5, 0) Z = 3(5) + 2(0) = 15

B(4,3) Z = 3(4) + 2(3) = 18

C (0,5) Z = 3(0) + 2(5) = 10

 Zmax = 18 at B(4,3)

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 4

2. Solve the following problem graphically:
Maximize Z = 4 x + y

Subjected to constraints: x + y  50, 3x + y  90, x  0, y  0 . (MP Q, M 2020, A 2022, M 2024)

Sol n: Consider x + y = 50 3 x + y = 90

x 0 50 x 0 30
y 50 0 y 90 0

Clearly, F.R OABC is bounded and the corner

points are O(0, 0), A(30, 0), B(20,30), C (0,50)

Corner points Z = 4x + y

O(0, 0) Z = 4(0) + (0) = 0

A(30, 0) Z = 4(30) + 0 = 120

B(20, 30) Z = 4(20) + 30 = 110

C (0, 50) Z = 4(0) + 50 = 50

 Z Max = 120 at B(30,0)

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 5

3. Solve the following problem graphically:
Minimize Z = −3x + 4 y
Subjected to constraints x + 2 y  8,3x + 2 y  12, x  0, y  0.
(MP Q, J 2017, M 2023, M 2024)

Sol n: consider x + 2 y = 8 3 x + 2 y = 12
x 0 8 x 0 4
y 4 0 y 6 0

Clearly, F.R OABC is bounded and the

corner points are O(0, 0), A(4, 0),
B(2,3), C (0, 4)

Corner points Z = −3x + 4 y

O(0, 0) Z = −3(0) + 4(0) = 0

A(4, 0) Z = −3(4) + 4(0) = −12

B(2,3) Z = −3(2) + 4(3) = 6

C (0, 4) Z = −3(0) + 4(4) = 16

 Zmin = −12 at A(4,0)

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 6

4. Solve the following problem graphically:
Minimize and Maximize Z = 5 x + 10 y

Subjected to constraints: x + 2 y  120, x + y  60, x − 2 y  0, x, y  0 . (M 2016, M 2019)

Sol n: Consider x + 2 y = 120 x + y = 60 x − 2y = 0

x 0 120 x 0 60 x 0 0 60
y 60 0 y 60 0 y 0 0 30

Clearly, F.R ABCD is bounded and the

corner points
are A(40, 20), B(60,30), C (120, 4), D(60, 0)

Corner points Z = 5 x + 10 y
A(40, 20) Z = 5(40) + 10(20) = 400
B(60, 30) Z = 5(60) + 10(30) = 600
C (120, 0) Z = 5(120) + 10(0) = 600
D(60, 0) Z = 5(60) + 10(0) = 300

 Zmin = 300 at D(60,0) and Z Max = 600

at all the points on the line segment
joining the points B(60, 30) & C (120, 0) .

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 7

5. Solve the following problem graphically:
Minimize and Maximize Z = x + 2 y

Subjected to constraints: x + 2 y  100, 2 x − y  0, 2 x + y  200, x, y  0 . (MQP , M 14, J 14, MQP 24)

Sol n: Consider x + 2 y = 100 2x − y = 0 2 x + y = 200

x 0 100 x 0 0 50 x 0 100
y 50 0 y 0 0 100 y 200 0

Clearly, F.R ABCD is bounded and the corner

points are A(0,50), B(20, 40),
C (50,100), D(0, 200)

Corner Z = x + 2y
points
A(0, 50) Z = 0 + 2(50) = 100

B(20, 40) Z = 20 + 2(40) = 100

C (50,100) Z = 50 + 2(100) = 250

D(0, 200) Z = 0 + 2(200) = 400

 Z min = 100 at all the points on the line segment

joining the points A(0, 50) & B(20, 40) and
Z Max = 400 at D(0,200) .

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 8

6. Solve the following problem graphically:
Minimize and Maximize Z = 3x + 9 y

Subjected to constraints: x + 3 y  60, x + y  10, x  y, x  0, y  0 .

(MQP , MQP 2024, J 2016, M 2018, J 2024)

Sol n: Consider x + 3 y = 60 x + y = 10 x= y

x 0 60 x 0 10 x 0 0 30
y 20 0 y 10 0 y 0 0 30

Clearly, F.R ABCD is bounded and the corner

points are A(0, 20), B(15,15), C (5,5), D(0,10)

Corner points Z = x + 2y
A(0, 20) Z = 3(0) + 9(80) = 180
B(15,15) Z = 3(15) + 9(15) = 180
C (5,5) Z = 3(5) + 9(5) = 60
D(0,10) Z = 3(0) + 9(10) = 90

 Z Min = 60 at C (5,5) and

Z Max = 180 at all the points on the line segment

joining the points A(0, 20) & B(15,15) .

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 9

7. Solve the following problem graphically:
Minimize Z = 200 x + 500 y
Subjected to constraints: x + 2 y  10, 3x + 4 y  24, x  0, y  0 . (MP Q)

Sol n: Consider x + 2 y = 10 3 x + 4 y = 24

x 0 10 x 0 8
y 5 0 y 6 0

Clearly, F.R ABC is bounded and the corner

points are A(0, 6), B(4,3), C (0,5)

Corner points Z = 200 x + 500 y

A(0, 6) Z = 200(0) + 500(6) = 3000

B(4,3) Z = 200(4) + 500(3) = 2300

C (0,5) Z = 200(0) + 500(5) = 2500

 Z Min = 2300 at B(4,3)

JALAJAKSHI G ( JR ) RVLH, JAYANAGAR 10