Are these practice questions for Linear Programming based on the CBSE pattern?

Yes. Every practice question is modeled on the CBSE Class 12 - Science Mathematics exam pattern — including MCQs, assertion-reason questions, and short-answer formats that frequently appear in CBSE papers.

Are the practice questions for Linear Programming free?

Yes. Every chapter includes free practice questions for Class 12 - Science students to get you started.

What types of questions are included?

The practice set for Linear Programming mainly includes MCQs and CBSE-style short-answer questions, with instant feedback on each answer. For full-length textbook practice, use the NCERT Solutions page.

Are the practice questions suitable for board exam preparation?

Yes. The questions test the same concepts and depth that CBSE asks in board exams. After finishing, also solve the NCERT and NCERT Exemplar exercises for Linear Programming for full coverage.

How many practice questions are there for Linear Programming?

The number scales with chapter length and concept density. Each chapter typically has 15-50 practice questions across MCQ and short-answer formats.

Linear Programming Class 12 Mathematics Practice Questions with Answers

easy

A factory produces two types of alloys, A and B, by mixing copper and zinc. Alloy A requires copper and zinc in a 1:3 ratio, and Alloy B requires them in a 3:2 ratio. The profit on Alloy A is Rs 400/kg and on Alloy B is Rs 500/kg. Formulate only the objective function to maximize profit.

Try solving it in your notebook first, then check the solution.

easy

Calculate the value of the objective function

Z = 150x + 200y

at the corner point

(10, 20)

.

Try solving it in your notebook first, then check the solution.

easy

Formulate an LPP for the following problem: A workshop manufactures two types of products, P1 and P2. Each product requires processing on two machines, M1 and M2. P1 requires 4 hours on M1 and 2 hours on M2. P2 requires 3 hours on M1 and 5 hours on M2. Machine M1 is available for at most 100 hours per week, and M2 is available for at most 80 hours per week. The profit on P1 is Rs 60 per unit and on P2 is Rs 75 per unit. The workshop must manufacture at least 10 units of P1.

Try solving it in your notebook first, then check the solution.

easy

Define a 'feasible region' in the context of an LPP.

Try solving it in your notebook first, then check the solution.

easy

The feasible region for a linear programming problem is bounded, with corner points at A(0,10), B(12,6), C(20,0), and the origin O(0,0). Analyze these points to determine the maximum value of the objective function

Z = 25x + 30y

.

Try solving it in your notebook first, then check the solution.

easy

What are 'non-negative constraints' in a Linear Programming Problem?

Try solving it in your notebook first, then check the solution.

easy

Create a linear constraint that mathematically represents the statement: 'For a certain product mix, the quantity of item X (

x

) must not exceed three times the quantity of item Y (

y

).'

Try solving it in your notebook first, then check the solution.

easy

Define the objective function in a Linear Programming Problem (LPP).

Try solving it in your notebook first, then check the solution.

easy

Given an objective function to maximize,

Z = 20x + 150y

, justify which variable's coefficient suggests a greater sensitivity on the total value of Z.

Try solving it in your notebook first, then check the solution.

easy

A company produces two types of souvenirs, type A and type B. The profit on one unit of type A is Rs 60 and on one unit of type B is Rs 85. Let

x

be the number of units of type A and

y

be the number of units of type B produced. Formulate the objective function to maximize the profit.

Try solving it in your notebook first, then check the solution.

easy

A workshop manufactures two products, P1 and P2. Each unit of P1 requires 4 hours of grinding and each unit of P2 requires 2 hours of grinding. The total available grinding time is 40 hours per week. If

x

is the number of units of P1 and

y

is the number of units of P2 manufactured, formulate the linear constraint for the grinding time.

Try solving it in your notebook first, then check the solution.

easy

List the three main components of a Linear Programming Problem.

Try solving it in your notebook first, then check the solution.

medium

What is an 'infeasible solution' in a linear programming problem?

Try solving it in your notebook first, then check the solution.

medium

Summarize the 'Corner Point Method' for solving a linear programming problem graphically, assuming the feasible region is bounded.

Try solving it in your notebook first, then check the solution.

medium

A student states, 'If a linear programming problem has a feasible region, it is guaranteed to have an optimal solution.' Critique this statement.

Try solving it in your notebook first, then check the solution.

medium

Solve the following Linear Programming Problem graphically: Maximise

Z = 4x + 3y

subject to the constraints:

x+y \leq 5

2x+y \leq 8

x \geq 0, y \geq 0

Try solving it in your notebook first, then check the solution.

medium

For the LPP: Minimize

Z = 5x + 10y

subject to

x+y \geq 6

,

