PracBee

COMEDK

Linear Programming PYQCOMEDK 2025 Afternoon Shift

MCQ+1 / -02025
The corner points of the feasible region determined by the system of linear constraints are (0,3),(1,1) and (3,0), If objective function is Z=px+qy,p,q>0 then the condition on p and q so that the minimum of Z occurs at (3,0) and (1,1) is

More Linear Programming questions to practice

Question details

Source: COMEDK 2025 Afternoon Shift. Subject: Mathematics. Chapter: Linear Programming. Marking: +1 / -0.

Linear Programming has 20 previous-year questions in COMEDK since 2020. It appeared in 92.3% of the 13 papers analysed. In 2026 it averaged 1.5 questions per paper, about 2.5% of the paper.

Similar Linear Programming PYQs

More practice from this question

Get your COMEDK study planSee where Linear Programming fits, with a day-by-day timetable for your exam date. Free PDF.