हिंदी

A company manufactures two types of chemicals A and 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 - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

A company manufactures two types of chemicals A and 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.

Raw Material \Chemical A B Availability
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. Formulate the problem as L.P.P. to maximize the profit.

योग

उत्तर

Let x units of chemical A and y units of chemical B are manufactured by the company.
Here, (3x + 2y) units of material P and (2x + 5y) units of material Q is required and 120 units of material P and 160 units of material Q are available.
∴ The constraints are :
3x + 2y ≤ 120,
2x + 5y ≤ 160
Since x and y cannot be negative, we have x ≥ 0, y ≥ 0
Now, Profit on one unit of chemical A is ₹ 350.
∴ Profit on x units of chemical A is 350x.
Profit on one unit of chemical B is ₹ 400.
∴ Profit on y units of chemical B is 400y.
∴ Total Profit, Z = 350x + 400y
This is the objective function to be maximized.
∴ Given problem can be formulated as,
Maximize Z = 350x + 400y
Subject to 3x + 2y ≤ 120, 2x + 5y ≤ 160, x ≥ 0, y ≥ 0.

shaalaa.com
Linear Programming Problem (L.P.P.)
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 6: Linear Programming - Exercise 6.1 [पृष्ठ ९८]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] 12 Standard HSC Maharashtra State Board
अध्याय 6 Linear Programming
Exercise 6.1 | Q 3 | पृष्ठ ९८

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

Find the feasible solution of the following inequation:

2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0


A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.


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.


If John drives a car at a speed of 60 km/hour, he has to spend ₹ 5 per km on petrol. If he drives at a faster speed of 90 km/hour, the cost of petrol increases ₹ 8 per km. He has ₹ 600 to spend on petrol and wishes to travel the maximum distance within an hour. Formulate the above problem as L.P.P.


Solve the following LPP by graphical method:

Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0


Minimize z = 6x + 2y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y  ≥ 3, x ≥ 0, y ≥ 0.


Objective function of LPP is ______.


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


The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.


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

4x - 18 ≥ 0


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 :

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


Choose the correct alternative:

Z = 9x + 13y subjected to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, 0 ≤ x, y was found to be maximum at the point


The variables involved in LPP are called ______


Solve the following linear programming problems by graphical method.

Maximize Z = 20x1 + 30x2 subject to constraints 3x1 + 3x2 ≤ 36; 5x1 + 2x2 ≤ 50; 2x1 + 6x2 ≤ 60 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?


Given an L.P.P maximize Z = 2x1 + 3x2 subject to the constrains x1 + x2 ≤ 1, 5x1 + 5x2 ≥ 0 and x1 ≥ 0, x2 ≥ 0 using graphical method, we observe


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

x + 2y ≥ 4, 2x - y ≤ 6


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×