मराठी

Science (English Medium) इयत्ता १२ - CBSE Important Questions

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  4881 to 4900 of 6295  next > 

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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical Method

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: Methods to Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical Method

A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1 hour on machine B to produce a package of bolts. He earns a profit of ₹ 35 per package of nuts and ₹ 14 per package of bolts. How many packages of each should be produced each day so as to maximize his profit, if he operates each machine for almost 12 hours a day? convert it into an LPP and solve graphically.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Different Types of 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: Methods to Find the Solution of L.P.P> Graphical Method

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

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Find the Solution of L.P.P> Graphical 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 Find the Solution of L.P.P> Graphical Method

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: Methods to Find the Solution of L.P.P> Graphical Method

Solve the following linear programming problem graphically:

Minimize: Z = 5x + 10y

Subject to constraints:

x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Find the Solution of L.P.P> Graphical Method

Solve the following linear programming problem graphically:

Maximize: Z = x + 2y

Subject to constraints:

x + 2y ≥ 100,

2x – y ≤ 0

2x + y ≤ 200,

x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Find the Solution of L.P.P> Graphical Method

Solve the following Linear Programming problem graphically:

Maximize: Z = 3x + 3.5y

Subject to constraints:

x + 2y ≥ 240,

3x + 1.5y ≥ 270,

1.5x + 2y ≤ 310,

x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Methods to Find the Solution of L.P.P> Graphical Method
< prev  4881 to 4900 of 6295  next > 
Advertisements
Advertisements
CBSE Science (English Medium) इयत्ता १२ Important Questions
Important Questions for CBSE Science (English Medium) इयत्ता १२ Biology
Important Questions for CBSE Science (English Medium) इयत्ता १२ Chemistry
Important Questions for CBSE Science (English Medium) इयत्ता १२ Computer Science (C++)
Important Questions for CBSE Science (English Medium) इयत्ता १२ Computer Science (Python)
Important Questions for CBSE Science (English Medium) इयत्ता १२ English Core
Important Questions for CBSE Science (English Medium) इयत्ता १२ English Elective - NCERT
Important Questions for CBSE Science (English Medium) इयत्ता १२ Entrepreneurship
Important Questions for CBSE Science (English Medium) इयत्ता १२ Geography
Important Questions for CBSE Science (English Medium) इयत्ता १२ Hindi (Core)
Important Questions for CBSE Science (English Medium) इयत्ता १२ Hindi (Elective)
Important Questions for CBSE Science (English Medium) इयत्ता १२ History
Important Questions for CBSE Science (English Medium) इयत्ता १२ Informatics Practices
Important Questions for CBSE Science (English Medium) इयत्ता १२ Mathematics
Important Questions for CBSE Science (English Medium) इयत्ता १२ Physical Education
Important Questions for CBSE Science (English Medium) इयत्ता १२ Physics
Important Questions for CBSE Science (English Medium) इयत्ता १२ Political Science
Important Questions for CBSE Science (English Medium) इयत्ता १२ Psychology
Important Questions for CBSE Science (English Medium) इयत्ता १२ Sociology
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×