English

A Firm Manufactures Two Types of Products a and B and Sells Them at a Profit of Rs 2 on Type a and Rs 3 on Type B. Each Product is Processed on Two Machines M1 and M2 - Mathematics

Advertisements
Advertisements

Question

A firm manufactures two types of products A and B and sells them at a profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2. Type A requires one minute of processing time on M1 and two minutes of M2; type B requires one minute on M1 and one minute on M2. The machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP.

Sum

Solution

Let the firm produces units of product A and y units of product B.
Since, each unit of product A requires one minute on machine \[M_1\] and two minutes on machine  \[M_2\] Therefore, x units of product A will require product x minutes on machine ​  \[M_1\] and 2x  minutes on machine \[M_2\]
Also, 
Since each unit of product B requires one minute on machine \[M_1\]  and one minute on machine  \[M_2\] Therefore, y  units of product A will require product y minutes on machine ​ \[M_1\] and y  minutes on machine \[M_2\] 
It is given that the machine \[M_1\] is available for  \[6 \text{ hours and 40 minutes} \] i.e. 400 minutes  and machine \[M_2\] is available for 10 hours i.e. 600 minutes

Thus,
\[x + y \leq 400\]

\[2x + y \leq 600\]

  Since,units of the products cannot be negative,so
\[x, y \geq\] 0  Let Z denotes the total profit
\[\therefore Z = 2x + 3y\] which is to be maximised
Hence, the required LPP is as follows:
Maximize Z = 2x + 3y
subject to  \[x + y \leq 400\]

\[2x + y \leq 600\]

\[x, y \geq\] 0
shaalaa.com
  Is there an error in this question or solution?
Chapter 30: Linear programming - Exercise 30.1 [Page 15]

APPEARS IN

RD Sharma Mathematics [English] Class 12
Chapter 30 Linear programming
Exercise 30.1 | Q 4 | Page 15

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

A company is making two products A and B. The cost of producing one unit of products A and B are Rs 60 and Rs 80 respectively. As per the agreement, the company has to supply at least 200 units of product B to its regular customers. One unit of product  A  requires one machine hour whereas product B has machine hours available abundantly within the company. Total machine hours available for product A are 400 hours. One unit of each product A and B requires one labour hour each and total of 500 labour hours are available. The company wants to minimize the cost of production by satisfying the given requirements. Formulate the problem as a LPP.


A rubber company is engaged in producing three types of tyres AB 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 AB 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.


Vitamins A and B are found in two different foods F1 and F2. One unit of food F1contains 2 units of vitamin A and 3 units of vitamin B. One unit of food F2 contains 4 units of vitamin A and 2 units of vitamin B. One unit of food F1 and F2 cost Rs 50 and 25 respectively. The minimum daily requirements for a person of vitamin A and B is 40 and 50 units respectively. Assuming that any thing in excess of daily minimum requirement of vitamin A and B is not harmful, find out the optimum mixture of food F1 and F2 at the minimum cost which meets the daily minimum requirement of vitamin A and B. 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.


The solution set of the inequation 2x + y > 5 is


Objective function of a LPP is


Which of the following sets are convex?


The maximum value of Z = 4x + 2y subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10 ; xy ≥ 0 is


The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80; xy ≥ 0 is


The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6; xy ≥ 0


If the constraints in a linear programming problem are changed


Which of the following is not a convex set?


A company manufactures two types of toys A and B. A toy of type A requires 5 minutes for cutting and 10 minutes for assembling. A toy of type B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours available for assembling the toys in a day. The profit is ₹ 50 each on a toy of type A and ₹ 60 each on a toy of type B. How many toys of each type should the company manufacture in a day to maximize the profit? Use linear programming to find the solution. 


Feasible region is the set of points which satisfy ______.


The optimum value of the objective function of LPP occurs at the center of the feasible region.


Choose the correct alternative:

How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?


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 ______


Ganesh owns a godown used to store electronic gadgets like refrigerator (x) and microwave (y). If the godown can accommodate at most 75 gadgets, then this can be expressed as a constraint by ______


Ms. Mohana want to invest at least ₹ 55000 in Mutual funds and fixed deposits. Mathematically this information can be written as ______


Determine the maximum value of Z = 4x + 3y if the feasible region for an LPP is shown in figure


Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.


Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, 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 ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×