Skip to main content
Class 11 ch 5 · Class 12 ch 12

Linear inequalities and linear programming: CUET-style questions

Original CUET-style questions on linear inequalities and linear programming, with a worked solution and the usual trap for each. Tap an option, or type a numerical answer, to check it.

  • 8 questions
  • 3 free
  • All multiple choice
  • No calculator

Learn the chapters first: Class 11, Linear Inequalities · Class 12, Linear Programming.

Questions

Q1

·CUET style·Multiple choiceLinear programming

Maximise Z=4x+3y subject to x+y≤4, x≤3, x,y≥0. The maximum value is

Show answer
Answer: (a) 15

Corner points: (0,0), (3,0), (3,1), (0,4). Z = 0, 12, 15, 12. Maximum 15 at (3,1).

Trap: Missing the corner (3,1), where x=3 meets x+y=4, gives 12.

Q2

·CUET style·Multiple choiceLinear inequalities

The solution set of 3x−5<x+7, x∈R, is

Show answer
Answer: (a) x<6

3x−x<7+5, so 2x<12 and x<6.

Q3

·CUET style·Multiple choiceMultiple optimal points

The corner points of a feasible region are (0,3), (2,0), (5,0), (5,6) and (0,6). The minimum of Z=3x+2y occurs

Show answer
Answer: (b) at every point of the segment joining (0,3) and (2,0)

Z at the corners: 6, 6, 15, 27, 12. The minimum 6 is reached at two adjacent corners, so it is reached at every point of the edge joining them (the line 3x+2y=6).

Trap: When two adjacent corners tie, the optimum is the whole edge, not one corner.

5 more questions with CBSE Pro

CBSE Pro opens them with worked solutions, along with every chapter question and marking scheme for Class 10, 11 and 12. Try it free for 7 days, no card.

Start free 7-day trial Sign in

What this set tests

The 8 questions, in order:

  1. Linear programming: CUET style, multiple choice (free, above)
  2. Linear inequalities: CUET style, multiple choice (free, above)
  3. Multiple optimal points: CUET style, multiple choice (free, above)
  4. Linear programming: CUET style, multiple choice (CBSE Pro)
  5. Feasible regions: CUET style, multiple choice (CBSE Pro)
  6. Systems of inequalities: CUET style, multiple choice (CBSE Pro)
  7. Minimising on an unbounded region: CUET style, multiple choice (CBSE Pro)
  8. Points in a region: CUET style, multiple choice (CBSE Pro)

The CBSE chapters behind it, and the exams that list them

"Background" means the exam does not list the chapter by name but its questions use it. This is our reading of the published syllabuses, still to be re-checked against the current editions: see the chapter map and the official syllabus before you skip anything.

The traps in this set (read them after you try the questions)

  • Linear programming. Missing the corner (3,1), where x=3 meets x+y=4, gives 12.
  • Multiple optimal points. When two adjacent corners tie, the optimum is the whole edge, not one corner.
  • Systems of inequalities. The strict inequality x<6 leaves out 6.
  • Minimising on an unbounded region. On an unbounded region, check that the open half-plane Z<11 misses the region before calling 11 the minimum.

Next steps

All questions are original, written by CBSE Math Revision in the style of each exam; none are taken from NTA, IIT, CBSE or NCERT papers. Every answer was checked twice: by a computer re-solve and by hand. No calculator needed. Spotted a mistake? Tell us.