1717829744666 Worksheet on Linear Programming
1717829744666 Worksheet on Linear Programming
WORKSHEET
CH-12 Linear Programming
Q2. The feasible region for a LPP is shown in Figure. Evaluate Z = 4x + y at each of the corner
points of this region. Find the minimum value of Z, if it exists
Q3. Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is
shown in Fig.
Q5.
Q7.
Q8.
Q9.Fill in the blanks:
(i) In a LPP, the linear inequalities or restrictions on the variables are called _________.
(ii) In a LPP, the objective function is always _________
(iii). If the feasible region for a LPP is _________, then the optimal value of the objective
function Z = ax + by may or may not exist.
(iv). In a LPP if the objective function Z = ax + by has the same maximum value on two corner
points of the feasible region, then every point on the line segment joining these two points give
the same _________ value.
(v). A feasible region of a system of linear inequalities is said to be _________ if it can be
enclosed within a circle.
(vi) A corner point of a feasible region is a point in the region which is the _________ of two
boundary lines.
(vii) The feasible region for an LPP is always a _________ polygon.
Q10.