Let the feasible region be defined by

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

Problem

x \ge y \ge 0

. Consider the objective function

Z = kx + y

. For which values of

k

does the maximisation of

Z

yield an unbounded (infinite) maximum value? (a)

k\ge -1

(b)

k<-1

(c)

k>-1

(d)

k>0