If , where , attains its maximum value at both corner points and of the feasible…

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

Problem

If Z=ax+by+cZ=ax+by+c, where a,b,c>0a,b,c>0, attains its maximum value at both corner points (4,0)(4,0) and (0,3)(0,3) of the feasible region, then

Related theory

Browse the problem library