Consider a system of linear inequalities in two variables whose solution set is…

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

Problem

Consider a system of linear inequalities in two variables whose solution set is called the feasible region. (i) Define a feasible region in the context of linear inequalities. (ii) Prove that the feasible region obtained by simultaneously satisfying any finite number of linear inequalities in two variables is always a convex set. (iii) Draw a rough sketch of two intersecting half-planes to illustrate part (ii) and mark the feasible region clearly.

Related theory

Browse the problem library