Inequalities and linear programming

Class 12 · Mathematics · 4 questions

Name: ____________________   Date: ____________

1. In linear programming, the region satisfying all the constraints is called the:

   • A Feasible region
   • B Objective
   • C Boundary only
   • D Optimal point

2. The optimal value of a linear objective function over a feasible region occurs at a:

   • A Origin always
   • B Corner point
   • C Outside the region
   • D Midpoint

3. The inequality 2x + y less than or equal to 6 includes the point:

   • A (4, 1)
   • B (3, 3)
   • C (5, 5)
   • D (1, 1)

4. Maximise z = x + y subject to x + y at most 4, x and y at least 0. The maximum value is:

   • A 8
   • B 4
   • C 2
   • D 0