Advertisements
Advertisements
प्रश्न
The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.
Advertisements
उत्तर
ABC is the feasible region which is open unbounded.
Here, we have
x + y = 3 ......(i)
And x + 2y = 4 ......(ii)
Z = 4x + y
Solving equation (i) and (ii), we get
x = 2 and y = 1
So, the corner points are A(4, 0), B(2, 1) and C(0, 3)
Let us evaluate the value of Z
| Corner points | Z = 4x + y | |
| A(4, 0) | Z = 4(4) + (0) = 16 | |
| B(2, 1) | Z = 4(2) + (1) = 9 | |
| C(0, 3) | Z = 4(0) + (3) = 3 | ← Minimum |
Now, the minimum value of Z is 3 at (0, 3) but since, the feasible region is open bounded so it may or may not be the minimum value of Z.
Therefore, to face such situation, we draw a graph of 4x + y < 3 and check whether the resulting open half-plane has no point in common with feasible region.
Otherwise Z will have no minimum value.
From the graph, we conclude that there is no common point with the feasible region.
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Minimise Z = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Maximise Z = – x + 2y, Subject to the constraints:
x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.
Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?
A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?
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.
To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
| Food I (per lb) |
Food II (per lb) |
Minimum daily requirement for the nutrient |
||||
| Calcium | 10 | 5 | 20 | |||
| Protein | 5 | 4 | 20 | |||
| Calories | 2 | 6 | 13 | |||
| Price (Rs) | 60 | 100 |
What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0
A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
Refer to question 15. Determine the maximum distance that the man can travel.
A company makes 3 model of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimise the operating costs and still meet the demand.
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.
Refer to Question 30. Minimum value of F is ______.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
A linear programming problem is as follows:
Minimize Z = 30x + 50y
Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0
In the feasible region, the minimum value of Z occurs at:
Objective function of a linear programming problem is ____________.
In linear programming infeasible solutions
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.
If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.
Which statement best describes a Linear Programming Problem (LPP)?
Which condition represents non-negative restrictions for two decision variables?
Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?
What are restrictions on decision variables called in linear programming?
Which component must always be included in a Linear Programming Problem?
