Advertisements
Advertisements
Question
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
Advertisements
Solution
Here, corner points are given as follows:
`"R"(7/2, 3/4)`
`"Q"(3/2, 15/4)`
`"P"(3/13, 24/13)`
And `"S"(18/7, 2/7)`
Now, evaluating the value of Z for the feasible region RQPS.
| Corner points | Value of Z = x + 2y | |
| `"R"(7/2, 3/4)` | Z = `7/2 + 2(3/4) = 5` | ← Maximum |
| `"Q"(3/2, 15/4)` | Z = `3/2 + 2(15/4) = 9` | |
| `"P"(3/13, 24/13)` | Z = `3/13 + 2(24/13) = 51/13` | |
| `"S"(18/7, 2/7)` | Z = `18/7 + 2(2/7) = 22/7` | ← Minimum |
Hence, the maximum value of Z is 9 at `(3/2, 15/4)` and the minimum value of Z is `22/7` at `(18/7, 2/7)`
APPEARS IN
RELATED QUESTIONS
Solve the following Linear Programming Problems graphically:
Minimise Z = – 3x + 4 y
subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Maximise Z = 5x + 3y
subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, 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 farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements 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?
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.
If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.
The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region
Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
Refer to Exercise 7 above. Find the maximum value of Z.
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.
Refer to quastion 12. What will be the minimum cost?
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 manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.
In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:
| Tablets | Iron | Calcium | Vitamin |
| X | 6 | 3 | 2 |
| Y | 2 | 3 | 4 |
The person needs atleast 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamin. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.
Compare the quantity in Column A and Column B
| Column A | Column B |
| Maximum of Z | 325 |
Refer to Question 27. Maximum of Z occurs at ______.
The feasible region for an LPP is always a ______ polygon.
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.
In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.
Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
In linear programming infeasible solutions
A maximum or a minimum may not exist for a linear programming problem if ____________.
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. If M and m respectively be the largest and smallest values at corner points then ____________.
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 the feasible region is unbounded, m is the minimum value of the objective function.
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 ____________.
Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
