Advertisements
Advertisements
प्रश्न
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
Advertisements
उत्तर
Given LPP is
Maximise and minimise Z = 3x – 4y subject to
x – 2y ≤ 0 .......(i)
| x | 0 | 2 |
| y | 0 | 1 |
– 3x + y ≤ 4 ......(ii)
| x | 0 | `-4/3` |
| y | 4 | 0 |
x – y ≤ 6 ......(iii)
| x | 0 | -6 |
| y | -6 | 0 |
And x, y ≥ 0 .....(iv)
From the graph, we see that AOB is open unbounded region whose corners are O(0, 0), A(0, 4), B(12, 6).
Let us evaluate the value of Z
| Corner points | Value of Z = 3x – 4y | |
| O(0, 0) | Z = 0 | |
| A(0, 4) | Z = 0 – 4(4) = – 16 | ← Minimum |
| B(12, 6) | Z = 3(12) – 4(6) = 12 | ← Maximum |
For this unbounded region, the value of Z may or may not be – 16.
So to decide it, we draw a graph of inequality 3x – 4y < – 16 and check whether the open half-plane has common points with feasible region or not.
But from the graph, we see that it has common points with the feasible region, so it will have not minimum value of Z.
Similarly for maximum value, we draw the graph of inequality 3x – 4y > 12 in which there is no common point with the feasible region.
Hence, the maximum value of Z is 12.
APPEARS IN
संबंधित प्रश्न
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.
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 LPP by graphical method:
Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, 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.
Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0
Maximize Z = 9x + 3y
Subject to
2x + 3y ≤ 13
3x + y ≤ 5
x, y ≥ 0
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ 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 = 2x + 4y
Subject to
\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]
Maximize Z = 3x + 3y, if possible,
Subject to the constraints
\[x - y \leq 1\]
\[x + y \geq 3\]
\[ 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.
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, x, y ≥ 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
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 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?
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 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 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 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.
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 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 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 units of product A and 16 units of product B. A working week consists of 40 hours of production and the weekly turn over must not be less than Rs 10000. If the profit on each of product A is Rs 20 and an 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 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 |
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
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 |
A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.
The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in
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 ______.
Area of the region bounded by y = cos x, x = 0, x = π and X-axis is ______ sq.units.
The minimum value of z = 7x + 9y subject to 3x + y ≤ 6, 5x + 8y ≤ 40, x ≥ 0, y ≥ 2 is ______.
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
Solve the following Linear Programming Problem graphically:
Minimize: Z = 60x + 80y
Subject to constraints:
3x + 4y ≥ 8
5x + 2y ≥ 11
x, y ≥ 0
Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.
If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.
