Question Bank with Solutions Linear Programming

LINEAR PROGRAMMING
One Marks Questions(MCQ)
1. In a Linear programming problem , the objective 9. Optimal value of objective function in LPP if exist
function is always is attains at the
a) a cubic function b) a quadratic equation a) points on the 𝑥 − 𝑎𝑥𝑖𝑠
c) a linear function d) a constant function b) points on the 𝑦 − 𝑎𝑥𝑖𝑠
2. Objective function of LPP is c) corner points of the feasible region
a) A function to be optimized d) only at origin
b) a constant function 10. The solution set of the inequalities 𝑥 ≥ 0, 𝑦 ≥ 0 is
a) first quadrant b) second quadrant
c) A relation between the variables
c) Third quadrant d) Fourth quadrant
d) none of these
11. In LPP if two corner points gives the optimal
3. Let 𝑍 = 𝑎𝑥 + 𝑏𝑦 where 𝑎, 𝑏 are constants is a linear
solution then the total number of optimal solutions
objective function variables 𝑥 and 𝑦 are called
are
a) decision variables
a) 2 only b) 4 solutions
b) dependent variables
c) 6 solutions d) infinitely many solutions
c) independent variables
12. The number of feasible solution of a L.P.P.
d) none of these
a) one b) two c) finite d) infinite
4. The feasible region is always a
13. The corner points of the feasible region of an LPP
a) convex region b) concave region
are (0,2), (3,0), (6,0), (6,8)&(0,5), then the
c) bounded region d) unbounded region
minimum value of 𝑍 = 4𝑥 + 6𝑦 occurs at
5. Feasible region is the set of points which satisfies
a) finite number of points
a) objective function
b) infinite number of points
b) some given constraints
c) only one point
c) all the constraints including none negative
d) only two points
constraints
14. The corner points of the feasible region of a𝐿𝑃𝑃 are
d) non-negative constraints
(5,5) , (15,15), (0,20) (10,0). The maximum value
6. Every point of feasible region is called
of objective function 𝑧 = 𝑎𝑥 + 𝑏𝑦 is occur at both
a) infeasible solution b) optimal solution
(0,20) and (15,15) then the condition for 𝑎 and 𝑏
c) feasible solution d) corner points
7. Any point on the feasible region which gives the a) 𝑎 = 𝑏 b) 𝑎 = 2𝑏 c) 𝑎 = 3𝑏 d) 𝑏 = 3𝑎

maximum or minimum value of the objective 15. The corner points of the feasible region determined

functions in an LPP is called by the following system of linear inequalities:

a) feasible region b) infeasible solution 2𝑥 + 𝑦 ≤ 10, 𝑥 + 3𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0 are

c) optimal solution d) feasible solution (0, 0), (5, 0), (3, 4) 𝑎𝑛𝑑 (0, 5). Let 𝑍 = 𝑝𝑥 + 𝑞𝑦,

8. Optimization of the objective function is a process 𝑝, 𝑞 > 0. Condition on 𝑝 𝑎𝑛𝑑 𝑞 so that the
of maximum of Z occurs at both (3, 4)𝑎𝑛𝑑 (0, 5) is
a) Maximizing the objective function a) 𝑝 = 𝑞 b) 𝑝 = 2𝑞
b) Minimizing the objective function c) 𝑝 = 3𝑞 d) 𝑞 = 3𝑝
c) Maximizing or Minimizing of the objective
function
d) None of these

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page1

Question Bank with Solutions Linear Programming

16. Corner points of the feasible region determine by 24. The corner points of an objective function
the system of linear constraints are 𝑍 = 200𝑥 + 500𝑦 in a LPP are (0,5), (4,3) and
(0,3), (1,1)𝑎𝑛𝑑(3,0). Let 𝑍 = 𝑝𝑥 + 𝑞𝑦 (0,6). The minimum of value of 𝑍 Occurs at
where 𝑝, 𝑞 > 0, condition on p and q so that the a) (0,5) b) (4,3) c) (0,6) d) (0,0)
minimum of Z occurs at (3,0) 𝑎𝑛𝑑 (1,1) is 25. The corner points of the bounded region are
𝑞
a) 𝑝 = b)𝑝 = 2𝑞 (0,0), (30,0), (20,30) 𝑎𝑛𝑑 (0, 50). Let 𝑍 = 4𝑥 + 𝑦
2
c) 𝑝 = 𝑞 d) 𝑞 2 = 𝑝 be objective function then the sum of maximum and
17. Corner points of the feasible region determined by minimum value of Z is
the system of linear constraints are (60,50)(40,60) a) 110 b) 120 c) 50 d) 170
(0,60) and (0,0). let 𝑧 = 𝑎𝑥 + by where 𝑎, 𝑏 > 0 26. The corner points of the bounded region are
condition on a and b so that maximum of z occurs at (0,10), (0,20), (5, 5), 𝑎𝑛𝑑 (15, 15). Let 𝑍 = 3𝑥 +

