English

Maximize Z = 5x + 3y Subject to 3 X + 5 Y ≤ 15 5 X + 2 Y ≤ 10 X , Y ≥ 0

Advertisements
Advertisements

Question

Maximize Z = 5x + 3y
Subject to

\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ x, y \geq 0\]

Sum
Advertisements

Solution

First, we will convert the given inequations into equations, we obtain the following equations:
3x + 5y = 15, 5x + 2y = 10, x = 0 and y = 0
Region represented by 3x + 5y ≤ 15 :
The line 3x + 5y = 15 meets the coordinate axes at A(5,0) and B(0,3) respectively. By joining these points we obtain the line 3x + 5y = 15.
Clearly (0,0) satisfies the inequation 3x + 5y ≤ 15. So,the region containing the origin represents the solution set of the inequation 3x + 5y ≤ 15.
Region represented by 5x + 2y ≤ 10 :
The line 5x + 2y = 10 meets the coordinate axes at C(2,0) and D(0,5) respectively. By joining these points we obtain the line 5x + 2y = 10.
Clearly (0,0) satisfies the inequation 5x + 2y ≤ 10. So,the region containing the origin represents the solution set of the inequation 5x + 2y ≤ 10.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and ≥ 0.The feasible region determined by the system of constraints, 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, and y ≥ 0, are as follows.
The corner points of the feasible region are O(0, 0), C(2, 0),
\[E\left( \frac{20}{19}, \frac{45}{19} \right)\] and B(0, 3).

The values of Z at these corner points are as follows.

Corner point Z = 5x + 3y
O(0, 0) 5 × 0 + 3 × 0 = 0
C(2, 0)

5 × 2 + 3 × 0 = 10

 

\[E\left( \frac{20}{19}, \frac{45}{19} \right)\]

5x \[\frac{20}{19}\] +3x \[\frac{45}{19}\] = \[\frac{235}{19}\]

B(0, 3)  5  0 + 3 × 3 = 9

 

Therefore, the maximum value of Z is

\[\frac{235}{19}\text{ at the point } \left( \frac{20}{19}, \frac{45}{19} \right)\] .Hence, x= \[\frac{20}{19}\]  and y =
\[\frac{45}{19}\]  is the optimal solution of the given LPP.
Thus, the optimal value of Z is \[\frac{235}{19}\] .
shaalaa.com
  Is there an error in this question or solution?
Chapter 29: Linear programming - Exercise 30.2 [Page 32]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 29 Linear programming
Exercise 30.2 | Q 1 | Page 32

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?


Solve the following L.P.P graphically:

Maximize: Z = 10x + 25y
Subject to: x ≤ 3, y ≤ 3, x + y ≤ 5, x ≥ 0, y ≥ 0


There are two types of fertilisers 'A' and 'B'. 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs Rs 10 per kg and 'B' cost Rs 8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost


Solve the following linear programming problem graphically :

Maximise Z = 7x + 10y subject to the constraints

4x + 6y ≤ 240

6x + 3y ≤ 240

x ≥ 10

x ≥ 0, y ≥ 0


Solve the following L.P.P graphically: Maximise Z = 20x + 10y

Subject to the following constraints x + 2y ≤ 28,

3x + y ≤ 24,

x ≥ 2,

 x, y ≥ 0


Maximize Z = 3x + 4y
Subject to

\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]


Minimize Z = x − 5y + 20
Subject to

\[x - y \geq 0\]
\[ - x + 2y \geq 2\]
\[ x \geq 3\]
\[ y \leq 4\]
\[ x, y \geq 0\]


Minimize Z = 3x1 + 5x2
Subject to

\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]

 


Maximize Z = x + y
Subject to

\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 0\]


If a young man drives his vehicle at 25 km/hr, he has to spend Rs 2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to Rs 5/per km. He has Rs 100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.


A company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of a lower quality. Profits on each type of belt are Rs 2 and Rs 1.50 per belt, respectively. Each belt of type A requires twice as much time as required by a belt of type B. If all belts were of type B, the company could produce 1000 belts per day. But the supply of leather is sufficient only for 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 fancy buckles are available for this per day. For belt of type B, only 700 buckles are available per day.
How should the company manufacture the two types of belts in order to have a maximum overall profit?


A company produces two types of goods, A and B, that require gold and silver. Each unit of type A requires 3 gm of silver and 1 gm of gold while that of type B requires 1 gm of silver and 2 gm of gold. The company can produce 9 gm of silver and 8 gm of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, find the number of units of each type that the company should produce to maximize the profit. What is the maximum profit?


A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.


An aeroplane can carry a maximum of 200 passengers. A profit of Rs 400 is made on each first class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats of first class. However, at least 4 times as many passengers prefer to travel by economy class to the first class. Determine how many each type of tickets must be sold in order to maximize the profit for the airline. What is the maximum profit.


A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp while it takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is ₹5.00 and a shade is ₹3.00. Assuming that the manufacturer sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit?    


A firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit. Solve the problem graphically. 


A box manufacturer makes large and small boxes from a large piece of cardboard. The large boxes require 4 sq. metre per box while the small boxes require 3 sq. metre per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 sq. metre of cardboard is in stock, and if the profits on the large and small boxes are Rs 3 and Rs 2 per box, how many of each should be made in order to maximize the total profit?


A library has to accommodate two different types of books on a shelf. The books are 6 cm and 4 cm thick and weigh 1 kg and  \[1\frac{1}{2}\] kg each respectively. The shelf is 96 cm long and atmost can support a weight of 21 kg. How should the shelf be filled with the books of two types in order to include the greatest number of books? Make it as an LPP and solve it graphically.

 


A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.


A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. Make an LPP and solve it graphically.


A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically. Do you agree with this view of the manufacturer that men and women workers are equally efficient and so should be paid at the same rate?


 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


From the details given below, calculate the five-year moving averages of the number of students who have studied in a school. Also, plot these and original data on the same graph paper.

Year 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002
Number of Students 332 317 357 392 402 405 410 427 405 438

Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically


Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region


The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.


For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.


The constraints of an LPP are 7 ≤ x ≤ 12, 8 ≤ y ≤ 13. Determine the vertices of the feasible region formed by them.


In linear programming feasible region (or solution region) for the problem is ____________.


Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.


The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.


Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?


The shaded part of given figure indicates in feasible region, then the constraints are:


The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?


Solve the following Linear Programming Problem graphically.

Maximise Z = 5x + 2y subject to:

x – 2y ≤ 2,

3x + 2y ≤ 12,

– 3x + 2y ≤ 3,

x ≥ 0, y ≥ 0


Which statement defines a feasible solution?


Which description represents a bounded region?


Which description represents an unbounded region?


What is the value of \[Z=4x+y\] at the corner point \[(30,0)\]?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×