A gardening club wishes to mark out a planting zone that satisfies the constraints…

MATHEMATICS · Multi-part · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

A gardening club wishes to mark out a planting zone that satisfies the constraints x+y≤5,x + y \le 5, x≥1,x \ge 1, y≥0.y \ge 0. Five points are proposed as possible reference stakes: (1,0),  (1,4),  (2,3),  (4,0),  (0,5).(1,0),\;(1,4),\;(2,3),\;(4,0),\;(0,5). (i) For each of the five points, verify whether it lies inside the planting zone defined by the inequalities. (ii) Using the results of part (i), state the exact coordinates of all vertices of the feasible region. (iii) Make a rough sketch of the feasible region, clearly marking every vertex obtained in part (ii).

Related theory

Browse the problem library