हिंदी

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. - Mathematics

Advertisements
Advertisements

प्रश्न

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.

योग

उत्तर

Let x and y units of products A and B were manufactured respectively.
The contribution to profit is Rs 2 for each unit of A and Rs 3 for each unit of B.
Therefore for x units of A and y units of B,the contribution to profit would be Rs 2x and Rs 3y respectively.

​Let Z denote the total profit

Then, Z = Rs (2x + 3y)

Total hours required for grinding, turning, assembling and testing are \[x + 2y, 3x + y, 6x + 3y, 5x + 4y\]  respectively.

The available capacities of these operations in hours for the given period are grinding 30, turning 60, assembling 200 and testing 200.

 \[x + 2y \leq 30, 3x + y \leq 60, 6x + 3y \leq 200, 5x + 4y \leq 200\]

Units of products cannot be negative.Therefore,

\[x, y \geq 0\]

Hence, the required LPP is as follows:
Maximize Z = 2x + 3y
subject to

\[x + 2y \leq 30, \]
\[3x + y \leq 60, \]
\[6x + 3y \leq 200, \]
\[5x + 4y \leq 200\]

 

 

 

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 30: Linear programming - Exercise 30.1 [पृष्ठ १६]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
अध्याय 30 Linear programming
Exercise 30.1 | Q 8 | पृष्ठ १६

वीडियो ट्यूटोरियल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 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.


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.


An automobile manufacturer makes automobiles and trucks in a factory that is divided into two shops. Shop A, which performs the basic assembly operation, must work 5 man-days on each truck but only 2 man-days on each automobile. Shop B, which performs finishing operations, must work 3 man-days for each automobile or truck that it produces. Because of men and machine limitations, shop A has 180 man-days per week available while shop B has 135 man-days per week. If the manufacturer makes a profit of Rs 30000 on each truck and Rs 2000 on each automobile, how many of each should he produce to maximize his profit? Formulate this as a LPP.


An airline agrees to charter planes for a group. The group needs at least 160 first class seats and at least 300 tourist class seats. The airline must use at least two of its model 314 planes which have 20 first class and 30 tourist class seats. The airline will also use some of its model 535 planes which have 20 first class seats and 60 tourist class seats. Each flight of a model 314 plane costs the company Rs 100,000 and each flight of a model 535 plane costs Rs 150,000. How many of each type of plane should be used to minimize the flight cost? Formulate this as a 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


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


Consider a LPP given by
Minimum Z = 6x + 10y
Subjected to x ≥ 6; y ≥ 2; 2x + y ≥ 10; xy ≥ 0
Redundant constraints in this LPP are 


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


Which of the following is not a convex set?


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?


State whether the following statement is True or False:

The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)


Tyco Cycles Ltd manufactures bicycles (x) and tricycles (y). The profit earned from the sales of each bicycle and a tricycle are ₹ 400 and ₹ 200 respectively, then the total profit earned by the manufacturer will be given as ______


By spending almost ₹ 250, Rakhi bought some kg grapes (x) and some dozens of bananas (y), then as a constraint this information can be expressed by ______


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 ______


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


Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0


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.


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 ______.


In maximization problem, optimal solution occurring at corner point yields the ____________.


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×