JEE Main & Advanced Mathematics Linear Programming Question Bank Linear Programming

  • question_answer
    For the constraint of a linear optimizing function \[z={{x}_{1}}+{{x}_{2}}\], given  by \[{{x}_{1}}+{{x}_{2}}\le 1,\ 3{{x}_{1}}+{{x}_{2}}\ge 3\] and \[{{x}_{1}},\ {{x}_{2}}\ge 0\]

    A)                 There are two feasible regions

    B)                 There are infinite feasible regions

    C)                 There is no feasible region          

    D)                 None of these

    Correct Answer: C

    Solution :

                    Clearly from graph there is no feasible region.


You need to login to perform this action.
You will be redirected in 3 sec spinner