English

Solve the following problem : A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 a - Mathematics and Statistics

Advertisements
Advertisements

Question

Solve the following problem :

A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B. If profits are ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.

Graph
Sum
Advertisements

Solution

Let x number of bicycles and y number of tricycles be manufactured by the company.
∴ Total profit Z = 180x + 220y
This is the objective function to be maximized.
The given information can be tabulated as shown below:

  Bicycles
(x)
Tricycles
(y)
Maximum availability of time (hrs)
Machine A 6 4 120
Machine B 3 10 180

∴ The constraints are 6x + 4y ≤ 120, 3x + 10y ≤ 180, x ≥ 0, y ≥ 0
∴ Given problem can be formulated as
Maximize Z = 180x + 220y
Subject to, 6x + 4y ≤ 120, 3x + 10y ≤ 180 , x ≥ 0, y ≥ 0.
To draw the feasible region, construct the table as follows:

Inequality 6x + 4y ≤ 120 3x + 10y ≤ 180
Corresponding equation (of line) 6x + 4y = 120 3x + 10y = 180
Intersection of line with X-axis (20, 0) (60, 0)
Intersection of line with Y-axis (0, 30) (0, 18)
Region Origin side Origin side

Shaded portion OABC is the feasible region,
whose vertices are O ≡ (0, 0), A ≡ (20, 0), B and C ≡ (0, 18)
B is the point of intersection of the lines 3x + 10y = 180 and 6x + 4y = 120.
Solving the above equations, we get
B ≡ (10, 15)
Here the objective function is,
Z = 180x + 220y
∴ Z at O(0, 0) = 180(0) + 220(0) = 0
Z at A(20, 0) = 180(20) + 220(0) = 3600
Z at B(10, 15) = 180(10) + 220(15) = 5100
Z at C(0, 18) = 180(0) + 220(18) = 3960
∴ Z has maximum value 5100 at B(10, 15)
∴ Z is maximum when x = 10, y = 15

Thus, the company should manufacture 10 bicycles and 15 tricycles to gain maximum profit of ₹ 5100.

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

APPEARS IN

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

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 small manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry, then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for the production of each unit of and B, and the number of man-hours the firm has available per week are as follows:

Gadget Foundry Machine-shop
A 10 5
B 6 4
 Firm's capacity per week 1000 600

The profit on the sale of A is Rs 30 per unit as compared with Rs 20 per unit of B. The problem is to determine the weekly production of gadgets A and B, so that the total profit is maximized. Formulate this problem as a LPP.

 


 


Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than

\[3\frac{1}{2}\] hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than 
\[2\frac{1}{2}\]  hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.

 


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 L.P.P. by graphical method:

Maximize: Z = 10x + 25y
subject to 0 ≤ x ≤ 3,
0 ≤ y ≤ 3,
x + y ≤ 5.
Also find the maximum value of z.


Solve the following L.P.P. by graphical method :

Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.


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 :

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


The constraint that a factory has to employ more women (y) than men (x) is given by _______


Solve the following problem :

Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0


Solve the following problem :

Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0


Solve the following problem :

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


A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.

Product/Machines Chair
(x)
Table
(y)
Available time (hours)
Assembling 3 3 36
Finishing 5 2 50
Polishing 2 6 60

Formulate and solve the following Linear programming problems using graphical method.


Solve the following problem :

A Company produces mixers and processors Profit on selling one mixer and one food processor is ₹ 2000 and ₹ 3000 respectively. Both the products are processed through three machines A, B, C The time required in hours by each product and total time available in hours per week on each machine are as follows:

Machine/Product Mixer per unit Food processor per unit Available time
A 3 3 36
B 5 2 50
C 2 6 60

How many mixers and food processors should be produced to maximize the profit?


Choose the correct alternative:

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


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:

If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)


State whether the following statement is True or False:

Corner point method is most suitable method for solving the LPP graphically


State whether the following statement is True or False:

Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region


State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant


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


A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost


A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs


Maximize Z = 2x + 3y subject to constraints

x + 4y ≤ 8, 3x + 2y ≤ 14, 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 

______


Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0


Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×