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

Solve the following LPP: Maximize z = 5x1 + 6x2 subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x1 ≥ 0, x2 ≥ 0. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following LPP:

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

आलेख
बेरीज
Advertisements

उत्तर

First we draw the lines AB and CD whose equations are 2x1 + 3x2 = 18 and 2x1 + x2 = 12 respectively.

Line Equation Points on the X-axis Points on the Y-axis Sign Region
AB 2x1 + 3x2 = 18 A(9, 0) B(0, 6) origin side of line AB
CD 2x1 + x2 = 12 C(6, 0) O(0, 12) origin side of line CD

The feasible region is OCPBO which is shaded in the graph. The vertices of the feasible region are O (0, 0), C (6, 0), P and B (0, 6).

P is the point of intersection of the lines

2x1 + 3x2 = 18        ....(1)

and 2x1 + x2 = 12      ....(2)

On subtracting, we get

2x2 = 6

∴ x2 = 3

Substituting x2 = 3 in (2), we get

2x1 + 3 = 12

∴ x1 = 9

∴ P is `(9/2, 3)`

The values of objective function z = 5x1 + 6x2 at these vertices are

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

z(C) = 5(6) + 6(0) = 30 + 0 = 30

z(P) = `5(9/2) + 6(3) = 45/2 + 18 = (45 + 36)/2 = 81/2 = 40.5`

z(B) = 5(0) + 6(3) = 0 + 18 = 18

Maximum value of z is 40.5 when x1 = `9/2` y1 = 3.

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) i) | पृष्ठ २४४

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

Find the feasible solution of the following inequation:

3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0


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.


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


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


The half-plane represented by 3x + 2y < 8 contains the point ______.


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:

4x - 18 ≥ 0


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

|x + 5| ≤ y


Solve the following LPP:

Maximize z =60x + 50y  subject to

x + 2y ≤ 40, 3x + 2y ≤ 60, 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 firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each units of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufactured per month to maximize profit? How much is 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 printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on 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, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.


Choose the correct alternative :

Feasible region; the set of points which satify.


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


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


State whether the following is True or False :

The feasible solution of LPP belongs to only quadrant I.


The feasible region is the set of point which satisfy.


The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at


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


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


Constraints are always in the form of ______ or ______.


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


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.

Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.


In the given graph the coordinates of M1 are


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


A firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.


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.

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 set of feasible solutions of LPP is a ______.


Shamli wants to invest ₹ 50, 000 in saving certificates and PPF. She wants to invest atleast ₹ 15,000 in saving certificates and at least ₹ 20,000 in PPF. The rate of interest on saving certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to determine maximum yearly income, is ______.


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


Solve the following LPP by graphical method:

Maximize: z = 3x + 5y Subject to:  x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0


Food F1 contains 2, 6, 1 units and food F2 contains 1, 1, 3 units of proteins, carbohydrates, fats respectively per kg. 8, 12 and 9 units of proteins, carbohydrates and fats is the weekly minimum requirement for a person. The cost of food F1 is Rs. 85 and food F2 is Rs. 40 per kg. Formulate the L.P.P. to minimize the 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


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

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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×