English

Solve the following L.P.P. by graphical method: Maximize: Z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5.Also find the maximum value of z. - Mathematics and Statistics

Advertisements
Advertisements

Question

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

Maximize: Z = 10x + 25y
subject to 0 ≤ x ≤ 3,
0 ≤ y ≤ 3,
x + y ≤ 5.
Also find the maximum value of z.

Graph
Sum

Solution

To draw the feasible region, construct table as follows:

Inequality x ≤ 3 y ≤ 3 x + y ≤ 5
Corresponding equation (of line) x = 3 y = 3 x + y = 5
Intersection of line with X-axis (3, 0) (5, 0)
Intersection of line with Y-axis (0, 3) (0, 5)
Region Origin side Origin side Origin side

Shaded portion OABCD is the feasible region,

whose vertices are O(0, 0), A(3, 0), B, C and D(0, 3)

B is the point of intersection of the lines x = 3 and x + y = 5.

Substituting x = 3 in x + y = 5, we get y = 2

∴ B ≡ (3, 2)

C is the point of intersection of the lines y = 3 and x + y = 5.

Substituting y = 3 in x + y = 5, we get

x = 2

∴ C ≡ (2, 3)

Here, the objective function is Z = 10x + 25y

∴ Z at O(0, 0) = 10(0) + 25(0) = 0

Z at A(3, 0) = 10(3) + 25(0) = 30

Z at B(3, 2) = 10(3) + 25(2) = 30 + 50 = 80

Z at C(2, 3) = 10(2) + 25(3) = 20 + 75 = 95

Z at D(0, 3) = 10(0) + 25(3) = 75

∴ Z has a maximum value of 95 at C(2, 3).

∴ Z is maximum when x = 2 and y = 3.

shaalaa.com
  Is there an error in this question or solution?
Chapter 6: Linear Programming - Exercise 6.2 [Page 101]

RELATED QUESTIONS

A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.


A firm manufactures 3 products AB and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product : 

Machine Products
A B C
M1
M2
4 3 5
2 2 4

Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.


Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than

\[3\frac{1}{2}\] hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than 
\[2\frac{1}{2}\]  hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.

 


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

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


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

Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.


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

Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.


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

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


Choose the correct alternative:

The value of objective function is maximize under linear constraints.


Choose the correct alternative :

The maximum value of z = 5x + 3y. subject to the constraints


Choose the correct alternative :

The maximum value of z = 10x + 6y, subjected to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.


The constraint that a factory has to employ more women (y) than men (x) is given by _______


The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.


State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.


Solve the following problem :

Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0


Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0


Solve the following problem :

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 the availability of each machine is given by the following table.

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

Formulate and solve the following Linear programming problems using graphical method.


Solve the following problem :

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 unit 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 manufacture per month to maximize profit? How much is the maximum profit?


Choose the correct alternative:

The maximum value of Z = 3x + 5y subjected to the constraints x + y ≤ 2, 4x + 3y ≤ 12, x ≥ 0, y ≥ 0 is


Choose the correct alternative:

The corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, x ≥ 0, y ≥ 0 are


Choose the correct alternative:

The corner points of the feasible region are (0, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at


Choose the correct alternative:

The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at


State whether the following statement is True or False:

The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20


State whether the following statement is True or False:

If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)


State whether the following statement is True or False:

Corner point method is most suitable method for solving the LPP graphically


State whether the following statement is True or False:

The point (6, 4) does not belong to the feasible region bounded by 8x + 5y ≤ 60, 4x + 5y ≤ 40, 0 ≤ x, y


State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant


The feasible region represented by the inequations x ≥ 0, y ≤ 0 lies in ______ quadrant.


A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit


A dealer deals in two products X and Y. He has ₹ 1,00,000/- to invest and space to store 80 pieces. Product X costs ₹ 2500/- and product Y costs ₹ 1000/- per unit. He can sell the items X and Y at respective profits of ₹ 300 and ₹ 90. Construct the LPP and find the number of units of each product to be purchased to maximize its profit


