2. Solved Papers
  3. J & K CET Engineering

J & K CET Engineering J and K - CET Engineering Solved Paper-2003

  • question_answer
    In case of a linear programming problem, feasible region is always

    A)  a convex set

    B)  a concave set

    C)  a bounded convex set

    D)  a bounded concave set

    Correct Answer: A

    Solution :

    In case of a linear programming problem feasible region is always a convex set.


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