English

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

Advertisements
Advertisements

Question

Maximize Z = 9x + 3y
Subject to 

2x + 3y ≤ 13

3x + y ≤ 5

x, y ≥ 0

Sum
Advertisements

Solution

First, we will convert the given inequations into equations, we obtain the following equations:
2x + 3y = 13, 3x +y = 5, x = 0 and y = 0
Region represented by 2x + 3y ≤ 13 :
The line 2x + 3y = 13 meets the coordinate axes at \[A\left( \frac{13}{2}, 0 \right)\] and  \[B\left( 0, \frac{13}{3} \right)\]  respectively. By joining these points we obtain the line 2x + 3y = 13.

Clearly (0,0) satisfies the inequation 2x + 3y ≤ 13. So,the region containing the origin represents the solution set of the inequation 2x + 3y ≤ 13.
 Region represented by 3x + y ≤ 5:
The line 5x + 2y = 10 meets the coordinate axes at
\[C\left( \frac{5}{3}, 0 \right)\] and D(0, 5) respectively. By joining these points we obtain the line 3x y = 5.
Clearly (0,0) satisfies the inequation 3x + y ≤ 5. So,the region containing the origin represents the solution set of the inequation 3x + y ≤ 5.
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, 2x + 3y ≤ 13, 3x + y ≤ 5, x ≥ 0, and y ≥ 0, are as follows.

The corner points of the feasible region are O(0, 0),

\[C\left( \frac{5}{3}, 0 \right)\] \[E\left( \frac{2}{7}, \frac{29}{7} \right)\] and  \[B\left( 0, \frac{13}{3} \right)\]

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

We see that the maximum value of the objective function Z is 15 which is at C

Corner point Z = 9x + 3y
O(0, 0) 9 × 0 + 3 × 0 = 0
\[C\left( \frac{5}{3}, 0 \right)\]
9 × \[\frac{5}{3}\] + 3 × 0 =15
\[E\left( \frac{2}{7}, \frac{29}{7} \right)\]
9 × \[\frac{2}{7}\] +3 × \[\frac{29}{7}\] = 15
\[B\left( 0, \frac{13}{3} \right)\]
9 × 0 +3 × \[\frac{13}{3}\] = 113
\[\left( \frac{5}{3}, 0 \right)\] and  \[E\left( \frac{2}{7}, \frac{29}{7} \right)\]  Thus, the optimal value of Z is 15.
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 2 | Page 32

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.


Find graphically, the maximum value of z = 2x + 5y, subject to constraints given below :

2x + 4y  83

x + y  6

x + y  4

x  0, y 0


Maximise Z = x + 2y subject to the constraints

`x + 2y >= 100`

`2x - y <= 0`

`2x + y <= 200`

Solve the above LPP graphically


Solve the following L.P.P. graphically: 

Minimise Z = 5x + 10y

Subject to x + 2y ≤ 120

Constraints x + y ≥ 60

x – 2y ≥ 0 and x, 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


A dietician wishes to mix two kinds ·of food X· and Y in such a way that the  mixture contains at least 10 units of vitamin A, 12 units of vitamin B arid 8 units of vitamin C. The vitamin contents of one kg food is given below:

Food Vitamin A Vitamin.B Vitamin C
X 1 unit 2 unit 3 unit
Y 2 unit 2 unit 1 unit

Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.


Maximize Z = 50x + 30y
Subject to 

\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]


Maximize Z = 10x + 6y
Subject to

\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]


Maximize Z = 4x + 3y
Subject to 

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]


Find the maximum and minimum value of 2x + y subject to the constraints:
x + 3y ≥ 6, x − 3y ≤ 3, 3x + 4y ≤ 24, − 3x + 2y ≤ 6, 5x + y ≥ 5, xy ≥ 0.


Find the minimum value of 3x + 5y subject to the constraints
− 2x + y ≤ 4, x + y ≥ 3, x − 2y ≤ 2, xy ≥ 0.


Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints

\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]


Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:

2x + 4y ≤ 8

3x + y ≤ 6

x + y ≤ 4 

x ≥ 0, y ≥ 0   


Solve the following LPP graphically:
Maximize Z = 20 x + 10 y 
Subject to the following constraints 

\[x +\]2\[y \leq\]28 
3x+ \[y \leq\]24 
\[x \geq\] 2x.
\[y \geq\]  0


A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nirogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicates that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
 

kg per bag
  Brand P Brand P
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2


If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?


Two tailors, A and B earn Rs 15 and Rs 20 per day respectively. A can stitch 6 shirts and 4 pants  while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce (at least) 60 shirts and 32 pants at a minimum labour cost?


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 manufactures two types of toys A and B. Type A requires 5 minutes each for cutting and 10 minutes each for assembling. Type B requires 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours available for cutting and 4 hours available for assembling in a day. The profit is Rs 50 each on type A and Rs 60 each on type B. How many toys of each type should the company manufacture in a day to maximize the profit?


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 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 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.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.


There are two types of fertilizers Fand F2. Fconsists of 10% nitrogen and 6% phosphoric acid and ​Fconsists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If Fcosts ₹6/kg and Fcosts ₹5/kg, determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost? 


A manufacturer has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
 

Items Number of hours required on machines
  I II III
M 1 2 1
N 2 1 1.25


She makes a profit of ₹600 and ₹400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?


A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available  for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each  for type B souvenirs. How many souvenirs of each type should the company manufacture in order to  maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit. 


Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7


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


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 objective function Z has both a maximum and a minimum value on R and ____________.


A feasible solution to a linear programming problem


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


Solve the following Linear Programming Problem graphically:

Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0


The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.


Solve the following Linear Programming problem graphically:

Maximize: Z = 3x + 3.5y

Subject to constraints:

x + 2y ≥ 240,

3x + 1.5y ≥ 270,

1.5x + 2y ≤ 310,

x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problem graphically:

Minimize: z = x + 2y,

Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.


Solve the following Linear Programming Problem graphically:

Maximize: z = – x + 2y,

Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×