हिंदी

Solve the following LPP by graphical method: Maximize z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following LPP by graphical method:

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

योग
Advertisements

उत्तर

First we draw the lines AB, AD whose equations are 3x + 2y = 12 and x + y = 4 respectively.

Line Equation Points on the X-axis Points on the Y-axis Sign Region
AB 3x + 2y = 12 A(4, 0) B(0, 6) origin side of the line AB
AC x + y = 4 A(4, 0) C(0, 4) non-origin side of line AC

The feasible region is the Δ ABC which is shaded in the graph.

The vertices of the feasible region (i.e. corner points) are A(4, 0), B (0, 6) and C (0, 4).

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

z(a) = 4(4) + 6(0) = 16 + 0 = 16

z(B) = 4(0) + 6(6) = 0 + 36 = 36

z(C) = 4(0) + 6(4) = 0 + 24 = 24

∴ z has maximum value 36, when x = 0 and y = 6.

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

APPEARS IN

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

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

Which of the following statements is correct?


Find the feasible solution of the following inequation:

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


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 company produces two types of articles A and B which requires silver and gold. Each unit of A requires 3 gm of silver and 1 gm of gold, while each unit of B requires 2 gm of silver and 2 gm of gold. The company has 6 gm of silver and 4 gm of gold. Construct the inequations and find feasible solution graphically.


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.


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


Which of the following is correct?


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


Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.


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 = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


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

y ≤ - 3.5


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


Solve the following LPP:

Maximize z = 4x1 + 3x2 subject to
3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0. 


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?


A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to machine shop for finishing. The number of man hours of labour required in each shop for production of A and B and the number of man hours available for the firm are as follows:

Gadgets Foundry  Machine Shop
A 10 5
B 6 4
Time available (hours) 60 35

Profit on the sale of A is ₹ 30 and B is ₹ 20 per unit. Formulate the L.P.P. to have maximum profit.


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:

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

By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 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 :

Solution of LPP to minimize z = 2x + 3y st. x ≥ 0, y ≥ 0, 1≤ x + 2y ≤ 10 is


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


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


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


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 = 20x1 + 40x2 subject to the constraints 36x1 + 6x2 ≥ 108; 3x1 + 12x2 ≥ 36; 20x1 + 10x2 ≥ 100 and x1, 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 = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.


Solve the following LP.P.

Maximize z = 13x + 9y,

Subject to 3x + 2y ≤ 12,

x + y ≥ 4,

x ≥ 0,

y ≥ 0.


The set of feasible solutions of LPP is a ______.


Solution which satisfy all constraints is called ______ solution.


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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×