CBSE · Senior secondary

CBSE Class 12 — Notes, Chapters & Practice Quizzes

Master every Class 12 chapter — the base your board marks and your NEET / JEE / CUET prep both stand on.

13 subjects 166 chapters 171 practice quizzes NCERT syllabus
77 quiz attempts so far Dual AI-verified questions 10 quizzes free, then ₹19 per quiz Plans from ₹99/month
Notice Board

10 questions · instant score · weak-chapter diagnosis

Class 12 students learning
01 Choose a chapter02 Revise key ideas03 Test recall

Students preparing for CBSE Class 12 Board Examination

View all
Formula of the day
Physics · Electrostatics · 13 formulae in the cheatsheet
Trap of the day
Photoelectric emission depends on FREQUENCY, not intensity. Below threshold frequency there is no emission however bright the light.
Next StepsPractice QuizFind weak topicsAccountancyBiologyBusiness StudiesChemistryEconomicsEnglishGeographyHistoryMathematicsPhysicsPolitical SciencePsychologySociologyPYQ PapersSolve official papersMock TestsRehearse exam dayDiscussionAsk the community
Mathematics · 13 chapters
Summary, key terms, extra questions with answers and a practice quiz with AI diagnosis for each.

Chapter 6: Linear ProgrammingClass 12 Mathematics — summary, notes, extra questions & MCQ quiz

Try one from this chapter
A linear programming problem optimises a:

Summary

Linear programming finds the optimal value of a linear objective function subject to linear constraints. A typical problem maximises or minimises \(Z=ax+by\) subject to inequalities such as \(c_1x+c_2y\leq k\) together with the non-negativity constraints \(x\geq0,\,y\geq0\). The set of points satisfying all constraints is the feasible region, a convex polygon (possibly unbounded). The key result is that an optimal value of \(Z\), when it exists, occurs at a corner (vertex) of the feasible region. The Corner Point Method therefore evaluates \(Z\) at each vertex and selects the largest or smallest value. For a bounded feasible region both a maximum and a minimum exist; for an unbounded region an optimum may fail to exist, which must be checked. The chapter solves such problems graphically in two variables.

Formulation of LPPConstraints and feasible regionCorner Point MethodBounded and unbounded regionsGraphical solution

Key terms

Objective function
The linear function \(Z=ax+by\) to be optimised.
Constraints
The linear inequalities restricting the variables.
Feasible region
The common region satisfying all constraints, including \(x,y\geq0\).
Corner point
A vertex of the feasible region, the intersection of two boundary lines.
Optimal solution
A feasible point giving the maximum or minimum of \(Z\).
Bounded region
A feasible region that can be enclosed within a circle.

Extra questions & answers

Explore interactively

Key-term flashcards
Flip cards · mark known · keyboard ← → and Space
6 cards
Term1 / 6
Objective function
Tap to reveal
Meaning1 / 6
The linear function \(Z=ax+by\) to be optimised.
Tap to flip back
Tap card to flip

Keyboard: ← → to move · Space to flip

Practice quiz · Linear Programming

Score on this chapter, climb the leaderboard, and get an AI diagnosis of your mistakes.

Dual AI-verified questions Real exam pattern 1 free quiz every month, then ₹9 per quiz — or a monthly plan

#1

Linear Programming

Start here
Maths 10 Qs · ~10 min

Instant score, answer review and weak-topic diagnosis