Consider the linear programming problem Maximise subject to

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

Problem

Consider the linear programming problem Maximise Z=kx+3yZ = kx + 3y subject to x+y≥6,  x+2y≤8,  x≥0,  y≥0x + y \ge 6,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0. For which values of kk is the optimal value of ZZ attained at the vertex (4,2)(4,2) of the feasible region? (a) k<1.5k < 1.5 (b) k=1.5k = 1.5 (c) k≤1.5k \le 1.5 (d) 1.5≤k≤31.5 \le k \le 3

Related theory

Browse the problem library