A linear programming problem is one that is conerned with finding the ….A…. Of a linear function called ….B… function of serval variables ( say x and Y) , subject to the condiations that the variables are ….C…. And satisfy set of linear inequalities called linear constriants .
Here, A,B C are respectively

A problem which seeks to maximise or minimise a linear function (say, of two variables x and y) subject to certain constraints as determined by a set of linear inequalities is called a/an

In linear programming problem, the linear function Z subject to certain conditions determined by a set of linear inequalities with variables as non-negative, is

In a LPP, the linear inequalities or restrictions on the variables called.

In a LPP, the linear inequalities or restrictions on the variables called.

Any solution to a linear programming problem which satisfies the non negative restrictions of the problems is called

Let R be the feasible region (convex polygon) for a linear programming problem and Z = ax + by be the objective function. Then, which of the following statements is false? A) When Z has an optimal value, where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region . B)If R is bounded, then the objective function Z has both a maximum and a minimum value on Rand each of these occurs at a corner point of R . C) If R is unbounded, then a maximum or a minimum value of the objective function may not exist D) If R is unbounded and a maximum or a minimum value of the objective function z exists, it must occur at corner point of R

Variables of the objective function of the linear programming problem are