Scribd
Upload
11 views

The Indian Public School, Erode: Senior Secondary - Grade Xii LPP (Study Material)

The document discusses linear programming problems (LPP), which involve maximizing or minimizing a linear objective function subject to linear constraints. An LPP has a feasible region defined by the constraints, and the optimal solution occurs at a corner point of this convex polygon region. Methods for solving LPPs graphically involve finding the maximum or minimum value of the objective function over the feasible region.

Uploaded by

update at my channel
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
11 views

The Indian Public School, Erode: Senior Secondary - Grade Xii LPP (Study Material)

The document discusses linear programming problems (LPP), which involve maximizing or minimizing a linear objective function subject to linear constraints. An LPP has a feasible region defined by the constraints, and the optimal solution occurs at a corner point of this convex polygon region. Methods for solving LPPs graphically involve finding the maximum or minimum value of the objective function over the feasible region.

Uploaded by

update at my channel
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

THE INDIAN PUBLIC SCHOOL, ERODE

SENIOR SECONDARY –
GRADE XII
LPP (STUDY MATERIAL)
1. The process of maximize or minimize is optimization
2. The problem involving maximization or minimization is optimization problem.
3. The special type of optimization problem is linear programming problem.
4. Linear constraints are called overriding conditions.
5. LPP constraints are non-negative constraints
6. The linear function to find optimal value is objective function.
7. Objective function is linear function.
8. Z = ax + by x and y are decision variable.
9. Linear object function is maximize or minimize.
10. The linear inequalities are called constraints
11. The linear restrictions are called constraints.
12. The conditions x >0 y > 0 are called non-negative restrictions.
13. The linear programming problem are special type of optimization problem.
14. Every point on the feasible region is called a feasible solution to the problem.
15. The common region determined by all constraints is called feasible region.
16. Any point outside the feasible region is called an imfeasible solution.
17. Any point in the feasible region that give optimum value is called optimal solution.
18. Feasible region is convex polygon.
19. The optimum value occurs at corner point.
20. If feasible region is bound then the objective function as both maximum and minimum value.
21. A feasible region of a system of linear inequalities is said to be bounded if it can be enclosed
within a circle.
22. The method of solving linear programming problem is referred as corner point method.
23. Manufacturing problem, diet problem, transportation problem are linear programming
problem.
24. In a LPP, the maximum value of the objective function Z = ax + by is always finite.
25. The graphical method of solving LPP is called as corner point method.
26. A corner point of a feasible region is a point in the region which is the intersection of two
boundary lines.
27. In a LPP if the objective function Z = ax + by has the same maximum value on two corner
points of the feasible region, the every point on the line segment joining these two points give
the same maximum value.
28. In case, the feasible region is unbounded, and M is the maximum value of Z, if the open half
plane determined by ax + by > M has no point in common with the feasible region. Otherwise
Z has no maximum value.
29. If the feasible region for a LPP is unbounded, then the optimal value of the objective function
may or may not exist.
30. The solution set of the inequation 4x + 5y < 15 is open half plane including origin.
Fill in the blanks in each of the Exercises 31 to 37.

31. In a LPP, the linear inequalities or restrictions on the variables are called _________.
32. In a LPP, the objective function is always _________
33. If the feasible region for a LPP is _________, then the optimal value of the objective function Z = ax +
by may or may not exist.
34. 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.
35. A feasible region of a system of linear inequalities is said to be _________ if it can be enclosed within a
circle.
36. A corner point of a feasible region is a point in the region which is the _________ of two boundary
lines.
37. The feasible region for an LPP is always a _________ polygon.

State whether the statements in Exercises 38 to 41 are True or False.

38. If the feasible region for a LPP is unbounded, maximum or minimum of the objective function
Z = ax + by may or may not exist.
39. Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point
of the feasible region.
40. In a LPP, the minimum value of the objective function Z = ax + by is always 0 if origin is one of the
corner point of the feasible region.
41. In a LPP, the maximum value of the objective function Z = ax + by is always finite.

You might also like