Let the point be tested against the constraints , , ,

MATHEMATICS · Single correct · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

Let the point (2,k)(2,k) be tested against the constraints x−y≤1x-y\le1, 2x+y≥52x+y\ge5, x≥0x\ge0, y≥0y\ge0. For which values of kk does the point satisfy all the constraints simultaneously? (a) k>1k>1 (b) k≥1k\ge 1 (c) k=1k=1 (d) 0≤k≤10\le k\le 1

Related theory

Browse the problem library