Advertisements
Advertisements
प्रश्न
Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, y ≥ 0
Advertisements
उत्तर
We first draw the graphs of x + 2y = 10
x + y = 6
3x + y = 8.
The shaded region ABCD is the feasible region (R) determined by the above constraints.
The feasible region is unbounded.
Therefore, minimum of Z may or may not occur.
If it occurs, it will be on the corner point.
| Corner Point | Value of Z | |
| A (0, 8) | 40 | |
| B (1, 5) | 28 | |
| C (2, 4) | 26 | ← Smallest |
| D (10, 0) | 30 |
Let us draw the graph of 3x + 5y < 26 as shown in Figure by dotted line.
We see that the open half-plane determined by 3x + 5y < 26 and R do not have a point in common.
Thus, 26 is the minimum value of Z.
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.
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
Objective function of a LPP is
Let X1 and X2 are optimal solutions of a LPP, then
The maximum value of Z = 4x + 2y subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10 ; x, y ≥ 0 is
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
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
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?
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 ______
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 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.
Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0
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 corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is ______.
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 ______.
What is defined as a problem in which a linear objective function is to be maximised or minimised subject to a set of linear constraints and non-negative conditions on the variables?
An optimisation problem becomes a Linear Programming Problem (LPP) when:
A furniture dealer invests in tables (\[x\]) and chairs (\[y\]). He has \[\text{Rs } 50,000\] to invest and storage space for at most \[60\] pieces. A table costs \[\text{Rs } 2500\] and gives a profit of \[\text{Rs } 250\], while a chair costs \[\text{Rs } 500\] and gives a profit of \[\text{Rs } 75\]. What is the objective function to maximise total profit \[Z\]?
For a furniture dealer with an investment limit of \[\text{Rs } 50,000\] and space for at most \[60\] pieces, where a table costs \[\text{Rs } 2500\] and a chair costs \[\text{Rs } 500\], which set of inequalities correctly represents the investment and storage constraints (where \[x\] is tables and \[y\] is chairs)?
