English

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

Question

Solve the following LPP:

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

Graph
Advertisements

Solution

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
Linear Programming Problem (L.P.P.)
  Is there an error in this question or solution?
Chapter 7: Linear Programming - Miscellaneous exercise 7 [Page 244]

APPEARS IN

Balbharati Mathematics and Statistics 1 (Arts and Science) [English] Standard 12 Maharashtra State Board
Chapter 7 Linear Programming
Miscellaneous exercise 7 | Q II) 5) iii) | Page 244
Balbharati Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
Chapter 6 Linear Programming
Miscellaneous Exercise 6 | Q 4.03 | Page 104

RELATED QUESTIONS

Find the feasible solution of the following inequation:

x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9,  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 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.


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

Fodder → Fodder 1 Fodder 2
Nutrient ↓
Nutrients A 2 1
Nutrients B 2 3
Nutrients C 1 1

The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 ₹ 2. Formulate the LPP to minimize the 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.


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


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 maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.


Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.


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


The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.


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


The half-plane represented by 4x + 3y >14 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


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

y ≤ - 3.5


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. 


Solve the following LPP:

Maximize z =60x + 50y  subject to

x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.


Solve the following LPP:

Minimize z = 4x + 2y

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


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 chemical company produces a chemical containing three basic elements A, B, C, so that it has at least 16 litres of A, 24 litres of B and 18 litres of C. This chemical is made by mixing two compounds I and II. Each unit of compound I has 4 litres of A, 12 litres of B and 2 litres of C. Each unit of compound II has 2 litres of A, 2 litres of B and 6 litres of C. The cost per unit of compound I is ₹ 800 and that of compound II is ₹ 640. Formulate the problems as LPP and solve it to minimize the cost.


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.


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


Choose the correct alternative :

The half plane represented by 3x + 2y ≤ 0 constraints the 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.


Fill in the blank :

“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.


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


Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3


Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, 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


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.


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.

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


Solve the following linear programming problems by graphical method.

Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 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


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


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.


A firm manufactures pills in two sizes A and B. Size A contains 2 mgs of aspirin, 5 mgs of bicarbonate and 1 mg of codeine. Size B contains 1 mg. of aspirin, 8 mgs. of bicarbonate and 6 mgs. of codeine. It is found by users that it requires at least 12 mgs. of aspirin, 74 mgs. of bicarbonate and 24 mgs. of codeine for providing immediate relief. It is required to determine the least number of pills a patient should take to get immediate relief. Formulate the problem as a standard LLP.


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.


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


The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______


Which of the following can be considered as the objective function of a linear programming problem?


The minimum value of z = 5x + 13y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10, x ≥ 0, y ≥ 2 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 ______ 


Solve the following LP.P.

Maximize z = 13x + 9y,

Subject to 3x + 2y ≤ 12,

x + y ≥ 4,

x ≥ 0,

y ≥ 0.


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


Solve the following problems by graphical method:

Maximize z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0 y ≥ 0


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.


Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.


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

x + y ≤ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×