Problems which seek to maximise or, minimise profit or, cost form a general class of problems called ………
In any problem in which we maximise or minimise profit or cost i.e. we find the optimal value.Hence, they are called Optimisation Problems
A ……… of a feasible region is a point in the region, which is the intersection of two boundary lines.
A vertex of the feasible region. Not every intersection of lines is a corner point. The corner points only occur at a vertex of the feasible region. If there is going to be an optimal solution to a linear programming problem, it will occur at one or more corner points, or on a line segment between two corner points.
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called …… The conditions x ≥ 0 , y ≥ 0 are called …….
The common region determined by all the constraints including non-negative constraints x, y ≥ 0 of a linear programming problem is called the ………
Let Z = ax + by is a linear objective function. Variables x and y are called ……… variables.
A linear function of several variables x and y is called ………
Every point of feasible region is called a ……… to the problem.
How many of the following points satisfy the inequality 2x – 3y > -5?
(1, 1), (-1, 1), (1, -1), (-1, -1), (-2, 1), (2, -1), (-1, 2) and (-2, -1)
2x – 3y > -5
Only these 5 (x, y) pairs satisfy the inequality
(1, 1), (1, -1), (-1, -1), (2, -1), (-2, -1)
The linear inequalities on the variables of a linear programming problem are called ………
The feasible solution of a L.P.P. belongs to
As per the definition of LPP:
Linear Programming Problem is one that is concerned with finding the optimal value of a linear function of several variables, subject to the conditions that the variables are non-negative and satisfy a set of linear inequalities.
Since the variables (x & y) are non-negative, the feasible solution of a LPP belongs to the 1st quadrant only.