2x+y \geq 8

,

x, y \geq 0

. A manager proposes the solution

(x,y)=(4,2)

. Evaluate this proposal by checking for feasibility and optimality. Justify your conclusion.

Try solving it in your notebook first, then check the solution.

medium

Explain the difference between a 'feasible solution' and an 'optimal solution' in an LPP.

Try solving it in your notebook first, then check the solution.

medium

Describe what an 'optimisation problem' is and explain why a Linear Programming Problem is considered a special type of optimisation problem.

Try solving it in your notebook first, then check the solution.

medium

A company manufactures two types of toys, A and B. Toy A requires 4 hours of moulding and 2 hours of finishing. Toy B requires 2 hours of moulding and 5 hours of finishing. The company has a maximum of 100 hours of moulding and 120 hours of finishing available. The profit is Rs 50 on toy A and Rs 60 on toy B. Identify the decision variables, the objective function, and the constraints for moulding and finishing.

Try solving it in your notebook first, then check the solution.

medium

For a linear programming problem, the feasible region is found to be unbounded. Using the Corner Point Method, the smallest value of the objective function

Z = 3x + 5y

is calculated to be 70 at a corner point. To confirm if 70 is the actual minimum value, an open half-plane is checked for common points with the feasible region. State the strict linear inequality that defines this open half-plane.

Try solving it in your notebook first, then check the solution.

medium

Create a real-world scenario for a small business that can be modeled by the LPP below. After describing the scenario, solve the LPP graphically to propose an optimal business plan. Maximize

P = 100x + 150y

Subject to:

2x + 3y \leq 120

x + y \leq 50

x \geq 15

x, y \geq 0

Try solving it in your notebook first, then check the solution.

medium

A dietician is designing a cost-effective diet from two food products, Food A and Food B. Food A costs Rs 5 per unit and contains 2 units of protein and 4 units of carbohydrates. Food B costs Rs 8 per unit and contains 3 units of protein and 2 units of carbohydrates. The diet requires a minimum of 12 units of protein and 16 units of carbohydrates. Formulate this situation as a Linear Programming Problem to minimize the cost.

Try solving it in your notebook first, then check the solution.

medium

Name the method used for solving LPPs graphically by evaluating the objective function at the vertices of the feasible region.

Try solving it in your notebook first, then check the solution.

medium

Justify why the optimal value (maximum or minimum) of a linear objective function over a bounded feasible region must occur at one of its corner points.

Try solving it in your notebook first, then check the solution.

medium

Solve the following Linear Programming Problem graphically: Minimise

Z = 5x + 7y

subject to the constraints:

2x+y \geq 8

x+2y \geq 10

x \geq 0, y \geq 0

Try solving it in your notebook first, then check the solution.

medium

A student is solving an LPP graphically. The feasible region is a polygon with vertices A(0,5), B(2,1), and C(6,0). The objective is to minimize

Z = 4x + 3y

. The student claims the minimum value occurs at the point (4, 0.5), which lies on the edge BC, with a value of

Z=17.5

. Critique this reasoning and determine the correct optimal solution.

Try solving it in your notebook first, then check the solution.

medium

A dietician wishes to mix two types of foods, F1 and F2. Food F1 contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food F2 contains 1 unit/kg of vitamin A and 2 units/kg of vitamin C. The mixture must contain at least 8 units of vitamin A and 10 units of vitamin C. Food F1 costs Rs 50 per kg and Food F2 costs Rs 70 per kg. Formulate this problem as a linear programming problem to minimise the cost of the mixture.

Try solving it in your notebook first, then check the solution.

medium

Analyze the feasible region for a linear programming problem defined by the constraints

x+y \leq 6

,

2x+y \leq 8

,

x \geq 0

,

y \geq 0

. Identify the corner points (vertices) of the feasible region.

Try solving it in your notebook first, then check the solution.

medium

Design a Linear Programming Problem involving two variables (

x, y

) and three linear constraints (excluding non-negativity constraints) such that its feasible region is a triangle with vertices at (0, 0), (8, 0), and (0, 5).

Try solving it in your notebook first, then check the solution.

medium

A company manufactures two types of lamps, L1 and L2. Each L1 lamp requires 2 hours of manufacturing time and 1 hour of finishing time. Each L2 lamp requires 1 hour of manufacturing and 2 hours of finishing. The company has a total of 100 hours of manufacturing time and 80 hours of finishing time available per week. The profit per unit of L1 is Rs 120 and for L2 is Rs 90. Formulate this as a linear programming problem and solve it graphically to find the weekly production level of each lamp type for maximum profit.

Try solving it in your notebook first, then check the solution.

