मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी विज्ञान (सामान्य) इयत्ता १२ वी

Maximize: 3 5 Subjectto - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

 Maximize: z = 3x + 5y  Subject to

x +4y ≤ 24                3x + y  ≤ 21 

x + y ≤ 9                     x ≥ 0 , y ≥0

आलेख
Advertisements

उत्तर

Inequation Point on x-axis  Point on y-axis Feasible Region 
x +4y ≤ 24  (24,0) (0,6) Origin side
3x +y ≤ 21 (7,0) (0,21) Origin side
x + y ≤9 (9,0) (0,9) Origin side

From the figure common feasible region is ABCDEA 
E is the point of intersection of  x + y = 9 and x + 4y =24
Solving them we get E(4,5)
D is the point of intersection of  x + y = 9 and 3x +y = 21
Solving them we get D(6,3)

End Point Value of z = 3x +5y
A(0,6) 0 +30= 30 
B(0,0) 0 + 0 = 0
C(7,0) 21 + 0 = 21
D(6,3) 18 +1 5 = 33
E(4,5) 12 +25 = 37

∴ z is maximum 37 at the point (4, 5) 

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
2018-2019 (March) Set 1

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

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

Solve the following LPP by using graphical method.

Maximize : Z = 6x + 4y

Subject to x ≤ 2, x + y ≤  3, -2x + y ≤  1, x ≥  0, y ≥ 0.

Also find maximum value of Z.


Minimize :Z=6x+4y

Subject to : 3x+2y ≥12

x+y ≥5

0 ≤x ≤4

0 ≤ y ≤ 4 


Solve the following L. P. P. graphically:Linear Programming

Minimize Z = 6x + 2y

Subject to

5x + 9y ≤ 90

x + y ≥ 4

y ≤ 8

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

Minimise Z = 5x + 10y

Subject to x + 2y ≤ 120

Constraints x + y ≥ 60

x – 2y ≥ 0 and x, y ≥ 0


In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :

Tablets  Iron Calcium Vitamin
x 6 3 2
y 2 3 4

The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.


Maximize Z = 15x + 10y
Subject to 

\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]

 


Maximize Z = 7x + 10y
Subject to 

\[x + y \leq 30000\]
\[ y \leq 12000\]
\[ x \geq 6000\]
\[ x \geq y\]
\[ x, y \geq 0\]

 


Minimize Z = 5x + 3y
Subject to 

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

 


Minimize Z = 30x + 20y
Subject to 

\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]


Maximize Z = −x1 + 2x2
Subject to

\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]

 


A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements


One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.


A manufacturer has three machines installed in his factory. machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table:

Item Number of hours required by the machine

A
B
I II III
1
2
2
1
1
5/4

He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produces so as to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.


A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.


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


A publisher sells a hard cover edition of a text book for Rs 72.00 and paperback edition of the same ext for Rs 40.00. Costs to the publisher are Rs 56.00 and Rs 28.00 per book respectively in addition to weekly costs of Rs 9600.00. Both types require 5 minutes of printing time, although hardcover requires 10 minutes binding time and the paperback requires only 2 minutes. Both the printing and binding operations have 4,800 minutes available each week. How many of each type of book should be produced in order to maximize profit?


A manufacturer makes two products A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the 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 man owns a field of area 1000 sq.m. He wants to plant fruit trees in it. He has a sum of Rs 1400 to purchase young trees. He has the choice of two types of trees. Type A requires 10 sq.m of ground per tree and costs Rs 20 per tree and type B requires 20 sq.m of ground per tree and costs Rs 25 per tree. When fully grown, type A produces an average of 20 kg of fruit which can be sold at a profit of Rs 2.00 per kg and type B produces an average of 40 kg of fruit which can be sold at a profit of Rs. 1.50 per kg. How many of each type should be planted to achieve maximum profit when the trees are fully grown? What is the maximum profit?


A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.


A firm makes items A and B and the total number of items it can make in a day is 24. It takes one hour to make an item of A and half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs 300 and on one item of B is Rs 160. How many items of each type should be produced to maximize the profit? Solve the problem 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.


An aeroplane can carry a maximum of 200 passengers. A profit of ₹1000 is made on each executive class ticket and a profit of ₹600 is made on each economy class ticket. The airline reserves atleast 20 seats for executive class. However, atleast 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximise the profit of the airline. What is the maximum profit?


A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at PQ and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:

Transportation Cost per packet(in Rs.)
From-> A B
To 
P 5 4
Q 4 2
R 3 5
 How many packets from each factory be transported to each agency so that the cost of transportation is minimum? Also find the minimum cost?

By graphical method, the solution of linear programming problem

\[\text{Maximize}\text{ Z }= 3 x_1 + 5 x_2 \]
\[\text{ Subject }  to \text{ 3 } x_1 + 2 x_2 \leq 18\]
\[ x_1 \leq 4\]
\[ x_2 \leq 6\]
\[ x_1 \geq 0, x_2 \geq 0, \text{ is } \]

The region represented by the inequation system xy ≥ 0, y ≤ 6, x + y ≤ 3 is 


The point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.


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. 


A company manufactures two types of products A and B. Each unit of A requires 3 grams of nickel and 1 gram of chromium, while each unit of B requires 1 gram of nickel and 2 grams of chromium. The firm can produce 9 grams of nickel and 8 grams of chromium. The profit is ₹ 40 on each unit of the product of type A and ₹ 50 on each unit of type B. How many units of each type should the company manufacture so as to earn a maximum profit? Use linear programming to find the solution.


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


A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of an L.P.P. is called its ____________.


In the Corner point method for solving a linear programming problem the second step after finding the feasible region of the linear programming problem and determining its corner points is ____________.


Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?


The comer point of the feasible region determined by the following system of linear inequalities:

2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let x = Px + qx where P, q > 0 condition on P and Q so that the maximum of z occurs at both (3, 4) and (0, 5) is


The solution set of the inequality 3x + 5y < 4 is ______.


Solve the following linear programming problem graphically:

Minimize: Z = 5x + 10y

Subject to constraints:

x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×