Linear Programming

12
Basic Concepts
1. Linear Programming is a
real-life problem may process by which bounded by straight lines such that the line
be
transformed into a
mathematical model function and then solved segment joining any two arbitrary points of
using algorithms. The word linear the region always lies entirely within the
that all the mathenmatical furnctions in indicates region.
the model
must be linear and Afeasible region may be bounded or unbounded,
planning The most common programming means
depending on whether the variables are bounded
application of linear
programming is
allocating resources among
or not in the region. There may be problem which
have no feasible solutions. Here, we say that the
activities in the best
possible way.
2. Linear Programming Model (LP- model): The feasible region is empty.
LP-model is formulated in terms of the general A optimal solution is a feasible solution that
problem of allocating resources to activities. gives the most favourable value of the objective
Let us consider n number of activities. function. The most favourable value is the largest
or the smallest value, depending on whether the
Let x, X2, be n(decision) variable and Cy Cz-. objective function is to maximized or minimized.
C be n oconstants.
An LPP may have more than one optimal solution
)The linear funcion z = C1 tC2l2t+Cn i.e., multiple optimal solutions)
which is to be maximized or minimized
or no
optimal
is solution.
called the objective function. It is
always i) A infeasible solution is one, such that at
non-negative. least one constraint is violated.
) The restriction on the variable of the 4.
LP-model are called constraints.
Graphical Methods to Solve the LPP in Two
Variables There are two ways of
11) The non-negative constraints of a LP-model the LPP in two variables
solving
are the inequalities of the form
using the graphical
method:
220, G) Corner point method where a 'corner point
where i=1, 2, n solution is a solution that lies at a corner of
1.e. the feasible region.
X20,X220, 20
3. (i) Iso-profit or Iso-cost method.
Types of Solutions of Linear Programming
a
Problem (LPP) : Possible solutions of the LPP are Theorem : Let R be the feasilble region for a LPP
and let zax+ by be the
=
sets ofvalues of the variables y I2.. , which objective function. If R is
are desirable or not desirable bounded then the objective function, z has both a
for which all maximum and a minimumn value on R and each
6) A feasible solution is one
of these occurs at a corner
the constraints are satisfied. The collection point of R
of the feasible solutions gives the feasible Note that if R is unbounded then a
maximum or
a minimum value of the
region The feasible region of an LPP is objective function may
not exist. However if it edists, it must
always a convex polygon, that is, a region occur at a
corner point of R.

Multiple Choice Questions

1. In an LPP, if the objective function z = ax + by (a) 0

(c) finite
comer
las the same maximum value on two (b) 2
then the number (d) infinite
points of the feasible region,
of points at which Zmax OCCurs 1s Ans. (d) infinite
Board Ouestion]
312 CBSE Question Banik MathematicS01

Explanation: (a) decision variables

(b) linear variables
Since, objective function has the same maximum
value on two corner points, therefore every point (c) optimal variables
on the line segment joining these two points also (d) none of the above
gives the maximum value. Hence, the number of Ans. (a) decision variables
points at which 2max Occurs is infinite.
2. Objective function is expressed in terms of the
Explanation:
The variables in a linear
programming problem
(a) Numbers are called decision variables.
7. The linear inequalities or equations or
b) Symbols
(c) Decision variables
restrictions on the variables of a linear
programnming problem are called:
(d) None of the above (a) linear relations
Ans. (c) Decision variables
(b) constraints
Explanation: (c) functions
As it involves decision variables, for which (d) objective functions
function need to maximized or minimised. Ans. (b) constraints
3. The optimal value of the objective function is
Explanation:
alttained at the points:
The restrictions on the variable of a linear
(a) Corner points of the feasible region
programming problem are called constraints.
(b) Any point of the feasible region
8. The objective function of an LPP is:
(c) On x-axis
(a) a constraint
(d) On y-axis
(b) a function to be optimised
Ans. (a) Corner points of the feasible region ( a relation between the variables
Explanation: (d) none of the above
By putting the corner points in objective function, Ans. (6) afunction to be optimised
we get the optimal value.
Explanation:
4 An optimisation problem may involve finding: The objective of an LPP is a function to be
(a) maximum profit
optimised.
(6) minimum cost 9. Which of the term is not used in a linear
()minimum use of resources
programnming problem?
(d) all of the above (a) Optimal solution
Ans. (d) all of the above
(b) Feasible solution
Explanation: (c)Concaveregion
An optimisation problem may involve finding (d) Objective function
maximum profit, minimum cost or minimum Ans. () Concave region
use of resources etc.
5. The condition x 20, y20 are called :
Explanation:
(a) restrictions only Optimal solution, feasible solution a
objective function are the terms used in linee
(b) negative restrictions
programming problem.
(C)non-negativerestrictions 10. Which of the following sets are not convex
(d) none of the above
(a) (x, y):2x+5y <7
Ans. (c) non-negative restrictions ()Crx1)=5
(b) (,y):+ys4 (d) y):3+2/s0
Explanation: Ans. (c) (x1x1) =5
The conditions x 20, and y20 are called non Explanation:
negative restrictions.
6. The variable ar and y Ixl 5 is not a convex pointsf r o
in a linear set at any two pol i
Problem are called progranming negative positive X-axis of joined will no ie