medium

Describe what a 'bounded' feasible region is. According to Theorem 2, what does this imply for the objective function?

Try solving it in your notebook first, then check the solution.

medium

Explain why the term 'linear' is used in 'Linear Programming Problem'.

Try solving it in your notebook first, then check the solution.

hard

A company manufactures two products, A and B. The current production plan is modeled by the LPP: Maximize Profit

P = 250x + 200y

Subject to:

3x + y \leq 150

(Machine Hours)

x + 2y \leq 100

(Labor Hours)

x, y \geq 0

The company can upgrade its machinery, which would change the machine hours constraint to

2x + y \leq 150

. Evaluate the original LPP to find the current maximum profit. Then, evaluate the new LPP with the upgraded machinery. Propose whether the company should invest in the upgrade if the investment cost is equivalent to 1000 profit units.

Try solving it in your notebook first, then check the solution.

hard

An LPP has a bounded feasible region. It is found that the objective function

Z = 4x + 6y

has the same maximum value at two distinct corner points, A(3, 8) and B(6, 6). Justify mathematically why any point P on the line segment AB must also be an optimal solution.

Try solving it in your notebook first, then check the solution.

hard

A manager has formulated the following LPP to minimize the cost of two raw materials,

x

and

y

: Minimize

C = 10x + 4y

Subject to:

3x + y \geq 9

x + y \geq 7

x + 2y \leq 8

x, y \geq 0

Critique this formulation by graphing the constraints. Justify whether the problem has a feasible solution. If not, propose one specific modification to the third constraint (

x + 2y \leq 8

) that would result in a non-empty, bounded feasible region.

Try solving it in your notebook first, then check the solution.

hard

A company produces two types of electronic circuits, A and B. It costs the company Rs 200 to make a type A circuit and Rs 300 to make a type B circuit. The company has a total budget of Rs 24,000 for production. The number of type B circuits produced cannot exceed half the number of type A circuits. Furthermore, the company must produce at least 30 type A circuits. If the profit on each type A circuit is Rs 40 and on type B is Rs 50, formulate and solve this LPP graphically to find the maximum profit.

Try solving it in your notebook first, then check the solution.

hard

A farmer needs to buy cattle feed consisting of two brands, X and Y. Brand X costs Rs 25 per kg and Brand Y costs Rs 40 per kg. Each kg of Brand X contains 2 units of nutrient A, 2 units of nutrient B, and 4 units of nutrient C. Each kg of Brand Y contains 3 units of nutrient A, 5 units of nutrient B, and 2 units of nutrient C. The minimum requirements for the feed are 240 units of A, 300 units of B, and 280 units of C. Also, the farmer must buy at least 100 kg of feed in total. Formulate this as an LPP and solve graphically to find the quantity of each brand that should be purchased to meet the requirements at a minimum cost.

Try solving it in your notebook first, then check the solution.

hard

Analyze the following linear programming problem to determine if a maximum value for Z exists. If it does, find it. If not, explain why. Maximise

Z = x + 3y

subject to the constraints:

x-y \geq 0

x+y \geq 6

x \geq 0, y \geq 0

Try solving it in your notebook first, then check the solution.

hard

Analyze and solve the following Linear Programming Problem graphically: Maximise

Z = 2x + 4y

subject to the constraints:

x+2y \leq 10

x+y \leq 6

x \leq 4

x \geq 0, y \geq 0

Try solving it in your notebook first, then check the solution.

hard

Explain the difference in the procedure for finding a maximum value for an objective function when the feasible region is bounded versus when it is unbounded.

Try solving it in your notebook first, then check the solution.

hard

Solve the following Linear Programming Problem graphically: Minimise

Z = 6x + 10y

subject to the constraints:

x+2y \geq 10

x+y \geq 6

3x+y \geq 8

x \geq 0, y \geq 0

Try solving it in your notebook first, then check the solution.

hard

Summarize what it means for a Linear Programming Problem to have 'no feasible solution'.

Try solving it in your notebook first, then check the solution.

hard

Describe a situation where a Linear Programming Problem can have multiple optimal solutions.

Try solving it in your notebook first, then check the solution.

hard

Consider the LPP: Maximize

Z = 2x + 5y

subject to constraints

x+4y \leq 24

,

3x+y \leq 21

,

x+y \leq 9

,

x, y \geq 0

. The optimal solution is found at a certain point. Now, evaluate the impact on the optimal value if the profit from

y

is reduced, changing the objective function to

Z = 2x + 2y

. Justify your findings.

Try solving it in your notebook first, then check the solution.

Linear ProgrammingClass 12 Mathematics Practice Questions