Start learning →

CUET UG Linear Programming — practice questions

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 1–30 of 36.

Linear programming problems seek to maximise or:Read the answer and worked solution →Linear programming is a class of which problems?Read the answer and worked solution →The function to be maximised or minimised is the:Read the answer and worked solution →The restrictions on the variables are called:Read the answer and worked solution →The conditions x >= 0 and y >= 0 are called:Read the answer and worked solution →The region satisfying all constraints is called:Read the answer and worked solution →A point outside the feasible region is an:Read the answer and worked solution →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 →A feasible region is bounded if it can be:Read the answer and worked solution →The region other than the feasible region is called:Read the answer and worked solution →Theorem 1 describes the feasible region as a:Read the answer and worked solution →Corner points of a feasible region are also called its:Read the answer and worked solution →A linear programming problem must have constraints that are:Read the answer and worked solution →Some problems minimise a linear function subject to given:Read the answer and worked solution →A feasible region is bounded if it can be:Read the answer and worked solution →The region other than the feasible region is called:Read the answer and worked solution →Theorem 1 describes the feasible region as a:Read the answer and worked solution →Corner points of a feasible region are also called its:Read the answer and worked solution →Linear programming is a class of which problems?Read the answer and worked solution →The region satisfying all constraints is called:Read the answer and worked solution →Some problems minimise a linear function subject to given:Read the answer and worked solution →A linear programming problem must have constraints that are:Read the answer and worked solution →The function to be maximised or minimised is the:Read the answer and worked solution →The restrictions on the variables are called:Read the answer and worked solution →The conditions x >= 0 and y >= 0 are called:Read the answer and worked solution →A point outside the feasible region is an:Read the answer and worked solution →

Worked practice questions

Linear programming problems seek to maximise or:

  1. Minimise
  2. Randomise
  3. Normalise
  4. Stabilise
Show answer and solution

Correct answer: A. Minimise

1. Such problems aim at the best possible outcome. 2. Profit is pushed up while cost is pushed down. 3. So they maximise or minimise a quantity. 4. The answer is minimise. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_

Open this question →

Linear programming is a class of which problems?

  1. Construction
  2. Optimisation
  3. Integration
  4. Factorisation
Show answer and solution

Correct answer: B. Optimisation

1. The aim is always the best value of some quantity. 2. Problems of that kind have a general name. 3. Linear programming is a class of optimisation problems. 4. So the answer is optimisation. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_

Open this question →

The function to be maximised or minimised is the:

  1. Feasible function
  2. Corner point value
  3. Objective function
  4. Constraint function
Show answer and solution

Correct answer: C. Objective function

1. One linear expression carries the goal of the problem. 2. Z = 250x + 75y is the worked example. 3. That is the linear objective function. 4. So the answer is the objective function. _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