Scribd
Upload
7 views2 pages

LINEAR PROGRAMING PROBLEMS Notes

Linear Programming is a mathematical technique used to maximize or minimize a linear function subject to constraints, with the objective function representing the goal of optimization. The feasible region, defined by constraints, contains all possible solutions, and optimal solutions occur at the corner points of this region. The document outlines methods for solving linear programming problems, including the corner point method and various conceptual problems related to the topic.

Uploaded by

vinayak5best
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

LINEAR PROGRAMING PROBLEMS Notes

Linear Programming is a mathematical technique used to maximize or minimize a linear function subject to constraints, with the objective function representing the goal of optimization. The feasible region, defined by constraints, contains all possible solutions, and optimal solutions occur at the corner points of this region. The document outlines methods for solving linear programming problems, including the corner point method and various conceptual problems related to the topic.

Uploaded by

vinayak5best
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

LINEAR PROGRAMING PROBLEMS

CLASS – 12
 Linear Programming is a mathematical technique in which a linear function is maximised when
subject to various constraints. This technique has been useful for guiding quantitative decisions in
business planning, industrial engineering, social and physical sciences.

 The linear function which is to be maximized or minimized is called the Objective function.

 The inequations or equations in the variables of an LPP, which describes the conditions under which
the optimisation (maximisation and minimization) is to be accomplished are called Constraints.

 Maximum or minimum value of objective function is called optimal value and the corresponding
point is called optimal solution.

 A set of values of variables is called a feasible solution of an LPP, if it satisfies the constraints and
non-negative restrictions of the problem.

 Any point outside the feasible region is an infeasible solution.

 The common region determined by all the constraints of an LPP is called the feasible region and
every point in this region is a feasible solution of the given LPP.

 The set of all feasible solutions of an LPP is a Convex set.

 According to Fundamental extreme point theorem an optimal solution of an LPP, if it exists,


occurs at one of the extreme (corner) points of the convex polygon of the set of all feasible solutions,

 Corner point method:


 Formulate the given LPP in mathematical form.
 Draw the graph of the inequations by putting x = 0 to get y and y = 0 to get x.
 Find the feasible region satisfying all the inequations (constraints) along with non-negative
restrictions.
{For that put both x and y = 0 if it satisfies the inequation then shade towards the origin else
away from the origin.
In case of line passing through origin put any pint on either side of the line in the inequations,
if it satisfies, shade towards it else shade other half region}.
 Determine the corner points of the feasible region.
 Evaluate Z = ax + by at each corner point. Let M and m respectively be the largest and
smallest values at these points.
 If the feasible region is bounded, M and m respectively are maximum and minimum values of
Z.
 If the feasible region is unbounded, then
(i) M is maximum value of Z, if open half determined by ax + by > M has no point in
common with feasible region, otherwise Z has no maximum value.
(ii) M is minimum value of Z, if open half determined by ax + by < m has no point in
common with the feasible region, otherwise Z has no minimum value.

 If two corner points of the feasible region are both optimal solutions of the same type i.e. either
maximum or minimum, then any point on the line segment joining these 2 points is also an optimal
solution of the same type.
Conceptual problems:
1. The corner points of feasible region determined by the system of linear constraints (0, 10), (5, 5),
(15,15), (0, 20). Let Z = px + qy where p, q > 0, condition on p and q so that max. of Z occurs at both
(15,15) and (0, 20) is ………………

2. In an LPP, the linear function which has to be maximised or minimised is called a linear ……………

3. The common region determined by all the linear constraints of an LPP is called the …………..region.

4. The min. value of Z = ax + by in a linear programming problem always occurs at only one corner
point of feasible region. (True/False)

5. In LPP, linear inequalities or restrictions on the variables are called linear ……………...

6. In LPP, objective function is always …………..

7. If the feasible region for an LPP is …………….., then optimal value of Z = ax + by may or may not
exist.

8. In LPP if objective function Z = ax + by has same maximum value on two corner points of feasible
region, then every point on the line segment joining these two points give the same …………. value.

9. A feasible region of a system of linear inequalities is said to be ……………. if it can be enclosed


within a circle.

10. A corner point of a feasible region is a point in the region which is the ………………. of two
boundary lines.

11. The feasible region for an LPP is always a …………….. polygon.

12. In an LPP, min. value of Z = ax + by is always ‘zero’ if origin is one of the corner point of feasible
region. (True/False)

13. Of all the points of feasible region, for max. or min. of objective function, the point lies on
…………………………………… of feasible region.

14. For constraint 3x + 4y – 9 ≤ 0, feasible region will contain origin. (True/ False)

15. Feasible region is the set of points which satisfies ……………………………

16. In an LPP, the maximum value of an objective function Z = ax + by is always finite. (True/False)

17. Maximum value of the objective function Z = ax + by in an LPP always occurs at only one corner
point of the feasible region. (True/False)

18. The graphical method for solving LPP is applicable to those problems which involves only
………….. variables.

19. Graphical method of solving LPP is also called …………………… method.

20. If an LPP admits two optimal solutions, then it has ……….. number of optimal solutions.

You might also like