English

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

Advertisements
Subjects
Topics
Subjects
Popular subjects
Topics
Advertisements
Advertisements
Mathematics
< prev  481 to 500 of 528  next > 

Equation of a line passing through point (1, 2, 3) and equally inclined to the coordinate axis, is ______.

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Direction Cosines and Direction Ratios of a Line

Find the angle between the following two lines:

`vecr = 2hati - 5hatj + hatk + λ(3hati + 2hatj + 6hatk)`

`vecr = 7hati - 6hatk + μ(hati + 2hatj + 2hatk)`

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Angle Between Two Lines

Find the coordinates of the foot of the perpendicular drawn from point (5, 7, 3) to the line `(x - 15)/3 = (y - 29)/8 = (z - 5)/-5`.

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Direction Cosines and Direction Ratios of a Line

The lines `vecr = hati + hatj - hatk + λ(2hati + 3hatj - 6hatk)` and `vecr = 2hati - hatj - hatk + μ(6hati + 9hatj - 18hatk)`; (where λ and μ are scalars) are ______.

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Shortest Distance Between Two Lines

Find the coordinates of the image of the point (1, 6, 3) with respect to the line `vecr = (hatj + 2hatk) + λ(hati + 2hatj + 3hatk)`; where 'λ' is a scalar. Also, find the distance of the image from the y – axis.

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Direction Cosines and Direction Ratios of a Line

An aeroplane is flying along the line `vecr = λ(hati - hatj + hatk)`; where 'λ' is a scalar and another aeroplane is flying along the line `vecr = hati - hatj + μ(-2hatj + hatk)`; where 'μ' is a scalar. At what points on the lines should they reach, so that the distance between them is the shortest? Find the shortest possible distance between them.

Appears in 1 question paper
Chapter: [11] Three - Dimensional Geometry
Concept: Shortest Distance Between Two Lines

A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)

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

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Solve LPP (Graphical / Corner Point Method)

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: Methods to Solve LPP (Graphical / Corner Point Method)
< prev  481 to 500 of 528  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×