हिंदी

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

Advertisements
Advertisements

प्रश्न

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

आलेख
योग

उत्तर

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

Line Equation Points on the X-axis Points on the Y-axis Sign Region
AB x + 2y = 3 A(3, 0) B`(0, 3/2)` non-origin side of line AB
CD x + 4y = 4 C(4, 0) D(0, 1) non-origin side of line CD
EF 3x + y = 3 E(1, 0) F(0, 3) non-origin side of line EF

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

The vertices of the feasible region are C(4, 0), P, Q and F (0, 3).

P is the point of intersection of the lines x + 4y = 4 and x + 2y = 3

On subtracting, we get

2y = 1 

∴ y = `1/2`

Substituting y = `1/2` in x + 2y = 3, we get

x + 2`(1/2)` = 3

∴ x = 2

∴ P ≡ `(2, 1/2)`

Q is the point of intersection of the lines

x + 2y = 3     ....(1)

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

Multiplying equation (1) by 3, we get

3x + 6y = 9

Subtracting equation (2) from this equation, we get

5y = 6

∴ y =`6/5`

∴ from (1), x + 2`(6/5) = 3`

∴ x = `3 - 12/5 = 3/5` 

∴ Q ≡ `(3/5,6/5)`

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

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

z(P) = 6(2) + 21`(1/2)`

= 12 + 10.5 = 22.5

z (Q) = `6(3/5) + 21(6/5)`

`= 18/5 + 126/5 = 144/5 = 28.8`

z(F) = 6(0) + 21(3) = 63

∴ z has minimum value 22.5, when x = 2 and y = `1/2`.

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

APPEARS IN

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

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

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


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


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 = 2x + 3y subject to x - y ≥ 3, x ≥ 0, y ≥ 0.


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

|x + 5| ≤ y


A firm manufactures two products A and B on which profit earned per unit ₹ 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 product A and B to be manufactured to get 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.


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.


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?


Choose the correct alternative :

Feasible region; the set of points which satify.


Choose the correct alternative :

The corner points of the feasible region are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y


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


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 point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


Choose the correct alternative:

The feasible region is


State whether the following statement is True or False:

LPP is related to efficient use of limited resources


The variables involved in LPP are called ______


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 ______


A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.


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 = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.


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.


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.


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?


A solution which maximizes or minimizes the given LPP is called


The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 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.

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.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×