COMEDK
Linear Programming PYQCOMEDK 2025 Evening Shift
MCQ+1 / -02025
Given , subject to constraints are .
P is one of the corner points of the feasible region for the given Linear Programming Problem.
Then the coordinate of is
P is one of the corner points of the feasible region for the given Linear Programming Problem.
Then the coordinate of
Solution
Correct option: B
Option B:
Step 1
Check each option against all constraints:
Step 2
For
So option A is not feasible.
Step 3
For
and
Also,
Step 4
For
For
So options C and D are not feasible.
Step 5
Only
