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.

 


 


A firm manufactures 3 products AB and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product : 

Machine Products
A B C
M1
M2
4 3 5
2 2 4

Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.


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.

 


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 ₹ 25 ₹ 30  
Labour cost per unit ₹ 16 ₹ 20  
Raw material cost per unit ₹ 4 ₹ 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.


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.


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

Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.


Choose the correct alternative :

The maximum value of z = 10x + 6y, subjected to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.


State whether the following is True or False :

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


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 = 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 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 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 point at which the minimum value of Z = 8x + 12y subject to the constraints 2x + y ≥ 8, x + 2y ≥ 10, x ≥ 0, y ≥ 0 is obtained at the point


Choose the correct alternative:

The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at


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:

A convex set includes the points but not the segment joining the points


The feasible region represented by the inequations x ≥ 0, y ≤ 0 lies in ______ quadrant.


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 = x + 4y subject to constraints

x + 3y ≥ 3, 2x + y ≥ 2, 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 

______


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×