NCERT/Class 12/Mathematics/Linear Programming

Linear Programming

Class 12 · Mathematics

37 questions14 easy12 medium11 hard

Sample Questions

Q1.A linear programming problem seeks to find the optimal value of a:

  • AQuadratic function
  • BLinear objective function
  • CPolynomial function
  • DExponential function

Q2.In the furniture dealer problem, the maximum profit of Rs 6250 occurs at which strategy?

  • ABuy 20 tables only
  • BBuy 60 chairs only
  • CBuy 10 tables and 50 chairs
  • DBuy 30 tables and 30 chairs

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

  • A12
  • B16
  • C7
  • D3

Q4.Maximise Z = 5x + 3y subject to 3x+5y ≤ 15, 5x+2y ≤ 10, x,y ≥ 0. The corner points include the intersection of 3x+5y=15 and 5x+2y=10. Find this intersection.

  • A(20/19, 45/19)
  • B(0, 3)
  • C(2, 0)
  • D(15/19, 45/19)

Q5.The linear function Z = ax + by that is to be maximised or minimised in an LPP is called the:

  • AConstraint function
  • BDecision variable
  • CObjective function
  • DFeasibility function

Q6.This is a sample question to preview what you'll get in the full practice test...

  • A. Option one
  • B. Option two
  • C. Option three
  • D. Option four
Create a test to practice all 37 questions →

Concepts Covered

Bounded and Unbounded Feasible RegionConstraintsCorner Point MethodFeasible RegionFeasible SolutionsGraphical MethodMathematical Formulation of LPPMultiple Optimal SolutionsObjective FunctionOptimal Solution

Ready to practice?

Create a timed test from 37 questions in Linear Programming. Pick your difficulty, get instant scores.

Start Practice Test