Linear Programming — Flashcards
NIOS · Class 12 · Mathematics
24 flashcards for Linear Programming (NIOS Class 12 Mathematics) to test yourself on key terms and facts. Part of the NIOS Class 12 Mathematics syllabus.
Interactive on Super Tutor
Studying Linear Programming? Get the full interactive chapter.
Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for flashcards and more.
Free trial, no card needed.
Solve the toy dealer problem. Rs.1500 is available. Type A toys cost Rs.300 and sell for Rs.325. Type B toys cost Rs.250 and sell for Rs.265. What purchase gives the maximum profit?
Answer
Step 1: Check the possible combinations that fit in Rs.1500. Step 2: Compute profit for each valid combination: - 0 A, 6 B: Cost = 6 × 250 = Rs.1500, Profit = 6 × 15 = Rs.90 - 1 A, 4 B: Cost = 300 + …
Formulate the radio retailer problem as a linear programming problem.
Answer
Let x1 = number of type A radio sets and x2 = number of type B radio sets. Step 1: Non-negative restrictions: x1 ≥ 0, x2 ≥ 0 Step 2: Cost constraint: 360x1 + 240x2 ≤ 5760 Divide by 120: 3x1 + 2x2 ≤ …
Solve the radio retailer LPP by checking the corner points.
Answer
Given: Maximise z = 50x1 + 40x2 subject to 3x1 + 2x2 ≤ 48, x1 + x2 ≤ 20, x1 ≥ 0, x2 ≥ 0. Step 1: Find corner points. - O(0,0) - On x1-axis: 3x1 ≤ 48 and x1 ≤ 20, so x1 = 16 gives point A(16,0) - On x…
Why are decision variables in linear programming always taken as non-negative?
Answer
Step 1: Decision variables usually represent real quantities such as number of toys, sets, days, or products. Step 2: A negative number of such items is impossible in a physical situation. Step 3: S…
Formulate the soft drink plants P and Q problem as an LPP.
Answer
Let x1 = days plant P runs and x2 = days plant Q runs. Step 1: Objective function for minimum cost: z = 6000x1 + 4000x2 Step 2: Demand constraints: Plant P and Q together must meet demand. For drink…
In the soft drink plants problem, how do you verify that the constraint for drink A is correct?
Answer
Step 1: Plant P produces 3000 bottles of A per day. Step 2: Plant Q produces 1000 bottles of A per day. Step 3: If P runs for x1 days and Q runs for x2 days, total A bottles = 3000x1 + 1000x2. Step 4:…
Solve the machines G and H problem: maximise z = 2x1 + 3x2 with x1 + x2 ≤ 400 and 2x1 + x2 ≤ 600.
Answer
Step 1: Note the constraints: x1 + x2 ≤ 400 2x1 + x2 ≤ 600 x1 ≥ 0, x2 ≥ 0 Step 2: Find corner points. - O(0,0) - On x1-axis: 2x1 ≤ 600 gives x1 ≤ 300, so A(300,0) - On x2-axis: x1 + x2 ≤ 400 gives x2…
Why does the feasible region matter in linear programming?
Answer
Step 1: Each constraint cuts the plane into a region. Step 2: The common part where all constraints are satisfied is the feasible region. Step 3: Only points inside this region can be accepted as solu…
+16 more flashcards
Practise AllFrequently Asked Questions
What are the important topics in Linear Programming for NIOS Class 12 Mathematics?
How many flashcards are available for Linear Programming?
How should I revise Linear Programming for the NIOS Class 12 board exam?
Sources & Official References
Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.
More resources for Linear Programming
Practice Quiz
Test yourself with a quick quiz
Important Questions
Exam-style questions with answers
Revision Notes
Key points for last-minute revision
Formula Sheet
The chapter's formulas in one place
Chapter Summary
Understand the chapter at a glance
Concept Maps
See how topics connect
Study Plan
Step-by-step plan for this chapter
Syllabus
What topics to cover
For serious students
Get the full Linear Programming chapter — start free.
Quizzes, flashcards, an AI doubt solver and a study plan for NIOS Class 12 Mathematics. Free to start, no card needed.