Advertisements
Advertisements
Question
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.
Advertisements
Solution
The problem is: Maximise Z = 510x + 675y
Subject to the constraints: `{:(x + y ≤ 300),(2x + 3y ≤ 720),(x ≥ 0"," y ≥ 0):}}`
The feasible region OABC is shown in the Figure
Since the feasible region is bounded
Therefore maximum of Z must occur at the corner point of OBC.
| Corner Point | Value of Z | |
| O(0, 0) | 510 (0) + 675 (0) = 0 | |
| A(300, 0) | 510 (300) + 675 (0) = 153000 | |
| B(180, 120) | 510 (180) + 675 (120) = 172800 | ← Maximum |
| C(0, 240) | 510 (0) + 675 (240) = 162000 |
Thus, maximum Z is 172800 at the point (180, 120), i.e., the company should produce 180 black and white television sets and 120 coloured television sets to get maximum profit.
APPEARS IN
RELATED QUESTIONS
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.
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.
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 optimal value of the objective function is attained at the points
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
Which of the following is not a convex set?
Feasible region is the set of points which satisfy ______.
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?
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 ______
Heramb requires at most 400 calories from his breakfast. Every morning he likes to take oats and milk. If each bowl of oats and a glass of milk provides him 80 calories and 50 calories respectively, then as a constraint this information can be expressed as ______
Determine the maximum value of Z = 4x + 3y if the feasible region for an LPP is shown in figure
Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0
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 ______.
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)?