set.
 Linear Prograiaing 313
11. The optimal value of the
attained at the point is: objective function is 16. A linear programmi5 P
(a) given by intersection of concerned with:
axes only inequations with (a) finding the upper limits ofa linear function
(b) given by intersection of of several variables
X-axis only inequations with
(b) finding the lower limit of a linear function
of
(c) given by corner points of the feasible several variables
(d) none of the above region (c) finding the limiting values of a linear
Ans. (c) given by cormer points of the feasible function of several variables
region (d) finding the optimal value (max or min) of a
Explanation: linear function of several variables
1ne optmal value of the objective function is Ans. (d) Finding the optimal value (max or min) ot a
attained at the point is given by corner linear function of several variables
the feasible region. points of
12. Feasible region in the set of Explanation:
satisfy: points which
A linear programming problem is one that is
(a) The objective functions concerned with finding the optimal value (max.
or min.) of a linear function of several variables.
(b) Some the given functions
(c) All of the given constriants 17. In a transportation problem, with 4 supply
points and 5 demand points how many number
(d) None of the above of contraints required in its formulation ?
Ans. (c) All of the given constriants
(a) 20
Explanation: (b) 1 (d) 9
Feasible region is the set of points which satisfies Ans. (d) 9
all the given constraints.
Explanation:
13. The region of feasible solution in LPP
graphical Given, m =4, n =5
method is called:
No. ofconstraints =m +n=4+5=9.
(a) Infeasible region
18. Let Z = ax + by is a linear objective function
(b) unbounded region
variablesxand y are called variables.
(c) Infinite region
(a) independent (c)decision
(d) Feasible region
(b) continuous (d) dependent
Ans. (d) Feasible region
Ans. (c) decision
Explanation Explanation:
The region of feasible solution in graphical
method of LPP is called feasible region. Variablesx and y are decision variables, which
helps to decide the min. and max. value of Z.
14. In equation 3x -y23and 4x-4y> 4 : 19. Infeasibility means that the numberof solutions
(a) Have solution for positive x and y to the linear programming models that satisfies
(b) Have no solution for positive x and y all constraints is:
(c) Have solution for all x
(a) At least
(d) Have soluton for all y (b) An infinite number
Ans. (a) Have solution for positive x and y
(c) Zeroo
(d) At least 2
Explanation:
As both the inequalities are greater. Ans. (c) Zero

15. In a LPP, the objective

function is always: Explanation:
(c) linear
(a) cubic As not all the constraints are satisfied. That is
(d) constant
(b) quadratic why, no solution exist or is infeasible.
Ans. (c) inear 20. The corner point of the feasible region
determined by the system of linear constraints
Explanation: are (0, 0), (0, 30), (20, 40), (60,
20), (50, 0).
In a LPP, the objective
function is always linear.
314 CBSE Question Bank Mat hemotics XI
Z has no maximum value
The objective function is Z= 4 +3y. Compare
the quantity in Column A and Column B 22. The graph of the inequality 2x+ 3y> 6 is :

Col. A Col. B
(a) half plane that contains the origin
Max Z 340
(b) half plane that neither contains the
(a) Quantity in column A is greater nor the points of the line 2x + 3y -6
origin rigin
(b)Quantity in column A is greater
(c) Two quantities are equal (c) whole XOY-plane excluding the points on
the line 2x +3y 6
(d) Relationship cannot be determined on the
(d) entire XOY plane.
basis of information
supplied that neither contains
Ans. (b) Quantity in column A is greater
Ans. (b) half plane origin
the origin
nor the points of the line 2x+3y = 6
Explanation:
Explanation:
Cormer Points Z 4x+ 3y
Since, origin (0, 0) does not satisfy the given
(0, 0) 0 inequality (i.e., 0 + 0 > 6 is not true). Also,
(0, 30) 90 2x +3y> 6 (i.e., the points on the line 2x +3y=6
(20, 40) 200 are not included).
(60, 20) 300 Max. The graph is half plane that neither contains
(50, 0) 200 the origin nor the points on the line 2x +3y =6.
Column A< Column B. 23. The position of points O(0, 0) and P(2, 2)in -

21. Maimize, Z =-x+2y, subject to the constraints the region of graph of inequation 2x 3y <5, -

x23, x + y25, x + 2y26, y20: will be:

(a) Max, Z -12 at (2, 6) (a) O inside and P outside
(b) Z has no maximum value (b) O and P both inside
(c) Max, Z-10 at (2, 6) (c) O and P both outside
(d) Max., Z = 14 at (2, 6)
(d) O outside and P inside
Ans. (b) Zhas no maximum value Ans. (a) O inside and P outside

Explanation: Explanation:
Here, Z -x+ 2y
Given constraintsare x 2 3, +y2 5, x+2y
x
0,
y20
Corner points 2x 3y 5
Z-X+ 2y
D6, 0) 6
A(4, 1) 2 oWI (5/2, 0) X

B(3, 2) 1 0,-5/3
Here, the open half plan has
with the feasible region.
points in common