Mathematics · JEE | LINEAR PROGRAMMING
हिन्दीGiven below are two statements: Statement I: The feasible region of a linear programming problem is always a convex region. Statement II: The optimal value of the objective function always occurs at the origin of the coordinate system.
View Answer & Solution
Correct answer · Option C
Statement I is correct but Statement II is incorrect.
Explanation
Statement I is true because feasible regions formed by linear inequalities are convex. Statement II is false because the optimal value occurs at a corner point, which may or may not be the origin.