Advertisements
Advertisements
प्रश्न
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
पर्याय
x ≥ 0, y ≥ 0
x ≥ 6, 2x + y ≥ 10
2x + y ≥ 10
none of these
Advertisements
उत्तर
We need to minimize the function Z = 6x + 10y
Converting the given inequations into equations, we obtain
These lines are drawn using a suitable scale
Scale
On X axis
1 Big division = 1 unit
On Y axis
1 Big division = 1 unit
The shaded region represents the feasible region of the given LPP.
We observe that the feasible region is due to the constraint \[x \geq 6, y \geq 2\]
So, the redundant constraint is \[2x + y \geq 10\]
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 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.
Which of the following sets are convex?
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
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
Choose the correct alternative:
The constraint that in a college there are more scholarship holders in FYJC class (X) than in SYJC class (Y) is given by
Choose the correct alternative:
How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?
State whether the following statement is True or False:
The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)
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 ______
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 ______
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.
Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, y ≥ 0
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 ______.
Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.
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 ____________.
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?
What is the correct sequential order of steps to formulate and solve a 2-variable Linear Programming Problem?
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)?