(60,50)(40,60) 9𝑦 be the objective function then the minimum

a) 𝑏 = 2𝑎 b) b = 2
𝑎 value of Z occur at
a) (0, 10) b)(0, 20) c)(15, 15) d) (5, 5)
c) 𝑎 = 3𝑏 d) a = b
27. Corner points of 𝑍 = 200 𝑥 + 500 𝑦 are (0,5),
18. Corner points of the feasible region determined by
(4,3) and (0,6) then the minimum value of 𝑍 is
the system of linear constraints are (0,2)(3,0)(6,0)
a) 2400 b) 3000 c) 2000 d) 2300
(6,8)(0,5). let 𝑧 = 𝑎𝑥 + by where 𝑎, 𝑏 > 0 condition
28. The corner points of the feasible region determined
on 𝑎 and 𝑏 so that maximum of 𝑧 occurs at (0,2) and
by the system of linear constraints are (0,0), (0,40),
(3,0)
(20,40), (60,20), (60,0). The objective function is
a) 2𝑏 = 3𝑎 b) 3𝑏 = 2𝑎
𝑍 = 4𝑥 + 3𝑦 then 𝑧𝑚𝑖𝑛 =
c) 4𝑎 = 2𝑏 d) a = b
a) 0 b) 120 c) 200 d) 300
19. In L.P.P none negative constraints are
29. The corner points of the bounded region are
a) 𝑥 ≥ 0, 𝑦 ≥ 0 b) 𝑥 ≤ 0, 𝑦 ≥ 0
(0,0), (20,0), (10, 50), 𝑎𝑛𝑑 (0, 60).
c) 𝑥 ≥ 0, 𝑦 ≥ 0 d) 𝑥 ≤ 0, 𝑦 ≤ 0
Let 𝑍 = 250𝑥 + 75𝑦 be the objective function then
20. One of the corner point of the feasible region of the
the minimum value of Z is
following problem : ‘maximize 𝑍 = 3𝑥 + 2𝑦
a) 0 b) 4500 c) 6250 d) 5000
subjected to constraints 𝑥 + 2𝑦 ≤ 10,
30. The corner points of the bounded region are
3𝑥 + 𝑦 ≤ 15 𝑎𝑛𝑑 𝑥, 𝑦 ≥ 0’ is
(2,72), (15,20), (40, 15). Let 𝑍 = 6𝑥 + 3𝑦 be the
a)(0,5) b)(4,6) c)(3,7) d)(4,0)
objective function then the minimum value of Z is
21. One of the corner point of the following LPP ‘
a) 150 b) 228 c) 285 d)100
maximize 𝑍 = 3𝑥 + 4𝑦 subject to the constraints
31. The minimum value of linear objective function
𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0 is
𝑍 = 5𝑥 + 2𝑦 subject to 10𝑥 + 2𝑦 ≥ 20,
a) (4,4) b)(4,0) c)(4,5) d) (3,4)
5𝑥 + 5𝑦 ≥ 30, 𝑥 ≥ 0, 𝑦 ≥ 0 is
22. The feasible region of an LPP is 𝑍 = 3𝑥 + 9𝑦 with
a) 10 b) 15 c) 20 d) 25
corner points (0,10), (0,20), (15,15), (5,5),then the
32. The corner points of the feasible region determined
minimum value of Z occurs at
by the system of linear constraints are
a) (5,5) b) (0,10) c)(0,20) d) (15,15)
(2,72), (15,20) 𝑎𝑛𝑑 (40,15) The objective function
23. Minimum value of 𝑍 = 3𝑥 + 4𝑦 subject to the
is 𝑍 = 6𝑥 + 3𝑦 then 𝑧𝑚𝑎𝑥 =
constraints 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0 occurs at
a) 228 b) 150 c) 285 d) 320
a) (0, −4) b) (4,0) C) (0,4) D)(0,0)

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page2

Question Bank with Solutions Linear Programming

