PracBee

KCET

Linear Programming PYQKCET 2020

MCQ+1 / -02020

Corner points of the feasible region determined by the system of linear constraints are (0,3),(1,1) and (3,0). Let z=px=qy, where, p,q>0. 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: KCET 2020. Subject: Mathematics. Chapter: Linear Programming. Marking: +1 / -0.

Linear Programming has 16 previous-year questions in KCET since 2017. It appeared in 100% of the 10 papers analysed. In 2026 it averaged 2 questions per paper, about 3.3% of the paper.

Similar Linear Programming PYQs

More practice from this question

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