मराठी

Science (English Medium) इयत्ता १२ - CBSE Question Bank Solutions

Advertisements
विषय
अध्याय
विषय
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  13581 to 13600 of 25507  next > 

Solve the system of linear equations using the matrix method.

2x + 3y + 3z = 5

x − 2y + z = −4

3x − y − 2z = 3

[4] Determinants
Chapter: [4] Determinants
Concept: undefined >> undefined

Solve the system of linear equations using the matrix method.

x − y + 2z = 7

3x + 4y − 5z = −5

2x − y + 3z = 12

[4] Determinants
Chapter: [4] Determinants
Concept: undefined >> undefined

Advertisements

If A = `[(2,-3,5),(3,2,-4),(1,1,-2)]` find A−1. Using A−1 solve the system of equations:

2x – 3y + 5z = 11

3x + 2y – 4z = –5

x + y – 2z = –3

[4] Determinants
Chapter: [4] Determinants
Concept: undefined >> undefined

The cost of 4 kg onion, 3 kg wheat and 2 kg rice is Rs. 60. The cost of 2 kg onion, 4 kg wheat and 6 kg rice is Rs. 90. The cost of 6 kg onion 2 kg wheat and 3 kg rice is Rs. 70. Find the cost of each item per kg by matrix method.

[4] Determinants
Chapter: [4] Determinants
Concept: undefined >> undefined

Solve the system of the following equations:

`2/x+3/y+10/z = 4`

`4/x-6/y + 5/z = 1`

`6/x + 9/y - 20/x = 2`

[4] Determinants
Chapter: [4] Determinants
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Maximise Z = 5x + 3y

subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 2y

subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

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

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Show that the minimum of Z occurs at more than two points.

Minimise and Maximise Z = 5x + 10 y

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

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Show that the minimum of Z occurs at more than two points.

Minimise and Maximise Z = x + 2y 

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Show that the minimum of Z occurs at more than two points.

Maximise Z = – x + 2y, Subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Show that the minimum of Z occurs at more than two points.

Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:

Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1

One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?

 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

Type of toy Machines
I II III
A 12 18 6
B 6 0 9

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined
< prev  13581 to 13600 of 25507  next > 
Advertisements
Advertisements
CBSE Science (English Medium) इयत्ता १२ Question Bank Solutions
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Biology
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Chemistry
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Computer Science (C++)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Computer Science (Python)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ English Core
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ English Elective - NCERT
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Entrepreneurship
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Geography
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Hindi (Core)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Hindi (Elective)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ History
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Informatics Practices
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Mathematics
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Physical Education
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Physics
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Political Science
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Psychology
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Sanskrit (Core)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Sanskrit (Elective)
Question Bank Solutions for CBSE Science (English Medium) इयत्ता १२ Sociology
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×