33. The corner points of the bounded region are Six Marks Questions
(0,0), (30,0), (20,30) 𝑎𝑛𝑑 (0, 50). Let 𝑍 = 4𝑥 + 𝑦 1) Solve the following problem graphically :
be objective function then the maximum value of Z Maximize and minimize
is 1) 𝒁 = 𝟑𝒙 + 𝟐𝒚, Subject to the constraints,
a) 210 b) 150 c) 110 d) 120 𝒙 + 𝟐𝒚 ≤ 𝟏𝟎, 𝟑𝒙 + 𝒚 ≤ 𝟏𝟓, 𝒙, 𝒚 ≥ 𝟎
Solution: To draw a line 𝑥 + 2𝑦 = 10
34. The maximum value of 𝑍 = 𝑥 + 𝑦 subject to
𝑥 + 2𝑦 ≤ 70 and 2𝑥 + 𝑦 ≤ 95, 𝑥 ≥ 0, 𝑦 ≥ 0 is x 0 10
a) 65 b) 45 c) 55 d) 50 y 5 0
35. The maximum value of 𝑍 = 40𝑥 + 50𝑦 subject to ⟹ (0,5) 𝑎𝑛𝑑 (10,0) lie on the line 𝑥 + 2𝑦 = 10
3𝑥 + 𝑦 ≤ 9, 𝑥 + 2𝑦 ≤ 8, and 𝑥 ≥ 0, 𝑦 ≥ 0 is To draw a line 3𝑥 + 𝑦 = 15
a) 220 b) 240 c) 260 d) 230
x 0 5
36. Let 𝑍 = 3𝑥 + 9𝑦 and Corner points of the feasible
y 15 0
region are (0,10), (0,20), (5,5)&(15,15) Let then
maximum value of 𝑍 is ⟹ (0,15) 𝑎𝑛𝑑 (5,0) lie on the line 3𝑥 + 𝑦 = 15
a) 180 b) 60 c) 120 d) 90
37. The maximum value of 𝑧 = 3𝑥 + 2𝑦 at the corner 𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠
𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠
points (5,0), (0,5), (4,3) and (0,0) of the constraints
𝑥 + 2𝑦 ≤ 10,3𝑥 + 𝑦 ≤ 15, 𝑥, 𝑦 ≥ 0 is
a) 16 b) 28 c) 12 d) 18
38. In a LPP if the objective function 𝑍 = 𝑎𝑥 + 𝑏𝑦 has
the minimum value is 100 on two corner points of
the feasible region determined by the system of
linear constraints. The value of objective function on
the mid point of those two corner point is
a)50 b) 100 c) 150 d) 200

ANSWER KEY
QN KEY QN KEY QN KEY QN KEY QN KEY Here feasible region is bounded and corner
1 c 2 a 3 a 4 a 5 c points are (0,0), (5,0), (4,3) and (0,5)
6 c 7 c 8 c 9 c 10 a
11 d 12 d 13 b 14 d 15 d Now,
16 a 17 a 18 a 19 a 20 a Corner points 𝑍 = 3𝑥 + 2𝑦
21 b 22 a 23 d 24 b 25 b
(0,0) 𝑍 =0+0=0
26 d 27 d 28 a 29 a 30 a
(5,0) 𝑍 = 15 + 0 = 15
31 b 32 c 33 d 34 c 35 d
(4,3) 𝑍 = 12 + 6 = 18
36 a 37 d 38 b
(0,5) 𝑍 = 0 + 10 = 10

Now , 𝑍𝑚𝑎𝑥 = 18 is at the point (4,3)

and 𝑍𝑚𝑖𝑛 = 0 is at the point (0,0)

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page3

Question Bank with Solutions Linear Programming

2) 𝒁 = 𝟒𝒙 + 𝒚 , Subject to the constraints: 3) 𝒁 = 𝟐𝟎𝟎𝒙 + 𝟓𝟎𝟎𝒚 , Subject to the constraints:

𝒙 + 𝒚 ≤ 𝟓𝟎 , 𝟑𝒙 + 𝒚 ≤ 𝟗𝟎 , 𝒙 ≥ 𝟎 , 𝒚 ≥ 𝟎 𝒙 + 𝟐𝒚 ≥ 𝟏𝟎 , 𝟑𝒙 + 𝟒𝒚 ≤ 𝟐𝟒 , 𝒙 ≥ 𝟎 , 𝒚 ≥ 𝟎
Solution: To draw a line 𝑥 + 𝑦 = 50 Solution: To draw a line 𝑥 + 2𝑦 = 10
x 0 50 x 0 10
y 50 0 y 5 0

⟹ (0,50) 𝑎𝑛𝑑 (50,0) lie on the line 𝑥 + 𝑦 = 50 ⟹ (0,5) 𝑎𝑛𝑑 (10,0) lie on the line 𝑥 + 2𝑦 = 10
To draw a line 3𝑥 + 𝑦 = 90 To draw a line 3𝑥 + 4𝑦 = 24
x 0 30 x 0 8
y 90 0 y 6 0

