हिंदी

Solve the following LPP: Maximize z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following LPP:

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

आलेख
Advertisements

उत्तर

First we draw the lines AB and CD whose equations are 3x + 5y = 10 and 5x + 3y = 15 respectively.

Line Equation Points on
the X-axis
Points on
the Y-axis
Sign Region
AB 3x + 5y = 10 A`(10/3, 0)` B(0, 2) origin side
of line AB
CD 5x + 3y = 15 C(3, 0) D(0, 5) origin side
of line CD


The feasible region is OCPBD which is shaded region in the graph.

The vertices of the feasible region are O(0, 0), C(3, 0), P and B(0, 2).

P is the point of intersection of lines

3x + 5y = 10  ....(1)

and 5x + 3y = 15  ....(2)

Multiplying equation (1) by 5 and equation (2) by 3, we get

15x + 25y = 50

15x + 9y = 45

On subtracting, we get

16y = 5

∴ y = `5/16`

Substituting y = `5/16` in equation (1), we get

`3x + 25/16` = 10

∴ 3x = `10 - 25/16 = 135/16`

∴ x = `45/16`

∴ P ≡ `(45/16, 5/16)`

The values of objective function z = 6x + 10y at these vertices are

z(O) = 6(0) + 10(0)

= 0 + 0

= 0

z(C) = 6(3) + 10(0)

= 18 + 0

= 18

z(P) = `6(45/16) + 10(5/10)`

= `270/16 + 50/16`

= `320/16`

= 20

z(B) = 6(0) + 10(2)

= 0 + 20

= 20

The maximum value of z is 20 at P`(45/16, 5/16)` and B(0, 2) two consecutive vertices.

∴ z has maximum value 20 at each point of line segment

PB where B is (0, 2) and P is `(45/16, 5/16)`

Hence, there are infinite number of optimum solutions.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 7: Linear Programming - Miscellaneous exercise 7 [पृष्ठ २४४]

APPEARS IN

बालभारती Mathematics and Statistics 1 (Arts and Science) [English] Standard 12 Maharashtra State Board
अध्याय 7 Linear Programming
Miscellaneous exercise 7 | Q II) 5) iii) | पृष्ठ २४४
बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
अध्याय 6 Linear Programming
Miscellaneous Exercise 6 | Q 4.03 | पृष्ठ १०४

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

Find the feasible solution of the following inequation:

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


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


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


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.


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.


The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.


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

Minimize: z = 8x + 10y

Subject to: 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.


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


Which of the following is correct?


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


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


If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.


Solve the following LPP:

Maximize z = 5x1 + 6x2 subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x1 ≥ 0, x2 ≥ 0.


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

|x + 5| ≤ y


Solve the following LPP:

Minimize z = 4x + 2y

Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0


A carpenter makes chairs and tables. Profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines: Assembling, Finishing and Polishing. The time required for each product in hours and availability of each machine is given by the following table:

Product → Chair (x) Table (y) Available time (hours)
Machine ↓
Assembling 3 3 36
Finishing 5 2 50
Polishing 2 6 60

Formulate the above problem as LPP. Solve it graphically


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.


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

Nutrient\Fodder Fodder 1 Fodder2
Nutrient A 2 1
Nutrient B 2 3
Nutrient C 1 1

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


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.


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 half plane represented by 4x + 3y ≥ 14 contains the point


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


A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by ______.


Fill in the blank :

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


State whether the following is True or False :

Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.


State whether the following is True or False :

The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


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


Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.


Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points


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


State whether the following statement is True or False:

Objective function of LPP is a relation between the decision variables


State whether the following statement is True or False:

LPP is related to efficient use of limited resources


The constraint that in a particular XII class, number of boys (y) are less than number of girls (x) is given by ______


A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.


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?


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


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


Solve the following linear programming problem graphically.

Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, x2 ≥ 0.


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.


Solve the following linear programming problem graphically.

Maximize Z = 60x1 + 15x2 subject to the constraints: x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1, x2 ≥ 0.


The maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.


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 ______ 


The maximum value of Z = 9x + 13y subject to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0 is ______.


For the following shaded region, the linear constraint are:


Solve the following LPP:

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


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


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

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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×