English

Minimize Z = 2x + 4y Subject to X + Y ≥ 8 X + 4 Y ≥ 12 X ≥ 3 , Y ≥ 2

Advertisements
Advertisements

Question

Minimize Z = 2x + 4y
Subject to 

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

 

Sum
Advertisements

Solution

First, we will convert the given inequations into equations, we obtain the following equations:
x + y = 8, x + 4y = 12, x = 3, y = 2

Region represented by x + y ≥ 8:
The line x + y = 8 meets the coordinate axes at A(8, 0) and B(0, 8) respectively. By joining these points we obtain the line x + y = 8.
Clearly (0,0) does not satisfies the inequation x + y ≥ 8. So,the region in xy plane which does not contain the origin represents the solution set of the inequation x + y ≥ 8.

Region represented by x + 4y ≥ 12:
The line x + 4y = 12 meets the coordinate axes at C(12, 0) and D(0, 3) respectively. By joining these points we obtain the line x + 4y = 12.
Clearly (0,0) satisfies the inequation x + 4y ≥ 12. So,the region in xy plane which contain the origin represents the solution set of the inequation x + 4y ≥ 12.

The line x = 3 is the line that passes through the point (3, 0) and is parallel to Y axis.x ≥ 3 is the region to the right of the line x = 3.

The line y = 2 is the line that passes through the point (0, 12) and is parallel to X axis.y ≥ 2 is the region above the line y = 2.

The corner points of the feasible region are E(3, 5) and F(6, 2).

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

Corner point Z = 2x + 4y
E(3, 5) 2 × 3 + 4 × 5 = 26
F(6, 2) 2 × 6 + 4 × 2 = 20

Therefore, the minimum value of Z is 20 at the point F(6, 2). Hence, x = 6 and y =2 is the optimal solution of the given LPP.
Thus, the optimal value of Z is 20.

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 10 | Page 32

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.


A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.


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 = 5x + 3y
Subject to

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


Maximize Z = 10x + 6y
Subject to

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


Show the solution zone of the following inequalities on a graph paper:

\[5x + y \geq 10\]

\[ x + y \geq 6\]

\[x + 4y \geq 12\]

\[x \geq 0, y \geq 0\]

Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.


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


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.


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 manufacturer makes two types A and B of tea-cups. Three machines are needed for the manufacture and the time in minutes required for each cup on the machines is given below:

  Machines
I II III
A
B
12
6
18
0
6
9

Each machine is available for a maximum of 6 hours per day. If the profit on each cup A is 75 paise and that on each cup B is 50 paise, show that 15 tea-cups of type A and 30 of type B should be manufactured in a day to get the maximum profit.


A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.


A furniture manufacturing company plans to make two products : chairs and tables. From its available resources which consists of 400 square feet to teak wood and 450 man hours. It is known that to make a chair requires 5 square feet of wood and 10 man-hours and yields a profit of Rs 45, while each table uses 20 square feet of wood and 25 man-hours and yields a profit of Rs 80. How many items of each product should be produced by the company so that the profit is maximum?


A factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.


Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.


A cooperative society of farmers has 50 hectares of land to grow two crops X and Y. The profits from crops X and Y per hectare are estimated as ₹10,500 and ₹9,000 respectively. To control weeds, a liquid herbicide has to be used for crops X and Y 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. How much land should be allocated to each crop so as to maximise the total profit of the society? 


There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and ​F2 consists 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 F1 costs ₹6/kg and F2 costs ₹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? 


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?


 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


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


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 maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.


If 4x + 5y ≤ 20, x + y ≥ 3, x ≥ 0, y ≥ 0, maximum 2x + 3y is ______.


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


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


The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is ____________.


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


The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.


A manufacturer wishes to produce two commodities A and B. The number of units of material, labour and equipment needed to produce one unit of each commodity is shown in the table given below. Also shown is the available number of units of each item, material, labour, and equipment.

Items Commodity A Commodity B Available no. of Units
Material 1 2 8
Labour 3 2 12
Equipment 1 1 10

Find the maximum profit if each unit of commodity A earns a profit of ₹ 2 and each unit of B earns a profit of ₹ 3.


The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.


Solve the following linear programming problem graphically:

Maximize: Z = x + 2y

Subject to constraints:

x + 2y ≥ 100,

2x – y ≤ 0

2x + y ≤ 200,

x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problem graphically:

Minimize: Z = 60x + 80y

Subject to constraints:

3x + 4y ≥ 8

5x + 2y ≥ 11

x, y ≥ 0


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?


Minimize z = x + 2y,

Subject to x + 2y ≥ 50, 2x – y ≤ 0, 2x + y ≤ 100, x ≥ 0, y ≥ 0.


Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.


The Corner Point Method is based on which theorem?


For a bounded feasible region, where do the maximum and minimum values occur?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×