Advertisements
Advertisements
प्रश्न
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 ______
Advertisements
उत्तर
x + y ≤ 250
APPEARS IN
संबंधित प्रश्न
A company is making two products A and B. The cost of producing one unit of products A and B are Rs 60 and Rs 80 respectively. As per the agreement, the company has to supply at least 200 units of product B to its regular customers. One unit of product A requires one machine hour whereas product B has machine hours available abundantly within the company. Total machine hours available for product A are 400 hours. One unit of each product A and B requires one labour hour each and total of 500 labour hours are available. The company wants to minimize the cost of production by satisfying the given requirements. Formulate the problem as a LPP.
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 manufacturer can produce two products, A and B, during a given time period. Each of these products requires four different manufacturing operations: grinding, turning, assembling and testing. The manufacturing requirements in hours per unit of products A and B are given below.
| A | B | |
| Grinding | 1 | 2 |
| Turning | 3 | 1 |
| Assembling | 6 | 3 |
| Testing | 5 | 4 |
The available capacities of these operations in hours for the given time period are: grinding 30; turning 60, assembling 200; testing 200. The contribution to profit is Rs 20 for each unit of A and Rs 30 for each unit of B. The firm can sell all that it produces at the prevailing market price. Determine the optimum amount of A and B to produce during the given time period. 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 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?
Consider a LPP given by
Minimum Z = 6x + 10y
Subjected to x ≥ 6; y ≥ 2; 2x + y ≥ 10; x, y ≥ 0
Redundant constraints in this LPP are
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
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.
Feasible region is the set of points which satisfy ______.
State whether the following is True or False:
The optimum value of the objective function of LPP occurs at the centre of the feasible region.
Choose the correct alternative:
How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?
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 ______
Ganesh owns a godown used to store electronic gadgets like refrigerator (x) and microwave (y). If the godown can accommodate at most 75 gadgets, then this can be expressed as a constraint by ______
Ms. Mohana want to invest at least ₹ 55000 in Mutual funds and fixed deposits. Mathematically this information can be written as ______
Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.
Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0
Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.
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.
