Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
The system of constraints is:
x ≥ 3 ...(i)
x + y ≥ 5 ...(ii)
x + 2y ≥ 6 ...(iii)
and y ≥ 0 ...(iv)
Let l1 : x = 3
l2 : x + y = 5
l3 : x + 2y = 6
l4 : y = 0
The shaded region in the figure is the feasible region determined by the system of constraints (i) to (iv).
The corner points are C(6, 0), E(4, 1) and F(3, 2).
Applying the Corner Point Method, we have

| Corner Point | Corresponding values of Z |
| (6, 0) | -6 |
| (4, 1) | -2 |
| (3, 2) | 1 |
It appears that Zmax = 1 at (3, 2).
But the feasible region is unbounded, therefore, we draw the graph of the inequality -x + 2y > 1.
Since the half-plane represented by - x + 2y > 1 has points common with the feasible region.
∴ Zmax ≠ 1.
Hence, Z has no maximum value.
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 = 5x + 3y
subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
Solve the following Linear Programming Problems graphically:
Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; 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 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:
| Type of toy | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.
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.
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.
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.
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
Refer to question 15. Determine the maximum distance that the man can travel.
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 27. (Maximum value of Z + Minimum value of Z) is equal to ______.
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ______.
In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?

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 ____________.
The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.

Which statement best describes a Linear Programming Problem (LPP)?
Which inequality is one of the given resource constraints in the formulation with objective function \[Z=250x+75y\]?
Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?
What is the name of the quantity to be optimised in linear programming?
What are the unknown quantities in a Linear Programming Problem called?
