हिंदी

Minimize: Z = 6x + 4y Subject to the conditions: 3x + 2y ≥ 12, x + y ≥ 5, 0 ≤ x ≤ 4, 0 ≤ y ≤ 4 - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Minimize: Z = 6x + 4y

Subject to the conditions:

3x + 2y ≥ 12,

x + y ≥ 5,

0 ≤ x ≤ 4,

0 ≤ y ≤ 4

योग
Advertisements

उत्तर

Graph the Feasible Region

(i) 3x + 2y ≥ 12

3x + 2y = 12 ⇒ intercepts: `{:{(x=0=> y=6),(y=0=>x=4):}`

(ii) x + y ≥ 5

x+y=5⇒intercepts: `{:{(x=0=>y=5),(y=0=>y=5):}`

(iii) 0 ≤ x ≤ 4, 0 ≤ y ≤ 4

This defines a square bounded by (0,0), (4,0), (4,4), and (0,4).

Find Corner Points of the Feasible Region

  • x + y ≥ 5

  • 3x + 2y ≥ 12

1) 3x + 2y = 12 and x + y = 5

From (2): y = 5 − x

3x + 2(5 − x) = 12 ⇒ 3x + 10 − 2x = 12 ⇒ x = 2, y = 3

Point A = (2, 3)

2) 3x + 2y = 12 and y = 4

3x + 2(4) = 12 ⇒ 3x = 4 ⇒ x = `4/3, y =4`

Point B = `(4/3, 4)`

3) x + y = 5 and y = 4

x + 4 = 5 ⇒ x = 1, y = 4

Point C = (1, 4)

Points where boundary lines meet square limits:

(4, 0): Check constraints

3(4) + 2(0) = 12

4 + 0 = 4 → Doesn't satisfy x + y ≥ 5

(4, 1):

3(4) + 2(1) = 14

4 + 1 = 5

Point D = (4, 1)

Evaluate Z = 6x + 4y at all feasible corner points

Point Z = 6x + 4y
A = (2, 3) 6(2) + 4(3) = 12 + 12 = 24
B = (4/3, 4) 6(4/3) + 4(4) = 8 + 16 = 24
C = (1, 4) 6(1) + 4(4) = 6 + 16 = 22
D = (4, 1) 6(4) + 4(1) = 24 + 4 = 28

The minimum value of Z is 22, which occurs at point C = (1, 4).

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2014-2015 (October)

APPEARS IN

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

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

Solve the following L.P.P graphically:

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


A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?


A company manufactures bicycles and tricycles each of which must be processed through machines A and B. Machine A has maximum of 120 hours available and machine B has maximum of 180 hours available. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B.
If profits are Rs. 180 for a bicycle and Rs. 220 for a tricycle, formulate and solve the L.P.P. to determine the number of bicycles and tricycles that should be manufactured in order to maximize the profit.


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


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


Solve the following LPP by graphical method:

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


Minimize Z = 18x + 10y
Subject to 

\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]


Maximize Z = 50x + 30y
Subject to 

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


Minimize Z = 2x + 4y
Subject to 

\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]

 


Minimize Z = 30x + 20y
Subject to 

\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ 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\]

 


Find the minimum value of 3x + 5y subject to the constraints
− 2x + y ≤ 4, x + y ≥ 3, x − 2y ≤ 2, xy ≥ 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 diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1400 of calories. Two foods A and B, are available at a cost of Rs 4 and Rs 3 per unit respectively. If one unit of A contains 200 units of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains 100 units of vitamin, 2 units of minerals and 40 calories, find what combination of foods should be used to have the least cost?


Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and at least 36 milligrams of iron. Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, and that rice contains 100 grams of protein and 30 milligrams of iron per kilogram, find the minimum cost of producing this new cereal if bran costs Rs 5 per kg and rice costs Rs 4 per kg


A farmer mixes two brands P and Q of cattle feed. Brand P, costing ₹250 per bag, contains 2 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing ₹200 per bag contains 1.5 units of nutritional element A, 11.25 units of element B and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


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 small manufacturer has employed 5 skilled men and 10 semi-skilled men and makes an article in two qualities deluxe model and an ordinary model. The making of a deluxe model requires 2 hrs. work by a skilled man and 2 hrs. work by a semi-skilled man. The ordinary model requires 1 hr by a skilled man and 3 hrs. by a semi-skilled man. By union rules no man may work more than 8 hrs per day. The manufacturers clear profit on deluxe model is Rs 15 and on an ordinary model is Rs 10. How many of each type should be made in order to maximize his total daily 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.


A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his 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 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 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.


An oil company has two depots, A and B, with capacities of 7000 litres and 4000 litres respectively. The company is to supply oil to three petrol pumps, DEF whose requirements are 4500, 3000 and 3500 litres respectively. The distance (in km) between the depots and petrol pumps is given in the following table:
Figure
Assuming that the transportation cost per km is Rs 1.00 per litre, how should the delivery be scheduled in order that the transportation cost is minimum?


A manufacturing company makes two models A and B of a product. Each piece of model A requires 9 labour hours for fabricating and 1 labour hour for finishing.  Each piece of model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹8000 on each piece of model A and ₹12000 on each piece of model B. How many pieces of model A and model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
 

Types of Toys Machines
  I II III
A 12 18 6
B 6 0 9
 
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is ₹7.50 and that on each toy of type B is ₹5, show that 15 toys of type A and 30 toys of type B should be manufactured in a day to get maximum profit.

A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?
It is being given that at least one of each must be produced.


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


Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______. 


The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.


The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.


A feasible region in the set of points which satisfy ____________.


Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-


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


The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0) and `(20/3, 4/3)`. If Z = 30x + 24y is the objective function, then (maximum value of Z – minimum value of Z) is equal to ______.


The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?


If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×