English

Solve the following problem : A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential compo - Mathematics and Statistics

Advertisements
Advertisements

Question

Solve the following problem :

A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components, a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufacture per month to maximize profit? How much is the maximum profit?

Graph
Sum
Advertisements

Solution

Let the firm manufacture x units of A and y units of B.
The profit is ₹ 20 per unit of A and ₹ 30 per unit of B.
∴ Total profit = ₹ (20 x + 30 y).
We construct a table with the constraints of number of motors and transformers needed.

Electrical item\Essential component A
(x)
B
(y)
Maximum Supply
Motors 3 2 210
Transformers 2 4 300

From the table, the total motors required is (3x + 2y) and total motor required is (2x + 4y).
But total supply of components per month is restricted to 210 motors and 300 transformers.
∴ The constraints are 3x + 2y ≤ 210 and 2x + 4y ≤ 300.
As x, y cannot be negative, we have x ≤ 0 and y ≥ 0.
Hence the given LPP can be formulated as follows:
Maximize Z = 20x + 30y
Subject to
3x + 2y ≤ 210,
2x + 4y ≤ 300,
x ≤ 0, y ≥ 0.
For graphical solutions of the inequalities, consider lines L1 : 3x + 2y = 210 and 2x + 4y = 300

For L1

x y (x, y)
0 105 (0, 105)
70 0 (70, 0)

For L2

x y (x, y)
0 75 (0, 75)
150 0 (150, 0)

L1 passes through A (0, 105) and B (70, 0)
L2 passes through P (0, 75) and Q (150, 0)
Solving both lines, we get x = 30, y = 60
The coordinates of origin O (0, 0) satisfies both the inequalities.
∴ The required region is on origin side of both the lines L1 and L2.
As x ≥ 0, y ≥ 0; the feasible region lies in the first quadrant.
OBRP is the required feasible region.
At O (0, 0), Z = 0 + 0 = 0
At B (70, 0), Z = 20 (70) + 0 = 1400
At R (30, 60), Z = 20 (30) + 30 (60) = 2400
At P (0, 75), Z = 0 + 30 (75) = 2250
The maximum value of Z is 2400 and it occurs at R (30, 60)
Thus 30 units of A and 60 units of B must be manufactured to get maximum profit of ₹ 2400.

shaalaa.com
  Is there an error in this question or solution?
Chapter 6: Linear Programming - Miscellaneous Exercise 6 [Page 105]

APPEARS IN

Balbharati Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
Chapter 6 Linear Programming
Miscellaneous Exercise 6 | Q 4.15 | Page 105

RELATED QUESTIONS

A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.


A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.


The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, xy ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is 


Solve the following LPP by graphical method:

Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0


Choose the correct alternative :

The point at which the maximum value of z = x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is


Fill in the blank :

Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant


Fill in the blank :

The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.


The region represented by the inequality y ≤ 0 lies in _______ quadrants.


The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.


State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.


Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.


Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0


Solve the following problem :

A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.

Ingredients per kg. /Chemical Units A
(x)
B
(y)
Minimum requirements in
P 1 2 80
Q 3 1 75
Cost (in ₹) 4 6  

Find the number of units of chemicals A and B should be produced so as to minimize the cost.


Choose the correct alternative:

The point at which the maximum value of Z = 4x + 6y subject to the constraints 3x + 2y ≤ 12, x + y ≥ 4, x ≥ 0, y ≥ 0 is obtained at the point


Choose the correct alternative:

The corner points of the feasible region are (0, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at


State whether the following statement is True or False:

The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20


State whether the following statement is True or False:

If LPP has two optimal solutions, then the LPP has infinitely many solutions


State whether the following statement is True or False:

If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12


A set of values of variables satisfying all the constraints of LPP is known as ______


A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit


Minimize Z = 24x + 40y subject to constraints

6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0


Minimize Z = 2x + 3y subject to constraints

x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0


Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.

Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.

x ≥ 0, y ≥ 0

As per the given condition, x + y ______ 45000

He wants to invest at least ₹ 10,000 in PPF.

∴ y ______ 10000

Amartya wants to invest at least ₹ 5000 in IVP.

∴ x ______ 5000

Total interest (Z) = ______

The formulated LPP is

Maximize Z = ______ subject to 

______


Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequations Equations X intercept Y intercept Region
5x + y ≥ 10 5x + y = 10 ( ___, 0) (0, 10) Away from origin
x + y ≥ 6 x + y = 6 (6, 0) (0, ___ ) Away from origin
x + 4y ≥ 12 x + 4y = 12 (12, 0) (0, 3) Away from origin
x, y ≥ 0 x = 0, y = 0 x = 0 y = 0 1st quadrant

∵ Origin has not satisfied the inequations.

∴ Solution of the inequations is away from origin.

The feasible region is unbounded area which is satisfied by all constraints.

In the figure, ABCD represents

The set of the feasible solution where

A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).

The coordinates of B are obtained by solving equations

x + 4y = 12 and x + y = 6

The coordinates of C are obtained by solving equations

5x + y = 10 and x + y = 6

Hence the optimum solution lies at the extreme points.

The optimal solution is in the following table:

Point Coordinates Z = 4x + 5y Values Remark
A (12, 0) 4(12) + 5(0) 48  
B ( ___, ___ ) 4( ___) + 5(___ ) ______ ______
C ( ___, ___ ) 4( ___) + 5(___ ) ______  
D (0, 10) 4(0) + 5(10) 50  

∴ Z is minimum at ___ ( ___, ___ ) with the value ___


A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-


If z = 200x + 500y  .....(i)

Subject to the constraints:

x + 2y ≥ 10  .......(ii)

3x + 4y ≤ 24  ......(iii)

x, 0, y ≥ 0  ......(iv)

At which point minimum value of Z is attained.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×