Skip to content
← Mathematics and Statistics

Mathematics and Statistics · Class 12 Commerce

Ch 14Linear Programming — Class 12 Mathematics and Statistics, concept-first.

This Maharashtra Std XII (Commerce) Mathematics and Statistics chapter studies Linear Programming — a technique for getting the best possible outcome (largest profit, smallest cost) when limited resources must be shared between competing activities.

28

Q&A

3

Concepts

Not available

Exam weightage

Start learning — read this chapter →

Key concepts

Hover a concept to preview it and jump to its most relevant Q&A.

Chapter contents

The NCERT structure, section by section. Open a section to see its questions, then read the concept-first solution.

1

Formulation of a Linear Programming Problem (LPP)

This Maharashtra Std XII (Commerce) Mathematics and Statistics chapter studies Linear Programming — a technique for getting the best possible outcome (largest profit, smallest cost) when limited resou…

2

Feasible Region — Bounded and Unbounded

Once an LPP is formulated, its constraints are graphed exactly as in Std XI: each inequation is a half-plane, and the region satisfying all of them at once is the set of allowable plans.

3

Graphical Solution by the Corner-Point Method

For an LPP in two variables the feasible region is a flat region of the plane, and the optimum can be found graphically. The method rests on one key result.

4

Maximisation and Minimisation Applications

The corner-point method turns real commercial questions into a short, repeatable calculation. Two families of problem recur throughout the Std XII (Commerce) course.

Exercises

Sample & Board Papers

Sample papers and previous-year board questions for this subject.

+Show 15 questions15 questions
  1. Q1In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C res…Preview
  2. Q2Solve the following LP.P. Maximize $z = 13x + 9y$, Subject to $3x + 2y \leq 12$, $x + y \geq 4$, $x \geq 0$, $y \geq 0$.Preview
  3. Q3If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and $\left(0, \frac{7}{3}\right)$ the maximum value of $z = 4x + 5y$…Preview
  4. Q4Graphical solution set of the inequations $x \geq 0$ and $y \leq 0$ lies in ______ quadrant.Preview
  5. Q5Solve the following L.P.P. by graphical method: Maximize: $Z = 4x + 6y$ Subject to $3x + 2y \leq 12$, $x + y \geq 4$, $x, y \geq 0$.Preview
  6. Q6Objective function of LPP is ______. (a) A constraint (b) A function to be maximised or minimised (c) A relation between the decision variab…Preview
  7. Q7State whether the following is True or False: The optimum value of the objective function of LPP occurs at the centre of the feasible region…Preview
  8. Q8Solve the following L.P.P. by graphical method: Minimize: $Z = 6x + 2y$ subject to $x + 2y \geq 3$, $x + 4y \geq 4$, $3x + y \geq 3$, $x \ge…Preview
  9. Q9The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per…Preview
  10. Q10Solve the following L.P.P. by graphical method: Maximize: $Z = 4x + 6y$ Subject to $3x + 2y \le 12$, $x + y \ge 4$, $x, y \ge 0$.Preview
  11. Q11If the corner points of the feasible region are $(0, 10)$, $(2, 2)$ and $(4, 0)$ then the point of minimum $z = 3x + 2y$ is ______. (a) $(2,…Preview
  12. Q12A dish washing machine holds up to 40 pieces of large crockery ($x$). This constraint is given by ______.Preview
  13. Q13Solve the following L.P.P. by graphical method: Minimize: $z = 8x + 10y$ Subject to: $2x + y \geq 7$, $2x + 3y \geq 15$, $y \geq 2$, $x \geq…Preview
  14. Q14Show the solution set for the following inequation $x + 4y \leq 0$ graphically.Preview
  15. Q15Solve the following L.P.P. graphically: Minimize: $Z = 3x + 2y$, Subject to the constraints $x - y \leq 1$, $x + y \geq 3$, $x \geq 0$, $y \…Preview

More questions