Time Left: 600 sec

1. Problems which seek to maximise or, minimise profit or, cost form a general class of problems called ………

2. A ……… of a feasible region is a point in the region, which is the intersection of two boundary lines.

3. 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 .......

4. The common region determined by all the constraints including non-negative constraints x, y ≥ 0 of a linear programming problem is called the ……...

5. Let Z = ax + by is a linear objective function. Variables x and y are called ……… variables.

6. A linear function of several variables x and y is called ……...

7. Every point of feasible region is called a ……… to the problem.

8. 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)

9. The linear inequalities on the variables of a linear programming problem are called ………

10. The feasible solution of a L.P.P. belongs to