⟹ (0,90) 𝑎𝑛𝑑 (30,0) lie on the line 3𝑥 + 𝑦 = 90 ⟹ (0,6) 𝑎𝑛𝑑 (8,0) lie on the line 3𝑥 + 4𝑦 = 24

𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 10 𝑢𝑛𝑖𝑡𝑠 𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠

𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 10 𝑢𝑛𝑖𝑡𝑠 𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠

Here feasible region is bounded and corner

points are (0,0), (30,0), (20,30) and (0,50) Here feasible region is bounded and corner
points are (4,3), (0,6) and (0,5)
Now,
Corner points 𝑍 = 4𝑥 + 𝑦 Now,
(0,0) 𝑍 =0+0=0 Corner points 𝑍 = 200𝑥 + 500𝑦
(30,0) 𝑍 = 120 + 0 = 120 (4,3) 𝑍 = 800 + 1500 = 2300
(20,30) 𝑍 = 80 + 30 = 110 (0,6) 𝑍 = 0 + 3000 = 3000
(0,50) 𝑍 = 0 + 50 = 50 (0,5) 𝑍 = 0 + 2500 = 2500

Now , 𝑍𝑚𝑎𝑥 = 120 is at the point (30,0) Now , 𝑍𝑚𝑎𝑥 = 3000 is at the point (0,6)
and 𝑍𝑚𝑖𝑛 = 0 is at the point (0,0) and 𝑍𝑚𝑖𝑛 = 2300 is at the point (4,3)

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page4

Question Bank with Solutions Linear Programming

4) 𝒁 = −𝟑𝒙 + 𝟒𝒚, Subject to the constraints, 5) 𝒁 = 𝟓𝒙 + 𝟑𝒚, Subject to the constraints,

𝒙 + 𝟐𝒚 ≤ 𝟖, 𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟐, 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎 𝟑𝒙 + 𝟓𝒚 ≤ 𝟏𝟓, 𝟓𝒙 + 𝟐𝒚 ≤ 𝟏𝟎, 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎
Solution: To draw a line 𝑥 + 2𝑦 = 8 Solution: To draw a line 3𝑥 + 5𝑦 = 15
x 0 8 x 0 5
y 4 0 y 3 0

⟹ (0,4) 𝑎𝑛𝑑 (8,0) lie on the line 𝑥 + 2𝑦 = 8 ⟹ (0,3) 𝑎𝑛𝑑 (5,0) lie on the line 3𝑥 + 5𝑦 = 15
To draw a line 3𝑥 + 2𝑦 = 12 To draw a line 5𝑥 + 2𝑦 = 10
x 0 4 x 0 2
y 6 0 y 5 0

⟹ (0,6) 𝑎𝑛𝑑 (4,0) lie on the line 3𝑥 + 2𝑦 = 12 ⟹ (0,5) 𝑎𝑛𝑑 (2,0) lie on the line 5𝑥 + 2𝑦 = 10

𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠 𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠

𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠 𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 1 𝑢𝑛𝑖𝑡𝑠

Here feasible region is bounded and corner Here feasible region is bounded and corner
points are (0,0), (4,0), (2,3) and (0,4) 20 45
points are (0,0), (0,3), (19 , 19) and (2,0)

Now,
Now,
Corner points 𝑍 = −3𝑥 + 4𝑦
Corner points 𝑍 = 5𝑥 + 3𝑦
(0,0) 𝑍 =0+0=0
(0,0) 𝑍 =0+0=0
(4,0) 𝑍 = −12 + 0 = −12
(0,3) 𝑍 =0+9=9
(2,3) 𝑍 = −6 + 12 = 6 20 45 100 135 235
(19 , 19) 𝑍= + 19 =
(0,4) 𝑍 = 0 + 16 = 16 19 19
(2,0) 𝑍 = 10 + 0 = 10
Now , 𝑍𝑚𝑎𝑥 = 16 is at the point (0,4)
235 20 45
and 𝑍𝑚𝑖𝑛 = −12 is at the point (4,0) Now , 𝑍𝑚𝑎𝑥 = is at the point (19 , 19)
19
and 𝑍𝑚𝑖𝑛 = 0 is at the point (0,0)

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page5

Question Bank with Solutions Linear Programming

6) 𝒛 = 𝟓𝒙 + 𝟏𝟎𝒚, subject to the constraints 7) 𝒛 = 𝒙 + 𝟐𝒚. subjected to constraints

