Unit– 5 Linear Inequalities and Linear Programming
KEY POINTS
Basic Concepts and Definitions
Linear Programming:
It is a technique to find the maximum or minimum value of the objective function under
the constraints.
Linear Inequalities:
Inequalities are expressed by the four symbols that are >, <, ≥ , ≤.
For example etc.
Points to Remember:
and represent regions which are called half planes.
The line is called the boundary of each half plane.
A vertical line divides the plane into left and right half planes.
A non-vertical line divides the plane into upper and lower half planes.
A solution of a linear inequality in x and y is an ordered pair of numbers which
satisfies the inequality.
is also called associated or corresponding equation.
The associated equation is graphed by using dashes if inequality involves symbols > or <.
The associated equation is graphed by a solid line if inequality involves symbols ≥ or ≤.
The point which is not on the graph of associated equation is taken as a test point.
The test point determines that the half plane is on which side of the boundary line.
If the inequality involves symbols >, < (proper inequality) then half plane is said to be
open half plane.
If the inequality involves symbols ≥, ≤ then half plane is said to be closed half plane.
Corner Point:
A point of a solution region where two of its boundary lines intersect, is called a corner
point or vertex of the solution region.
Problem Constraint:
An inequality related to daily life problem is called problem constraint.
Problem Constraints:
The system of linear inequalities related to daily life problem, are called problem
constraints.
Non-negative Constraints:
KIPS OBJECTIVE TYPE SERIES 279
Unit– 5 Linear Inequalities and Linear Programming
The variables used in system of linear inequalities are called non-negative constraints.
Non – negative constraints are also called decision variables.
Feasible Region:
A region which is restricted to the first quadrant is called feasible region.
Feasible Solution:
Each point of feasible region is called a feasible solution.
Feasible Solution Set:
A set consisting of all the feasible solutions is called a feasible solution set.
Convex Region:
If the line segment obtained by joining any two points of a region lies entirely within the
region, then the region is called convex.
Not Convex Convex
Bounded region:
A feasible region which can be enclosed within a circle is called bounded region.
Unbounded region:
A feasible region is called unbounded if it cannot be enclosed in any circle how large it
may be.
Objective Function:
A function which is to be maximized or minimized is called an objective function.
Optimal Solution:
The feasible solution which maximizes or minimizes the objective function is called
optimal solution.
Note:
Every optimal solution is a feasible solution but every feasible solution is not an optimal
solution.
Theorem of Linear Programming:
The theorem of linear programming states that the maximum and minimum values of the
objective function occur at corner points of the feasible region.
KIPS OBJECTIVE TYPE SERIES 280
Unit– 5 Linear Inequalities and Linear Programming
TOPICAL MULTIPLE CHOICE QUESTIONS
Topic No 5.1, 5.2
Introduction, Linear Inequalities
(1) An expression involving any one of the symbols <, > , ≤ , ≥ is
called:
(a) Equation (b) Inequality
(c) Identity (d) linear equation
(2) is/an:
(a) Inequality (b) Equation
(c) Identity (d) Linear equation
(3) Associated equation of and is:
(a) (b)
(c) (d)
(4) The solution set of the inequality is:
(a) Closed half plane (b) Circle
(c) Open half plane (d) Parabola
(5) The point lies in … quadrant:
(a) I (b) III
(c) II (d) IV
(6) is a solution of the inequality:
(a) (b)
(c) (d)
(7) is not the solution of inequality:
(a) (b)
(c) (d)
(8) A test point is the point which is______ of the corresponding
equation:
(a) On the graph (b) Not on the graph
(c) Below the graph (d) Above the graph
(9) The graphs of and are:
(a) Open half planes (b) Closed half planes
(c) Left and right planes (d) Straight lines
(10) The solution set of the inequality is the interval:
(a) (b)
(c) (d)
(11) is the solution of inequality:
KIPS OBJECTIVE TYPE SERIES 281
Unit– 5 Linear Inequalities and Linear Programming
(a) (b)
(c) (d)
(12) Which of the following inequality represents the graph:
(a) (b)
(c) (d)
KIPS OBJECTIVE TYPE SERIES 282
Unit– 5 Linear Inequalities and Linear Programming
Topic No 5.3, 5.4, 5.5
Region bounded by 2 or 3 Simultaneous inequalities Problem constraints, Feasible
Solution Set
(13) A point of solution region where two of its boundary lines
intersect, is called:
(a) Centre (b) Vertex
(c) Test point (d) Stationary point
(14) The system of linear inequalities involved in the problem
concerned are called:
(a) Problem constraints (b) Solution
(c) Coefficients (d) Half plane
(15) The variables used in the system of linear inequalities relating
to the problems of every day life are called:
(a) Negative constraints (b) Negative coefficients
(c) Non – negative constraints (d) Problem constraints
(16) Region which is restricted to the first quadrant is called:
(a) Half plane (b) Feasible region
(c) Solution region (d) Closed plane
(17) Each point of the feasible region is called a __________ of the
system of linear inequalities:
(a) Feasible solution (b) Solution set
(c) Test Point (d) Corner point
(18) If the line segment obtained by joining any two points of the
region lies entirely within the region, then the region is called:
(a) Convex (b) Concave
(c) Open half-plane (d) Closed half plane
(19) The solution region of the inequalities is:
(a) 2 quadrant
nd
(b) 3 quadrant
rd
(c) 4th quadrant (d) 1st quadrant
(20) A linear inequality concerning the problem from everyday life
is named as:
(a) Problem constraint (b) Negative constraints
(c) Non – negative constraints (d) Linear programming
(21) The non – negative constraints are called :
(a) Coefficients (b) Solutions
(c) Decision variables (d) Vertex
No 5.6, 5.7
Linear programming and linear programming problems
(22) A function which is to be maximized or minimized is called :
(a) Maximum function (b) Minimum function
(c) Quadratic function (d) Objective function
(23) The feasible solution which maximizes or minimizes the
objective function is called:
(a) Optimal solution (b) Feasible solution
(c) Extraneous solution (d) Feasible solution set
(24) The procedure for determining the optimal solution for a
problem involving linear constraint is called :
(a) Objection function (b) Linear programming
(c) Convex region (d) Optimal solution
KIPS OBJECTIVE TYPE SERIES 283
Unit– 5 Linear Inequalities and Linear Programming
(25) The maximum and minimum values of the objective function
occur in the feasible region at :
(a) Origin (b) Corner points
(c) Any point (d) Non-negative constraints
KIPS OBJECTIVE TYPE SERIES 284
Unit– 5 Linear Inequalities and Linear Programming
KIPS EXERCISE
(1) is a/an :
(a) Equation (b) Inequality
(c) Linear equation (d) Identity
(2) A vertical line divides the plane into:
(a) Left and right half planes (b) Upper and lower half planes
(c) Closed half planes (d) Open half planes
(3) A set consisting of all the feasible solutions of the system of
linear inequality is called a:
(a) Solution set (b) Feasible solution set
(c) Closed half plane (d) Optimal solution set
(4) A point of a solution region where two of its boundary lines
intersect, is called:
(a) Origin (b) Test point
(c) Corner point (d) Half plane
(5) Corner points of and is:
(a) (b)
(c) (d)
(6) The solution region which can be enclosed by a circle is called:
(a) Bounded region (b) Unbounded region
(c) Circular region (d) Non – convex region
(7) is a linear inequality in:
(a) Three variables (b) Two variables
(c) One variable (d) Four variables
(8) To find the optimal solution we evaluate the objective function
at:
(a) Corner points (b) Only origin
(c) Any point (d) All points of feasible region
(9) is in the solution of inequality:
(a) (b)
(c) (d)
(10) is not in the solution of inequality:
(a) (b)
(c) (d)
MULTIPLE CHOICE QUESTIONS
(From Past Papers 2014-2018)
(Lahore + Gujranwala Board)
(1) Point lies in the region of inequality: (LHR 2014)
(a) (b)
KIPS OBJECTIVE TYPE SERIES 285
Unit– 5 Linear Inequalities and Linear Programming
(c) (d)
(2) is the solution of inequality: (LHR 2014)
(a) (b)
(c) (d)
(3) Which one satisfy the inequality : (GRW 2014)
(a) (b)
(c) (d)
(4) is the solution of inequality: (LHR 2015)
(a) (b)
(c) (d)
(5) A function which is to be maximized or minimized is called: (LHR 2015)
(a) Exponential function (b) Linear function
(c) Quadratic function (d) Objective function
(6) Solution of inequality is: (GRW 2015)
(a) (b)
(c) (d)
(7) Solution set of inequality is: (LHR 2016)
(a) (b)
(c) (d)
(8) A function which is to be maximized or minimized is called: (LHR 2016)
(a) Subjective function (b) Quantitative function
(c) Objective function (d) Qualitative function
(9) is the solution of the inequality: (GRW 2016)
(a) (b)
(c) (d)
(10) is solution of inequality (LHR 2017)
(a) (b)
(c) (d)
(11) is (LHR 2017)
(a) Linear inequality (b) Identity
(c) Equation (d) Not inequality
(12) The feasible solution that maximizes or minimizes the objective function is
(GRW
2017)
(a) Solution (b) Optimal solution
(c) Minimum solution (d) Maximum solution
KIPS OBJECTIVE TYPE SERIES 286
Unit– 5 Linear Inequalities and Linear Programming
(13) The feasible solution which maximizes or minimizes the objective function is called:
(LHR
2018)
(a) Exact solution (b) Optimal solution
(c) Final solution (d) Objective solution
(14) System of linear inequalities involved in the problem is called: (LHR 2018)
(a) Coefficients (b) Solution
(c) Problem constrains (d) Boundaries
(15) To find optimal solution we evaluate the objective function at (GRW 2018)
(a) One point (b) Origin
(c) Some points (d) Corner points
MULTIPLE CHOICE QUESTIONS
(From Past Papers 2014-2018)
(Faisalabad + Sargodha + Rawalpindi Board)
(1) is in the solution of: (FSD 2014)
(a) (b)
(c) (d)
(2) The point satisfy inequality: (SGD 2014)
(a) (b)
(c) (d)
(3) Which one is the solution of inequality : (RWP 2014)
(a) (b)
(c) (d)
(4) The point lies in the solution region of the inequality: (FSD 2015)
(a) (b)
(c) (d)
(5) Corner points of feasible region of inequalities are also called: (SGD 2015)
(a) Constrains (b) Variables
(c) Decision variables (d) Vertices
(6) If then point that does not satisfy inequality is (SGD 2015)
(a) (b)
(c) (d)
(7) A function which is to be maximized or minimized is called: (RWP 2015)
(a) Subjective function (b) Qualitative function
(c) Objective function (d) Quantitative function
(8) Point lies in the solution region of the inequality: (FSD 2016)
(a) (b)
(c) (d)
(9) is: (SGD 2016)
(a) An equation (b) Inequality
(c) Identity (d) Not identity
KIPS OBJECTIVE TYPE SERIES 287
Unit– 5 Linear Inequalities and Linear Programming
(10) The solution set of : (RWP 2016)
(a) (b)
(c) (d)
(11) A function which is to be maximized or minimized is called (FSD 2017)
(a) Subjective function (b) Objective function
(c) Qualitative function (d) Quantitative function
(12) The solution set of an inequality is (SGD 2017)
(a) Open half plane (b) Closed half plane
(c) Circle (d) Parabola
(13) lies in the solution set of inequality. (RWP 2017)
(a) (b)
(c) (d)
(14) satisfies (RWP 2017)
(a) (b)
(c) (d)
MULTIPLE CHOICE QUESTIONS
(From Past Papers 2014-2018)
(Multan +Sahiwal+ Bahawalpur/R.Y Khan + D.G Khan Board)
(1) The inequality is satisfied by point: (MTN 2014)
(a) (b)
(c) (d)
(2) is in the solution of inequality (MTN 2014)
(a) (b)
(c) (d)
(3) is the solution of inequality: (SWL 2014)
(a) (b)
(c) (d)
(4) is in the solution region of: (BWP 2014)
(a) (b)
(c) (d)
(5) is not in the solution of: (D.G.K 2014)
(a) (b)
(c) (d)
(6) A vertical line divides a plane into ____ half planes. (D.G.K 2014)
(a) Upper and lower (b) Upper and right
(c) Left and right (d) Left and lower
(7) The associated equation of inequality equals: (MTN 2015)
(a) (b)
KIPS OBJECTIVE TYPE SERIES 288
Unit– 5 Linear Inequalities and Linear Programming
(c) (d)
(8) is not satisfied by: (MTN 2015)
(a) (b)
(c) (d)
(9) Solution set of inequality is: (SWL 2015)
(a) (b)
(c) (d)
(10) The point satisfy the inequality: (BWP 2015)
(a) (b)
(c) (d)
(11) A vertical line divides the plane into: (D.G.K 2015)
(a) Upper and lower half planes (b) Upper and right half planes
(c) Left and right half planes (d) Left and lower half plans
(12) is not in the solution of inequality: (D.G.K 2015)
(a) (b)
(c) (d)
(13) Solution of : (MTN 2016)
(a) (b)
(c) (d)
(14) is the solution of inequality (SWL 2016)
(a) (b)
(c) (d)
(15) Which of the following point satisfies : (BWP 2016)
(a) (b)
(c) (d)
(16) Solution of inequality is: (D.G.K 2016)
KIPS OBJECTIVE TYPE SERIES 289
Unit– 5 Linear Inequalities and Linear Programming
(a) (b)
(c) (d)
(17) is in the solution of inequality: (MTN 2017)
(a) (b)
(c) (d)
(18) is satisfied by: (MTN 2017)
(a) (b)
(c) (d)
(19) is the solution of inequality (SWL 2017)
(a) (b)
(c) (d)
(20) is a linear inequality in (BWP 2017)
(a) Four variables (b) Three variables
(c) One variables (d) Two variables
(21) Solution region of in-equality lies (D.G.K 2017)
(a) in 1st quadrant (b) in 2nd quadrant
(c) towards the origin (d) out wards the origin
(22) is satisfied by (D.G.K 2017)
(a) (b)
(c) (d)
(23) The graph of lies in: (MTN 2018)
(a) Upper Half Plane (b) Lower Half Plane
(c) Left Half Plane (d) Right half Plane
(24) ________ point satisfy . (MTN 2018)
(a) (b)
(c) (d)
KIPS OBJECTIVE TYPE SERIES 290
Unit– 5 Linear Inequalities and Linear Programming
(25) is not in the solution of inequality (SWL 2018)
(a) (b)
(c) (d)
(26) A function which is to be maximized or minimized is called (BWP 2018)
(a) Subjective Function (b) Objective Function
(c) Qualitative Function (d) Quantitative Function
(27) is (D.G.K 2018)
(a) Equation (b) Identity
(c) Inequality (d) Curve
(28) Solution of inequality is (D.G.K 2018)
(a) (b)
(c) (d)
KIPS OBJECTIVE TYPE SERIES 291
Unit– 5 Linear Inequalities and Linear Programming
ANSWER KEYS
(Topical Multiple Choice Questions)
1
b 11 a 21 c
2
a 12 a 22 d
3
b 13 b 23 a
4
c 14 a 24 b
5
b 15 c 25 b
6
a 16 b
7
b 17 a
8
b 18 a
9
b 19 d
10
a 20 a
(KIPS Exercise)
1 b 6 a
2 a 7 b
3 b 8 a
4 c 9 d
5 b 10 b
(From Past Papers 2014-2018)
(Lahore + Gujranwala Board)
1 d 10 b
2 a 11 a
3 d 12 b
4 c 13 b
5 d 14 c
6 a 15 d
7 a
8 c
9 d
(From Past Papers 2014-2018)
(Faisalabad + Sargodha + Rawalpindi Board)
1 c 10 c
2 a 11 b
3 a 12 a
4 c 13 a
5 d 14 b
6 c
7 c
8 b
9 b
(From Past Papers 2014-2018)
(Multan + Sahiwal + Bahawalpur/R.Y Khan + D.G Khan Board)
1 b 10 c 19 c 28 b
KIPS OBJECTIVE TYPE SERIES 292
Unit– 5 Linear Inequalities and Linear Programming
2 d 11 c 20 d
3 d 12 d 21 d
4 a 13 a 22 b
5 a 14 a 23 d
6 c 15 b 24 b
7 a 16 d 25 b
8 b 17 a 26 b
9 a 18 d 27 c
KIPS OBJECTIVE TYPE SERIES 293
Unit– 5 Linear Inequalities and Linear Programming
KIPS SHORT QUESTIONS
(1) What is the linear programming?
(2) Explain the procedure for determining the optimal solution.
(3) Define the theorem of linear programming.
(4) What are the linear inequalities?
(5) Define half planes.
(6) Define associated equation of the inequality.
(7) Write the procedure for solution of a linear inequality in two variables.
(8) Graph the inequality .
(9) What is meant by solution region of inequality?
(10) Graph the system of inequalities.
(11) Define corner point.
(12) What are problem constraints?
(13) Define decision variables.
(14) Define feasible region and feasible solution set.
(15) Define convex region.
(16) Define objective function.
(17) What is optimal solution?
(18) Graph the feasible region .
(19) Define test point.
(20) Graph the solution region of the following system of linear inequalities
.
(21) Is (2, 3) is the solution of the equality ?
(22) Graph the inequality .
(23) Differentiate bounded and unbounded region.
(24) Graph the solution region of .
(25) Graph the solution region of .
SHORT QUESTIONS
(From Past Papers 2014-2018)
(Lahore + Gujranwala Board)
(1) State the theorem of linear programming. (LHR 2014)
(2) What is feasible solution? (LHR 2014)
(3) Graph the solution set of inequality . (LHR 2014)
(4) Define vertex of the solution region. (LHR 2014)
(5) Define an optimal solution. (GRW 2014)
(6) Graph the solution of linear inequality (GRW 2014)
(7) Graph the solution region of . (LHR 2015)
(8) What are problem constraints? (LHR 2015)
(9) Graph the solution set of inequality . (LHR 2015)
(10) Find the corner points of inequalities . (LHR 2015)
(11) Graph the inequalities ; ; ; . (GRW 2015)
(12) Indicate solution set of linear inequality by shading. (GRW 2015)
(13) What is convex region? (LHR 2016)
(14) Graph the solution set of linear inequality by shading. (LHR 2016)
(15) Graph the inequalities , , . (LHR 2016)
KIPS OBJECTIVE TYPE SERIES 294
Unit– 5 Linear Inequalities and Linear Programming
(16) Find corner points of ; ; . (LHR 2016)
(17) Define objective function. (GRW 2016)
(18) Graph the solution region of . (GRW 2016)
(19) Define optimal solution (LHR 2017)
(20) Define decision variable (LHR 2017)
(21) Indicate the solution set of the system of linear inequalities and .
(LHR 2017)
(22) Graph the solution region of linear inequality . (LHR 2017)
(23) Define objective function. (GRW 2017)
(24) Graph the solution set of inequality (GRW 2017)
(25) Define optimal solution and feasible solution. (LHR 2018)
(26) Graph the region indicated by (LHR 2018)
(27) Define corner point. (GRW 2018)
(28) Graph in xy-plane. (GRW 2018)
SHORT QUESTIONS
(From Past Papers 2014-2018)
(Faisalabad + Sargodha + Rawalpindi Board)
(1) Graph the solution set of . (FSD 2014)
(2) Define the feasible solution set. (FSD 2014)
(3) Shade the feasible region of . (SGD 2014)
(4) Define optimal solution. (SGD 2014)
(5) Define optimal solution. (RWP 2014)
(6) Graph the solution set of the linear inequality . (RWP 2014)
(7) Define feasible region and feasible solution. (FSD 2015)
(8) Define optimal solution. (FSD 2015)
(9) Indicate the solution region of linear inequality by shading and .
(SGD 2015)
(10) Describe solution region: (SGD 2015)
(11) Graph the system of inequalities ; (SGD 2015)
(12) Define convex region and feasible region. (SGD 2015)
(13) Define convex region. (RWP 2015)
(14) Graph the solution region of . (RWP 2015)
(15) What is an objective function? (FSD 2016)
(16) Graph the solution set of the linear inequality by shading. (FSD 2016)
(17) Define objective function. (SGD 2016)
(18) Graph the feasible region of following inequality . (SGD 2016)
(19) Define vertex of the solution region. (RWP 2016)
KIPS OBJECTIVE TYPE SERIES 295
Unit– 5 Linear Inequalities and Linear Programming
(20) Graph the solution set of the inequality . (RWP 2016)
(21) Graph the solution set of (FSD 2017)
(22) Define (a) corner point (b) objective function (FSD 2017)
(23) Define feasible region and feasible solution. (SGD 2017)
(24) Define optimal solution. (SGD 2017)
(25) What is linear programming? (RWP 2017)
(26) Graph the solution set of the linear inequality by shading (RWP 2017)
(27) What is an optimal solution? (RWP 2017)
(28) Graph the solution region of linear inequalities (RWP 2017)
(29) Define objective function. (SGD 2018)
(30) Graph the inequality (SGD 2018)
SHORT QUESTIONS
(From Past Papers 2014-2018)
(Multan + Sahiwal + Bahawalpur/R.Y Khan + D.G Khan Board)
(1) Graph the inequality . (MTN 2014)
(2) Define an objective function and optimal solution. (MTN 2014)
(3) Define convex region. (MTN 2014)
(4) Graph the solution set of the inequality in xy-plane. (MTN 2014)
(5) What is an objective function? (SWL 2014)
(6) State the theorem of linear programming. (SWL 2014)
(7) Define optimal solution (BWP 2014)
(8) Write associated equations of . (BWP 2014)
(9) What is feasible region? (D.G.K 2014)
(10) What is an optimal solution? (D.G.K 2014)
(11) Graph the solution (D.G.K 2014)
(12) Define the vertex of the solution region. (D.G.K 2014)
(13) Graph the solution set of inequality in – plane. (MTN 2015)
(14) Define optimal solution. (MTN 2015)
(15) What is an objective function? (MTN 2015)
(16) Graph the solution set of the linear inequality in xy-plane (MTN 2015)
(17) Graph the solution set in –plane. (SWL 2015)
(18) What is an objective function? (SWL 2015)
(19) Graph the solution of linear inequalities . (BWP 2015)
(20) Define Optimal solution. (BWP 2015)
(21) Define the feasible solution set. (BWP 2015)
KIPS OBJECTIVE TYPE SERIES 296
Unit– 5 Linear Inequalities and Linear Programming
(22) Shade the solution region of inequality (D.G.K 2015)
(23) Define objective function. (D.G.K 2015)
(24) Graph the solution region of linear inequalities (D.G.K 2015)
(25) Indicate the solution set of inequality . (D.G.K 2015)
(26) Define the feasible solution set. (MTN 2016)
(27) Graph the solution set of inequalities in xy-plane . (MTN 2016)
(28) Define feasible region and feasible solution of system of linear inequalities (SWL 2016)
(29) Indicate the solution region of linear inequalities (SWL 2016)
(30) Define corner points. (BWP 2016)
(31) Indicate the solution region of inequality . (BWP 2016)
(32) State theorem of linear programming. (D.G.K 2016)
(33) Indicate the solution set by shading . (D.G.K 2016)
(34) Indicate the solution region by shading the inequality (MTN 2017)
(35) What are problem constraints? (MTN 2017)
(36) Define objective function (MTN 2017)
(37) Graph the solution region of (MTN 2017)
(38) Find corner points of (SWL 2017)
(39) Define objective function and linear programming (SWL 2017)
(40) Graph the solution set of (BWP 2017)
(41) Indicate the solution set of (BWP 2017)
(42) Define objective function (D.G.K 2017)
(43) Graph the inequality (D.G.K 2017)
(44) Indicate solution set by graphing the linear inequalities (D.G.K 2017)
(45) Graph the solution region of the linear inequality (D.G.K 2017)
(46) Graph the inequality (MTN 2018)
(47) State the linear programming theorem. (MTN 2018)
(48) Define feasible solution set. (MTN 2018)
(49) Graph the inequality . (MTN 2018)
(50) Define a corner point or vertex of solution region (SWL 2018)
(51) Graph the inequality (SWL 2018)
(52) Define the convex region. (BWP 2018)
(53) Graph the solution set of (BWP 2018)
KIPS OBJECTIVE TYPE SERIES 297
Unit– 5 Linear Inequalities and Linear Programming
(54) Define convex region. (D.G.K 2018)
(55) Indicate the solution set for . (D.G.K 2018)
(56) Graph the solution set of linear inequality . (D.G.K 2018)
(57) Define a “corner point” (D.G.K 2018)
KIPS OBJECTIVE TYPE SERIES 298