Advertisements
Advertisements
प्रश्न
Maximize Z = x + y
Subject to
\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 0\]
Advertisements
उत्तर
We need to maximize Z = x + y
First, we will convert the given inequations into equations, we obtain the following equations:
−2x + y = 1, x = 2, x + y = 3, x = 0 and y = 0.
The line −2x + y = 1 meets the coordinate axis at \[A\left( \frac{- 1}{2}, 0 \right)\] and B(0, 1). Join these points to obtain the line −2x + y = 1 .
Clearly, (0, 0) satisfies the inequation −2x + y ≤ 1. So, the region in xy-plane that contains the origin represents the solution set of the given equation.
x = 2 is the line passing through (2, 0) and parallel to the Y axis.The region below the line x = 2 will satisfy the given inequation.
The line x + y = 3 meets the coordinate axis at C(3, 0) and D(0, 3). Join these points to obtain the line x + y = 3.
Clearly, (0, 0) satisfies the inequation x + y ≤ 3. So, the region in xy-plane that contains the origin represents the solution set of the given equation.
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.
These lines are drawn using a suitable scale.

The corner points of the feasible region are O(0, 0), \[G\left( 2, 0 \right)\] ,\[E\left( 2, 1 \right)\] and \[F\left( \frac{2}{3}, \frac{7}{3} \right)\]
The values of Z at these corner points are as follows.
| Corner point | Z = x + y |
| O(0, 0) | 0 + 0 = 0 |
|
\[C\left( 2, 0 \right)\]
|
2 + 0 = 2 |
|
\[E\left( 2, 1 \right)\]
|
2 +1 = 3 |
|
\[F\left( \frac{2}{3}, \frac{7}{3} \right)\]
|
\[\frac{2}{3} + \frac{7}{3} = \frac{9}{3} = 3\]
|
We see that the maximum value of the objective function Z is 3 which is at \[E\left( 2, 1 \right)\] and \[F\left( \frac{2}{3}, \frac{7}{3} \right)\]
Thus, the optimal value of Z is 3.
APPEARS IN
संबंधित प्रश्न
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.
A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B 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. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,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
Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0
Maximize Z = 5x + 3y
Subject to
\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ 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 = 3x1 + 5x2
Subject to
\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]
A diet of two foods F1 and F2 contains nutrients thiamine, phosphorous and iron. The amount of each nutrient in each of the food (in milligrams per 25 gms) is given in the following table:
Nutrients |
Food |
F1 | F2 |
| Thiamine | 0.25 | 0.10 |
|
| Phosphorous | 0.75 | 1.50 | |
| Iron | 1.60 | 0.80 | |
The minimum requirement of the nutrients in the diet are 1.00 mg of thiamine, 7.50 mg of phosphorous and 10.00 mg of iron. The cost of F1 is 20 paise per 25 gms while the cost of F2 is 15 paise per 25 gms. Find the minimum cost of diet.
A dietician mixes together two kinds of food in such a way that the mixture contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin C and 9 units of vitamin D. The vitamin contents of 1 kg of food X and 1 kg of food Y are given below:
| Vitamin A |
Vitamin B |
Vitamin |
Vitamin D |
|
| Food X Food Y |
1 2 |
1 1 |
1 3 |
2 1 |
One kg food X costs Rs 5, whereas one kg of food Y costs Rs 8. Find the least cost of the mixture which will produce the desired diet.
A wholesale dealer deals in two kinds, A and B (say) of mixture of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew nuts and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew nuts and 180 grams of hazel nuts. The remainder of both mixtures is per nuts. The dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew nuts and 540 grams of hazel nuts. Mixture A costs Rs 8 per kg. and mixture B costs Rs 12 per kg. Assuming that mixtures A and B are uniform, use graphical method to determine the number of kg. of each mixture which he should use to minimise the cost of the bag.
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 firm manufacturing two types of electric items, A and B, can make a profit of Rs 20 per unit of A and Rs 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programing problem for maximum profit and solve it graphically.
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 firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit. Solve the problem graphically.
A small firm manufacturers items A and B. The total number of items A and B that it can manufacture in a day is at the most 24. Item A takes one hour to make while item B takes only half an hour. The maximum time available per day is 16 hours. If the profit on one unit of item A be Rs 300 and one unit of item B be Rs 160, how many of each type of item be produced to maximize the profit? Solve the problem graphically.
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 merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. Make an LPP and solve it graphically.
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 |
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 P, Q 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 |
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 ______.
Maximize: z = 3x + 5y Subject to
x +4y ≤ 24 3x + y ≤ 21
x + y ≤ 9 x ≥ 0 , y ≥0
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 |
Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region
Area of the region bounded by y = cos x, x = 0, x = π and X-axis is ______ sq.units.
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 point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
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.
Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?
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.
Solve the following Linear Programming Problem graphically.
Maximise Z = 5x + 2y subject to:
x – 2y ≤ 2,
3x + 2y ≤ 12,
– 3x + 2y ≤ 3,
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.
Which description represents a bounded region?
What does the Extreme Point Theorem state about the optimum solution of an LPP, if it exists?
