Start learning →

CUET UG Linear Programming — practice questions — page 2

Explore 36 free Linear Programming questions in CUET UG 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–36 of 36.

Points within and on the boundary of the feasible region are:Read the answer and worked solution →Linear programming problems here are solved by which method?Read the answer and worked solution →The optimal value of Z occurs at which points of the region?Read the answer and worked solution →If the feasible region R is bounded, Z has:Read the answer and worked solution →If the feasible region is unbounded, an optimum may:Read the answer and worked solution →Linear programming problems seek to maximise or:Read the answer and worked solution →

Worked practice questions

Points within and on the boundary of the feasible region are:

  1. Infeasible points
  2. Objective values
  3. Unbounded values
  4. Feasible solutions
Show answer and solution

Correct answer: D. Feasible solutions

1. The boundary lines are part of the region. 2. Every point up to and including them satisfies the constraints. 3. So they represent feasible solutions. 4. The answer is feasible solutions. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_

Open this question →

Linear programming problems here are solved by which method?

  1. Graphical
  2. Numerical
  3. Iterative
  4. Recursive
Show answer and solution

Correct answer: A. Graphical

1. The constraints are drawn as lines on a plane. 2. The region between them is then read off. 3. So the problems are solved by the graphical method. 4. The answer is graphical. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_

Open this question →

The optimal value of Z occurs at which points of the region?

  1. Outside points
  2. Corner points
  3. Middle points
  4. Random points
Show answer and solution

Correct answer: B. Corner points

1. Theorem 1 pins the optimum to the boundary. 2. Specifically it lands on a vertex of the polygon. 3. So the optimum occurs at a corner point. 4. The answer is corner points. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_

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 CUET UG. Read explanations as you go. No signup form needed to start.

Practise Linear Programming →

More Mathematics topics

Vector Algebra and 3D GeometryIntegrals and ApplicationsContinuity, Differentiability & DerivativesDeterminantsMatrices and Determinants