A company manufactures two types of ladies dresses C and D. The raw material and labour available per day is given in the table.

Resources Dress C(x) Dress D(y) Max. availability
Raw material 5 4 60
Labour 5 3 50

P is the profit, if P = 50x + 100y, solve this LPP to find x and y to get the maximum profit


Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum


A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost


A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs


Maximize Z = 2x + 3y subject to constraints

x + 4y ≤ 8, 3x + 2y ≤ 14, x ≥ 0, y ≥ 0.


Maximize Z = 5x + 10y subject to constraints

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


Maximize Z = 400x + 500y subject to constraints

x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0


Minimize Z = 2x + 3y subject to constraints

x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0


Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.

Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.

x ≥ 0, y ≥ 0

As per the given condition, x + y ______ 45000

He wants to invest at least ₹ 10,000 in PPF.

∴ y ______ 10000

Amartya wants to invest at least ₹ 5000 in IVP.

∴ x ______ 5000

Total interest (Z) = ______

The formulated LPP is

Maximize Z = ______ subject to 

______


Solve the following LPP graphically:

Maximize Z = 9x + 13y subject to constraints

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

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequation Equation X intercept Y intercept Region
2x + 3y ≤ 18 2x + 3y = 18 (9, 0) (0, ___) Towards origin
2x + y ≤ 10 2x + y = 10 ( ___, 0) (0, 10) Towards origin
x ≥ 0, y ≥ 0 x = 0, y = 0 X axis Y axis ______

The feasible region is OAPC, where O(0, 0), A(0, 6),

P( ___, ___ ), C(5, 0)

The optimal solution is in the following table:

Point Coordinates Z = 9x + 13y Values Remark
O (0, 0) 9(0) + 13(0) 0  
A (0, 6) 9(0) + 13(6) ______  
P ( ___,___ ) 9( ___ ) + 13( ___ ) ______ ______
C (5, 0) 9(5) + 13(0) ______  

∴ Z is maximum at __( ___, ___ ) with the value ___.


Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequations Equations X intercept Y intercept Region
5x + y ≥ 10 5x + y = 10 ( ___, 0) (0, 10) Away from origin
x + y ≥ 6 x + y = 6 (6, 0) (0, ___ ) Away from origin
x + 4y ≥ 12 x + 4y = 12 (12, 0) (0, 3) Away from origin
x, y ≥ 0 x = 0, y = 0 x = 0 y = 0 1st quadrant

∵ Origin has not satisfied the inequations.

∴ Solution of the inequations is away from origin.

The feasible region is unbounded area which is satisfied by all constraints.

In the figure, ABCD represents

The set of the feasible solution where

A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).

The coordinates of B are obtained by solving equations

x + 4y = 12 and x + y = 6

The coordinates of C are obtained by solving equations

5x + y = 10 and x + y = 6

Hence the optimum solution lies at the extreme points.

The optimal solution is in the following table:

Point Coordinates Z = 4x + 5y Values Remark
A (12, 0) 4(12) + 5(0) 48  
B ( ___, ___ ) 4( ___) + 5(___ ) ______ ______
C ( ___, ___ ) 4( ___) + 5(___ ) ______  
D (0, 10) 4(0) + 5(10) 50  

∴ Z is minimum at ___ ( ___, ___ ) with the value ___


A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-


If z = 200x + 500y  .....(i)

Subject to the constraints:

x + 2y ≥ 10  .......(ii)

3x + 4y ≤ 24  ......(iii)

x, 0, y ≥ 0  ......(iv)

At which point minimum value of Z is attained.


Shraddho wants to invest at most ₹ 25,000/- in saving certificates and fixed deposits. She wants to invest at least ₹ 10,000/- in saving certificate and at least ₹ 15,000/- in fixed deposits. The rate of interest on saving certificate is 5% and that on fixed deposits is 7% per annum. Formulate the above problem as LPP to determine maximum income yearly.


Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×