Overview & Revision Guide

Practise Class 12 Linear Programming by translating constraints into linear inequalities, graphing the feasible region and finding the optimum value at its corner points. This chapter test supports CBSE Maths revision of objective functions and graphical solutions.

Show your inequalities and identify the feasible region before evaluating candidate vertices. After submission, use explanations to check both the graph and the reasoning behind the maximum or minimum value.

Test Structure & CBSE Scoring Advice: This online assessment simulates authentic CBSE examination standards. Read every question carefully, formulate algebraic equations methodically on scratch paper, and check intermediate signs. For subjective questions, write down the applicable theorem or identity before executing substitutions.

Time Management Strategy: Allocate approximately 1.5 to 2 minutes per 1-mark question, 4 to 5 minutes for 2-mark problems, and 8 to 10 minutes for multi-step 4-mark and 5-mark proofs. Review all answers and verify calculations before pressing final submit.

Need Quick Review? Consult our Class 12 Chapter Notes, practice with NCERT Textbook Solutions, and verify recurring patterns in Board Exam PYQs.

CBSE Stepwise Marking Norms: Remember that full credit requires explicit step justification. State the theorem name (such as BPT, Fundamental Theorem of Calculus, or Bayes' Formula), define all substituted variables clearly, and double-check algebraic arithmetic before final submission to maximize your score. After completing the test, inspect the detailed question solutions to analyze common pitfalls, review question-wise timing, and reinforce weaker syllabus topics using our chapter notes and NCERT solutions. Maintain a dedicated error log for incorrect attempts to systematically track conceptual formula gaps and recurring calculation slips.

Test: Linear Programming | Class 12 Maths

Section A
Question 1 (1 Mark)
Back to Dashboard