Linear Programming (LP) is crucial because it models real-world constraints with a linear objective and helps decide the best (maximum or minimum) outcome efficiently. It forms the backbone of many CBSE Board and competitive exam questions through graph-based solution, corner-point method, and parameter-based reasoning about optimality and degeneracy (unique/infinite/multiple optima).
25
Minutes
20
Questions
1 / -0
Marking
Q1. For the feasible region defined by
find the maximum value of .
Q2. For the linear programme with
let . For which values of is the point an optimal solution (not necessarily unique)?
Q3. A workshop makes two types of chairs S and D. Each S needs hours of carpentry and hour of polishing; each D needs hour of carpentry and hours of polishing. Daily available hours are (carpentry) and (polishing). Profit per S is and per D is . Let be numbers of S and D produced. Maximise subject to
What is the maximum profit and at which is it attained?
at
at
at
at
Q4. Assertion (A): If the feasible region of a linear programming problem is unbounded and non-empty, then the maximum of any linear objective function over that region does not exist (is unbounded above).
Reason (R): If there exists a feasible point and a direction such that is feasible for all , and the objective coefficient vector satisfies , then as , so the maximum does not exist.
Both A and R are true and R is the correct explanation for A.
Both A and R are true but R is not the correct explanation for A.
A is true but R is false.
A is false but R is true.
Q5. For the LP maximize subject to
determine all real values of for which the LP has more than one optimal solution.
No real value of
All
only
Q6. Maximise subject to
at
at
at
at
Q7. Maximise subject to
at
at
at
at
Q8. Minimise subject to
at
at
at
at
Q9. For which values of does the LPP have infinitely many optimal solutions? Maximise subject to
No real
Q10. Consider the LPP: Maximise subject to
For which real value(s) of does the maximum value of occur uniquely at the point ?
No real value of
Q11. (Maximise the objective function subject to the constraints
Find the maximum value of and the point where it occurs.)
Q12. (Minimise subject to
Find the minimum value of and the point at which it occurs.)
Q13. (Maximise subject to
Determine the maximum value of and the point where it occurs.)
Q14. (Consider the LPP: maximise subject to
For which values of the parameter does this LPP have infinitely many optimal solutions?)
Q15. (Maximise subject to
For which values of the parameter is the point an optimal solution of the LPP? (Include cases where is an optimal solution but not unique.))
...and 5 more challenging questions available in the interactive simulator.