For the inequalities determine the least value of that makes the feasible region…

MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

For the inequalities x+y≥3,  x+2y≤k,  x≥0,  y≥0,x + y \ge 3,\; x + 2y \le k,\; x \ge 0,\; y \ge 0, determine the least value of kk that makes the feasible region non-empty.

Related theory

Browse the problem library