Advertisements
Advertisements
Solve the system of linear equations using the matrix method.
x − y + z = 4
2x + y − 3z = 0
x + y + z = 2
Concept: undefined >> undefined
Solve the system of linear equations using the matrix method.
2x + 3y + 3z = 5
x − 2y + z = −4
3x − y − 2z = 3
Concept: undefined >> undefined
Advertisements
Solve the system of linear equations using the matrix method.
x − y + 2z = 7
3x + 4y − 5z = −5
2x − y + 3z = 12
Concept: undefined >> undefined
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
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.
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`
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.
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.
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
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.
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.
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.
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.
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.
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.
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.
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?
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?
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?
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.
Concept: undefined >> undefined
