मराठी

A Company Sells Two Different Products, a and B. the Two Products Are Produced in a Common Production Process, Which Has a Total Capacity of 500 Man-hours.

Advertisements
Advertisements

प्रश्न

A company sells two different products, A and B. The two products are produced in a common production process, which has a total capacity of 500 man-hours. It takes 5 hours to produce a unit of A and 3 hours to produce a unit of B. The market has been surveyed and company officials feel that the maximum number of unit of A that can be sold is 70 and that for B is 125. If the profit is Rs 20 per unit for the product A and Rs 15 per unit for the product B, how many units of each product should be sold to maximize profit?

बेरीज
Advertisements

उत्तर

Let x units of product A and y units of product B were manufactured.
Clearly, \[x \geq 0, y \geq 0\]

It takes 5 hours to produce a unit of A and 3 hours to produce a unit of B.The two products are produced in a common production process, which has a total capacity of 500 man-hours.

\[5x + 3y \leq 500\]

The maximum number of unit of A that can be sold is 70 and that for B is 125.

\[x \leq 70\]
\[y \leq 125\]

If the profit is Rs 20 per unit for the product A and Rs 15 per unit for the product B. Therefore, profit x units of product A and y units of product B  is Rs 20x and Rs 15y respectively.

Total profit  = Z = \[20x + 15y\]

The mathematical formulation of the given problem is 

Max Z = \[20x + 15y\] 

subject to

\[5x + 3y \leq 500\]

\[x \leq 70\]

\[y \leq 125\]

\[x \geq 0, y \geq 0\]

First we will convert inequations into equations as follows:
5x + 3y = 500, x = 70, y = 125, x = 0 and y = 0

Region represented by 5x + 3y ≤ 500:
The line 5x + 3y = 500 meets the coordinate axes at A1(100, 0) and \[B_1 \left( 0, \frac{500}{3} \right)\] respectively. By joining these points we obtain the line 5x + 3y = 500. Clearly (0,0) satisfies the 5x + 3y = 500. So, the region which contains the origin represents the solution set of the inequation 5x + 3y ≤ 500.
Region represented by x ​ ≤ 70:
The line ​x = 70 is the line passes through C1(70, 0) and is parallel to Y axis. The region to the left of the line x = 70 will satisfy the inequation x ​ ≤ 70.
Region represented by y ​ ≤ 125:
The line ​y = 125 is the line passes through D1(0, 125) and is parallel to X axis. The region below the  the line y = 125 will satisfy the inequation y ​ ≤ 125.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints 5x + 3y ≤ 500, x ​ ≤ 70, y ​ ≤ 125, x ≥ 0 and y ≥ 0 are as follows.

The corner points are  O(0, 0), D1 \[\left( 0, 125 \right)\] , E1(25, 125), F1(70, 50) and C1(70, 0).The values of Z at the corner points are 

Corner points Z = \[20x + 15y\]
O 0
D1 1875
E1 2375
F1 2150
C1 1400
 
The maximum value of Z is 2375 which is at E1
\[\left( 25, 125 \right)\] .
Thus, maximum profit is Rs 2375, 25 units of A and 125 units of B should be manufactured.

 

 
shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 29: Linear programming - Exercise 30.4 [पृष्ठ ५४]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 29 Linear programming
Exercise 30.4 | Q 33 | पृष्ठ ५४

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.


A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs 7 profit and  B at a profit of Rs 4. Find the production level per day for maximum profit graphically.


Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0


Maximize Z = 4x + 3y
subject to

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]


Maximize Z = 3x + 4y
Subject to

\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]


Maximize Z = −x1 + 2x2
Subject to

\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]

 


Maximize Z = x + y
Subject to

\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 0\]


To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:

  Food I Food II Minimum daily requirement
Calcium
Protein
Calories
10
5
2
4
6
6
20
20
12
Price Rs 0.60 per unit Rs 1.00 per unit  

Find the combination of food items so that the cost may be minimum.


One kind of cake requires 200 g of flour and 25 g of fat, and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no storage of the other ingredients used in making the cakes.


A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.


A company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of a lower quality. Profits on each type of belt are Rs 2 and Rs 1.50 per belt, respectively. Each belt of type A requires twice as much time as required by a belt of type B. If all belts were of type B, the company could produce 1000 belts per day. But the supply of leather is sufficient only for 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 fancy buckles are available for this per day. For belt of type B, only 700 buckles are available per day.
How should the company manufacture the two types of belts in order to have a maximum overall profit?


A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.


A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?


A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?


A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.


A firm makes items A and B and the total number of items it can make in a day is 24. It takes one hour to make an item of A and half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs 300 and on one item of B is Rs 160. How many items of each type should be produced to maximize the profit? Solve the problem graphically.


A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.


There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and ​F2 consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If F1 costs ₹6/kg and F2 costs ₹5/kg, determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost? 


A manufacturer has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
 

Items Number of hours required on machines
  I II III
M 1 2 1
N 2 1 1.25


She makes a profit of ₹600 and ₹400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?


An aeroplane can carry a maximum of 200 passengers. A profit of ₹1000 is made on each executive class ticket and a profit of ₹600 is made on each economy class ticket. The airline reserves atleast 20 seats for executive class. However, atleast 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximise the profit of the airline. What is the maximum profit?


 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:

  Transportation cost per quintal(in Rs.)
From-> A B
To
D 6.00 4.00
E 3.00 2.00
F 2.50 3.00

How should the supplies be transported in order that the transportation cost is minimum?


The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is 


A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available  for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each  for type B souvenirs. How many souvenirs of each type should the company manufacture in order to  maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit. 


The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.


For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.


The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______ 


The maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.


The maximum of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.


A manufacturer wishes to produce two commodities A and B. The number of units of material, labour and equipment needed to produce one unit of each commodity is shown in the table given below. Also shown is the available number of units of each item, material, labour, and equipment.

Items Commodity A Commodity B Available no. of Units
Material 1 2 8
Labour 3 2 12
Equipment 1 1 10

Find the maximum profit if each unit of commodity A earns a profit of ₹ 2 and each unit of B earns a profit of ₹ 3.


The comer point of the feasible region determined by the following system of linear inequalities:

2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let x = Px + qx where P, q > 0 condition on P and Q so that the maximum of z occurs at both (3, 4) and (0, 5) is


Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-


Solve the following Linear Programming Problem graphically:

Minimize: Z = 60x + 80y

Subject to constraints:

3x + 4y ≥ 8

5x + 2y ≥ 11

x, y ≥ 0


The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?


Find feasible solution for the following system of linear inequation graphically.

3x + 4y ≥ 12, 4x + 7y ≤ 28, x ≥ 0, y ≥ 0


The solution set of constraints x + 2y ≥ 11, 3x + 4y  ≤  30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.


The Corner Point Method is based on which theorem?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×