Advertisements
Advertisements
प्रश्न
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = 5x + 10 y
subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Advertisements
उत्तर
The system of constraints is:
x + 2y ≤ 120 ...(i)
x + y ≥ 60 ....(ii)
x - 2y ≥ 0 ....(iii)
and x, y ≥ 0 ....(iv)
Let l1 : x + 2y = 120
l2 : x + y = 60
l3 : x - 2y = 0
It is observed that the feasible region CADE is bounded.
The coordinates of C, A, D, E are (60, 0), (120, 0), (60, 30), (40, 20) respectively.
Thus, we use the Corner Point Method to determine the maximum and minimum values of Z.
We have : Z = 5x + l0y
| Corner Point | Corresponding values of Z |
| (60, 0) | 300 (Minimum) |
| (120, 0) | 600 |
| (60, 30) | 600 |
| (40, 20) | 400 |
Hence Zmin = 300 at (60, 0) and Zmax = 600 at all points on the line segment joining the points (120, 0) and (60, 30).
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, 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.
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 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?
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
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
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.
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
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?
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 27. Maximum 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 ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
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 feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.
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?
In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:
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 ____________.
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
Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
What are constraints in a Linear Programming Problem?
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?
Which component must always be included in a Linear Programming Problem?
