Advertisements
Advertisements
Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
| Transportation cost per quintal(in Rs.) | ||
| From-> | A | B |
| To | ||
| D | 6.00 | 4.00 |
| E | 3.00 | 2.00 |
| F | 2.50 | 3.00 |
How should the supplies be transported in order that the transportation cost is minimum?
Concept: undefined >> undefined
A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:
| Transportation Cost per packet(in Rs.) | ||
| From-> | A | B |
| To | ||
| P | 5 | 4 |
| Q | 4 | 2 |
| R | 3 | 5 |
Concept: undefined >> undefined
Advertisements
By graphical method, the solution of linear programming problem
\[\text{ Subject } to \text{ 3 } x_1 + 2 x_2 \leq 18\]
\[ x_1 \leq 4\]
\[ x_2 \leq 6\]
\[ x_1 \geq 0, x_2 \geq 0, \text{ is } \]
Concept: undefined >> undefined
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
Concept: undefined >> undefined
The point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.
Concept: undefined >> undefined
The value of objective function is maximum under linear constraints ______.
Concept: undefined >> undefined
If li, mi, ni, i = 1, 2, 3 denote the direction cosines of three mutually perpendicular vectors in space, prove that AAT = I, where \[A = \begin{bmatrix}l_1 & m_1 & n_1 \\ l_2 & m_2 & n_2 \\ l_3 & m_3 & n_3\end{bmatrix}\]
Concept: undefined >> undefined
If\[A = \begin{bmatrix}2 & 3 \\ 4 & 5\end{bmatrix}\]prove that A − AT is a skew-symmetric matrix.
Concept: undefined >> undefined
If A is a square matrix of order 3 with |A| = 4 , then the write the value of |-2A| .
Concept: undefined >> undefined
Show that the height of a cylinder, which is open at the top, having a given surface area and greatest volume, is equal to the radius of its base.
Concept: undefined >> undefined
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
Concept: undefined >> undefined
If sin y = xsin(a + y) prove that `(dy)/(dx) = sin^2(a + y)/sin a`
Concept: undefined >> undefined
If A = `[[0 , 2],[3, -4]]` and kA = `[[0 , 3"a"],[2"b", 24]]` then find the value of k,a and b.
Concept: undefined >> undefined
`"If y" = (sec^-1 "x")^2 , "x" > 0 "show that" "x"^2 ("x"^2 - 1) (d^2"y")/(d"x"^2) + (2"x"^3 - "x") (d"y")/(d"x") - 2 = 0`
Concept: undefined >> undefined
A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
The probabilities of solving a specific problem independently by A and B are `1/3` and `1/5` respectively. If both try to solve the problem independently, find the probability that the problem is solved.
Concept: undefined >> undefined
Prove that `int_0^"a" "f(x)" "dx" = int_0^"a" "f"("a"-"x")"dx"` ,and hence evaluate `int_0^1 "x"^2(1 - "x")^"n""dx"`.
Concept: undefined >> undefined
If A and B are square matrices of the same order 3, such that ∣A∣ = 2 and AB = 2I, write the value of ∣B∣.
Concept: undefined >> undefined
If f(x) = x + 1, find `d/dx (fof) (x)`
Concept: undefined >> undefined
