English

Arts (English Medium) Class 12 - CBSE Important Questions for Mathematics

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics
Advertisements
Advertisements
Mathematics
< prev  901 to 920 of 927  next > 

There are two types of fertilisers 'A' and 'B'. 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs Rs 10 per kg and 'B' cost Rs 8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of a large increase in the volume of mail handling and delivery. Because of the limited office space and the budgetary conditions, the number of temporary helpers must not exceed 10. According to past experience, a man can handle 300 letters and 80 packages per day, on the average, and a woman can handle 400 letters and 50 packets per day. The postmaster believes that the daily volume of extra mail and packages will be no less than 3400 and 680 respectively. A man receives Rs 225 a day and a woman receives Rs 200 a day. How many men and women helpers should be hired to keep the pay-roll at a minimum ? Formulate an LPP and solve it graphically.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Linear Programming Problem and Its Mathematical Formulation

Maximise Z = x + 2y subject to the constraints

`x + 2y >= 100`

`2x - y <= 0`

`2x + y <= 200`

Solve the above LPP graphically

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following linear programming problem graphically :

Maximise Z = 7x + 10y subject to the constraints

4x + 6y ≤ 240

6x + 3y ≤ 240

x ≥ 10

x ≥ 0, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following L.P.P. graphically: 

Minimise Z = 5x + 10y

Subject to x + 2y ≤ 120

Constraints x + y ≥ 60

x – 2y ≥ 0 and x, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following L.P.P. graphically Maximise Z = 4x + y 

Subject to following constraints  x + y ≤ 50

3x + y ≤ 90,

x ≥ 10

x, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following L.P.P graphically: Maximise Z = 20x + 10y

Subject to the following constraints x + 2y ≤ 28,

3x + y ≤ 24,

x ≥ 2,

 x, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Solve the following LPP graphically :
Maximise Z = 105x + 90y
subject to the constraints
x + y ≤ 50
2x + y ≤ 80
x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :

Tablets  Iron Calcium Vitamin
x 6 3 2
y 2 3 4

The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
xy ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of a grinding/cutting machine and a sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at the most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is Rs 25 and that from a shade is Rs 15. Assuming that the manufacturer can sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit? Formulate an LPP and solve it graphically.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Different Types of Linear Programming Problems

A company manufactures two types of cardigans: type A and type B. It costs ₹ 360 to make a type A cardigan and ₹ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most ₹ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of ₹ 100 for each cardigan of type A and ₹ 50 for every cardigan of type B. 

Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

The solution set of the inequality 3x + 5y < 4 is ______.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming Problem graphically:

Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems
< prev  901 to 920 of 927  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×