Start learning →

AP Intermediate 2nd Year Linear Programming — practice questions — page 4

Explore 97 free Linear Programming questions in AP Intermediate 2nd Year 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 91–97 of 97.

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 →Feasible or infeasible?Read the answer and worked solution →Linear programming numbersRead 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

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 →

If the feasible region R is bounded, Z has:

  1. Only a minimum
  2. Neither of them
  3. Both max and min
  4. Only a maximum
Show answer and solution

Correct answer: C. Both max and min

1. A bounded region is closed on every side. 2. The objective function is evaluated at each corner. 3. So Z has both a maximum and a minimum on R. 4. The answer is both max and min. _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 AP Intermediate 2nd Year. Read explanations as you go. No signup form needed to start.

Practise Linear Programming →

More Mathematics topics

Vector Algebra and 3D GeometryContinuity, Differentiability & DerivativesIntegrals and ApplicationsRelations, Functions & Inverse TrigonometryDifferential EquationsDeterminantsMatrices and DeterminantsProbability