Manufacturing and Linear Programming Concepts

This tutorial covers linear programming problems (LPP) for class 12, focusing on manufacturing, diet, and transportation problems. It explains the steps to solve LPP, including writing inequalities, drawing graphs, and finding corner points. Two detailed examples are provided: one on manufacturing and another on computer sales, demonstrating how to maximize profit using LPP.

What is the short form of Linear Programming Problems?

• LPP

• LPR

• LPC

• LPS

Which of the following is NOT a type of Linear Programming Problem discussed?

• Investment

• Diet

• Manufacturing

• Transportation

What is the first step in solving a Manufacturing problem?

• Calculate profit

• Find corner points

• Draw the graph

• Write linear inequalities

In the Manufacturing problem example, how many labor hours are required for fabricating model A?

• 12 hours

• 3 hours

• 1 hour

• 9 hours

What is the profit for each piece of model B in the Manufacturing problem example?

• Rupees 8,000

• Rupees 15,000

• Rupees 12,000

• Rupees 10,000

Which inequality represents the labor hours constraint for fabricating in the Manufacturing problem?

• 9x + 12y ≤ 180

• x + 3y ≤ 30

• 5x + 2y ≤ 100

• 3x + 4y ≤ 60

What is the maximum profit achieved in the Manufacturing problem example?

• Rupees 1,00,000

• Rupees 1,68,000

• Rupees 1,20,000

• Rupees 1,50,000

In the personal computer problem, what is the cost of a desktop model?

• Rupees 30,000

• Rupees 25,000

• Rupees 50,000

• Rupees 40,000

What is the maximum number of computers that can be demanded monthly in the personal computer problem?

• 300 units

• 200 units

• 250 units

• 150 units

What is the profit on each portable model in the personal computer problem?

• Rupees 6,000

• Rupees 3,500

• Rupees 5,000

• Rupees 4,500