Advertisements
Advertisements
प्रश्न
Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.
पर्याय
(0, 8)
(2, 5)
(4, 3)
(9, 0)
उत्तर
Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point (2, 5).
Explanation:
APPEARS IN
संबंधित प्रश्न
A firm manufactures two types of products A and B and sells them at a profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2. Type A requires one minute of processing time on M1 and two minutes of M2; type B requires one minute on M1 and one minute on M2. The machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP.
A rubber company is engaged in producing three types of tyres A, B and C. Each type requires processing in two plants, Plant I and Plant II. The capacities of the two plants, in number of tyres per day, are as follows:
| Plant | A | B | C |
| I | 50 | 100 | 100 |
| II | 60 | 60 | 200 |
The monthly demand for tyre A, B and C is 2500, 3000 and 7000 respectively. If plant I costs Rs 2500 per day, and plant II costs Rs 3500 per day to operate, how many days should each be run per month to minimize cost while meeting the demand? Formulate the problem as LPP.
Vitamins A and B are found in two different foods F1 and F2. One unit of food F1contains 2 units of vitamin A and 3 units of vitamin B. One unit of food F2 contains 4 units of vitamin A and 2 units of vitamin B. One unit of food F1 and F2 cost Rs 50 and 25 respectively. The minimum daily requirements for a person of vitamin A and B is 40 and 50 units respectively. Assuming that any thing in excess of daily minimum requirement of vitamin A and B is not harmful, find out the optimum mixture of food F1 and F2 at the minimum cost which meets the daily minimum requirement of vitamin A and B. Formulate this as a LPP.
An automobile manufacturer makes automobiles and trucks in a factory that is divided into two shops. Shop A, which performs the basic assembly operation, must work 5 man-days on each truck but only 2 man-days on each automobile. Shop B, which performs finishing operations, must work 3 man-days for each automobile or truck that it produces. Because of men and machine limitations, shop A has 180 man-days per week available while shop B has 135 man-days per week. If the manufacturer makes a profit of Rs 30000 on each truck and Rs 2000 on each automobile, how many of each should he produce to maximize his profit? Formulate this as a LPP.
A firm manufactures two products, each of which must be processed through two departments, 1 and 2. The hourly requirements per unit for each product in each department, the weekly capacities in each department, selling price per unit, labour cost per unit, and raw material cost per unit are summarized as follows:
| Product A | Product B | Weekly capacity | |
| Department 1 | 3 | 2 | 130 |
| Department 2 | 4 | 6 | 260 |
| Selling price per unit | Rs 25 | Rs 30 | |
| Labour cost per unit | Rs 16 | Rs 20 | |
| Raw material cost per unit | Rs 4 | Rs 4 |
The problem is to determine the number of units to produce each product so as to maximize total contribution to profit. Formulate this as a LPP.
A firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost
The solution set of the inequation 2x + y > 5 is
Which of the following sets are convex?
Let X1 and X2 are optimal solutions of a LPP, then
The optimal value of the objective function is attained at the points
The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80; x, y ≥ 0 is
The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6; x, y ≥ 0
If the constraints in a linear programming problem are changed
Which of the following is not a convex set?
A company manufactures two types of toys A and B. A toy of type A requires 5 minutes for cutting and 10 minutes for assembling. A toy of type B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours available for assembling the toys in a day. The profit is ₹ 50 each on a toy of type A and ₹ 60 each on a toy of type B. How many toys of each type should the company manufacture in a day to maximize the profit? Use linear programming to find the solution.
Tyco Cycles Ltd manufactures bicycles (x) and tricycles (y). The profit earned from the sales of each bicycle and a tricycle are ₹ 400 and ₹ 200 respectively, then the total profit earned by the manufacturer will be given as ______
By spending almost ₹ 250, Rakhi bought some kg grapes (x) and some dozens of bananas (y), then as a constraint this information can be expressed by ______
A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least 4000 units, then the inequation for his requirement will be ______
Determine the maximum value of Z = 4x + 3y if the feasible region for an LPP is shown in figure
Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.
A manufacturing company makes two types of television sets; one is black and white and the other is colour. The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. If it makes a profit of Rs 510 per black and white set and Rs 675 per coloured set, how many sets of each type should be produced so that the company has maximum profit? Formulate this problem as a LPP given that the objective is to maximise the profit.
The common region determined by all the linear constraints of a LPP is called the ______ region.
In maximization problem, optimal solution occurring at corner point yields the ____________.
A type of problems which seek to maximise (or, minimise) profit (or cost) form a general class of problems called.
Conditions under which the object function is to be maximum or minimum are called ______.
