Start learning →

JEE Advanced Linear Programming — practice questions — page 2

Explore 42 free Linear Programming questions in JEE Advanced Mathematics. Open each question or exercise to read its content, reference answers and available explanation.

Practise Linear Programming with Quill →

Linear Programming questions and exercises with answers

Showing questions 31–42 of 42.

The graph of a linear inequality such as $2x + 3y \le 12$ represents:Read the answer and worked solution →The corner points of a feasible region are obtained as the:Read the answer and worked solution →If the feasible region of an LPP is empty, then the problem has:Read the answer and worked solution →The word 'linear' in linear programming indicates that the objective function and constraints are:Read the answer and worked solution →Bounded or unboundedRead the answer and worked solution →Order the corner point methodRead the answer and worked solution →Name the partRead the answer and worked solution →Read the furniture problemRead the answer and worked solution →Type the programming termRead the answer and worked solution →One word is wrongRead the answer and worked solution →Feasible or notRead the answer and worked solution →Spot the false statementRead the answer and worked solution →

Worked practice questions

The graph of a linear inequality such as $2x + 3y \le 12$ represents:

  1. a circle
  2. a single line
  3. a half-plane
  4. a bounded triangle
Show answer and solution

Correct answer: C. a half-plane

A linear inequality in two variables represents a half-plane on one side of the boundary line.

Open this question →

The corner points of a feasible region are obtained as the:

  1. centres of the region
  2. intersections of the boundary lines of the constraints
  3. origin and axes only
  4. midpoints of each constraint
Show answer and solution

Correct answer: B. intersections of the boundary lines of the constraints

Corner points are the vertices where the boundary lines of the constraints intersect.

Open this question →

If the feasible region of an LPP is empty, then the problem has:

  1. infinitely many solutions
  2. no feasible solution
  3. a unique solution
  4. exactly two solutions
Show answer and solution

Correct answer: B. no feasible solution

If no point satisfies all constraints, the feasible region is empty and there is no feasible solution.

Open this question →

How to practise

  1. Choose a Linear Programming question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

Put it into practice

Continue with Linear Programming practice for JEE Advanced. Read explanations as you go. No signup form needed to start.

Practise Linear Programming →

More Mathematics topics

Vector Algebra and 3D GeometryStatistics and ProbabilityContinuity, Differentiability & DerivativesIntegrals and ApplicationsMatrices and DeterminantsRelations, Functions & Inverse TrigonometryStraight Lines and Conic SectionsDeterminants