𝒙 + 𝟐𝒚 ≤ 𝟏𝟐𝟎 , 𝒙 + 𝒚 ≥ 𝟔𝟎,𝒙 − 𝟐𝒚 ≥ 𝟎 𝒙 + 𝟐𝒚 ≥ 𝟏𝟎𝟎, 𝟐𝒙 − 𝒚 ≤ 𝟎 , 𝟐𝒙 + 𝒚 ≤ 𝟐𝟎𝟎 ,
and 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎
Solution: To draw a line 𝑥 + 2𝑦 = 120 Solution: To draw a line 𝑥 + 2𝑦 = 100

x 0 120 x 0 100
y 60 0 y 50 0

⟹ (0,60) & (120,0) lie on the line 𝑥 + 2𝑦 = 120 ⟹ (0,50) & (100,0) lie on the line 𝑥 + 2𝑦 = 100
To draw a line 𝑥 + 𝑦 = 60 To draw a line 2𝑥 − 𝑦 = 0

x 0 60 x 0 50
y 60 0 y 0 100

⟹ (0,60) & (60,0) lie on the line 𝑥 + 𝑦 = 60 ⟹ (0,0) & (60,0) lie on the line 2𝑥 − 𝑦 = 0
To draw a line 𝑥 − 2𝑦 = 0 To draw a line 2𝑥 + 𝑦 = 200

x 0 60 x 0 100
y 0 30 y 200 0

⟹ (0,0) & (60,30) lie on the line 𝑥 − 2𝑦 = 0 ⟹ (0,200) & (100,0) lie on the line 2𝑥 + 𝑦 = 200

𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 50 𝑢𝑛𝑖𝑡𝑠

𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 20 𝑢𝑛𝑖𝑡𝑠 𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 50 𝑢𝑛𝑖𝑡𝑠
𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 20 𝑢𝑛𝑖𝑡𝑠

Here feasible region is bounded and corner Here feasible region is bounded and corner
points are (60,0), (120,0), (60,30) and (40,20) points are (0,50), (20,40), (50,100) & (0,200)
Now, Now,
Corner points 𝑍 = 5𝑥 + 10𝑦 Corner points 𝑧 = 𝑥 + 2𝑦
(60,0) 𝑍 = 300 + 0 = 300 (0,50) 𝑍 = 0 + 100 = 100
(120,0) 𝑍 = 600 + 0 = 600 (20,40) 𝑍 = 20 + 80 = 100
(60,30) 𝑍 = 300 + 300 = 600 (50,100) 𝑍 = 50 + 200 = 250
(40,20) 𝑍 = 200 + 200 = 400 (0,200) 𝑍 = 0 + 400 = 400

Now , 𝑍𝑚𝑎𝑥 = 600 and 𝑍𝑚𝑖𝑛 = 300 Now , 𝑍𝑚𝑎𝑥 = 400 and 𝑍𝑚𝑖𝑛 = 100

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page6

Question Bank with Solutions Linear Programming

8) 𝒛 = 𝟑𝒙 + 𝟗𝒚 subject to the constraints

𝒙 + 𝟑𝒚 ≤ 𝟔𝟎, 𝒙 + 𝒚 ≥ 𝟏𝟎, 𝒙 ≤ 𝒚,
𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎
Solution: To draw a line 𝑥 + 3𝑦 = 60
x 0 60
y 20 0

⟹ (0,20) 𝑎𝑛𝑑 (60,0) lie on the line 𝑥 + 3𝑦 = 60

To draw a line 𝑥 + 𝑦 = 10
x 0 10
y 10 0

⟹ (0,10) 𝑎𝑛𝑑 (10,0) lie on the line 𝑥 + 𝑦 = 10

To draw a line 𝑥 = 𝑦
x 0 15
y 0 15

⟹ (0,0) 𝑎𝑛𝑑 (15,15) lie on the line 𝑥 = 𝑦

𝑆𝑐𝑎𝑙𝑒: 𝑥 − 𝑎𝑥𝑖𝑠: 1 𝑐𝑚 = 10 𝑢𝑛𝑖𝑡𝑠

𝑦 − 𝑎𝑥𝑖𝑠 = 1 𝑐𝑚 = 10 𝑢𝑛𝑖𝑡𝑠

𝑥 + 𝑦 ≥ 10

Here feasible region is bounded and corner

points are (0,10), (0,20), (15,15) and (5,5)
Now,
Corner points 𝑍 = 3𝑥 + 9𝑦
(0,10) 𝑍 = 0 + 90 = 90
(5,5) 𝑍 = 15 + 45 = 60
(15,15) 𝑍 = 45 + 135 = 180
(0,20) 𝑍 = 0 + 180 = 180

Now , 𝑍𝑚𝑎𝑥 = 180 and 𝑍𝑚𝑖𝑛 = 60

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page7