मराठी

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

Advertisements
Advertisements

प्रश्न

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.

बेरीज
Advertisements

उत्तर

Let the firm produces x 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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 29: Linear programming - Exercise 30.1 [पृष्ठ १५]

APPEARS IN

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

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

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

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 A, B 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 A, B 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 firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost


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


Objective function of a LPP is


Let X1 and X2 are optimal solutions of a LPP, then


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


The optimal value of the objective function is attained at the points


The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80; x, y ≥ 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; x, y ≥ 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 ______.


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 ______


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.


A manufacturing company makes two types of television sets; one is black and white and the other is colour. The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. If it makes a profit of Rs 510 per black and white set and Rs 675 per coloured set, how many sets of each type should be produced so that the company has maximum profit? Formulate this problem as a LPP given that the objective is to maximise the profit.


Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, 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 ______.


Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.


Conditions under which the object function is to be maximum or minimum are called ______.


What is defined as a problem in which a linear objective function is to be maximised or minimised subject to a set of linear constraints and non-negative conditions on the variables?


A furniture dealer invests in tables (\[x\]) and chairs (\[y\]). He has \[\text{Rs } 50,000\] to invest and storage space for at most \[60\] pieces. A table costs \[\text{Rs } 2500\] and gives a profit of \[\text{Rs } 250\], while a chair costs \[\text{Rs } 500\] and gives a profit of \[\text{Rs } 75\]. What is the objective function to maximise total profit \[Z\]?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×