मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी विज्ञान (सामान्य) इयत्ता १२ वी

A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:

Fertilizers→ F1 F2 Availability
Raw Material ↓
A 2 3 40
B 1 4 70

By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.

बेरीज
Advertisements

उत्तर

Let the company manufactures x units of fertilizers F1 and y units of fertilizers F2. Then the total profit to the company is z = ₹(500x + 750y).

This is a linear function that is to be maximized. Hence, it is an objective function.

Fertilizers→ F1 F2 Availability
Raw Material ↓
A 2 3 40
B 1 4 70

The raw material A required for x units of Fertilizers F1 and y units of Fertilizers F2 is 2x + 3y. Since the maximum availability of A is 40, we have the first constraint as 2x + 3y ≤ 40.

Similarly, considering the raw material B, we have x + 4y ≤ 70.

Since, x and y cannot be negative, we have, x ≥ 0, y ≥ 0.
Hence, the given LPP can be formulated as:

Maximize z = 500x + 750y, subject to

2x + 3y ≤ 40, x + 4y ≤ 70, x ≥ 0, y ≥ 0

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 7: Linear Programming - Exercise 7.3 [पृष्ठ २३८]

APPEARS IN

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

Which of the following statements is correct?


Find the feasible solution of the following inequation:

x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9,  x ≥ 0, y ≥ 0.


Find the feasible solution of the following inequations:

x - 2y ≤ 2, x + y ≥ 3, - 2x + y ≤ 4, x ≥ 0, y ≥ 0


In a cattle breading firm, it is prescribed that the food ration for one animal must contain 14. 22 and 1 units of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit of these two contains the following amounts of these three nutrients: 

Fodder → Fodder 1 Fodder 2
Nutrient ↓
Nutrients A 2 1
Nutrients B 2 3
Nutrients C 1 1

The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 ₹ 2. Formulate the LPP to minimize the cost.


A company manufactures two types of chemicals Aand B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B and the total availability of P and Q.

Chemical→ A B Availability
Raw Material ↓
P 3 2 120
Q 2 5 160

The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. (Assume that the entire production of A and B can be sold). How many units of the chemicals A and B should be manufactured so that the company gets a maximum profit? Formulate the problem as LPP to maximize profit.


A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 in magazines A and B per copy. These are processed on three Machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II, and 2 hours on machine III. Magazine B requires 3 hours on machine I, 2 hours on machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, and 60 hours per week respectively. Formulate the LPP to determine weekly production of magazines A and B, so that the total profit is maximum.


A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on Machine M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. Formulate the LPP to maximize the profit, if he operates the machine M1, for almost 10 hours a day and machine M2 for almost 12 hours a day.


A doctor has prescribed two different units of foods A and B to form a weekly diet for a sick person. The minimum requirements of fats, carbohydrates and proteins are 18, 28, 14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP, so that the sick person’s diet meets the requirements at a minimum cost.


Solve the following LPP by graphical method:

Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


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


The point of which the maximum value of x + y subject to the constraints x + 2y ≤  70, 2x + y ≤ 95, x, ≥ 0, y ≥ 0 is is obtained at ______.


Solve the following LPP:

Maximize z = 4x + 2y subject to 3x + y ≤ 27, x + y ≤ 21, x ≥ 0, y ≥ 0.


Solve the following LPP:

Maximize z = 2x + 3y subject to x - y ≥ 3, x ≥ 0, y ≥ 0.


Solve each of the following inequations graphically using XY-plane:

- 11x - 55 ≤ 0


Sketch the graph of the following inequation in XOY co-ordinate system:

|x + 5| ≤ y


Find graphical solution for the following system of linear in equation:

3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1


A company produces mixers and food processors. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:

Machine  Mixer Food Processor Available time
A 3 3 36
B 5 2 50
C 2 6 60

How many mixers and food processors should be produced in order to maximize the profit?


A firm manufactures two products A and B on which profit earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. The product A requires one minute of processing time on M1 and two minutes of processing time on M2, B requires one minute of processing time on M1 and one minute of processing time on M2. Machine M1 is available for use for 450 minutes while M2 is available for 600 minutes during any working day. Find the number of units of products A and B to be manufactured to get the maximum profit.


A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. to maximize the profit.


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

Maximize: Z = 4x + 6y

Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


Choose the correct alternative :

Which of the following is correct?


Objective function of LPP is ______.


Choose the correct alternative :

Of all the points of the feasible region the optimal value of z is obtained at a point


Choose the correct alternative :

The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are


If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.


Choose the correct alternative :

The half plane represented by 3x + 2y ≤ 0 constraints the point.


The optimal value of the objective function is attained at the ______ points of the feasible region.


Fill in the blank :

A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.


Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0


Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0


Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3


Solve the Linear Programming problem graphically:

Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.


Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.


Solve the following linear programming problems by graphical method.

Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0.


Solve the following linear programming problems by graphical method.

Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.


Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?


The minimum value of the objective function Z = x + 3y subject to the constraints 2x + y ≤ 20, x + 2y ≤ 20, x > 0 and y > 0 is


Solve the following linear programming problem graphically.

Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.


The point which provides the solution of the linear programming problem, Max.(45x + 55y) subject to constraints x, y ≥ 0, 6x + 4y ≤ 120, 3x + 10y ≤ 180, is ______ 


Solve the following LP.P.

Maximize z = 13x + 9y,

Subject to 3x + 2y ≤ 12,

x + y ≥ 4,

x ≥ 0,

y ≥ 0.


Solution which satisfy all constraints is called ______ solution.


Solve the following LPP:

Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.


Sketch the graph of the following inequation in XOY co-ordinate system.

x + y ≤ 0


Sketch the graph of the following inequation in XOY co-ordinate system.

2y - 5x ≥ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×